Question: Consider the following linear program: Max 2A + 3B s.t. 5A + 5B ¤ 400 Constraint1 -1A + 1B ¤ 10 Constraint 2 1A +
Max 2A + 3B
s.t.
5A + 5B ¤ 400 Constraint1
-1A + 1B ¤ 10 Constraint 2
1A + 3B ¥ 90 Constraint 3
A, B ¥ 0
Figure shows a graph of the constraint lines.
FIGURE GRAPH OF THE CONSTRAINT LINES FOR EXERCISE 21
.png)
a. Place a number (1, 2, or 3) next to each constraint line to identify which constraint it represents.
b. Shade in the feasible region on the graph.
c. Identify the optimal extreme point. What is the optimal solution?
d. Which constraints are binding? Explain.
e. How much slack or surplus is associated with the nonbindingconstraint?
90 70 t 50 10 F 0 10 20 30 40 50 60 70 80 90 100
Step by Step Solution
3.34 Rating (166 Votes )
There are 3 Steps involved in it
a and b c Optimal solution occurs at the intersection of constraints 1 an... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
148-M-O-G-L-P (34).docx
120 KBs Word File
