A linear programming formulation, which has an optimal solution, cannot become infeasible by the addition of a single constraint.

Name: A linear programming formulation, which has an optimal solution, cannot become infeasible by the addition of a single constraint.
Brand: Quizplus
Rating: 5.0 (33 reviews)

Question

Quizplus · Accepted Answer

Adding a single constraint to a linear programming formulation can make the problem infeasible if the new constraint contradicts or limits the solution space in such a way that no solution can satisfy all constraints simultaneously.

A Linear Programming Formulation, Which Has an Optimal Solution, Cannot