Trilekha › CMA Final › P16 › 6 Linear Programming › 6.0
6.0 Linear Programming
123 lectures (123 with exact minutes) · 6 past exam questions · about 4.2 marks per exam · tier B for Dec 2026
Linear programming (LPP) is a mathematical constrained optimization technique that allocates scarce resources to maximize profit or minimize cost using decision variables, linear objective functions, and equality or inequality constraints. It encompasses model formulation, key solution concepts (feasible, basic, degenerate, and optimal solutions), and quantitative solution techniques including the Graphical Method (Corner Point and Iso-profit/Iso-cost approaches) and the iterative Simplex Method using slack, surplus, and artificial variables. Additionally, the topic covers special solution conditions (infeasibility, unboundedness, multiple optima) and Primal-Dual relationships for shadow price evaluation.