Question: A pply simplex algorithm to solve the following: M aximize 15x1 + 6x2 + 9x3 + 2x4 S ubject to 2x1 + x2 + 5x3
A pply simplex algorithm to solve the following:
M aximize 15x1 + 6x2 + 9x3 + 2x4 S ubject to 2x1 + x2 + 5x3 + .6x4 ≤ 20 3x1 + x2 + 3x3 + 0.25 x4 ≤ 24 7x1 + x4 ≤ 70 every xi ≥ 0
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
