Linear Programming: Goals and Objectives

What should you be able to accomplish after you finish this tutorial?

Upon completion, you should be able to:

graph the feasible region for a linear programming problem with two decision variables.
use Winplot to sketch a feasible region.
use the RREF command of the TI83 (or newer) calculator to find the solution to a system of linear equations.
understand how the slope of the objective function relates to the solution.
use the slope of the objective function to find the solution.
set up a table, find the intersection points of a system of equations, and determine whether or not intersections are feasible.
understand how basic and non-basic variables relate to the graph of problem.
identify whether or not a problem is a standard maximization problem.
understand the Simplex method and why the method works.
realize the limitations of the Simplex method and when to apply it.
use the Simplex method to solve a standard maximum linear programming problem.
move from the current point to a connected point by pivoting on the tableau.
interpret a tableau, including determining which values are basic and which are non-basic and giving the values of the variables.
identify which variables are basic for each row of the tableau.
use the Pivot and Simplex calculator programs to solve a linear programming problem.