In a graphically solvable linear program, if one of the constraints is changed from " $\leq$ type" to "= type", all other things remaining the same, then the optimal solution will never change.

Question

Quizplus · Accepted Answer

Changing a constraint from "$\leq$" to "=" type can potentially reduce the feasible region to a smaller set or even a single point, which might not include the previous optimal solution, thus potentially changing the optimal solution.

In a Graphically Solvable Linear Program, If One of the Constraints