Question

D 12.5 pts Question 7 Quality Bike Maps has produced four map designs for the local area. A limited amount of time (in minutes) is allocated to the printing, cutting and folding of each map. Additionally, at least one thousand of map designs A, B, and C must be printed. The profit per map is $1 for A and B and $2 for C and D. Using the Report below, which constraints are NOT binding? Variable Cells Reduced Objective Allowable Final Allowable Cell Name Decrease Value Cost Coefficient Increase 1500 1000 1000 2833.33 13 0.3333 1E+30 1E+30 0.5 SB$18 Map A SC$18 Map B SD$18 MapC SES18 Map D 1 0.33333 0.33333 2 0 Constraints Final Shadow Constraint Allowable Allowable Price R.H. Side Cell Name Value Increase Decrease 0.5 15000 20000 20000 1000 1000 1000 5666.6667 SB$24 Print 1000 15000 1E+30 3500 16500 20000 1500 1000 1000 SB$25 Cut 0.16667 1000 1E+30 SB$26 Fold 7000 500 SB$27 PrintA -0.33333 -0.33333 1750 1000 1000 SB$28 PrintB SB$29 PrintC 500 Print and Fold Print and Cut Print, Fold, Print B and Print C

Answer 1

7)

a nonbinding constraint always has a shadow price of zero, since a change in its RHS does not affect the optimal solution or OFV at all. The shadow price of a constraint is defined for a “one unit” change in the constraint

here cut and PrintA are not binding as their shadow price = 0

5)

since 1 <= allowable increase

optimal solution won't change

hence

1500 * 1 + 1000*1 + 1000*2 + 2833.33* 3
=

13000