16. Linear programming

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