Question: Consider the following linear programming problem: Max 12X+10Y s.t. 4X+3Y
Consider the following linear programming problem:
Max 12X+10Y
s.t. 4X+3Y <= 480
2X+3Y <= 360
X, Y >= 0
The optimal solution is
| a. | (120, 40) | |
| b. | (0,120) | |
| c. | (30,120) | |
| d. | (60, 80) |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
