Multiple Choice
In a linear programming problem, the binding constraints for the optimal solution are:
5x1 + 3x2 ≤ 30
2x1 + 5x2 ≤ 20
Which of these objective functions will lead to the same optimal solution?
A) 2x1 + 1x2
B) 7x1 + 8x2
C) 80x1 + 60x2
D) 25x1 + 15x2
Correct Answer:
Verified
Correct Answer:
Verified
Q66: In the graphical approach, simultaneous equations may
Q67: The following is a graph of a
Q68: A linear programming model consists of<br>A) decision
Q69: In the formulation of a ≥ constraint,<br>A)
Q70: _ is the difference between the left-
Q72: Consider the following linear programming problem:<br>MIN Z
Q73: The poultry farmer decided to make his
Q74: A graphical representation of a linear program
Q75: The _ property of linear programming models
Q76: Which of the following could not be