Linear programming solution 2
Linear programming solution 2
𝑧 = 4𝑥1 + 6𝑥2
Constraints.
Space 324𝑥1 + 216𝑥2 ≤ 43,200
Time 4𝑥1 + 8𝑥2 ≤ 1,080
Non-Negativity 𝑥1, 𝑥2 ≥ 0
b. Solve the linear programming model by using the Excel Solver.
X1 X2 Z
Solution 65 102.5 875
obj.coeff 4 6
LHS RHS
Space 324 216 43200 <= 43200
Time 4 8 1080 <= 1080
The optimal solution would be to plant 65 number of daisies and 102.5 number of impatiens,
and she would realize a profit of $ 875.
c. According to the sensitivity report, if Angie can increase the time she spends each week
with her flowers by 1 hour, how much more revenue might she get?
Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$B$2 X1 65.00 0.00 4.00 5.00 1.00
$C$2 X2 102.50 0.00 6.00 2.00 3.33
Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$D$5 Space LHS 43200.00 0.00 43200.00 44280.00 14040.00
$D$6 Time LHS 1080.00 0.63 1080.00 520.00 546.67
From the sensitivity report, the shadow price for time constraint is $0.63, meaning the
revenue is expected to increase by $0.63 for every additional minute spent cultivating the
flowers.
0.63 ∗ 60 = $37.8
Problem 2 solution
Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$I$10 Fat LHS 20 0 60 1E+30 40
$I$11 Cholesterol LHS 30 -0.0028 30 1.567080045 30
$I$6 Calories LHS 1500 0 2000 1E+30 500
$I$7 Iron LHS 5.079428571 0 5 0.079428571 1E+30
$I$8 Protein LHS 30 0.04 30 1E+30 0.361038961
$I$9 Carbohydates LHS 160.8 0 40 120.8 1.00E+30