Upload
others
View
1
Download
0
Embed Size (px)
Citation preview
3.3 and 3.4 Pt 1 Inequality Systems Lin Prog 2018.notebook
1
September 14, 2018
GO COUGARS!
1) Graph: 4x 3y < 12
2) Graph: y < 3 |x + 1| + 4
89
8 9
9
9
8
8 1
23
4 5 6 7
1
3
4567
4567
23
14567 3 22
WARM UPon graph paper
3.3 and 3.4 Pt 1 Inequality Systems Lin Prog 2018.notebook
2
September 14, 2018
3.3 Graphing and Solving Systems of Linear and Absolute
Value Inequalities
Objective: to solve systems of inequalities
3.3 and 3.4 Pt 1 Inequality Systems Lin Prog 2018.notebook
3
September 14, 2018
Steps for GraphingGraph the lines and appropriate shading for each inequality on the same coordinate plane.
Lines are dotted or solid.
The final shaded area is the section where all the shadings overlap.
* Sometimes it helps to use a different colored pencil for each line and shaded region.
3.3 and 3.4 Pt 1 Inequality Systems Lin Prog 2018.notebook
4
September 14, 2018
Solve the system of inequalities by graphing.
3.3 Systems of Inequalities
x y > 2 2x + y < 5
1st inequality in y = mx + b form:
Shade
2nd inequality in y = mx + b form:
Shade
Answer is where the colors overlap!
3.3 and 3.4 Pt 1 Inequality Systems Lin Prog 2018.notebook
5
September 14, 2018
Graph the system.
x 2y ≤ 10y > 3x 4
1st inequality in y = mx + b form:
Shade
2nd inequality in y = mx + b form:
Shade
3.3 and 3.4 Pt 1 Inequality Systems Lin Prog 2018.notebook
6
September 14, 2018
3) Graph the system.x ≤ 0y > 0x – y > 2
6 5 4 3 2 1 0 1 2 3 4 5 6
6
5
4
3
2
1
1
2
3
4
5
6
x
y
3.3 and 3.4 Pt 1 Inequality Systems Lin Prog 2018.notebook
7
September 14, 2018
4) Solve the system of inequalities by graphing.
y 3y < –| x + 2| + 5
>
3.3 and 3.4 Pt 1 Inequality Systems Lin Prog 2018.notebook
8
September 14, 2018
3.4 Linear ProgrammingPart I
3.3 and 3.4 Pt 1 Inequality Systems Lin Prog 2018.notebook
9
September 14, 2018
VOCABULARY
Linear Programming identifies conditions that make a quantity as large (maximum) or as small (minimum) as possible.
This quantity is expressed as the objective function.
Limitations are placed on the variable.
3.3 and 3.4 Pt 1 Inequality Systems Lin Prog 2018.notebook
10
September 14, 2018
TESTING VERTICESIf there is a max or min value of the objective function, it occurs at one or more vertices of the feasible region.
Vertices of Feasible Region
3.3 and 3.4 Pt 1 Inequality Systems Lin Prog 2018.notebook
11
September 14, 2018
Find the values of x and y that maximize the objective function of P = ‐x+3y.
Now test the vertices of the feasible region(2,8)
(2,0)
(5,0)
(5,2)Max of 22 at (2,8)
3.3 and 3.4 Pt 1 Inequality Systems Lin Prog 2018.notebook
12
September 14, 2018
Graph the system of constraints. Name all vertices.
Then find the values of x and y that maximize the objective function: C = 3x + y
Vertices of feasible region:
Max of ___ at ( __, __ )
3.3 and 3.4 Pt 1 Inequality Systems Lin Prog 2018.notebook
13
September 14, 2018
Graph each system of constraints. Name all vertices. Then find the values of x and y that minimize and maximinze the objective function:
P = 2x + 3y
Min of _____ at (__ , __)
Max of _____ at (__ , __ )
Vertices of feasible region:
3.3 and 3.4 Pt 1 Inequality Systems Lin Prog 2018.notebook
14
September 14, 2018
ASSIGNMENT
HW 3.3/3.4p. 136 #9, 13, 15, 23, 28p. 142 #17 odd, 18
3.3 and 3.4 Pt 1 Inequality Systems Lin Prog 2018.notebook
15
September 14, 2018
3.3 and 3.4 Pt 1 Inequality Systems Lin Prog 2018.notebook
16
September 14, 2018