Linear Programming

Maximize N according to the constraints.

• (0,0)

• (5,0)

• (2,6)

• (0,8)

Which of these coordinate points lies withing the feasible region? (two answers)

• (5,3)

• (6,5)

• (5,1)

• (1,2)

Which coordinate point below minimizes C? (be careful, some of them are not within the feasible region)

• (0,3)

• (8,0)

• (2,0)

• (2,3)

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

• 
• 
• 
• 

Tags

CCSS.HSA.REI.D.12

Find the maximum value of  f(x,y)=9x+90y

• 108

• 102

• 82

• 42

• 30

Find the minimum value of z=5x+7y

• 28

• 21

• 20

• 19

• 15

Find the maximise z=4x+y subject to the constraints  $x+y\le50\ ;\ 3x+y\le90\ ;\ x\ge0\ ;\ y\ge0$  

• 150

• 135

• 120

• 110

• 100

Find the minimum value of z=200x+500y subject to the constraints $x+2y\ge10\ ;\ \ 3x+4y\le24;\ x\ge0\ ;\ y\ge0$  

• 2700

• 2650

• 2500

• 2450

• 2300

Find the minimum value of z=3x+9y subject to the constraints  $x+3y\le10\ ;\ 3x+y\ge10;\ y\le x\ ;\ x\ge0;\ y\ge0$  

• 40

• 33

• 30

• 15

• 10

Which point is a solution?

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