The transhipment problem: Total unimodularity

Related lectures (30)

Page 1 of 3

Covers optimization problems in path finding and portfolio allocation.

Explores basic solutions in linear constraints and the equivalence with vertices.

Covers the basics of linear programming, defining corners, extreme points, and feasible solutions within polyhedrons.

Covers linear constraints and degeneracy in polyhedrons, focusing on basic solutions and degenerate cases.

Explores Linear Programming Duality, covering weak duality, strong duality, Lagrange multipliers interpretation, and optimization constraints.

Covers classical optimization problems, brute force algorithms, and integer linear optimization.

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

Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.

Explores convex sets, their properties, and applications in optimization.

Covers the basics of linear programming and the simplex method, focusing on finding optimal solutions and handling degeneracy.