Linear Programming

In Linear Programming: A Modern Integrated Analysis, both boundary (simplex) and interior point methods are derived from the complementary slackness theorem and, unlike most books, the duality theorem is derived from Farkas''s Lemma, which is proved as a convex separation theorem. The tedium of the simplex method is thus avoided.
A new and inductive proof of Kantorovich''s Theorem is offere...