← Standard syllabus

Get started Book tutoring

In this program

Linear programming problems: standard form and geometry
Feasible regions and vertices
The fundamental theorem of LP
Simplex method
Termination
Duality: weak and strong duality (statements)
Sensitivity analysis
Shadow prices (introduction)

Linear programming

Feasible regions and vertices

Optimization & linear programming · Standard syllabus

Topic

Feasible regions and vertices

Practice by unit: Linear programming

Undergraduate Optimization & Linear Programming — scope drawn from open optimization / LP materials (e.g. Boyd convex-optimization companion undergrad tracks) and typical US syllabi.

Get started Book tutoring All topics