LPP Forms and Simplex Concepts
Covers various mathematical forms of linear programming problems: general, matrix, canonical, and standard. Explains constraints, slack and artificial variables, and standardization required for simplex analysis. Outlines the terminology and stepwise preparation of LPPs for algorithmic optimization methods