In a graphically solvable linear program with an optimal solution, if one of the constraints is changed from "= type" to " $\leq$ type", all other things remaining the same, the problem may become infeasible.

Question

Quizplus · Accepted Answer

Changing a constraint from "=" to "≤" type in a linear program expands the feasible region rather than shrinking it, making it less likely to become infeasible, as it allows for more solutions to satisfy the constraint.

In a Graphically Solvable Linear Program with an Optimal Solution ≤\leq≤

In a Graphically Solvable Linear Program with an Optimal Solution $\leq$