Use the simplex algorithm to find the optimal solution to the following LP: maxz=36x1 +30x2 3x3 4x4
Fantastic news! We've Found the answer you've been seeking!
Question:
Use the simplex algorithm to find the optimal solution to the following LP:
maxz=36x1 +30x2 –3x3 –4x4
s.t.
x1+x2 –x3<5
6x1 +5x2 –x4 <10
∀xi > 0
Related Book For
Introduction to Operations Research
ISBN: 978-1259162985
10th edition
Authors: Frederick S. Hillier, Gerald J. Lieberman
Posted Date: