This video shows you how to use the simplex method on a simplex table to find a maximum in a linear programming maximization problem (LPP). Once we have set up our simplex tableau and located the pivot in the table, we then use row reduction on the table by adding and subtracting copies of the pivot row to reduce the pivot column. We work through an entire example of this.
0:00 Intro
0:37 Using the first pivot
1:55 Rule for changing signs of rows
4:59 Checking the indicators
5:58 Finding the next pivot
7:03 Using the second pivot
10:13 Basic variables and writing your solution
Houston Math Prep Finite/Business Math Playlist: • Finite Math/Mathematics for Business
Houston Math Prep YouTube: / houstonmathprep