Professional Documents
Culture Documents
Quantitative Models Assignment 5
Quantitative Models Assignment 5
Exercise 5
1. The Bakery Problem: The ‘Cookie Company’ is organizing their production plan for the
next week. Using linear programming, they have produced the following model:
where 𝑥 𝑖 = number of cookies of type 𝑖 and the objective function maximizes net profits.
Solve the problem using a program and answer the following questions:
a) How many cookies of which type will we bake and what is the profit from the optimal
solution?
b) By how much could we be mistaken with respect to the net profit of cookie type 3
without affecting the optimal solution?
c) If the profits from cookie type 1 increased by $0.05 as a result of improving the
production efficiency, how would this impact the optimal solution?
d) One of our competitors is offering to sell us up to 200 hours of use of their oven, which
is identical to our own oven, at a cost of $0.15 per hour. Is this offer worthwhile and
what would be the impact of such an agreement?
e) After testing the supplies, we have discovered that 1,500 grams of sugar is of insuffi-
cient quality and needs to be thrown away. How will this impact out profits?
f) If we are required to produce cookies of type 4, how will this impact our profits?
• Objective Function:
Min 𝑥1 + 2𝑥2
• Constraints:
2𝑥 1 + 𝑥2 ≥ 12
2𝑥 1 + 3𝑥2 ≥ 30
2𝑥 1 − 𝑥2 ≥ 0
𝑥 1 − 2𝑥2 ≥ 0
𝑥1 , 𝑥2 ≥ 0
1
Lecture 5. Sensitivity Analysis
• Graph:
15
10
𝑥2
5 𝐴
𝐵
0
0 2 4 6 8 10 12 14
𝑥1
𝐴(8.57, 4.29)
𝐵(15, 0)
• Preferred points:
None of the points is dominant on the other
• Checking the value of the objective function:
𝑥1∗ = 15 𝑥2∗ = 0
𝑍 ∗ = 15
a) Find the optimality range for the coefficients of the objective function 𝑐 1 and 𝑐2 .
b) Find the reduced cost of 𝑥2 .
c) For each constraint, determine whether it is binding or not and what is the slack of
each.
d) Determine the shadow price for each constraint.
e) Determine the range of feasibility for each constraint.
f) What would be the optimal solution if we turn the problem into a maximization
problem?
g) Solve the problem in Solver and check your answers.
Operators work an 8-hour continuous shift but begin work at midnight, 4 AM, 8 AM, and
so on.
Bezeq would like to schedule its work shifts to minimize the number of operators on
the payroll. Formulate the problem as linear programming and solve it using Solver (no
sensitivity analysis here).
NSC can meet demand by producing the steel, by drawing from its inventory, or a com-
bination of these. Inventory at the beginning of January is zero. Production costs are
expected to rise in February and March. Production and inventory costs are:
Production costs are in $ per ton. Inventory costs are in $ per ton per month. For example,
1 ton in inventory for 1 month costs $250, for 2 months, it costs $500.
NSC can produce at most 3000 tons of steel per month.