A Linear Programming Problem (LPP) consists of three main components:

• Objective Function – A linear function that needs to be maximized or minimized.

• Constraints – A set of linear inequalities or equations that define the feasible region.

• Feasible Region – The set of all possible solutions that satisfy the given constraints.

The optimal solution lies within the feasible region and is determined using graphical or algebraic methods.