Linear Optimization
Before this course
Linear equations, inequalities and matrix basics.
Review a prerequisite lesson →- 01Feasible Regions, Vertices & Dual Bounds
Optimize over a polygon and use a valid upper bound to certify an optimal feasible point.
- 02Integer Decisions, Assignment & Transport
Distinguish fractional relaxations from discrete feasible decisions and solve a small allocation exactly.
After these topics
Full simplex tableaux, duality proofs, transportation algorithms and integer-programming methods.
The topics above describe this library’s current scope, not a complete university course. Use the reference readings and written exercises to continue.