Finding Solutions to Linear Inequalities

the intersection of the graphs in a system of constraints

• feasible region

• bounded region

• unbounded region

Tags

CCSS.HSA.REI.D.12

the process of finding the maximum or minimum values of a function for a region defined by inequalities

• linear programming

• system of inequalities

• ordered triple

a set of inequalities with the same variables

• system of inequalities

• system of equations

• inconsistent system

The ordered pair (a)   is in the solution set of 8x+16y>32.

• (-3, 5)

• (0, 2)

• (-1, 1)

• (4, 0)

any of the points of intersection of the graphs of the constraints that determine a feasible region

• vertex

• ordered triple

• bounded region

Tags

CCSS.8.EE.C.8B

a system of inequalities that forms a region that is open

• unbounded region

• bounded region

• feasible region

Tags

CCSS.HSA.REI.D.12

It takes Sarah 2 hours to make small purses and 3 hours to make big purses. She has a maximum of 18 hours a week. Which inequality represents this situation?

• 2x + 3y ≤ 18

• x + y ≤ 6

• x + y ≤ 9

• 3x + 2y ≤ 18

Solve the system of inequalities. The feasible region is shown by the darkest blue shading.

• 
• 
• 
• 

Tags

CCSS.HSA.REI.D.12

In other words...what are the vertices of the feasible region?

• (0, 0), (0, 6), (6, 2), (8, 0)

• (0, 0), (6, 0), (2, 6), (0, 8)

Tags

CCSS.HSA.REI.D.12

When graphing constraints, what do you call the area where all the shading overlaps?

• the answer

• the feasible region

• the void

• the objective function

Tags

CCSS.HSA.REI.D.12