Systems of Inequalities & Linear Programming

Front

What are the vertices of the feasible region?

Back

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

Front

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

Back

the feasible region

Front

Objective function: P = 30x + 50y. Which vertex maximizes the profit? Options: (0,0), (6,2), (8,0), (0,6)

Back

(0,6)

Front

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

Back

Front

Inequality that matches the given graph: x ≥ -1, x ≤ -1, x > -1, x < -1

Back

x < -1

Front

Which inequality matches the given graph? Options: y ≤ -3/4 x + 3, y ≥ -3/4 x + 3, y < -3/4 x + 3, y > -3/4 x + 3

Back

y ≥ -3/4 x + 3

Front

Find the values of x and y that maximize the objective function P = 3x + 2y for the graph.

Back

Maximum value at (9, 0); 27

Front

Which system of inequalities matches the graph? Options: y > 2x - 4
y < 2, y < 2x - 4
y < 2, y > 2x - 4
y <  2 , y < 2x - 4
y <   -2

Back

y > 2x - 4
y <  2 

Front

Which system of inequalities is shown? Options: y ≥ -x - 1
y < x + 4, y < -x - 1
 y ≥ x + 4, y > -x - 1
y ≥ x + 4, y > -x - 1
y ≥ x + 3

Back

y > -x - 1
y ≥ x + 4

Front

Which point is a solution? Options: (0, 6), (-3, 4), (1, 0), (-4, 3)

Back

(1, 0)