Lecture 7.1 bt
-
Upload
btmathematics -
Category
Technology
-
view
58 -
download
3
Transcript of Lecture 7.1 bt
![Page 1: Lecture 7.1 bt](https://reader035.fdocuments.net/reader035/viewer/2022062418/556428bad8b42a69298b5431/html5/thumbnails/1.jpg)
Today’s AgendaAttendance / Announcements
Questions from 6.1Sections 7.1Quiz Friday
![Page 2: Lecture 7.1 bt](https://reader035.fdocuments.net/reader035/viewer/2022062418/556428bad8b42a69298b5431/html5/thumbnails/2.jpg)
Exam ScheduleExam 4 (Ch 6,7)
Fri 11/15Exam 5 (Ch 10)
Thur 12/5Final Exam (All)
Thur 12/12
![Page 3: Lecture 7.1 bt](https://reader035.fdocuments.net/reader035/viewer/2022062418/556428bad8b42a69298b5431/html5/thumbnails/3.jpg)
Review Graphing Lines
Sections 2.1, 2.2
![Page 4: Lecture 7.1 bt](https://reader035.fdocuments.net/reader035/viewer/2022062418/556428bad8b42a69298b5431/html5/thumbnails/4.jpg)
Graphing Linear Inequalities
![Page 5: Lecture 7.1 bt](https://reader035.fdocuments.net/reader035/viewer/2022062418/556428bad8b42a69298b5431/html5/thumbnails/5.jpg)
Graphing Linear Inequalities𝑦<𝑥+3
1. Graph boundary line3xy
2. Check inequality sign (Dashed or Solid?)
3. Shade accordingly
4. Test Points
![Page 6: Lecture 7.1 bt](https://reader035.fdocuments.net/reader035/viewer/2022062418/556428bad8b42a69298b5431/html5/thumbnails/6.jpg)
Graphing Linear Inequalities
1. Graph boundary line
2
3
2
1 xy
2. Check inequality sign (Dashed or Solid?)
3. Shade accordingly
4. Test Points
624 xy 23
21 xy
![Page 7: Lecture 7.1 bt](https://reader035.fdocuments.net/reader035/viewer/2022062418/556428bad8b42a69298b5431/html5/thumbnails/7.jpg)
Graphing Systems of Inequalities
1. Graph boundary lines2. Check inequality signs (Dashed or Solid?)3. Shade accordingly
5. Test Points
4 𝑥+𝑦 ≥92 𝑥+3 𝑦 ≤7
4. Identify Intersecting regions (“Feasible”)
![Page 8: Lecture 7.1 bt](https://reader035.fdocuments.net/reader035/viewer/2022062418/556428bad8b42a69298b5431/html5/thumbnails/8.jpg)
Graph the Feasible Region5 𝑦−2𝑥≤10
𝑥 ≥3𝑦≥2
𝑦 ≤25𝑥+2
𝑥≥3𝑦 ≥2
![Page 9: Lecture 7.1 bt](https://reader035.fdocuments.net/reader035/viewer/2022062418/556428bad8b42a69298b5431/html5/thumbnails/9.jpg)
Find “Corner Points” of the Feasible Region3𝑥+2 𝑦 ≤6
−2𝑥+4 𝑦 ≤8𝑥+𝑦 ≥1𝑥≥0𝑦 ≥0
𝑦 ≤−32𝑥+3
𝑦 ≤ 12𝑥+2
𝑦 ≥−𝑥+1𝑥≥0𝑦 ≥0
![Page 10: Lecture 7.1 bt](https://reader035.fdocuments.net/reader035/viewer/2022062418/556428bad8b42a69298b5431/html5/thumbnails/10.jpg)
Find “Corner Points” of the Feasible Region3𝑥+2 𝑦 ≤6
−2𝑥+4 𝑦 ≤8𝑥+𝑦 ≥1𝑥≥0𝑦 ≥0
![Page 11: Lecture 7.1 bt](https://reader035.fdocuments.net/reader035/viewer/2022062418/556428bad8b42a69298b5431/html5/thumbnails/11.jpg)
Finding Feasible RegionsFind the system whose feasible region is a triangle with vertices (2,4), (-4,0), and (2,-1)
2
46
832
x
yx
yx
![Page 12: Lecture 7.1 bt](https://reader035.fdocuments.net/reader035/viewer/2022062418/556428bad8b42a69298b5431/html5/thumbnails/12.jpg)
Classwork / Homework
• Page 395•1 – 6 •7 – 45 e.o.odd•47, 49, 53