1. Class Opener: Solve each equation for Y: 1.3x + y = 3 2.7 + y = 2x 3.x + 2y = 5 4. x – y = -1 5. 4x + 3y = 7 6. 2x – 5y = -3

2. Linear Programming: Vocabulary Linear programming is a technique that identifies the minimum or maximum value of some quantity. This quantity is modeled with an objective function. Limits on the variables in the objective function are constraints, written as linear inequalities.

3. Feasible Region: After graphing your constraints you will come up with a feasible region. This shaded portion of your graph will contain all the points that satisfy the constraints.

4. Using Our Calculators

5. Finding the Vertex: For each feasible region we come up with we are going to have to find the value (x,y) of its corners. The corners are called vertices.

6. Looking Back: Find the value of each vertex of our feasible region that we just graphed.

7. Using Our Vertices:

8. Example:

9. Student Check:

10. Practice: Linear Programming Basics Worksheet

11. Exit Slip: