16. Linear programming

From Jeff Erickson 3/25/2021

56 plays 0 comments

a. Examples: linear classification, star-shaped polygons
b. Symbolic formulation: max {c·x | Ax ≤ b}
c. Geometric formulation: Lowest point in a convex polyhedron
d. No solution: Infeasible or unbounded
e. Simplex algorithm: vertices, bases, greedy pivots
f. Incremental LP — analysis next time

Tags: computational geometry

Date of creation: 3/25/2021 12:00 AM
Appears In: CS 498 TC — Computational Geometry — Spring 2021

Comments
Related Media

Loading…

	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

16. Linear programming

Related Media