A linear programming formulation, which is unbounded, may become bounded and have an optimal solution by the addition of a constraint.

Name: A linear programming formulation, which is unbounded, may become bounded and have an optimal solution by the addition of a constraint.
Brand: Quizplus
Rating: 4.8 (26 reviews)

Question

Quizplus · Accepted Answer

Adding a constraint to an unbounded linear programming problem can limit the feasible region, potentially making the problem bounded and allowing for the determination of an optimal solution.

A Linear Programming Formulation, Which Is Unbounded, May Become Bounded