Consider this linear program:

MinimizeZ

=

45

x

+

45

y

Z=45x+45y

Subject to2

11

x

+

1

5

y

1

(

C

1

)

13

2

x

+

4

y

26

(

C

2

)

x

5

(

C

3

)

2

15

y

1

(

C

4

)

x

,

y

0

211x+15y1(C1)132x+4y26(C2)x5(C3)215y1(C4)x,y0

(a)Graph the feasible region for the constraints.(50%)

Drawing the feasible region requires 3 mouse clicks for each constraint. Use the first two clicks to draw the line and the third click to select the region satisfying the constraint.

(B)Graph only the feasible region.(10%)

Click once on each corner point of the feasible region to draw it. Then click on the first point again to close and shade it.

(C)State the optimal solution point and the objective function value.(30%)

Enter your answers below as fractions or decimals accurate to at least 3 decimal places. Do not use rounded values to calculate the objective function value. Use exact values.

The optimal solution occurs at

x

x

=, y

y

=

The optimal objective function value,Z

Z

=

(D)At optimal solution, which constraints arenon-binding?(10%)

Select all that apply.

• C
• 1
• C1
• C
• 2
• C2
• C
• 3
• C3
• C
• 4