23. Linear programming

views comments

Definition of linear programming
Example: Maximum flows
Geometry: Lowest point in a convex polyhedron
Infeasible and unbounded LPs
Canonical (standard inequality) form
Example: Shortest paths as a maximization problem (Ford's relaxation algorithm)
Example: Shortest paths as a minimization problem (minimum cost flows)
Duality and the Fundamental Theorem of Linear Programming
The duality dictionary
Example: Dualizing the shortest-path max LP

	Contact Technology Services to report an issue, offer feedback, or request assistance.
	Technology Services Home \| Kaltura Help \| Privacy Policy
	Illinois Media Space, © 2022 Board of Trustees of the University of Illinois

Related Media