In a linear programming problem, the binding constraints for the optimal solutio

Question

In a linear programming problem, the binding constraints for the optimal solution are:

2X1+ 1X2 ? 20

3X1 + 2X2 ? 36

Which of the following objective functions would make the leave that optimal solution unchanged (in other words, for which if the following solutions will the two constraints still be "binding" at the solution.

Question 3 options:

Max Z = 15X1 + 4X2

Max Z = 7X1 + 5X2

Max Z = 3X1 + 1X2

Max Z = 3X1 + 4X2

Max Z = 7X1 + 4X2

Max Z = 4X1 + 5X2

Max Z = 15X1 + 4X2

Max Z = 7X1 + 5X2

Max Z = 3X1 + 1X2

Max Z = 3X1 + 4X2

Max Z = 7X1 + 4X2

Max Z = 4X1 + 5X2

Explanation / Answer

Option D is Correct

Max Z = 3X1 + 4X2, objective functions would make the leave that optimal solution unchanged

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.