In the dual simplex method dual feasibility (primal is a ...

[BrownTown3]

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^th dual variable is positive then:
  a.i^th primal variable = 0.
  b.i^th primal slack = 0.
  c.i^th primal variable is nonbasic.
  d.i^th dual slack = 0.

[ApricotDream]

Answer to Question 1

correct: b

Answer to Question 2

correct: b

[BrownTown3]

TYSM

[EAN94]

Gracias!