Zagazig University

Faculty of Engineering
Civil Engineering Department

linear programming
in construction

Presented to Prof.Dr:

Ahmed Hussain

Made by:

‫عمرو محمد سليمان السيد متولى جندية‬

1-A concrete manufacturer is concerned about how many units of two types of
concrete elements to produce during the next time period to maximize profit.
Each element of type “A” generates a profit of LE 60, while each element of type
“B” produces a profit of LE 40.
Two and three units of raw materials are needed to produce one concrete element of type A
and B, respectively. Also, four and two units of time are required to produce one concrete
element of type A and B respectively.
If 100 units of raw materials and 120 units of time are available,
formulate a linear programming model for this problem to determine the maximum profit.

The solution

Type A Type B
Martials 2 3 100
Time 4 2 120
Profit 60 40
(Max)

ZMax = 60X1 +40 X2

S.T
2X1 + 3X2 ≤ 100 (0,33.33) & (50,0)

4X1 + 2X2 ≤ 120 (0,60) & (30,0)

Iso-line:
let ZMax =60x+40 X2 =720
(0,18) & (12,0)
The optimum solution is at point E (20,20)
ZMax = 2000
X1 = 20 & X2 = 20
2- A small construction firm specializes in building and selling single-family homes. The
firm offers two basic types of houses, model A and model B. Model A houses require 4,000
labor hours, 2 tons of stone, and 2,000 board feet of lumber. Model B houses require
10,000 labor hours, 3 tons of stone, and 2,000 board feet of lumber. Due to long lead times
for ordering supplies and the scarcity of skilled and semiskilled workers in the area, the firm
will be forced to rely on its present resources for the upcoming building season. It has
400,000 hours of labour, 150 tons of stone, and 200,000 board feet of lumber.
What mix of model A and B houses should the firm construct if model as yield a profit of
$1,000 per unit and model Bs yield
$2,000 per unit? Assume that the firm will be able to sell all the units it build
The solution

A B
Labor 4000 10000 400000
Stone 2 3 150
Lumber 2000 2000 200000
Profit 1000 2000
(Max)

ZMax = 1000X1 +2000 X2

S.T 4000X1 + 10000X2 ≤ 400000 (0,40) & (100,0)

2X1 + 3X2 ≤ 150 (0,50) & (75,0)
2000X1 + 2000X2 ≤ 200000 (0,100)&(100,0)

Iso-line:
let ZMax =1000X1 + 2000X2 =10000
(0,20) & (10,0)
The optimum solution is at point G (37.5, 25)
ZMax = 87500
X1 = 37.5 & X2 = 25
3- A contractor may purchase material from two different sand and gravel pits.
The unit cost of material including delivery from pits 1 and 2 is LE 50 and LE 70
per cubic meter, respectively, the contractor requires at least 100 cubic meter of
mix.
The mix must contain a minimum of 30% sand. Pit 1 contains 25% and pit 2
contains 50% sand. If the objective is to minimize the cost of material, define the
decision variables and formulate a mathematical model.
- Draw the feasible region
- Determine the optimum solution by the graphical method

The solution

Pit 1 Pit 2
Sand 0.25 0.5 0.3
Gravel 0.75 0.5 0.7
Cost 50 70
(Min)

ZMin = 50X1 + 70X2

S.T
0.25X1 + 0.5X2 ≥ 0.3 (0,0.6) & (1.2,0)

0.75X1 + 0.5X2 ≥ 0.7 (0,1.4) & (0.93,0)

Iso-line:
let ZMin = 50X1 + 70X2 =35
(0,0.5) & (0.7,0)
 Unbounded Area

The optimum solution

at D (0,1.4) ZMin = 98
at E (0.8,0.2) ZMin = 54
at A (1.2,0) ZMin = 60

The optimum solution is at point E (0.8, 0.2)

ZMin = 54
X1 = 0.8 & X2 = 0.2
4- A concrete batch plant produces 2 types of concrete mix A, mix B. mix A
requires the following quantities per m3; 0.9 m3 gravel + 0.5 m3 sand +360 kg
cement +110kg. steel. Mix B requires the following quantities per m3; 0.8 m3
gravel + 0.45 m3 sand +260 kg cement.
Its required to determine the optimum quantities of concrete production based on
the following:
Tender price of A = 400 LE / m3
Tender price of B= 170 LE / m3
The max available amounts of materials area:
Gravel Sand Cement Steel
150 m3 90 m3 65 tons 30 tons
Formulate the problem to get the max value of tender price.

The solution

A B
Gravel 0.9 0.8 150
Stone 0.5 0.45 90
Cement 0.36 0.26 65
Steel 0.11 0 30
Profit 400 170
(Max)

ZMax = 400X1 + 170X2

S.T
0.9X1 + 0.8X2 ≤ 150 (0,187.5) & (166.67,0)

0.5X1 + 0.45X2 ≤ 90 (0,200) & (180,0)

0.36X1 + 0.26X2 ≤ 65 (0,250) & (180.5,0)

0.11X1 ≤ 30 (272.72,0)
The optimum solution is at point A1 (166.67, 0)
ZMax = 66668
X1 = 166.67 & X2 = 0
5- A manufacturer produces two types of timber frame housing packages (type
1&2). The operations are highly mechanized and the estimated average time
required
from each machine for the manufacturing of each package is given below:

Type 1 Type 2
A 10 30
B 10 60
C 40 20

In a given period, there are 600 hours of machine A time available, 850 hours of
machine B available, and 800 hours of machine C. The expected profit for the
production of each unit package is LE 2000 for type 1 and LE 1900 for type 2.
Formulate a linear program model that maximizes the profit and determine the
number of house type produces.

The solution

Type 1 Type 2
A 10 30 600
B 10 60 850
C 40 20 800
Profit 2000 1900
(Max)

ZMax = 2000X1 + 1900X2

S.T
10X1 + 30X2 ≤ 600

10X1 + 60X2 ≤ 850

40X1 + 20X2 ≤ 800

 10X1 + 30X2 +S1 = 600

10X1 + 60X2 +S2 = 850

40X1 + 20X2 +S3 = 800

ZMax = 2000X1 + 1900X2 +0S1 +0S2 +0S3

X1 X2 S1 S2 S3
Basic CB 2000 1900 0 0 0 Ratio
S1 0 10 30 1 0 0 600 60
S2 0 10 60 0 1 0 850 85
S3 0 40 20 0 0 1 800 20
Zj 0 0 0 0 0 0
Cj- Zj 2000 1900 0 0 0

Pivot = 40

X1 X2 S1 S2 S3
Basic CB 2000 1900 0 0 0 Ratio
S1 0 0 25 1 0 -1/4 400 16
S2 0 0 55 0 1 -1/4 650 130/11
X1 2000 1 1/2 0 0 1/40 20 40
Zj 2000 1000 0 0 50 400000
Cj- Zj 0 0 0 0 -50

New coming = old / pivot

New = old – [ Intersection*New coming]
Pivot = 55

X1 X2 S1 S2 S3
Basic CB 2000 1900 0 0 0
S1 0 0 0 1 -5/11 -3/22 1150/11
X2 1900 0 1 0 1/55 -1/220 130/11
X1 2000 1 0 0 -1/110 3/110 155/11
Zj 2000 1000 0 180/11 55/11 557000/11
Cj- Zj 0 0 0 -180/11 -55/11
New coming = old / pivot
New = old – [ Intersection*New coming]
The optimum solution
X1=155/11 X2= 130/11

S1=0 S2=0 S3=0

ZMax=557000/11