# bounded and unbounded solution in lpp

Bounded Solution in Linear Programming (LPP):

Step 1: Formulate the linear objective function and constraints. Step 2: Graphically represent the constraints on a coordinate plane. Step 3: Identify the feasible region, where all constraints overlap. Step 4: Evaluate the objective function at each corner point of the feasible region. Step 5: Identify the corner point that optimizes (maximizes or minimizes) the objective function.

Unbounded Solution in Linear Programming (LPP):

Step 1: Formulate the linear objective function and constraints. Step 2: Graphically represent the constraints on a coordinate plane. Step 3: Observe if the feasible region extends indefinitely in one or more directions. Step 4: If the feasible region is unbounded, the linear programming problem has an unbounded solution. Step 5: In an unbounded solution, the objective function can be infinitely increased or decreased, indicating no optimal solution.