Lectures:
Unit 1: Formulation of LPP & NLPP
Unit 2: Graphical Method, Geometry of LPP, Standard form & BFS, Simplex & Big-M Method, Two Phase Method, Duality Theory, Dual Simplex Method, Sensitivity or Post-Optimality Analysis.
Unit 3: Branch & Bound Technique, Gomory's Cutting Plane Method
Unit 4: Transportation Problem, Assignment Problem, Critical Path Method(CPM)
Unit 5: Multi-objective Linear Programming Problem
Unit 6: Unimodal Function & Steepest Descent Method
Unit 7: Unconstraint Non-Linear Programming, Constraint Non-Linear Programming
Sample Codes: Graphical Method, Basic Feasible Solutions, Simplex Method, Least Cost Method, Steepest Descent Method