Dual simplex with Artificial constraints. Consider the following problem: Maximize z = 2x1 - x2 + x3

Question:

Dual simplex with Artificial constraints. Consider the following problem:
Maximize z = 2x1 - x2 + x3
Subject to
2x1 + 3x2 - 5x3 ≥ 4
- x1 + 9x2 - x3 ≥ 3
4x1 + 6x2 + 3x3 ≤ 8
X1, x2, x3 ≥ 0
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: