Author Question: In the dual simplex method dual feasibility (primal is a maximization problem) is maintained by: ... (Read 102 times)

BrownTown3 · **on:** Aug 1, 2018

In the dual simplex method dual feasibility (primal is a maximization problem) is maintained by:
a.at least 1 variable in row 0 is negative.
b.row zero is nonnegative.
c.at least 1 right-hand side is negative.
d.each right-hand side is nonnegative.

Question 2

If the i^thdual variable is positive then:
a.i^thprimal variable = 0.
b.i^thprimal slack = 0.
c.i^thprimal variable is nonbasic.
d.i^th dual slack = 0.