systems of inequality and linear programming

Objective quantity:
P = 30x + 50y
Corner that maximizes profit: (0, 6)
What is the profit?

• 300
• 280
• 400
• 240

Which are vertices of the feasible region?

• (0, 3) (3, 0) (5, 8)

• (0, 6) (3, 5) (6, 5)

• (3, 3) (8, 5) (5, 8)

• (0, 5) (6, 0) (3, 3)

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)

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

• (2, 0), (4, 5), (6, 0)

• (2, 0), (3, 5), (0, 6)

• (0, 2), (3.5, 4.5), (6, 2)

• (0, 0), (3, 5), (6, 0)

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

• 
• 
• 
• 

Tags

CCSS.HSA.REI.D.12

Which system of inequality 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 + 4

Tags

CCSS.HSA.REI.D.12

What would the solution be to this system of linear equations?

• (0,-1.5)

• (1, -3)

• (5,0)

• (0,0)

Tags

CCSS.8.EE.C.8B

Match the following graphs to the systems of equations

• 
• 
• 

Tags

CCSS.8.EE.C.8B

• 
• 
• 

Tags

CCSS.8.EE.C.8B