Maximization and Minimization Problems on Feasible Regions
This video explains maximization and minimization problems in linear programming. We show you how to maximize and/or minimize an objective function over a feasible region. We work several examples, which include both bounded and unbounded regions, and discuss the effect that each has on the results of finding a maximum or a minimum on the feasible region. Our examples in this video use systems of linear inequalities already graphed in our previous video from this series.
0:00 Intro
1:00 Example 1
3:59 Example 2
8:04 Example 3
12:43 Example 4
16:17 Example 5
Video that shows how to graph each feasible region used in this video: • Graphing Systems of Linear Inequalities
Houston Math Prep Finite/Business Math Playlist: • Finite Math/Mathematics for Business
Houston Math Prep YouTube: / houstonmathprep