Mixed-Integer Linear Programming: Formulations and Applications

Related lectures (51)

Explores convex polyhedra, linear programs, and their optimization importance.

Covers semi-definite programming and optimization over positive semidefinite cones.

Explores fundamental solutions in partial differential equations, highlighting their significance in mathematical applications.

Introduces the two-phase simplex algorithm and explores duality in linear programming.

Explores multistage games, focusing on extensive form and feedback strategies, including Nash equilibria and backward induction methods.

Covers the formulation of optimization programs for minimizing piecewise linear cost functions.

Explores the complexity of convex hulls and the concept of vertices within them.

Covers the basics of linear optimization, including equations, polyhedrons, feasible directions, and optimal solutions.

Covers the process of formulating integer programs and improving solutions.

Covers iterative methods for solving linear equations and analyzing convergence, including error control and positive definite matrices.

Page 3 of 3