OR02 Geometric Solutions for 2 dim Linear Programs

#operationsresearch #linearprogramming #simplexmethod How to solve two dimensional linear programs geometrically by using graphs? What does the solution tells about the Simplex Algorithm? Linear Programs (i.e., optimization problems with a linear objective function and linear constraints) are the mainstay of Operations Research. If there are only two variables, we can solve them geometrically, and this gives a bird's eye view of the simplex algorithm. Subscribe @Shahriari for math videos at the undergraduate level.
00:00 Introduction
01:02 Example: a profit maximization problem
01:54 Set up as a linear program: Decision Variables, Objective Function, Constraints
03:58 Feasible Solutions
05:20 Optimal Solutions (& a proof of optimality)
07:28 Geometric Solution
11:22 The Simplex Algorithm: A bird's eye view

Shahriar Shahriari is the William Polk Russell Professor of Mathematics at Pomona College in Claremont, CA USA
Shahriari is a 2015 winner of the Mathematical Association of America's Haimo Award for Distinguished Teaching of Mathematics, and five time winner of Pomona College's Wig teaching award.