BASIC TECHNIQUES OF LINEAR PROGRAMMING
The following sections are included:
Formulation of Linear Programming
Graphical Method for Two Dimension Problems
Simplex Method and Computer Solution Procedure
Duality Theory and Its Economic Interpretation
Complementary Slackness
Sensitivity Analyses
The Change in The Objective Vector c
The Change in The Constraint Level Vector d
Complexity Analyses and Other Methods
Basic Concepts of Computational Complexity
Complexity of Simplex Method
Khachian's Ellipsoid Method
Karmarkar's Projective Method
Further Remarks
Exercises