This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Objective: minimize 6 R + 10 D Constraints: 15 R + 20 D 180 Number of drumsticks 1/2*(number of wings), which is written as 3 R + 8 D 1 2 (12 R + 12 D ), which reduces to 3 R 2 D or 3 R2 D 0. 2. Graph the feasible region. 1 1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10 R (Regular) D (Deluxe) 3 R 2 D , or 3 R2 D Corner Point (4 , 6) 15 R + 20 D 180 Corner Point (0 , 9) 3. Identify the extreme points. The corner points are R = 0, D = 9; and R = 4, D = 6. 4. Find the objective value at each corner point. At (0 , 9), the objective value is 90. At (4 , 6), the objective value is 84. Since the objective is min, we choose (4 , 6) as the optimal. 5. Solve the problem in Excel. 6. Interpret your solution. We should buy 4 regular buckets and 6 deluxe buckets at a cost of $84. 2...
View
Full
Document
 Fall '06
 RUBIN,David

Click to edit the document details