Rudimentary simplex Algorithm 5A is being applied to optimize a linear program with objective function min 3w1
Question:
Rudimentary simplex Algorithm 5A is being applied to optimize a linear program with objective function min 3w1 + 11w2 - 8w3 Determine whether each of the following simplex directions for w4 leads to a conclusion that the given LP in unbounded.
(a) w = 11, 0, -4, 12
(b) w = 11, 3, 10, 12
(c) w = 11, 3, 0, 12
(d) w = 10, 1, -2, 12
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Question Posted: