Consider the linear program max 4y1 + 5y2 s.t. -y1 + y2 4 y1 - y2
Question:
Consider the linear program max 4y1 + 5y2 s.t. -y1 + y2 … 4 y1 - y2 … 10 y1, y2 Ú 0
(a) Show graphically that the model is un bounded.
(b) Add slacks y3 and y4 to place the model in standard form.
(c) Starting with all slacks basic, apply rudimentary simplex Algorithm 5A to establish that the original model is unbounded.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Question Posted: