Question

Which of the following statements regarding linear programming is not true?

A) A linear programming problem can have more than one optimal solution.

B) Most real-world linear programming problems are solved on a computer.

C) If a binding constraint were relaxed, the optimal solution wouldn't change.

D) A surplus variable is added to a > constraint to convert it to an equality.

Answer

This answer is hidden. It contains 1 characters.