1 / 9

Example 1

Example 1. Define the Variables: Let l = length of package g = girth of package. Two variables – two inequalities:. g. Graph each inequality. Don’t forget to shade!.

chapa
Download Presentation

Example 1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Example 1 Define the Variables: Let l = length of package g = girth of package Two variables – two inequalities: g Graph each inequality. Don’t forget to shade! One variable is not dependent on the other, so it doesn’t matter which is the horizontal axis and which is the vertical axis. The boundary of one equation is l = 60 (dashed line) l The boundary of the other equation is g = -l + 84 (dashed line) Any ordered pair within the red-blue area is a solution to the system. Which ordered pairs are a solution to the application?

  2. Solutions to Systems of Linear Inequalities There is no overlapping region of each inequality, so this system has no solution. The solution is the overlapping region of each inequality.

  3. Polygonal Convex Set This area is also called the “feasible region.” The bounded set of all points on or inside the convex polygon created by the overlapping regions of the system of inequalities.

  4. Example 2 Boundary: x = 0 & shade Boundary: y = 0 & shade 2(0) + y = 4 y = 4 2x + 0 = 4 x = 2 zeros There are 3 vertices. The coordinates are: • (0, 0) (0, 4) (2, 0) •

  5. Vertex Theorem When searching for a maximum or minimum value for a system of inequalities, it will always be located at one of the vertices of the polygon. Minimum Maximum You will not find a value less than -6 or greater than 25 within the feasible region.

  6. Example 3 Boundary A: x + 4(0) = 12 (Solid line) x = 12 0 + 4y = 12 y = 3 Boundary B: 3x - 2(0) = -6 (Solid line) x = -2 3(0) – 2y = -6 y = 3 Boundary C: x + 0 = -2 (Solid line) x = -2 0 + y = -2 y = -2 Boundary A: 3x - 0 = 10 (Solid line) x = 3.3 3(0) - y = 10 y = -10 Graph the boundaries:

  7. Example 3 Evaluate the function For each vertex. -2 – 0 + 2 0 (-2, 0) -1 0 – 3 + 2 (0, 3) 4 – 2 + 2 4 (4, 2) 2 + 4 + 2 8 (2, -4) The vertices are: (-2, 0), (0, 3), (4, 2), & (2, -4) Minimum Maximum

  8. HW: Page 109

More Related