Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
8.4
Problem Description Stable owner wants to set a nutritional diet for the horses in his
care but maintaining a daily cost of feed to a minimum. Feed mixes are oat, enriched
grain and a mineral product and for each of these mixes there must be a certain
amount of ingredients A, B, C, D, E. So, we are under a minimization linear problem.
Parameters
Decision Variables
Constraints
A: 2 ∗ 𝑥1 + 3 ∗ 𝑥2 + 𝑥3 ≥ 6
B: 0.5 ∗ 𝑥1 + 𝑥2 + 0.5 ∗ 𝑥3 ≥ 2
C: 3 ∗ 𝑥1 + 5 ∗ 𝑥2 + 6 ∗ 𝑥3 ≥ 9
D: 𝑥1 + 1.5 ∗ 𝑥2 + 2 ∗ 𝑥3 ≥ 8
E: 0.5 ∗ 𝑥1 + 0.5 ∗ 𝑥2 + 1.5 ∗ 𝑥3 ≥ 5
Problem Description An automobile rental agency has to decide how many cars should
be leased in each month on each type of lease in order to minimize the cost of leasing
over a six-month period.
Parameters
Decision Variables
Constraints
In overall:
𝑥13 + 𝑥23 + 𝑥33 + 𝑥43 + 𝑥53 +𝑥63
𝑥11 + 𝑥12 + 𝑥13 + 𝑥21 + 𝑥22 + 𝑥23 + 𝑥31 + 𝑥32 + 𝑥33 + 𝑥41 + 𝑥42 + 𝑥43 + 𝑥51 + 𝑥52 + 𝑥53 + 𝑥61 + 𝑥62 + 𝑥63
≥ 0.5 ∗ (𝑥11 + 𝑥12 + 𝑥13 + 𝑥21 + 𝑥22 + 𝑥23 + 𝑥31 + 𝑥32 + 𝑥33 + 𝑥41 + 𝑥42 + 𝑥43 + 𝑥51 + 𝑥52 + 𝑥53
+ 𝑥61 + 𝑥62 + 𝑥63
March: 𝑥11 + 𝑥12 + 𝑥13 ≥ 30
April: 𝑥11 + 𝑥12 + 𝑥13 + 𝑥21 + 𝑥22 + 𝑥23 ≥ 130
May: 𝑥11 + 𝑥12 + 𝑥13 + 𝑥21 + 𝑥22 + 𝑥23 + 𝑥31 + 𝑥32 + 𝑥33 ≥ 300
June: 𝑥12 + 𝑥13 + 𝑥21 + 𝑥22 + 𝑥23 + 𝑥31 + 𝑥32 + 𝑥33 + 𝑥41 + 𝑥42 + 𝑥43 ≥ 460
July: 𝑥13 +𝑥22 + 𝑥23 + 𝑥31 + 𝑥32 + 𝑥33 + 𝑥41 + 𝑥42 + 𝑥43 + 𝑥51 + 𝑥52 + 𝑥53 ≥
470
August: 𝑥23 + 𝑥32 + 𝑥33 + 𝑥41 + 𝑥42 + 𝑥43 + 𝑥51 + 𝑥52 + 𝑥53 + 𝑥61 + 𝑥62 +
𝑥63 ≥ 440
Objective Function min. 𝑍 = 1260(𝑥11 + 𝑥21 + 𝑥31 + 𝑥41 ) + 840𝑥51 + 420𝑥61 +
1600(𝑥12 + 𝑥22 + 𝑥32 ) + 1200𝑥42 + 800𝑥52 + 400𝑥62 + 1850(𝑥13 + 𝑥23 ) +
1480𝑥33 + 1110𝑥43 + 740𝑥53 + 370𝑥63
Results
X13=30, X23=100, X33=170, X43=160, X53=10, and our objective function Z=677100. The
remaining decision variables are 0.
8.9
Problem Description Given the previous problem, the automobile rental agency has
decided to perhaps the previous strategy is not the appropriate one since the agency
may still be obligated to additional months on some leases. Now it has to minimize the
cost of leasing taking into account that it should not have additional months to pay
after August.
Parameters
Decision Variables
Since we have to avoid having extra months paid after August, we removed those
decision variables that caused additional months to be paid in all types of leases.
Constraints
In overall:
𝑥13 + 𝑥23 + 𝑥33 + 𝑥43 + 𝑥53 +𝑥63
𝑥11 + 𝑥12 + 𝑥13 + 𝑥21 + 𝑥22 + 𝑥23 + 𝑥31 + 𝑥32 + 𝑥33 + 𝑥41 + 𝑥42 + 𝑥43 + 𝑥51 + 𝑥52 + 𝑥53 + 𝑥61 + 𝑥62 + 𝑥63
≥ 0.5 ∗ (𝑥11 + 𝑥12 + 𝑥13 + 𝑥21 + 𝑥22 + 𝑥23 + 𝑥31 + 𝑥32 + 𝑥33 + 𝑥41 + 𝑥42 + 𝑥43 + 𝑥51 + 𝑥52
+ 𝑥53 + 𝑥61 + 𝑥62 + 𝑥63
Objective Function
Function 𝑍 = 1260 ∗ (𝑥11 + 𝑥21 + 𝑥31 + 𝑥41 ) + 1600 ∗ (𝑥12 + 𝑥22 + 𝑥32 ) +
1850 ∗ (𝑥13 + 𝑥23 )
Results
X13=30, X23=440 and our objective function Z=869500. The rest of the decision
variables are 0.
8.11
Parameters
Advertising, in-store displays and in on-hand wallpaper inventory are the factors in
which the retail allocates its budget. It also has to care about its mark-up.
Decision Variables
Constraints
Budget constraints:
Overall: 𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 = 17000
On advertising: 3000 ≤ 𝑥1 ≤ 17000
On in-store displays and in on-hand wallpaper inventory: 𝑥2 −0.5 ∗ 𝑥3 ≥ 0
Results X1=17000, X2=0, X3=0, X4=0.2 and our objective function Z=327000
8.23
Problem Description An airline wants to reduce the cost of fuel purchases by taking
advantage of lower fuel costs in certain cities. However, it must be careful of having
extra fuel on the plain because it adds weight to the plain and, therefore, raises the
cost of arriving to places.
Parameters
Decision Variables
Constraints
Objective Function
Results x1=24, x2=15, x3=9, x4=11, xA=0, xL=0, xH=0, xN=0, Z=246,23
PART 2 – New England Confectionery Company
Part A
EXERCISE 1
1a - Mayflower
Problem Description Mr Miller wants to achieve an optimal mix of various candies into
each of the six boxes.
Parameters
Decision Variables
Xc % of cream candies
Xf % of fudge candies
1b - Salem
Problem Description Mr Miller wants to achieve an optimal mix of various candies into
each of the six boxes.
Parameters
Decision Variables
Xt % of toffee candies
Xf % of fudge candies
Constraints 𝑥𝑡 ≤ 0.7 and 𝑥𝑓 ≤ 0.9, 1𝑥𝑡 + 1𝑥𝑓 = 1600
Fruits: 0.04𝑥𝑓
Caramel: 0.08𝑥𝑡
EXERCISE 2
2a - Cherry
Problem Description Mr Miller wants to figure out how many candies of each theme
confectionary should make in order to maximize profits.
Parameters
Inputs required to make the candy themes: cherries, mixing, labor, molds, minimum
pieces
Decision Variables
Constraints
Problem Description Mr Miller wants to figure out how many candies of each theme
confectionary should make in order to maximize profits.
Parameters
Inputs required to make the candy themes: cherries, hazelnuts, mixing, labor, molds,
minimum pieces
Decision Variables
Xh number of hazelnuts
Xw number of walnuts
Constraints
Hazelnuts: 𝑥𝑤 ≤ 500
Molds: 𝑥ℎ + 𝑥𝑤 ≤ 550
EXERCISE 3
“That can’t be right. You’ve left out the chocolate, sugar and vanilla, to name a few
ingredients”
What Mr. McGregor could say is that the mixtures that he inherited from his
grandfather did not take into account these ingredients, so he’s only improving from
the already existing ingredients that have always been considered when making the
candy.
EXERCISE 4
If we now have the option to do a 2 pound box, we will have to change the restriction
so that it expresses the maximum amount. Also, since the 1 and 2 pound boxes
distribute equally, there is not going to be a proportion problem.
EXERCISE 5
Adding this new restriction will not change the solution of the problem because we
already found that the optimal solution required that both types of candies added up
to 1 pound.
EXERCISE 6
We add the following modified constraint, replacing the previous one regarding the
maximum weight of the 1 pound box
In the Mayflower we modify the constraint so that it has this form 80𝑥𝑐 + 90𝑓 = 1600.
When we apply it the solution does not change
However, in the Salem box, when we add the new constraint 90𝑥𝑡 + 110𝑥𝑓 = 1600
the solution does change. Xt=0.9, xf= 0.7, Z=0.137. We have a new value for the
number of pieces of fudge and a new value for the objective function as well.
What we noticed in this exercise is that the 1 pound weight box constraint is not
satisfied, which may be the thing that complicates the assortment. It could be that
making sure that the box weights one pound is difficult due to the data being an
average of the piece weight and some outliers could mess the desired box weight up.
EXERCISE 7
100𝑥𝑡 ≤ 0.7 and 100𝑥𝑓 ≤ 0.9, 1𝑥𝑡 + 1𝑥𝑓 ≤ 16,5, 1𝑥𝑡 + 1𝑥𝑓 ≥ 15,5
Caramel: 8𝑥𝑡
100𝑥𝑐 ≤ 0.7 and 100𝑥𝑓 ≤ 0.9, 1𝑥𝑡 + 1𝑥𝑓 ≤ 16,5, 1𝑥𝑡 + 1𝑥𝑓 ≥ 15,5
c. When we round for integers in Question 6 it does not affect the optimality of the
problem, therefore we cannot compare with the results found in part b