Linear Programming
Defined in 5 lectures. Each definition is in that lecture's terms.
Definitions are written by AI from each lecture’s transcript. The time opens the lecture where the lecturer explains it.
- An optimization problem where a linear function is minimized subject to a set of linear inequality constraints.
- An optimization problem solved efficiently in practice by the Simplex algorithm despite a worst-case exponential time complexity.21:11Mathematics and Computation: The Landscape of P vs. NPAvi Wigderson · Institute for Advanced Study
- An optimized class of problems involving a linear objective function and linear inequality constraint equations.13:52Optimization: A Bootcamp for Machine Learning, Inverse Problems, and ControlSteve Brunton · University of Washington
- An optimization problem with a linear objective function and a set of linear inequality constraints forming a convex polytope feasible region.
- An optimization problem where the objective function is linear and the constraint equations are linear.