CE 771: Optimization in Civil

Engineering

Mathematical formulation of optimization

problems

AvijitMaji©
Problem
A scaffolding system consists of three beams and six
ropes. Each of the top ropes A and B can carry a load
of 𝑊1, each of the middle ropes C and D can carry a
load of 𝑊2, and each of the bottom ropes E and F can
carry a load of 𝑊3. If the loads acting on beams 1, 2,
and 3 are 𝑥1, 𝑥2, and 𝑥3, respectively. Assume that
the weights of the beams 1, 2, and 3 are 𝑤1, 𝑤2, and
𝑤3, respectively, and the weights of the ropes are
negligible.
• Formulate the problem of finding the maximum
load (𝑥1 + 𝑥2 + 𝑥3) that can be supported by the
system.
• Also, how would you like to classify this problem?

1st Semester of 2020-21 Academic year CE 771: Optimization in Civil Engineering (Online course) AvijitMaji© 2
 Solution:
Assuming that the weights of the beams act through their respective middle points, the equations
of equilibrium for vertical forces and moments for each of the three beams can be written as
For beam 3:
𝑇! + 𝑇" = 𝑥# + 𝑤# Net vertical force
𝑥# (3𝑙) + 𝑤# (2𝑙) + 𝑇" (4𝑙) = 0 Moment about E

For beam 2:
𝑇$ + 𝑇% − 𝑇! = 𝑥& + 𝑤& Net vertical force
𝑥& 𝑙 + 𝑤& 𝑙 + 𝑇! 𝑙 − 𝑇% (2𝑙) = 0 Moment about C

For beam 1:
𝑇' + 𝑇( − 𝑇$ − 𝑇% − 𝑇" = 𝑥) + 𝑤) Net vertical force
*
𝑥& 3𝑙 + 𝑤) 𝑙 − 𝑇( 9𝑙 + 𝑇$ 2𝑙 + 𝑇% 4𝑙 + 𝑇" (7𝑙) = 0 Moment about A
&

1st Semester of 2020-21 Academic year CE 771: Optimization in Civil Engineering (Online course) AvijitMaji© 3
Intermediate steps
3 1
𝑇" = 𝑥# + 𝑤#
4 2
1 1
𝑇$ = 𝑥# + 𝑤#
4 2
1 1 1 1
𝑇% = 𝑥& + 𝑥# + 𝑤& + 𝑤#
2 8 2 4
1 1 1 1
𝑇' = 𝑥& + 𝑥# + 𝑤& + 𝑤#
2 8 2 4
1 1 2 1 1 5
𝑇( = 𝑥) + 𝑥& + 𝑥# + 𝑤) + 𝑤& + 𝑤#
3 3 3 2 3 9
2 2 1 1 2 4
𝑇* = 𝑥) + 𝑥& + 𝑥# + 𝑤) + 𝑤& + 𝑤#
3 3 3 2 3 9
where 𝑇𝑖 denotes the tension in rope 𝑖.
1st Semester of 2020-21 Academic year CE 771: Optimization in Civil Engineering (Online course) AvijitMaji© 4
Final solution
The optimization problem can 𝑥$
be formulated by choosing 𝑋 = 𝑥%
the design variables 𝑥&
Objective is to maximize
the total load, therefore Max. 𝑓 𝑋 = (𝑥$ + 𝑥% + 𝑥& )
the objective function is
The constraints on the forces Subject to:
in the ropes can be stated as 𝑇* ≤ 𝑊) ; 𝑇( ≤ 𝑊) ; 𝑇' ≤ 𝑊& ; 𝑇% ≤ 𝑊& ; 𝑇$ ≤ 𝑊# ; 𝑇" ≤ 𝑊#
Considering the non-negativity
𝑥$ , 𝑥% , 𝑥& ≥ 0
requirement of the design variables
Since all the equations of the optimization formulation are linear
functions of 𝑥$ , 𝑥% 𝑎𝑛𝑑 𝑥& the problem is a linear programming problem
1st Semester of 2020-21 Academic year CE 771: Optimization in Civil Engineering (Online course) AvijitMaji© 5
Problem
A traveling saleswoman has to cover n towns. She plans to start from a
particular town numbered 1, visit each of the other 𝑛 − 1 towns, and
return to the town 1. The distance between towns 𝑖 and 𝑗 is given by
𝑑𝑖𝑗. Formulate the problem of selecting the sequence in which the
towns are to be visited to minimize the total distance travelled.

1st Semester of 2020-21 Academic year CE 771: Optimization in Civil Engineering (Online course) AvijitMaji© 6
Solution
1 ; 𝑖𝑓 𝑡𝑜𝑤𝑛 𝑗 𝑖𝑠 𝑣𝑖𝑠𝑖𝑡𝑒𝑑 𝑖𝑚𝑚𝑒𝑑𝑖𝑎𝑡𝑒𝑙𝑦 𝑎𝑓𝑡𝑒𝑟 𝑐𝑖𝑡𝑦 𝑖 Where, 𝑖 =source, 𝑗 =destination
• 𝑥+, = / ∀ 𝑖, 𝑗 = 1, … … , 𝑛
0 ; 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
• 𝑑+, = Distance between town 𝑗 and town 𝑖 - -

