In a linear programming problem with an inequality constraint and an optimal solution, if the inequality constraint is changed to an inequality constraint, all other things remaining the same, the problem may become unbounded.

Question

Quizplus · Accepted Answer

Changing an inequality constraint to another inequality constraint does not inherently cause a linear programming problem to become unbounded; it depends on the specific constraints and objective function.

In a Linear Programming Problem with an Inequality Constraint and an Optimal