Question: Find the optimal solution of the following linear programming problem with the simplex method: Maximize Z = 5x1 + 7x2 subject to 3x1 + 4x2
Find the optimal solution of the following linear programming problem with the simplex method:
Maximize Z = 5x1 + 7x2 subject to 3x1 + 4x2 <= 650 2x1 + 3x2 <= 500 and x1,x2 >= 0
Select one:
a. Z=2275, x1=0, x2=0
b. Z=2275/2, x1=0, x2=325/2
c. Z=2275, x1=15, x2=0
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