• Objective is to minimize the total distance travelled 𝑀𝑖𝑛. 𝐷 = 5 5 𝑑+. 𝑥+.

+,) ./+,.,)
• Subject to:
∑0+-),+/, 𝑥+, = 1 ∀𝑗 = 1, 2, … , 𝑛 Ensures a town 𝑖 is visited once from town 𝑗
∑0,-),,/+ 𝑥+, = 1 ∀𝑖 = 1, 2, … , 𝑛 Ensures only one town 𝑗 can be visited from town 𝑖
𝑦+ − 𝑦, + 𝑛𝑥+, ≤ 𝑛 − 1 2 ≤ 𝑖 ≠ 𝑗 ≤ 𝑛 Enforces only a single tour covering all towns
0 ≤ 𝑦+ ≤ 𝑛 − 1 2≤𝑖≤𝑛
Where, 𝑦+ = dummy variable ∀𝑖 = 1, 2, … , 𝑛

1st Semester of 2020-21 Academic year CE 771: Optimization in Civil Engineering (Online course) AvijitMaji© 7
Problem
A railroad track of length 𝐿 is constructed over an uneven terrain. The
absolute gradient of the track is restricted to 𝑔1. The rate of change of
the gradient is limited to 𝑔2 to avoid rapid accelerations and
decelerations. The absolute value of the second derivative of the slope
is limited to 𝑔3 to avoid severe jerks. Formulate the problem of finding
the elevation of the track to minimize the construction costs. Assume
the construction costs to be proportional to the amount of soil added
or removed. The elevation of the track is equal to 𝑎 and 𝑏 at 𝑥 = 0
and 𝑥 = 𝐿, respectively.

1st Semester of 2020-21 Academic year CE 771: Optimization in Civil Engineering (Online course) AvijitMaji© 8
Solution
ℎ = elevation at a location
(like: ℎ1 , ℎ2 , ℎ3, etc.)
𝑥 = position of the location
(like: 𝑥1 , 𝑥2 , 𝑥3, etc.)

Considering unit width of section,

Construction cost, 𝐶 = ℎ. 𝑥. 1 = ℎ𝑥
• Objective function Source : S. S. Rao

Min. 𝐶 = ℎ𝑥
1st Semester of 2020-21 Academic year CE 771: Optimization in Civil Engineering (Online course) AvijitMaji© 9
Solution
Subject to:
I
J
≤ 𝑔K To satisfy the absolute gradient
LI
LJ
≤ 𝑔M To satisfy the rate of change of gradient
L LI
LJ LJ
≤ 𝑔N To satisfy the second derivative of slope
ℎOP JQR = 𝑎 Boundary condition at the start
ℎOP JQS = 𝑏 Boundary condition at the end

1st Semester of 2020-21 Academic year CE 771: Optimization in Civil Engineering (Online course) AvijitMaji© 10
Problem
About 80 m3 of grain is transported from
warehouse to a factory in an open
rectangular box of length 𝑥1 m, width 𝑥2 m,
and height 𝑥3 m. The bottom, sides, and
the ends of the box cost, Rs. 80, 10, and 20
per m2, respectively. It costs Rs. 1 for each
round trip of the box. Assuming that the
box will have no salvage value, find the
minimum cost to transport.

1st Semester of 2020-21 Academic year CE 771: Optimization in Civil Engineering (Online course) AvijitMaji© 11
Solution
• Let, 𝐿𝑒𝑛𝑔𝑡ℎ×𝑊𝑖𝑑𝑡ℎ×𝐻𝑒𝑖𝑔ℎ𝑡 = 𝑥<𝑥=𝑥> 𝑚>
• Consider the number of round trips = 𝑛
• Total grains to be transported = 80 𝑚3
• Cost for bottom surface = 80𝑥1𝑥2
• Cost for side surfaces = 2 10𝑥1𝑥3 = 20𝑥1𝑥3
• Cost for end surfaces = 2 20𝑥2𝑥3 = 40𝑥2𝑥3
• Total cost for n trips = 𝐶 = 80𝑥1𝑥2 + 20𝑥1𝑥3 + 40𝑥2𝑥3 + 𝑛

• Objective function: 𝑀𝑖𝑛. 𝐶 = 80𝑥1𝑥2 + 20𝑥1𝑥3 + 40𝑥2𝑥3 + 𝑛

• Subject to: 𝑛𝑥1𝑥2𝑥3 = 80
𝑥<, 𝑥=, 𝑥> > 0

1st Semester of 2020-21 Academic year CE 771: Optimization in Civil Engineering (Online course) AvijitMaji© 12
 Thank you

1st Semester of 2020-21 Academic year CE 771: Optimization in Civil Engineering (Online course) AvijitMaji© 13