Question: Consider the linear programming formulation below. Maximize 9T + 10S + 2P subject to the constraints T + S + P = 6 S
Consider the linear programming formulation below.
Maximize 9T + 10S + 2P
subject to the constraints
T + S + P = 6
S ≥ 3
T ≥ 1
P ≤ 3
T, S, P ≥ 0
This is a linear program with 3 variables. Rewrite this as an algebraically equivalent linear program that only has 2 variables. Then solve the problem graphically. What is the optimal solution (T, S, P), and what is the objective function value?
Step by Step Solution
3.33 Rating (159 Votes )
There are 3 Steps involved in it
The algebraically equivalent linear program with 2 variables would be Maximize 9T 10S subject to t... View full answer
Get step-by-step solutions from verified subject matter experts
