Question: Find the complete optimal solution to this linear programming problem. (HINT: Chapter 7, Points = 5) Min 3 x + 3 y s.t. 12x +
Find the complete optimal solution to this linear programming problem. (HINT: Chapter 7, Points = 5)
Min 3x + 3y
s.t. 12x + 4y 48
10x + 5y 50
4x + 8y 32
x , y 0
The complete optimal solution is:
x =
y =
s1 =
s2 =
s3 =
The objective function = 18
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
