Question: You are given the following simplex table for a maximization problem. Z X 1 X 2 X 3 X 4 RHS 1 c 1 0

You are given the following simplex table for a maximization problem.

Z

X1

X2

X3

X4

RHS

1

c1

0

0

0

10

0

a1

1

0

-2

b

0

-5

0

1

1

2

Give conditions on the unknowns a1, b, and c1 that makes the following statements true. (Fill the table below)

  1. The current solution is not a basic feasible solution (infeasible).
  2. The current solution is optimal, and there are alternative optimal solutions.
  3. The LP is unbounded.

a1

b

c1

Infeasible

Alternative Optimal

Unbounded

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!