A pply simplex algorithm to solve the following: M aximize 15x1 + 6x2 + 9x3 + 2x4
Question:
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
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Construction Project Management Theory And Practices
ISBN: 9789332542013
2nd Edition
Authors: Kumar Neeraj Jha
Question Posted: