Question: Problem 2-21 Consider the following linear program: Max 2 A + 3 B s.t. 5 A + 5 B 400 - A + B 10
Problem 2-21
Consider the following linear program:
| Max | 2A | + | 3B | |||
| s.t. | ||||||
| 5A | + | 5B | 400 | |||
| -A | + | B | 10 | |||
| A | + | 3B | 90 | |||
| A, B | 0 |
- Select the constraint to identify which graph it represents (1, 2 or 3).
Constraint 1 = Constraint 2 = Constraint 3 = - Select the correct graph that shades the feasible region for the problem.
(i) (ii) (iii) (iv) - Identify the optimal extreme point. What is the optimal solution? Optimal solution is A = fill in the blank 5, B = fill in the blank 6, Max = fill in the blank 7
- Which constraints are binding?
Constraint 1 = Constraint 2 = Constraint 3 = - How much slack or surplus is associated with the nonbinding constraint?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
