The following is a tableau obtained when solving a minimization linear programmi

Question

The following is a tableau obtained when solving a minimization linear programming problem via the dual simplex algorithm: Find conditions on the parameters a, b, c, d, e, f, g, h such that the following are true. State the most general conditions that apply. (You do not have to mention those parameters that can take on any value from -inf to +inf.) (i) The above tableau is a valid tableau for the dual simplex algorithm. (ii) A basic feasible solution to the problem has been found (iii) The problem is infeasible (iv) The problem is unbounded. (v) The current solution is not feasible. According to the dual simplex method, the variable to enter the basis is x_4. (Assume that there are no ties.) (vi) x_7 enters the basis, and the resulting solution is still infeasible

Explanation / Answer

a belongs to [-2,2]

b belongs to [-1,1]

c belongs to [-2,1]

d = 0

e belongs to (-inf, inf)

f belongs to [-1,1]

g belongs to (-inf, inf)

h = 0

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.