Linear and Integer Programming
- Sriram Sankaranarayanan and Shalom D. Ruben
- Oct 20, 2014
- 1 min read
Linear Programming (LP) is arguably one of the most important optimization problems in applied mathematics and engineering. The Simplex algorithm to solve linear programs is widely regarded as one among the "top ten" algorithms of the 20th century. Linear Programs arise in almost all fields of engineering including operations research, statistics, machine learning, control system design, scheduling, formal verification and computer vision. It forms the basis for numerous approaches to solving hard combinatorial optimization problems through randomization and approximation.
This course has some similar content with another course Discrete Inference and Learning in Artificial Vision, but provides more information on linear programming.

Recent Posts
See AllThis course presents the state of the art energy minimization algorithms that are used to perform inference in modern artificial vision...