Chapter 2 Problem 21: Consider the following linear program: Max 2A + 3B s.t 5A + 5B =0 Figure 2.22 shows a graph of the

Chapter 2

Problem 21:

Consider the following linear program:

Max 2A + 3B

s.t

5A + 5B <= 400 Constraint 1

-1A + 1B <= 10 Constraint 2

1A + 3B >= 90 Constraint 3

A, B >=0

Figure 2.22 shows a graph of the constraint lines.

Figure 2.22Graph of the Constraint Lines for Exercise 21

1. Place a number (1, 2, or 3) next to each constraint line to identify which constraint it represents.

2. Shade in the feasible region on the graph.

3. Identify the optimal extreme point. What is the optimal solution?

4. Which constraints are binding? Explain.

5. How much slack or surplus is associated with the nonbinding constraint?