## The Simplex Method and the Standard Maximization Problem

In Section 4.2, we examined several linear programming problems. The common theme to these problems is the number of decision variables. To be able to solve these linear programming problems graphically, they must have exactly two decision variables.

In this section you will learn how to solve linear programming problems with two or more decision variables. This strategy, called the Simplex Method, will allow us to solve the problems from section 4.2 as well as other maximization problems with more than 2 variables. Since large numbers of decision variables are common in business and industry, the Simplex Method and similar variations are standard tools used to analyze linear optimization problems with hundreds of decision variables and hundreds of constraints.

**Read **in Section 4.3

- What is a standard maximization problem?
- What are slack variables?
- How do you find a basic feasible solution?
- How do you get the optimal solution to a standard maximization problem with the Simplex Method?

**Watch **Videos

**Applications**

**Read** in Section 4.3

**Watch** Videos