Duality and Further Variations of the Simplex Method

Abstract

The vectors õ defined in Sections 2.2 and 2.6,

$$ \underline \pi = \left( {\pi _{1,...,} \pi _m } \right) = \underline c _B A_B^{ - 1} $$

play a central role in this section. The ople. timality condition given in Theorem 2.2.1 together with the .niteness of the Simplex Method with Bland’s pivot rule (Theorem 2.4.3) implies that every feasible and bounded LP