Special cases in a Linear Programming problem

--- The Simplex Algorithm ---

The ship “Hoegl Shore” is making a voyage in the Mediterranean Sea, between Europe and
Africa, leaving from Rotterdam, Netherlands and arriving in Nigeria.

The ship provides the crew with the necessary meals. Gastronomy is an important aspect,
one where the crew must establish a corresponding ratio and must respect the specialists’ directions
which claim that a diet is considered good if certain substances are offered, preferably organic
products, in small well-established quantities. Of course, in this case the menu at the crew’s
disposal is sought to have an optimum level of nutritious substances.

On the other hand, to reach this level costs must be minimized.

Therefore, this ratio must contain nutritious substances – proteins, carbohydrates, lipids and
vitamins(calcium), in the minimum quantities of 60g, 300g, 60g and 15g, respectively, found in
meat, fish, dairy, fruit and/or vegetables, with the corresponding price per unit of 15, 25, 10 and 10,
respectively.

Food Minimum
A4
A1 A2 A3 requirement of
(fruit/
Substance ( meat ) ( fish ) ( dairy ) nutritious
vegetables)
substance
S1 (protein) u11= 3 u12= 2 u13= 0 u14= 3 b1 = 60
S2 (carbohydrates) u21= 1 u22= 2 u23= 2 u24= 0 b2 = 300
S3 (lipids) u31= 2 u32= 5 u33= 0 u34= 3 b3 = 60
S4(vitamins-calcium) u41= 1 u42= 3 u43= 6 u44= 0 b4 = 15
Food price c1 = 15 c2 = 25 c3 = 10 c4 = 10
Consumption units x1 x2 x3 x4

Considering the following Linear Programming problem:

[max]f = 15x1+ 25x2+ 10x3 + 10x4
3𝑥1 + 2𝑥2 + 3𝑥4 ≥ 60
𝑥 + 2𝑥2 + 2𝑥3 ≥ 300
{ 1 𝑥 ≥ 0, 𝑖 = ̅̅̅̅
1,4
2𝑥1 + 5𝑥2 + 3𝑥4 ≥ 60 𝑖
𝑥1 + 3𝑥2 + 6𝑥3 ≥ 15
min f(x) = 60x1 + 300x2 + 60x3 + 15x4
 3𝑦1 + 𝑦2 + 2𝑦3 + 𝑦4 ≥ 20 −3𝑦1 − 𝑦2 − 2𝑦3 − 𝑦4 ≤ −20
2𝑦1 + 2𝑦2 + 5𝑦3 + 3𝑦4 ≥ 15 −2𝑦1 − 2𝑦2 − 5𝑦3 − 3𝑦4 ≤ −15
{ │ * (-1) → {
2𝑦2 + 6𝑦4 ≥ 12 −2𝑦2 − 6𝑦4 ≤ −12
3𝑦1 + 3𝑦3 ≥ 10 −3𝑦1 − 3𝑦3 ≤ −10

xj ≥ 0 , i = ̅̅̅̅
1,4

−3𝑦1 − 𝑦2 − 2𝑦3 − 𝑦4 + 𝑦5 = −20

−2𝑦1 − 2𝑦2 − 5𝑦3 − 3𝑦4 + 𝑦6 = −15 ̅̅̅̅
{ xj ≥ 0 , i = 1,8
−2𝑦2 − 6𝑦4 + 𝑦7 = −12
−3𝑦1 − 3𝑦3 + 𝑦8 = −10

c 60 300 60 15 0 0 0 0
Cb B b P1 P2 P3 P4 P5 P6 P7 P8
P5 -20 -3 -1 -2 -1 1 0 0 0
P6 -15 -2 -2 -5 -3 0 1 0 0
P7 -12 0 -2 0 -6 0 0 1 0
P8 -10 -3 0 -3 0 0 0 0 1
P4 → 0 0 0 0 0 0 0 0 0
zj
P5 ← Δj / 60 300 60 15 0 0 0 0
5 P4 20 3 1 2 1 - 1 0 0 0
0 P6 45 7 1 1 0 - 3 1 0 0
0 P7 108 18 4 12 0 - 6 0 1 0
0 P8 - 10 - 3 0 - 3 0 0 0 0 1
P1 → 15 5 10 5 5 - 5 0 0 0
zj
P8 ← Δj 45 300 50 10 5 0 0 0 0
5 P4 10 0 1 - 1 1 - 1 0 0 1
0 P6 65/3 0 1 - 6 0 - 3 1 0 7/3
0 P7 48 0 4 - 6 0 - 6 0 1 6
60 P1 10/3 1 0 1 0 0 0 0 - 1/3
zj 80 80 5 75 5 - 5 0 0 - 65/3
P5 ← Δj / -20 295 -15 10 5 0 0 65/3
5 P4 20/1 3/1 1/1 2/1 1/1 - 1/1 0/1 0/1 0/1
0 P6 55/1 7/1 1/1 1/1 0/1 - 3/1 1/1 0/1 0/1
0 P7 38/3 - 1/1 - 2/9 - 2/3 0/1 1/3 0/1 - 0/1
1/18
0 P1 - 10/1 - 3/1 0/1 - 3/1 0/1 0/1 0/1 0/1 1/1
zj 100/1 15/1 5/1 10/1 5/1 - 5/1 0/1 0/1 0/1
Δj / 45/1 295/1 50/1 10/1 5/1 0/1 0/1 0/1

10 65
𝑥 (𝑠) = ( , 0 , 0 , 10, 0 , , 48 , 0 )
3 3

10
𝑥 (𝑔) = ( 3 , 0 , 0 , 10)
 950
(min)f(x) = 3

65
𝑥 (𝑝) = ( 5, 0 , 0 , )
3

(max)f(x) = - min(-f(x))→ min(-f(x)) =-20x1 - 15x2 - 12x3 - 10x4

65 950
min(-f(x))= - 20 * 5 - 10 * =-
3 3