Multiple Choice
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.
Correct Answer:

Verified
Correct Answer:
Verified
Q17: A binding constraint has slack but does
Q21: D.5 The Transportation Method<br>Table D.1<br>Tanfastic, Inc., a
Q47: A small oil company has a refining
Q48: Scenario D.1<br>Lisa lives out in the country
Q49: An = constraint is often used for
Q51: The Really Big Shoe Company is a
Q52: Scenario D.1<br>Lisa lives out in the country
Q53: _ are the limitations that restrict the
Q54: For the line that has the equation
Q78: Table D.3<br>The Harper Company is in the