Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region...
-
Upload
aldous-ross -
Category
Documents
-
view
221 -
download
0
Transcript of Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region...
![Page 1: Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)](https://reader036.fdocuments.net/reader036/viewer/2022062321/56649f295503460f94c43369/html5/thumbnails/1.jpg)
Warm-up
Sketch the region bounded by the system of inequalities:
1)
2)
632
4
0
0
yx
yx
y
x
102
8
2
0,0
yx
yx
yx
yx
![Page 2: Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)](https://reader036.fdocuments.net/reader036/viewer/2022062321/56649f295503460f94c43369/html5/thumbnails/2.jpg)
During World Mathematical Year 2000, a sequence of posters designed at the Isaac Newton Institute for Mathematical Sciences was displayed month by month in the trains of the London Underground. The posters were designed to stimulate, fascinate - even infuriate! But most importantly that they bring maths to life, illustrating the wide applications of modern mathematics in all branches of science - physical, biological, technological and financial.
![Page 3: Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)](https://reader036.fdocuments.net/reader036/viewer/2022062321/56649f295503460f94c43369/html5/thumbnails/3.jpg)
Optimization – find maximum (or minimum) of a function.
Non-Linear Optimization (Section 2.7). Linear Optimization (Section 10.8)
1. Optimization - Summary
Definition: Feasible region is the bounded region defined by the
constraints.
![Page 4: Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)](https://reader036.fdocuments.net/reader036/viewer/2022062321/56649f295503460f94c43369/html5/thumbnails/4.jpg)
Continued… Maximize: z = 2x + yyxz 2
Objective function: Maximize:
Constraints : Subject to:
yxz 2
2
520
0
yx
yxy
x
2. A Linear Programming Problem
![Page 5: Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)](https://reader036.fdocuments.net/reader036/viewer/2022062321/56649f295503460f94c43369/html5/thumbnails/5.jpg)
3. Linear Programming
Theorem:
If a Linear Programming Problem has a unique
solution, the solution is located at a corner point
(vertex) of the feasible region.
A non-unique solution will lie along the boundary
![Page 6: Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)](https://reader036.fdocuments.net/reader036/viewer/2022062321/56649f295503460f94c43369/html5/thumbnails/6.jpg)
4. Corner Point MethodSolving a Linear Programming Problem
1) Graph feasible region from constraints
2) Determine Corner Points of feasible region
3) Evaluate objective function at each corner point
4) Determine max/min for the problem
5) If solution is non-unique it will include the entire
boundary between 2 corner points
![Page 7: Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)](https://reader036.fdocuments.net/reader036/viewer/2022062321/56649f295503460f94c43369/html5/thumbnails/7.jpg)
Continued… Maximize: z = 2x + yyxz 2
Objective function: Maximize:
Constraints : Subject to:
yxz 2
2
520
0
yx
yxy
x
5. A Linear Programming Problem
![Page 8: Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)](https://reader036.fdocuments.net/reader036/viewer/2022062321/56649f295503460f94c43369/html5/thumbnails/8.jpg)
Continued… Maximize: z = 2x + yyxz 2Corner Point Value of Objective Function
![Page 9: Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)](https://reader036.fdocuments.net/reader036/viewer/2022062321/56649f295503460f94c43369/html5/thumbnails/9.jpg)
Practice… p. 821 #9 maximize : subject to:
![Page 10: Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)](https://reader036.fdocuments.net/reader036/viewer/2022062321/56649f295503460f94c43369/html5/thumbnails/10.jpg)
6. ApplicationSolve a Linear Programming Problem in 2 variables
Step 1: Define variables
Step 2: Write the objective function z=Ax+By
Step 3: List restrictions (constraints) as inequalities
Step 4: Solve using Linear Programming Methodolgy
![Page 11: Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)](https://reader036.fdocuments.net/reader036/viewer/2022062321/56649f295503460f94c43369/html5/thumbnails/11.jpg)
6. Writing an Objective Function
Example: A manufacturer produces two models of mountain bicycles. The times (in hours) required for assembling and painting each model is given:
The maximum total weekly hours available are: 200 hrs for assembly and 108 hours for painting.The profits per unit are $25 for model A and $15 for model B. How many of each type should be produced to maximize profit?
Model A Model BAssembling 5 4
Painting 2 3