MATA2664 Tutorial 10

Question 1.

Max: z = x1 + 2 x2

Subject to:
2x1 + 4x2 ≤ 20
x1 + x2 ≤ 8
x1 , x2 ≥ 0

Augmented form:
𝑧 − 𝑥1 − 2𝑥2 = 0
2𝑥1 + 4𝑥2 + 𝑠1 = 20
𝑥1 + 𝑥2 + 𝑠2 = 8

z x1 x2 s1 s2 RS
R0 z 1 -1 -2 0 0 0
1 R1 s1 0 2 4 1 0 20 5 <--- smallest, so s1 must go out
R2 s2 0 1 1 0 1 8 8 𝑅12 = 𝑅11 /4
R0 z 1 0 0 0.5 0 10
𝑅02 = 𝑅01 − (−2)𝑅12
2 R1 x2 0 0.5 1 0.25 0 5
R2 s2 0 0.5 0 -0.25 1 3 𝑅22 = 𝑅21 − (1)𝑅12

Solution:
𝑥1 = 0
𝑥2 = 5
𝑧𝑚𝑎𝑥 = 10
2. A company produces 3 different bookshelves: a luxury, a regular and an exportation
model. The working hours at the carpentry and finishing sections have the working time
limitations below:

Section Total number Number of hours needed to produce each model

of hours
available luxury regular exportation
(thousands)

carpentry 1.4 0.5 0.5 1.0

finishing 1.2 0.5 0.5 2.0

Assuming the selling profit for the luxury, regular and exportation models is 1500, 1300 and
2500 respectively, formulate the LP problem in order to maximize the profit.
Interpret the results detailing the optimal number of bookshelves of each type produced
discussing the total amount of hours used in each section.

Linear Program:
𝑥1 = number of luxury bookshelves
𝑥2 = number of regular bookshelves
𝑥3 = number of export bookshelves

Maximize 𝑧 = 1500𝑥1 + 1300𝑥2 + 2500𝑥3

Subject to
0.5𝑥1 + 0.5𝑥2 + 𝑥3 ≤ 1400
0.5𝑥1 + 0.5𝑥2 + 2𝑥3 ≤ 1200
Augmented form:
𝑧 − 1500𝑥1 − 1300𝑥2 − 2500𝑥3 = 0
0.5𝑥1 + 0.5𝑥2 + 𝑥3 + 𝑠1 = 1400
0.5𝑥1 + 0.5𝑥2 + +2𝑥3 + 𝑠2 = 1200
 z x1 x2 x3 s1 s2 RS
R0 z 1 -1500 -1300 -2500 0 0 0
1 R1 s1 0 0.5 0.5 1 1 0 1400 1400
R2 s2 0 0.5 0.5 2 0 1 1200 600 <--- smallest, so s2 must go out
R0 z 1 -875 -675 0 0 1250 1500000 𝑅22 = 𝑅21 /2
𝑅02 = 𝑅01 − (−2500)𝑅22
2 R1 s1 0 0.25 0.25 0 1 -0.5 800 3200 𝑅12 = 𝑅11 − (1)𝑅22
R2 x3 0 0.25 0.25 1 0 0.5 600 2400 <--- smallest, so x3 must go out
R0 z 1 0 200 3500 0 3000 3600000 𝑅23 = 𝑅22 /0.25
3 R1 s1 0 0 0 -1 1 -1 200 𝑅03 = 𝑅02 − (−875)𝑅23
R2 x1 0 1 1 4 0 2 2400 𝑅13 = 𝑅12 − (0.25)𝑅23

Solution:
𝑥1 = 2400
𝑥2 = 0
𝑥3 = 0
𝑧𝑚𝑎𝑥 = 3600000
Thus, manufacture 2400 luxury bookshelves and none of the other 2 types.
From the fact that 𝑠1 = 200 (and not 0), means there is slack on constraint 1. For this
problem it means that 200 hours remain unused in the carpentry process.
3.

Max: Z = 25x1 + 36 x2
Subject to:
3x1 + 2x2 ≤ 15
x1 + 3x2 ≤ 20
2 x1 + x2 ≤ 30
x1 ≥ 0 , x2 ≥ 0

Augmented form:
𝑧 − 25 − 36𝑥2 = 0
3𝑥1 + 2𝑥2 + 𝑠1 = 15
𝑥1 + 3𝑥2 + 𝑠2 = 20
2𝑥1 + 𝑥2 + 𝑠3 = 30

z x1 x2 s1 s2 s3 RS
R0 z 1 -25 -36 0 0 0 0
R1 s1 0 3 2 1 0 0 15 7.5
1
R2 s2 0 1 3 0 1 0 20 6.67 <--- smallest, so s2 must go out
R3 s3 0 2 1 0 0 1 30 30
R0 z 1 -13 0 0 12 0 240
R1 s1 0 2.333 0 1 -0.667 0 1.667 0.71 <--- smallest, so s1 must go out
2
R2 x2 0 0.333 1 0 0.333 0 6.667 20
R3 s3 0 1.667 0 0 -0.333 1 23.33 14
R0 z 1 0 0 5.571 8.286 0 249.3
R1 x1 0 1 0 0.429 -0.286 0 0.714
3
R2 x2 0 0 1 -0.14 0.429 0 6.429
R3 s3 0 0 0 -0.71 0.143 1 22.14

2nd Tableau’s values 3rd Tableau’s values

𝑅22 = 𝑅21 /3 𝑅13 = 𝑅12 /2.33

𝑅02 = 𝑅01 − (−36)𝑅22 𝑅03 = 𝑅02 − (−13)𝑅13

𝑅12 = 𝑅11 − (2)𝑅22 𝑅23 = 𝑅22 − (0.33)𝑅13
𝑅32 = 𝑅31 − (1)𝑅22 𝑅33 = 𝑅32 − (1.67)𝑅13

Solution:
𝑥1 = 0.714
𝑥2 = 6.429
𝑧𝑚𝑎𝑥 = 249.3