1. LINEARPROGRAMMING
4/26/2019 9:23 AM
4/26/2019 9:23 AM 1

2. Example 1 (-5, 3) (4, 3) (-5, -1) (4, -1) 4/26/2019 9:23 AM
3.5 Linear Programming 2 2 2

3. Definitions Optimization is finding the minimum and maximum value
For the most part, optimization involves point, P
Steps in Linear Programming
1. Find the vertices by graphing
2. Plug the vertices into the P equation, which is given
3. Find the minimum and maximum optimization values of P
4/26/2019 9:23 AM
4/26/2019 9:23 AM
3.4 Linear Programming 3

4. Linear Programming is a method of finding a maximum or minimum value of a function that satisfies a set of conditions called constraints
A constraint is one of the inequalities in a linear programming problem.
The solution to the set of constraints can be graphed as a feasible region.

5. Optimization
A Haunted House is opened from 7pm to 4am. Look at this graph and determine the maximization and minimization of this business.
MAXIMIZATION
MINIMIZATION
MINIMIZATION
7p p p p p a a a a a
4/26/2019 9:23 AM
4/26/2019 9:23 AM
3.5 Linear Programming 5

6. Example 1 Given Find the minimum and maximum for equation, Step 1:
Find the vertices by graphing
(-5, 3)
(4, 3)
(-5, -1)
(4, -1)
4/26/2019 9:23 AM
4/26/2019 9:23 AM
3.5 Linear Programming 6

7. Example 1 vertices P = –2x + y profit (-5, 3) (4, 3) (4, -1) (-5, -1)
Given Find the minimum and maximum for equation,
Step 2: Plug the vertices into the P equation, which is given
vertices
P = –2x + y
profit
(-5, 3)
(4, 3)
(4, -1)
(-5, -1)
P = -2(-5) + (3)
P = 13
P = -2(4) + (3)
P = –5
P = -2(4) + (-1)
P = –9
P = -2(-5) + (-1)
P = 9
4/26/2019 9:23 AM
4/26/2019 9:23 AM
3.5 Linear Programming 7

8. Example 1 Minimum: –9 @ (4,-1) 13 @ (-5,3) Maximum:
Given Find the minimum and maximum for equation,
Step 3: Find the minimum and maximum optimization values of P
vertices
P = -2x + y
Profit
(-5, 3)
(4, 3)
(4, -1)
(-5, -1)
P = -2(-5) + (3)
P = 13
P = -2(4) + (3)
P = –5
P = -2(4) + (-1)
P = –9
P = -2(-5) + (-1)
P = 9
Minimum:
(4,-1)
Maximum:
(-5,3)
4/26/2019 9:23 AM
4/26/2019 9:23 AM
3.5 Linear Programming

9. Given Find the minimum and maximum optimization for equation,
Example 2
Given Find the minimum and
maximum optimization for equation,
4/26/2019 9:23 AM
4/26/2019 9:23 AM
3.5 Linear Programming 9

10. Example 2 39 10 Minimum: 10 @ (2,1) Maximum: 39 @ (5,6)
Given Find the minimum and maximum for
equation,
Maximum:
(5,6)
Vertices
P = 3x+4y
Profit
(2, 6)
P = 3(2) + 4(6) 30
(5, 6)
P = 3(5) + 4(6) 39
(2, 1)
P = 3(2) + 4(1) 10
(5, 1)
P = 3(5) + 4(1) 19
(2, 6)
(5, 6)
(2, 1)
(5, 1)
4/26/2019 9:23 AM
4/26/2019 9:23 AM
3.5 Linear Programming 10

11. Example 3 Given Find the minimum and maximum for equation, Vertices:
y ≥ 1.5
2.5x + 5y ≤ 20
3x + 2y ≤ 12
Given Find the minimum and maximum
for equation,
(0, 4)
(2, 3)
Vertices:
(0, 4), (0, 1.5), (2, 3), and (3, 1.5)
(0, 1.5)
(3, 1.5)
4/26/2019 9:23 AM
4/26/2019 9:23 AM
3.5 Linear Programming 11

12. Example 3 45 140 Given Find the minimum and maximum for equation,
y ≥ 1.5
2.5x + 5y ≤ 20
3x + 2y ≤ 12
Given Find the minimum and maximum
for equation,
(x, y)
25x + 30y
P($)
(0, 4)
25(0) + 30(4)
120
(0, 1.5)
25(0) + 30(1.5) 45
(2, 3)
25(2) + 30(3)
140
(3, 1.5)
25(3) + 30(1.5)
(0, 4)
(2, 3)
(0, 3/2)
(3, 3/2)
4/26/2019 9:23 AM
3.5 Linear Programming 12

13. Example 4 24 4 (0, 8) (0, 2) 6 (2, 0) (4, 0) 8 (0, 8) P = 2(0) + 3(8)
Given Find the minimum and maximum for equation,
(0, 8)
vertices
P = 2x + 3y
profit
(0, 8)
P = 2(0) + 3(8) 24
(0, 2)
P = 2(0) + 3(2) 6
(2, 0)
P = 2(2) + 3(0) 4
(4, 0)
P = 2(4) + 3(0) 8
(0, 2)
(2, 0)
(4, 0)
4/26/2019 9:23 AM
4/26/2019 9:23 AM
3.5 Linear Programming 13