Lecture
Linear Programming Basics
Related lectures (90)
Solving Linear Programs: SIMPLEX Method
Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.
Linear Programming: Extreme Points
Explores extreme points in linear programming and the role of constraints in finding optimal solutions.
Integer Programming Basics
Introduces the basics of integer programming, including binary integer programs and constraint strategies.
Linear Programming: Optimization and Constraints
Explores linear programming optimization with constraints, Dijkstra's algorithm, and LP formulations for finding feasible solutions.
Max-Flow Min-Cut
Explores the Ford Fulkerson algorithm, Max-Flow Min-Cut theorem, Incidence matrix, and network optimization complexity.
Shortest Path in Directed Graphs
Covers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.
Convex Polyhedra and Linear Programs
Explores convex polyhedra, linear programs, and their optimization importance.
Simplex Algorithm: Basics
Introduces the Simplex algorithm for solving flow problems and handling negative cost cycles.
Interlacing Families and Ramanujan Graphs
Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.
Linear Programming Basics
Covers the basics of linear programming, defining corners, extreme points, and feasible solutions within polyhedrons.