Systems of Inequalities & Linear Programming

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

Given the objective function: P = 30x + 50y

Which vertex maximizes the profit?

• (0,0)

• (6,2)

• (8,0)

• (0,6)

Tags

CCSS.HSA.REI.D.12

CCSS.HSA.CED.A.2

CCSS.HSA.REI.D.10

CCSS.HSA.CED.A.3

CCSS.HSA.REI.C.6

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

• 
• 
• 
• 

Tags

CCSS.HSA.REI.D.12

Which of the following inequalities matches the given graph?

• x ≥ -1
• x ≤ -1
• x > -1
• x < -1

Tags

CCSS.HSA.REI.D.12

Which of the following inequalities matches the given graph?

• y ≤ -3/4 x + 3
• y ≥ -3/4 x + 3
• y < -3/4 x + 3
• y > -3/4 x + 3

Tags

CCSS.HSA.REI.D.12

Find the values of x and y that maximize the objective function P = 3x + 2y for the graph. What is the maximum value?
   

• maximum value at (5, 4); 32
• maximum value at (0, 8); 16
• maximum value at (9, 0); 27
• maximum value at (0, 0); 0

Tags

CCSS.HSA.REI.D.12

CCSS.HSA.CED.A.2

CCSS.HSA.REI.D.10

CCSS.HSA.CED.A.3

CCSS.HSA.REI.C.6

CCSS.HSA.REI.D.11

Which system of inequalities matches the graph?

• y > 2x - 4
  y < 2
• y < 2x - 4
  y < 2
• y > 2x - 4
  y <  2 
• y < 2x - 4
  y <   -2

Tags

CCSS.HSA.REI.D.12

Which system of inequalities is shown?

• y ≥ -x - 1
  y < x + 4
• y < -x - 1
   y ≥ x + 4
• y > -x - 1
  y ≥ x + 4
• y > -x - 1
  y ≥ x + 3

Tags

CCSS.HSA.REI.D.12

Which point is a solution?

• (0, 6)
• (-3, 4)
• (1, 0)
• (-4, 3)

Tags

CCSS.HSA.CED.A.2

CCSS.HSA.REI.D.10

CCSS.HSA.REI.D.11