Question

Choose the option that represents the original linear programming problem based on the initial simplex tableau given below, where $S_i$ represents slack/surplus variables and $A_i$ represents the artificial variables corresponding to the $i^{th}$constraint:

• A. Minimize Z-15x+25y
  subject to 7x+6y≥ 20, 3x-2y ≤18, 8x+5y ≤ 30; x, y ≥0.
• B. Maximize Z-15x+25y
  subject to 7x+6y≥ 20, 3x-2y=18, 8x+5y ≤ 30 x, y 20.
• C. Minimize Z-15x+25y
  subject to 7x+6y≥ 20, 3x-2y=18, 8x+5y ≥30; x, y ≥0.
• D. Maximize Z-15x+25y
  subject to 7x+6y=20, 3x-2y=18, 8x+5y≤ 30; x, y ≥0.

Answer 1

Answer: (B)

Maximize Z-15x+25y
subject to 7x+6y≥ 20, 3x-2y=18, 8x+5y ≤ 30 x, y 20.

Answer 2

The correct option is (B): Maximize Z-15x+25y
subject to 7x+6y≥ 20, 3x-2y=18, 8x+5y ≤ 30 x, y 20.