Bahir Dar University

(BDU)

Bahir Dar Institute of Technology (BiT)

Faculty of Civil and Water Resource Engineering

Postgraduate Program in Structural Engineering

Structural Optimization
Assignment
Submitted By:

Mulualem Atalel

ID: BDU1022147

Submitted To:

Instructor Seyfe N.

Submission Date Sep 20, 2021 G.C

 STRUCTURAL OPTIMIZATION ASSIGNMENT

Part -1

1) What is Structural optimization?

The term structural optimization is commonly used for the optimization of engineering structures,
such as building, automobile, or airplane structures for improved strength or stiffness properties
and reduced weight or cost. It is the subject of making an assemblage of materials sustain loads in
the best way. In Structural optimization, the purpose is to find the optimal material distribution of
structures or structural components to achieve certain objectives according to some given demands
of a structure.

2) Write the general mathematical expression of optimization models.

3) What are the application areas of linear programming model in your field of specialization?
LP problems arise in some fields of engineering such as water resources, systems engineering,
traffic flow control, resources management, and transportation engineering. In the areas of
aerospace, automotive, structural, or mechanical system design, most problems are not linear.
Structural engineers use linear programming
 For reducing the environmental impacts of civil engineering structures, such as greenhouse
gas emission and energy consumption
 To minimizing the total cost of structures by reducing structure weight or volume.
 To find the minimum weight truss designs satisfying equilibrium
 To make decisions about the most efficient use of limited resources – like money, time,
materials, and machinery (cost estimation).
4) List the basic requirements for linear programming problem.
Basic requirements for Linear Programming Problem
a. Decision Variable and their Relationship
The decision variables refer to candidates that are completing with one another for sharing
the given limited resources. These variables are usually interrelated in terms of utilization of

Page | 2
 STRUCTURAL OPTIMIZATION ASSIGNMENT

resources and need simultaneous solutions. The relationship among these variables should
be linear.
b. Well-Defined Objective Function:
A linear programming problem must have a clearly- defined objective function to optimize
which may be either to maximize contribution by utilizing available resources, or it may be
to produce at the lowest possible cost by using a limited amount of productive factors. It
should be expressed as a linear function of decision variables.
c. Presence of Constraints or Restrictions
There must be limitations or constraints on the use of limited resources which are to be
allocated among various competitive activities. These constraints must be capable of being
expressed as linear equalities or inequalities in terms of decision variables. The solution of
on LP model satisfy these constraints.
d. Alternative Courses of Action
There must be alternative courses of action. For example, it must be possible to make a
selection between various combinations of the productive factors such as men, machines,
materials, market, etc.
e. Non-Negative Restriction:
All decision variables must assume non-negative values as negative values of physical
quantities is an impossible condition
5) Suppose we want to maximize the area of an object, but we have a choice between a square and a
circle, where the length of the square is equal to the radius of the circle, and the radius can be at
most 4 cm. Formulate this as an optimization problem.
Solution

Let As, Ac corresponds to the area of the square and circle. Let x be the length of the radius. Let
y1, y2 be a binary variable that is y1=1 if the object chosen is square or 0 otherwise.
Minimize: 𝑓(𝐴, 𝑥, 𝑦) = −𝐴1 − 𝐴2
Subjected to: 𝐴1 ≤ 𝑥 2

𝐴2 ≤ 𝛱𝑥 2

Page | 3
 STRUCTURAL OPTIMIZATION ASSIGNMENT

0<𝑥<4

𝐴𝑖 ≤ 1000𝑦𝑖 (1000 was chosen to arbitrarily range)

𝑦1 + 𝑦2 = 1

6) A 100 × 100-m lot is available to construct a multistory office building. At least 20,000 m2 of total
floor space is needed. According to a zoning ordinance, the maximum height of the building can
be only 21 m, and the parking area outside the building must be at least 25% of the total floor area.
It has been decided to fix the height of each story at 3.5 m. The cost of the building in millions of
dollars is estimated at 0.6h + 0.001A, where A is the cross-sectional area of the building per floor
and h is the height of the building. Formulate the minimum-cost design problem.
Solution
Given: The lot size, building floor space and parking area requirements, and the data given in
the problem statement.
Required: It is desired to find the building cross-sectional area and its height to meet all the
requirements and minimize cost of the building.
Procedure: We follow the five step process to formulate the problem as an optimization
problem.
Step 1: Project/Problem Statement
Shown above
Step 2: Data and Information Collection
Area of the lot =100×100 = 10,000 m2
Area available for parking = (10,000 – A), m2
ℎ
Total floor area = (number of floors) ×A = 3.5 𝐴, 𝑚2

Step 3: Definition of Design Variables

A = cross-sectional area of the building for each floor, m2
h = height of the building, m
Step 4: Optimization Criterion
Optimization criterion is to minimize cost, and the cost function is defined as
Cost = (0.6h + 0.001A), million dollars------------------------------------------ (a)
Step 5: Formulation of Constraints
Floor Space Constraint:

Page | 4
 STRUCTURAL OPTIMIZATION ASSIGNMENT

ℎ
𝐴 ≥ 20,000, 𝑚2 ------------------------------------------------------------------ (b)
3.5

Parking Constraint:
ℎ
(10,000 − 𝐴) ≥ 0.25 𝐴, 𝑚2 --------------------------------------------------- (c)
3.5

Explicit Design Variable Constraints:

ℎ ≥ 3.5, 𝑚 ------------------------------------------------------------------- (d)

ℎ ≤ 21, 𝑚 -------------------------------------------------------------------- (e)

𝐴 ≥ 0, 𝑚2 -------------------------------------------------------------------- (f)

𝐴 ≤ 10,000, 𝑚2 ------------------------------------------------------------- (g)

Final Formulation:
Find h and A to minimize the cost function of Eq. (a) subject to the constraints in Eqs. (b) to (g).
Note that for a meaningful design, h must be a multiple of 3.5.
Therefore the final Formulation is:
Cost = (0.6h + 0.001A),
ℎ
Subjected to: 𝐴 ≥ 20,000
3.5
ℎ
(10,000 − 𝐴) ≥ 0.25 𝐴
3.5

ℎ ≥ 3.5

ℎ ≤ 21
𝐴 ≥ 0
𝐴 ≤ 10,000

Page | 5
 STRUCTURAL OPTIMIZATION ASSIGNMENT

Part2- Linear Programming

1. An overhead crane (as shown on Figure -1) is used to transport concrete from a mix plant
to a casting site. Lifting yokes facilitate placing concrete and moving cured member. What
is the maximum concrete (W1 + W2 + W3) that can be carried in the three buckets at the
positions shown? Cable 1 and 2 each have 8KN capacity, cable 3 and 4 each have a 16KN
capacity, and each crane rail (5 and 6) can support 20KN.the crane and yokes are of
negligible weight. All dimensions of the beam length is given in centimeter.

Solution
Let 𝐹1, 𝐹2, … , 𝐹6 represents the force in cables 1,2,3,and 4 supports 5 and 6, respectively. For
equilibrium, we set the sums of the moments about each of the six support position equal to zero.
This yields
𝐹1 = 1⁄3 𝑊2 𝐹4 = 2⁄15 𝑊2 + 3⁄5 𝑊3

𝐹2 = 2⁄3 𝑊2 𝐹5 = 3⁄4 𝑊1 + 7⁄12 𝑊2 + 1⁄4 𝑊3

𝐹3 = 8⁄15 𝑊2 + 2⁄5 𝑊3 𝐹6 = 1⁄4 𝑊1 + 5⁄12 𝑊2 + 3⁄4 𝑊3

Hence the linear programming form:

Max: W’ = 𝑊1 + 𝑊2 + 𝑊3
Subjected to: 1⁄3 𝑊2 ≤ 8 2⁄ 𝑊 ≤ 8
3 2

Page | 6
 STRUCTURAL OPTIMIZATION ASSIGNMENT

8⁄ 𝑊 + 2⁄ 𝑊 ≤ 16 3⁄ 𝑊 + 7⁄ 𝑊 + 1⁄ 𝑊 ≤ 20
15 2 5 3 4 1 12 2 4 3
2⁄ 𝑊 + 3⁄ 𝑊 ≤ 16 1⁄ 𝑊 + 5⁄ 𝑊 + 3⁄ 𝑊 ≤ 20
15 2 5 3 4 1 12 2 4 3
𝑊1 , 𝑊2 , 𝑊3 ≥ 0

The second constraint clearly implies the first. Therefore the second can be omitted and the number
of constraints reduced to five.

Maximization of functions can be treated routinely. For example, if the objective is to maximize a
function, we simply minimize its negative. Therefore

Max: W’ = 𝑊1 + 𝑊2 + 𝑊3 →Minimize 𝑓 = −(𝑊1 + 𝑊2 + 𝑊3 )

Min: f= −𝑊1 −𝑊2 − 𝑊3

To solve this linear programming model using the Simplex method the following steps are necessary:

1. Express the linear programming problem in its standard form (Introducing slack variables).

Maximization model: W’ = −𝑊1 − 𝑊2 − 𝑊3 + 0𝑆1 + 0𝑆2 + 0𝑆3 + 0𝑆4 + 0𝑆5

Subjected to: 1⁄3 𝑊2 + 𝑆1 = 8 3⁄ 𝑊 + 7⁄ 𝑊 + 1⁄ 𝑊 + 𝑆4 = 20
4 1 12 2 4 3
8⁄ 𝑊 + 2⁄ 𝑊 + 𝑆2 = 16 1⁄ 𝑊 + 5⁄ 𝑊 + 3⁄ 𝑊 + 𝑆5 = 20
15 2 5 3 4 1 12 2 4 3
2⁄ 𝑊 + 3⁄ 𝑊 + 𝑆3 = 16
15 2 5 3
𝑊1 , 𝑊2 , 𝑊3 ≥ 0

Basic variables: S1 = 8 S2 = 16 S3 = 16 S4 = 20 S5 = 20
Non basic variables: W1 = W2 = W3 = 0

Function: f = 0 from the last row of the tableau after substituting for𝑊1 , 𝑊2 𝑎𝑛𝑑 𝑊3 .

2. Creating the tableau

Basic
variable W1 W2 W3 s1 s2 s3 s4 s5 RHS
s1 0 1/3 0 1 0 0 0 0 8
s2 0 8/15 2/5 0 1 0 0 0 16
s3 0 2/15 3/5 0 0 1 0 0 16
s4 3/4 7/12 1/4 0 0 0 1 0 20
s5 1/4 5/12 3/4 0 0 0 0 1 20
f -1 -1 -1 0 0 0 0 0 f

Page | 7
 STRUCTURAL OPTIMIZATION ASSIGNMENT

3. Identify Pivot Variable

Entering
1st Tabluea variabel
Basic
variable W1 W2 W3 s1 s2 s3 s4 s5 RHS ratio
min(Leaving
s1 0 1/3 0 1 0 0 0 0 8 24 variabel)
s2 0 8/15 2/5 0 1 0 0 0 16 30 40
s3 0 2/15 3/5 0 0 1 0 0 16 120 26.67
s4 3/4 7/12 1/4 0 0 0 1 0 20 26.67 34.29 80
s5 1/4 5/12 3/4 0 0 0 0 1 20 80.00 48 26.67
f -1 -1 -1 0 0 0 0 0 f

4. Creating the new tableau

Entering
2nd Tabluea variabel
Basic
variable W1 W2 W3 s1 s2 s3 s4 s5 RHS ratio
W2 0.00 1.00 0.00 3.00 0.00 0.00 0.00 0.00 24.00
min(Leaving
s2 0.00 0.00 0.40 -1.60 1.00 0.00 0.00 0.00 3.20 8 variabel)
s3 0.00 0.00 0.60 -0.40 0.00 1.00 0.00 0.00 12.80 21.33
s4 0.75 0.00 0.25 -1.75 0.00 0.00 1.00 0.00 6.00 8.00 24
s5 0.25 0.00 0.75 -1.25 0.00 0.00 0.00 1.00 10.00 40.00 13.33
f -1.00 0.00 -1.00 3.00 0.00 0.00 0.00 0.00 f +24

3rd Entering
Tabluea variabel
Basic
variable W1 W2 W3 s1 s2 s3 s4 s5 RHS ratio
W2 0.00 1.00 0.00 3.00 0.00 0.00 0.00 0.00 24.00
W3 0.00 0.00 1.00 -4.00 2.50 0.00 0.00 0.00 8.00
s3 0.00 0.00 0.00 2.00 -1.50 1.00 0.00 0.00 8.00
min(Leaving
s4 0.75 0.00 0.00 -0.75 -0.63 0.00 1.00 0.00 4.00 5.33 variable)
s5 0.25 0.00 0.00 1.75 -1.88 0.00 0.00 1.00 4.00 16
f -1.00 0.00 0.00 -1.00 2.50 0.00 0.00 0.00 f +32.0

Page | 8
 STRUCTURAL OPTIMIZATION ASSIGNMENT

Reduced cost coefficients in the non-basic columns are nonnegative; the tableau
4th Tabluea gives optimum solution.
Basic
variable W1 W2 W3 s1 s2 s3 s4 s5 RHS
W2 0.00 1.00 0.00 3.00 0.00 0.00 0.00 0.00 24.00
W3 0.00 0.00 1.00 -4.00 2.50 0.00 0.00 0.00 8.00
s3 0.00 0.00 0.00 2.00 -1.50 1.00 0.00 0.00 8.00
W1 1.00 0.00 0.00 -1.00 -0.83 0.00 1.33 0.00 5.33
s5 0.00 0.00 0.00 2.00 -1.67 0.00 -0.33 1.00 2.67
f 0.00 0.00 0.00 -2.00 1.67 0.00 1.33 0.00 f +37.33
The solution obtained after four iteration

Basic variable Non basic variable

W1 = 5.33 S1=0
W2 = 24.00 S2=0
W3 = 8.00 S4=0
S3 = 8.00 W’= W1 +W2 +W3
S5 = 2.67 37.33=5.33+24+8=37.33
0= f +37.33 f=-37.33→W’=37.33

2. A three member rigid frame is shown in the Figure -2. Determine plastic moment capacity of the
beam and column (Mpa and Mpc) for minimum total frame weight. Use limit analysis and assume a linear
relationship between the plastic moment and weight per unit length of the member.

Solution

In the plastic analysis of this frame, the relationship between external force and internal moment can
be obtained by considering the balance of external work W and internal energy U in each of the

Page | 9
 STRUCTURAL OPTIMIZATION ASSIGNMENT

deformed shape corresponding to the different collapse modes. The three possible collapse mechanism
are illustrated in the following figure where the plastic hinge are indicated at location of maximum
positive/ negative moments and the corresponding limiting value of W and V are given.

The (linearized) weight w appears in the objective function

Min: 𝑊 = 40𝑀𝑝𝑐 + 30𝑀𝑝𝑏

The figure 2.1 shows three collapse mechanism and the six corresponding linear inequalities
expressed in terms of the plastic moments in the column and beam. The mechanism constraints are
obtained using principle of virtual work. The virtual work W and the maximum internal energy U are
given in fig. 2.1.

Page | 10
 STRUCTURAL OPTIMIZATION ASSIGNMENT

Fig 2.1 Collapse modes for the three member rigid frame; (o) denotes a plastic-hinge location.

The virtual work W and the maximum internal energy U

From beam mechanism: 𝑈 ≥ 𝑊

2𝑀𝑝𝑏 𝜃 + 2𝑀𝑝𝑏 𝜃 = 30𝜃 2𝑀𝑝𝑏 𝜃 + 2𝑀𝑝𝑐 𝜃 ≥ 30𝜃

4𝑀𝑝𝑏 ≥ 30 2𝑀𝑝𝑏 + 2𝑀𝑝𝑐 ≥ 30

From sway mechanism:

2𝑀𝑝𝑏 𝜃 + 2𝑀𝑝𝑐 𝜃 = 20𝜃 2𝑀𝑝𝑐 𝜃 + 2𝑀𝑝𝑐 𝜃 ≥ 20𝜃

2𝑀𝑝𝑏 + 2𝑀𝑝𝑐 ≥ 20 4𝑀𝑝𝑐 ≥ 20

From combined mechanism:

4𝑀𝑝𝑏 𝜃 + 2𝑀𝑝𝑐 𝜃 = 50𝜃 2𝑀𝑝𝑏 𝜃 + 4𝑀𝑝𝑐 𝜃 ≥ 50𝜃

4𝑀𝑝𝑏 + 2𝑀𝑝𝑐 ≥ 50 2𝑀𝑝𝑏 + 4𝑀𝑝𝑐 ≥ 50

The problem is formulated as

Min: 𝑊 = 40𝑀𝑝𝑐 + 30𝑀𝑝𝑏 ---------------------------------------------------------------------- (a)

4𝑀𝑝𝑏 ≥ 30
Subjected to: } Beam mechanism
2𝑀𝑝𝑐 + 2𝑀𝑝𝑏 ≥ 30

2𝑀𝑝𝑐 + 2𝑀𝑝𝑏 ≥ 20
} Sway mechanism------------------- (b)
4𝑀𝑝𝑐 ≥ 20

2𝑀𝑝𝑐 + 4𝑀𝑝𝑏 ≥ 50
} Combined mechanism
4𝑀𝑝𝑐 + 2𝑀𝑝𝑏 ≥ 50

Page | 11
 STRUCTURAL OPTIMIZATION ASSIGNMENT

𝑀𝑝𝑐 𝑎𝑛𝑑 𝑀𝑝𝑏 ≥ 0 ------------------------------------------------------ (c)

To illustrate the duality theorem, we solve the dual of the above problem using simplex technique.
Since there are six primal constraints, there are six dual variables for the problem. Let y1, y2, y3, y4,
y5 and y6 be the dual variables associated with the six constraints.

The dual for the standard primal is defined as follows: Find the dual variables y1,y2,……ym to
minimize a dual objective functionn:
𝑚

𝑓𝑑 = 𝑒1 𝑦1 +. . . +𝑒𝑚 𝑦𝑚= ∑ 𝑒𝑖 𝑦𝑚 = 𝒆𝑻 𝒚
𝑖=1

Subjected to the constraints: 𝑎11 𝑦1 +. . . +𝑎𝑚1 𝑦𝑚 ≥ 𝑑1

… … … .. (𝑨𝑻 𝒚) ≥ 𝒅

𝑎1𝑛 𝑦1 +. . . +𝑎𝑚𝑛 𝑦𝑚 ≥ 𝑑𝑛

𝑦𝑖 ≥ 0: 𝑖 = 1 𝑡𝑜 𝑚

1. Express the linear programming problem in its standard form (Introducing slack variables).

Consider expression (a) and (c) as the primal problem, the dual problem can be formulated as

Max: 𝑧 = 30𝑦1 + 30𝑦2 + 20𝑦3 + 20𝑦4 + 50𝑦5 + 50𝑦6 + 0𝑠1 + 0𝑠2 ------------------------------- (a)

Subjected to: 2𝑦2 + 2𝑦3 + 4𝑦4 + 2𝑦5 + 4𝑦6 + 𝑠1 ≤ 40

4𝑦1 + 2𝑦2 + 2𝑦3 + 4𝑦5 + 2𝑦6 + 𝑠2 ≤ 30

𝑦𝑖 ≥ 0 𝑖 = 1,2, … … ,6

Slack variables 𝑠1 and 𝑠2 are added to inequation to obtain a canonical form. The resulting simplex
tableaus are shown in tabel below.

2. Creating the tableau

Basic
variable y1 y2 y3 y4 y5 y6 s1 s2 z RHS
s1 0 2 2 4 2 4 1 0 0 40
s2 4 2 2 0 4 2 0 1 0 30
z -30 -30 -20 -20 -50 -50 0 0 1 0

Page | 12
 STRUCTURAL OPTIMIZATION ASSIGNMENT

3. Identify Pivot Variable

Entering
1st Tabluea variabel
Basic
variable y1 y2 y3 y4 y5 y6 s1 s2 z RHS ratio
s1 0 2 2 4 2 4 1 0 0 40 20 10
s2 4 2 2 0 4 2 0 1 0 30 7.5 15 min(Leaving variable)
z -30 -30 -20 -20 -50 -50 0 0 1 0

4. Creating the new tableau

2nd Entering
Tabluea variabel
Basic
variable y1 y2 y3 y4 y5 y6 s1 s2 z RHS ratio
min(Leaving
s1 -2 1 1 4 0 3 1 -0.5 0 25 8.33 variable)
y5 1 0.5 0.5 0 1 0.5 0 0.25 0 7.5 15
z 20 -5 5 -20 0 -25 0 12.5 1 375

3rd Tabluea
Basic
variable y1 y2 y3 y4 y5 y6 s1 s2 z RHS
y6 -0.667 0.333 0.333 1.333 0 1 0.333 -0.167 0 8.333
y5 1.333 0.333 0.333 -0.667 1 0 -0.167 0.333 0 3.333
z 3.333 3.333 13.33 13.333 0 0 8.333 8.333 1 583.33

The solution obtained at the second itration is

𝑦1 = 𝑦2 = 𝑦3 = 𝑦4 = 0

𝑦5 = 3.333 𝑦6 = 8.333 z = 583.33

The solution to the primal problem can be obtained directly from the cost coefficients in the last
tableau, i.e., corresponding to the slack variables s7 and s8, Mpc=8.333 and Mpb=8.333. Alternatively,
corresponding to the basic dual variables 𝑦5 𝑎𝑛𝑑 𝑦6 , we must have equalities in the primal constraints,
that is, 2𝑀𝑝𝑐 + 4𝑀𝑝𝑏 = 50 and 4𝑀𝑝𝑐 + 2𝑀𝑝𝑏 = 50. Solving this set of equation simultaneously
yields the optimal solution.

Page | 13
 STRUCTURAL OPTIMIZATION ASSIGNMENT

Part-3. Nonlinear Programming

1. Find the absolute maximum and minimum values of the function f (x, y)  y2  x2 over
the region given by x2  y2  4 (Hint: Use Lagrange multipliers).

Solution

Solve equations ∇𝑓 = 𝜆∇g and g(x, y)= 4 Constraints g(x, y) = x 2  y 2  4

Using Lagrange multipliers

f𝑥 = 𝜆g 𝑥 f𝑦 = 𝜆g 𝑦 g(x, y)= 4

Which becomes

−2𝑥 =2𝑥𝜆 … … … … … … … … … … … … … … … … (𝑎)

2𝑦 =2𝑦𝜆 … … … … … … … … … … … . . … … … … … (𝑏)

x 2  y 2  4… … … … … … … … … … … … . … … … … (𝑐)

From (𝑎) we have 𝑥 = 0, 𝑜𝑟 𝜆 = −1. if 𝑥 = 0, then (𝑐) gives 𝑦 = ±2. If 𝜆 = −1 then 𝑦 = 0

from(𝑏), so then (𝑐) gives 𝑥 = ±2. Therefore f has possible extreme values at the
point(0,2), (0, −2), (2,0), (−2,0).

𝑓(0,2) = 4 𝑓(2,0) = −4

𝑓(0, −2) = 4 𝑓(−2,0) = −4

Therefore the maximum value of f on the circle x 2  y 2  4 is 𝑓(0, ±2) = 4 and the minimum
value is 𝑓(±2,0) = −4

2. Find the maximum area of a rectangle with sides measuring x and y if the perimeter is 14
units. Is there a minimum value of the area?

Solution

The perimeter is 14: g(x, y) = 2𝑥 + 2𝑦  14

The area is the product of the sides: 𝐴 = (𝑓𝑥, 𝑦) = 𝑥𝑦

Solve equations using Lagrange multipliers

∇𝑓 = 𝜆∇g and g(x, y)= 14

Page | 14
 STRUCTURAL OPTIMIZATION ASSIGNMENT

Constraints g(x, y) = 2𝑥 + 2𝑦  14

f𝑥 = 𝜆g 𝑥 f𝑦 = 𝜆g 𝑦 g(x, y)= 14

Which becomes

𝑦 =2𝜆 … … … … … … … … … … … … … … … … (𝑎)

𝑥 =2𝜆 … … … … … … … … … … … . . … … … … … (𝑏)

2𝑥 + 2𝑦  14… … … … … … … … … … … … . … … … … (𝑐)
14
From (𝑎) we have 𝑦 = 2 𝜆 and from(𝑏), 𝑥 =2𝜆 so then (𝑐) gives 4𝜆+4𝜆  14. , 𝜆 = ,𝑥 =
8
7 7 7
𝑦 = 2 Therefore f has possible extreme values at the point(2 , 2)

7 7 49
𝐴 = 𝑓( , ) =
2 2 4

If one of the sides is zero, the area is zero, and areas generally can’t get smaller than that. If we
allow negative sides and signed area there’s is no minimum.

3. A cylindrical can is to be designed with a capacity of holding 475cm3 of fluid. What are the
dimensions of the can that would require the least amount of material?
Solution
Let height = h and radius of the base = r. Then, the volume of the tank (𝜋𝑟 2 ℎ) is required to be V.
Therefore, volume 𝑉 = 𝜋𝑟2 ℎ = 475 and surface area of the can A = 2𝜋𝑟2 + 2𝜋𝑟ℎ
Therefore, the cost function for the problem is given as
𝑓 = 𝑐(2𝜋𝑟 2 + 2𝜋𝑟ℎ)

Solve equations using Lagrange multipliers

Constraints g(h, r)= 𝜋𝑟2 ℎ = 475 ∇𝑓 = 𝜆∇g and g(h, r)= 475
2𝜋𝑟 =𝜆𝜋𝑟^2 … … … … … … … … … … … … … … (𝑎)
4𝜋𝑟 + 2𝜋ℎ =𝜆2𝜋𝑟ℎ… … … … … … … … … . … … . (𝑏)
𝜋𝑟^2 ℎ = 475 … … … … … … … … … … … … … … . (𝑐)
16𝜋
From (𝑎) 𝑟 = 2/𝜆 and substituting this in to (𝑏) ℎ = 4/𝜆. And from (𝑐)𝜆3 = 475 , 𝜆 = 0.4729
2 4
𝑟 = = 4.229𝑐𝑚 ℎ = = 8.458𝑐𝑚
𝜆 𝜆

Page | 15
 STRUCTURAL OPTIMIZATION ASSIGNMENT

The can with volume 475 cm3 that has the smallest surface area is 4.23 cm in radius and 8.46 cm
in height. The surface area of the can is 337 cm2. (In general, a cylinder where diameter = height
has the smallest surface area given constant volume.)
4. Maximize f(x)  12x  3x4  2x6 using Newton-Raphson technique with error margin of
0.0001.
Solution

A numerical method for solving of optimization of a nonlinear function and using Newton-Raphson
technique to maximize the function.

𝑓 ′ ( 𝑥𝑖 )
𝑥𝑖+1 = 𝑥𝑖 −
𝑓′′ (𝑥𝑖 )

𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑓(𝑥) = 𝑚𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑧(𝑥) = −𝑚𝑖𝑛𝑖𝑚𝑖𝑧𝑒(−𝑓(𝑥))

𝑧(𝑥) = −𝑓(𝑥) = −12𝑥 + 3𝑥4 + 2𝑥6

Minimize: 𝑧(𝑥) = −𝑓(𝑥) = −12𝑥 + 3𝑥4 + 2𝑥6
𝑧′(𝑥) = −12 + 12𝑥3 + 12𝑥5

i x f'(x) f''(x) f(x) error check

1 10 1211988 603600 2029880 1 not OK
2 7.992068 397384.14 247086.148 533320 2.007932 not OK
3 6.383786 130334.98 101114.159 140268.71 1.608282 not OK
4 5.094797 42767.228 41360.2803 36937.877 1.288988 not OK
5 4.060781 14041.94 16908.7227 9734.8499 1.034017 not OK
6 3.230325 4613.4731 6909.01429 2560.4223 0.830455 not OK
7 2.562578 1516.0069 2823.78245 664.97821 0.667747 not OK
8 2.025707 497.07121 1158.04335 164.40168 0.536871 not OK
9 1.596474 161.27628 481.51501 33.443498 0.429234 not OK
10 1.261538 50.435336 209.261625 0.5217743 0.334935 not OK
11 1.020523 14.03704 102.571972 -6.733055 0.241016 not OK
12 0.883672 2.7464833 64.6976267 -7.822455 0.136851 not OK
13 0.841221 0.1986342 55.5218545 -7.883589 0.042451 not OK
14 0.837643 0.0012975 54.7977493 -7.883946 0.003578 not OK
15 0.837620 5.644E-08 54.7929816 -7.883946 2.37E-05 OK

∴The maximum value f(x) is 7.8839 at xi=0.8376

Page | 16
 STRUCTURAL OPTIMIZATION ASSIGNMENT

5. Find the location of the maximum of f(x)  x5  x on [0, 20] to within error margin of
1% using Golden section search technique.
Solution

Iteration 1:
Given the values for the boundaries of 𝑥𝑙 = 0 and 𝑥𝑢 = 20 and 1% error.
Step 1: Determine two intermediate points x1 and x2
𝑥1 = 𝑥𝑙 + 0.618(𝑥𝑢 − 𝑥𝑙 ) = 0 + 0.618 ∗ (20 − 0) = 12.360
𝑥2 = 𝑥𝑢 − 0.618(𝑥𝑢 − 𝑥𝑙 ) = 20 − 0.618 ∗ (20 − 0) = 7.640
Step 2: Evaluate f(x1) and f(x2).

𝑓(𝑥1 ) = 12.360 (5𝜋 − 12.3607) = 41.381

𝑓(𝑥2 ) = 7.640 (5𝜋 − 7.6393) = 61.639
xu − xl < ε, 20 − 0 = 20 < 0.01 − − − not ok (go to iteration 2)
The summary results of all the iterations are shown in the table below.

i xl xu x1 x2 f(xl) f(xu) f(x1) f(x2) error

1 0 20 12.36 7.64 0 -85.841 41.381 61.6392 1 not ok
2 7.64 20 15.278 12.362 61.639 -85.841 6.5619 41.3671 12.36 not ok
3 12.362 20 17.082 15.279 41.367 -85.841 -23.473 6.5479 7.63848 not ok
4 15.279 20 18.197 17.083 6.5479 -85.841 -45.288 -23.484 4.720581 not ok
5 17.083 20 18.886 18.197 -23.48 -85.841 -60.011 -45.295 2.917319 not ok
6 18.197 20 19.311 18.886 -45.3 -85.841 -69.585 -60.016 1.802903 not ok
7 18.886 20 19.574 19.311 -60.02 -85.841 -75.683 -69.588 1.114194 not ok
8 19.311 20 19.737 19.574 -69.59 -85.841 -79.52 -75.685 0.688572 not ok
9 19.574 20 19.837 19.737 -75.68 -85.841 -81.918 -79.522 0.425537 not ok
10 19.737 20 19.9 19.837 -79.52 -85.841 -83.41 -81.919 0.262982 not ok
11 19.837 20 19.938 19.9 -81.92 -85.841 -84.336 -83.411 0.162523 not ok
12 19.9 20 19.962 19.938 -83.41 -85.841 -84.91 -84.337 0.100439 not ok
13 19.938 20 19.976 19.962 -84.34 -85.841 -85.265 -84.91 0.062071 not ok
14 19.962 20 19.985 19.976 -84.91 -85.841 -85.485 -85.265 0.03836 not ok
15 19.976 20 19.991 19.985 -85.27 -85.841 -85.621 -85.485 0.023707 not ok
16 19.985 20 19.994 19.991 -85.49 -85.841 -85.705 -85.621 0.014651 not ok
17 19.991 20 19.997 19.994 -85.62 -85.841 -85.757 -85.705 0.009054 ok

After seventeen iterations involving 17-observations, the interval of uncertainty is

[19.991, 20], so that the maximum point is 19.9955. 𝒇 (19.9955) = 19.9955 (5𝜋 − 19.9955) =
−85.8907

Page | 17
 STRUCTURAL OPTIMIZATION ASSIGNMENT

6. A minimum weight tubular column design problem is formulated in chapter one using
mean radius R and thickness t as design variables. Solve the KKT conditions for the
problem imposing an additional constraint R/t ≤ 50 for this data: P = 50kN, l = 5.0m,
E = 210GPa, σa = 250MPa and ρ = 7850kg/m3. Interpret the necessary conditions at
the solution point graphically.
Solution
In chapter one using mean radius R and thickness t as design variables a minimum weight tubular
column design problem is formulated. There is an additional constraint R/t ≤ 50 is given. Therefore
from chapter one we have the following formulations with constraints.

𝑀𝑎𝑠𝑠 = 𝜌𝑙𝐴 = 2𝜌𝑙𝜋𝑅𝑡

𝑃
Subjected to: ≤ 𝜎𝑎
2𝜋𝑅𝑡
𝜋 3 𝐸𝑅 3 𝑡
𝑃 ≤ 4𝑙2

𝑅/𝑡 ≤ 50

tmin ≤ t ≤ tmax

𝑀𝑎𝑠𝑠 = 0.2466𝑅𝑡
Subjected to: 7.9577/𝑅𝑡 ≤ 0.25

767893.7 ≤ 𝑅 3 𝑡
𝑅/𝑡 ≤ 50
Rmin ≤ R ≤ Rmax
tmin ≤ t ≤ tmax

𝑔1 = 1/𝑅𝑡 − 0.0314 ≤ 0
𝑔2 = 767893.7 – 𝑅 3 𝑡 ≤ 0
𝑔3 = 𝑅/𝑡 − 50 ≤ 0
1 𝑅
𝐿 = 0.2466𝑅𝑡 +𝜆1 (𝑅𝑡 – 0.0314 + 𝑠12 ) +𝜆2(767893.7– 𝑅 3 𝑡 + 𝑠22 ) +𝜆3 ( 𝑡 – 50 + 𝑠32 ) . . (a)

dL/dR = 0.2466t −𝜆1/R2 t − 3𝜆2R2 t +𝜆3/t ………………………………… (b)

Page | 18
 STRUCTURAL OPTIMIZATION ASSIGNMENT

dL/dt = 0.2466R − u1/Rt 2 − λ2R3 − λ3R/t 2 ………………………………… (c)

dL/dλ1 = 1/Rt– 0.0314 + s12 = 0……………………………………………… (d)
dL/dλ2 = 767893.7 – R3 t + s22 = 0…………………………………………… (e)
dL/dλ3 = R/t – 50 + s32 = 0…………………………………………………… (f)
λ1s1 ≥ 0; λ2s2 ≥ 0; λ3s3 ≥ 0………………………………………………… (g)
λ1 ≥ 0; λ2 ≥ 0; λ3 ≥ 0……………………………………………………… (h)
The switching condition in eqn (g) gives the following different cases for the solution to the KKT
condition.

Case 1:-
𝜆1 = 0, 𝑠2 = 0, 𝑠3 = 0, g1 is in active; g2 and g3 are active.
From the above equations 𝑅 = 50𝑡 and
767893.7 1/4
767893.7 = 503 𝑡 4 ; 𝑡 = ( ) = 𝟏. 𝟓𝟕𝒎𝒎
503

𝑅 = 50𝑡 = 50 ∗ 1.57 = 𝟕𝟖. 𝟕𝟐𝒎𝒎

From eqn (d); 1/𝑅𝑡– 0.0314 + 𝑠12 = 0, 𝑠1 = 0.0314 − 1/1.57 ∗ 78.72 = 0.153 > 0……ok!
From eqn (b); 0.2466𝑡 − 𝜆1/𝑅 2 𝑡 − 3𝜆2𝑅 2 𝑡 + 𝜆3/𝑡
From eqn (c); 0.2466𝑅 − 𝜆1/𝑅𝑡 2 − 𝜆2𝑅 3 − 𝜆3𝑅/𝑡 2
By substituting the values of R and t and solving simultaneously gives that;
0.2466 ∗ 1.57 − 𝜆1/78.722 ∗ 1.57 − 3𝜆2 ∗ 78.722 ∗ 1.57 + 𝜆3/1.57
0.2466 ∗ 78.72 − 𝜆1/78.72 ∗ 1.572 − 𝜆2 ∗ 78.722 − 𝜆3 ∗ 78.7/1.572
0.387 − 29172.28𝜆2 + 0.637𝜆3 = 0
19.4 − 487443.4𝜆2 − 31.93𝜆3 = 0
𝜆2 = 𝟑. 𝟎𝟓𝟔 ∗ 𝟏𝟎−𝟒 > 0 𝑎𝑛𝑑 𝜆3 = 𝟎. 𝟑𝟎𝟑𝟖 > 0;
𝐹 ∗ = 𝑀𝑎𝑠𝑠 = 0.246615𝑅𝑡 = 𝟑𝟎. 𝟓𝟔𝒌𝒈
Thus the KKT condition is satisfied. And these are the candidate minimum points.
Checking the sufficient condition
𝑑2𝐿
= 2𝜆1/𝑅 3 𝑡 − 6𝜆2𝑅𝑡 = −6𝜆2𝑅𝑡 = −0.2266
𝑑𝑅 2

Page | 19
 STRUCTURAL OPTIMIZATION ASSIGNMENT

𝑑 2 𝐿 2𝜆1
= + 2𝜆3𝑅/𝑡 3 = 2𝜆3𝑅/𝑡 3 = 12.356
𝑑𝑡 2 𝑅𝑡 3
𝑑2𝐿
= 0.2466 − 2𝜆1𝑅 2 − 3𝜆2𝑅 2 − 𝜆3/𝑡 2 = −5.555
𝑑𝑅𝑑𝑡
The sufficient condition for the minimum is not satisfied
Case 2
𝑆1 = 0; 𝜆2 = 0; 𝑠3 = 0
From 𝑅 = 50𝑡; 1/50𝑡 2 = 0.0314
𝑡 = 0.8𝑚𝑚
𝑅 = 39.9𝑚𝑚
From eqn (e); 767893.7 – 39.93 ∗ 0.8 + 𝑠22 = 0; 𝑠22 = −717255 < 0
The KKT condition is not satisfied. So this can’t be the candidate for minimum point.
Case 3; 𝑠1 = 0; 𝑠2 = 0; 𝜆3 = 0;
From eqn (d); 1/𝑅𝑡– 0.0314 and from eqn (e); 767893.7 – 𝑅 3 𝑡
𝑅 = 155.32𝑚𝑚 𝑎𝑛𝑑 𝑡 = 0.2𝑚𝑚.
𝑅/𝑡 – 50 + 𝑠32 = 0; 𝑠32 = 50 − 155.32/0.2 = −707.88 < 0
The KKT condition is not satisfied. So this can’t be the candidate for minimum point.

The minimum point is (2.5, 125), 𝑓(2.5, 125) = 77.0625𝑘𝑔

Page | 20
 STRUCTURAL OPTIMIZATION ASSIGNMENT

7. Using secant and Newton-raphson method find the root of the following equations. Start from a
reasonable initial point.
a) 𝑓(𝑥) = 𝑎𝑥 6 − 𝑏𝑥 5 − 𝑐𝑥 3 + 𝑑𝑥 + 𝑒
b) 𝑓(𝑥) = 𝑔 sin(𝑥) + ℎ𝑥 4

For the constants a, b, c, d, e, g and h please refer the table below

a b c d e g h
0.3 3.9 2.2 2.1 40 0.9 0.16
Therefore,

a) 𝑓(𝑥) = 0.3𝑥 6 − 3.9𝑥 5 − 2.2𝑥 3 + 2.1𝑥 + 40

b) 𝑓(𝑥) = 0.9 sin(𝑥) + 0.16𝑥 4

Solution

A) Secant Method
a) 𝑓(𝑥) = 0.3𝑥 6 − 3.9𝑥 5 − 2.2𝑥 3 + 2.1𝑥 + 40

Calculate the next estimate of the root from two initial guesses

𝑓(𝑥𝑖 )
𝑥𝑖+1 = 𝑥𝑖 − (𝑥 − 𝑥𝑖−1 )
𝑓(𝑥𝑖 ) − 𝑓(𝑥𝑖−1 ) 𝑖

Find the absolute relative approximate error

Let us assume the initial guesses of the root of f (x) = 0 as

𝑥−1 = 2 𝑎𝑛𝑑 𝑥0 = 3

Iteration 1:- Assume the pre-specified relative error tolerance (e =0.0001)

The estimate of the root is

𝑓(𝑥0 )
𝑥1 = 𝑥0 − (𝑥 − 𝑥−1 )
𝑓(𝑥0 ) − 𝑓(𝑥−1 ) 0
𝑓(𝑥𝑖 ) = 𝑓(3) = 0.3 ∗ 36 − 3.9 ∗ 35 − 2.2 ∗ 33 + 2.1 ∗ 3 + 40 = −702.5
𝑓(𝑥𝑖−1 ) = 𝑓(2) = 0.3 ∗ 36 − 3.9 ∗ 35 − 2.2 ∗ 33 + 2.1 ∗ 3 + 40 = −70.20

−702.5
𝑥1 = 3 − (3 − 2 ) = 1.8889
−702.5 + 70.20
|𝑒 | = |1.8889 – 3| = 1.111 > 0.0001 Not ok

Page | 21
 STRUCTURAL OPTIMIZATION ASSIGNMENT

Iteration 2:- Summarized in the table below

i xi-1 xi f(xi-1) f(xi) error check

1 2 3 -70.2 -702.5 1 not OK
2 3 1.888977 -702.5 -44.0526 1.111023 not OK
3 1.888977 1.814645 -44.0526 -29.4619 0.074332 not OK
4 1.814645 1.664553 -29.4619 -6.05585 0.150092 not OK
5 1.664553 1.625719 -6.05585 -1.15063 0.038833 not OK
6 1.625719 1.61661 -1.15063 -0.06143 0.009109 not OK
7 1.61661 1.616096 -0.06143 -0.00068 0.000514 not OK
8 1.616096 1.616091 -0.00068 -4E-07 5.72E-06 OK
Therefore the root of the function is 1.6161

b) 𝑓 (𝑥) = 0.9 sin(𝑥) + 0.16𝑥 4

Let us assume the initial guesses of the root of f (x) = 0 as 𝑥−1 = 8 𝑎𝑛𝑑 𝑥0 = 3

Iteration 1:- Assume the pre-specified relative error tolerance (e =0.0001)

The estimate of the root is

𝑓(𝑥0 )
𝑥1 = 𝑥0 − (𝑥 − 𝑥−1 )
𝑓(𝑥0 ) − 𝑓(𝑥−1 ) 0
𝑓(𝑥𝑖 ) = 0.9 sin(𝑥) + 0.16𝑥 4
𝑓(𝑥𝑖 ) = 𝑓(3) = 0.9 sin(3) + 0.64(3)4 = 13.08701
𝑓(𝑥−1 ) = 𝑓(8) = 0.9 sin(8) + 0.64(8)4 = 656.2504

13.08701
𝑥1 = 3 − (3 − 8 ) = 2.8982
13.08701 − 656.2504
|𝑒 | = |2.8982 – 3| = 0.10174 > 0.0001 Not ok

Iteration 2:- Summarized in the table below

i xi-1 xi f(xi-1) f(xi) error check

1 8 3 656.2504 13.08701 1 not OK
2 3 2.898261 13.08701 11.50621 0.101739 not OK
3 2.898261 2.157724 11.50621 4.217578 0.740536 not OK
4 2.157724 1.729212 4.217578 2.319313 0.428512 not OK
5 1.729212 1.205653 2.319313 1.178737 0.523559 not OK
6 1.205653 0.664576 1.178737 0.586264 0.541076 not OK
7 0.664576 0.129171 0.586264 0.115976 0.535405 not OK
8 0.129171 -0.00286 0.115976 -0.00258 0.132034 not OK
9 -0.00286 6.72E-06 -0.00258 6.05E-06 0.002869 not OK
10 6.72E-06 -9.2E-12 6.05E-06 -8.3E-12 6.72E-06 OK
Therefore the root of the function is almost 0

Page | 22
 STRUCTURAL OPTIMIZATION ASSIGNMENT

B) Newton-Raphson Method
a) 𝑓(𝑥) = 0.3𝑥 6 − 3.9𝑥 5 − 2.2𝑥 3 + 2.1𝑥 + 40
𝑓 ′ (𝑥) = 1.8𝑥 5 − 19.5𝑥 4 − 6.6𝑥 2 + 2.1
𝑓(1) = 0.3(1)6 − 3.9(1)5 − 2.2(13)3 + 2.1 ∗ 1 + 40 = 36.3(+𝑣𝑒)
𝑓(2) = 0.3(2)6 − 3.9(2)5 − 2.2(2)3 + 2.1 ∗ 2 + 40 = −70.2(−𝑣𝑒)
So the root lies in between (1,2)

Iteration 1:- Assume the pre-specified relative error tolerance (e =0.0001) and the initial guesses of
the root of f (x) = 0 as x0 =1

𝑓(𝑥) = 0.3𝑥 6 − 3.9𝑥 5 − 2.2𝑥 3 + 2.1𝑥 + 40

𝑓(1) = 0.3(1)6 − 3.9(1)5 − 2.2(13)3 + 2.1 ∗ 1 + 40 = 36.3
𝑓 ′ (13) = 1.8(1)5 − 19.5(1)4 − 6.6(1)2 + 2.1 = −22.2
𝑓(𝑥𝑖 )
𝑥𝑖+1 = 𝑥𝑖 −
𝑓 ′ (𝑥𝑖 )
36.3
𝑥1 = 1 − = 2.635
−22.2
|𝑒 | = |2.635– 1| = 1.635 > 0.0001 Not ok

Iteration 2:- Summarized in the table below

i x f'(x) f(x) error check

1 -22.2 36.3 1 not OK
1
2.63514 -755.2752 -364.836 1.63514 not OK
2
2.15208 -363.6586 -115.903 0.48305 not OK
3
1.83337 -203.1115 -32.9346 0.31871 not OK
4
1.67122 -144.9821 -6.94225 0.16215 not OK
5
1.62334 -130.4171 -0.86373 0.04788 not OK
6
1.61672 -128.4897 -0.0739 0.00662 not OK
7
1.61614 -128.3232 -0.00588 0.00058 not OK
8
1.61609 -128.31 -0.00046 4.6E-05 OK
9

Therefore the root of the function is 1.6161

Page | 23
 STRUCTURAL OPTIMIZATION ASSIGNMENT

a) 𝑓(𝑥) = 0.9 sin(𝑥) + 0.16𝑥 4

Iteration 1:- Assume the pre-specified relative error tolerance (e =0.0001) and since
function has no negative value let the initial guesses of the root of f (x) = 0 as x0 =1
𝑓(1) = 0.9 sin(1) + 0.16 ∗ 14 = 0.91732
𝑓 ′ (𝑥𝑖 ) = 0.9 cos(𝑥) + 0.64𝑥 3
𝑓 ′ (1) = 0.9 cos(1) + 0.64(1)3 = 1.12627
0.91732
𝑥1 = 1 − = 0.18552
1.12627
|𝑒 | = |0.18552 – 1| = 0.81448 > 0.0001 Not ok

Iteration 2:- Summarized in the table below

i x f'(x) f(x) error check

1 1 1.1262721 0.917324 1 not OK
2 0.18552 0.8886427 0.166203 0.81448 not OK
3 -0.0015 0.899999 -0.00136 0.18703 not OK
4 1.1E-09 0.9 1.03E-09 0.00151 not OK
5 0 0.9 0 1.1E-09 OK
Therefore the root of the function is 0

8. Using the steepest–descent method find the roots of the following function. Start from a
reasonable initial point
a) 𝑓(𝑥1 , 𝑥2 ) = 𝑎𝑥1 − 𝑏𝑥2 + 𝑐𝑥1 2 + 𝑑𝑥1 𝑥2 + 𝑒𝑥2 2
b) 𝑓(𝑥1 , 𝑥2 ) = 𝑔𝑥1 2 + ℎ𝑥2 2 − 𝑘

For the constants a, b, c, d, e, g and h please refer the table below

a b c d e g h k
1 1.1 1.2 1.1 0.9 0.9 0.9 100

Therefore,

a) 𝑓(𝑥1 , 𝑥2 ) = 𝑥1 − 1.1𝑥2 + 1.2𝑥1 2 + 1.1𝑥1 𝑥2 + 0.9𝑥2 2

b) 𝑓(𝑥1 , 𝑥2 ) = 0.9𝑥1 2 + 0.9𝑥2 2 − 100

Page | 24
 STRUCTURAL OPTIMIZATION ASSIGNMENT

Solution

a) 𝒇(𝒙𝟏 , 𝒙𝟐 ) = 𝒙𝟏 − 𝟏. 𝟏𝒙𝟐 + 𝟏. 𝟐𝒙𝟏 𝟐 + 𝟏. 𝟏𝒙𝟏 𝒙𝟐 + 𝟎. 𝟗𝒙𝟐 𝟐

Let’s start with initial point (1,0)

𝜕𝑓
𝜕𝑥1 1 + 2.4𝑥1 + 1.1𝑥2
𝑮𝒓𝒂𝒅𝒊𝒆𝒏𝒕 of 𝑓 is ∇𝑓(𝑥1 , 𝑥2 ) = ∇𝑓 = =[ ]
𝜕𝑓 −1.1 + 1.1𝑥1 + 1.8𝑥2
[𝜕𝑥2 ]
3.4
∇𝑓(1,0) =[ ]
0
𝜕2𝑓 𝜕2𝑓
𝜕𝑥1 2 𝜕𝑥1 𝜕𝑥2 2.4 1.1
𝑯𝒆𝒔𝒔𝒊𝒂𝒏 𝑴𝒂𝒕𝒓𝒊𝒙 𝑖𝑠 𝐻 = =[ ]
𝜕2𝑓 𝜕2𝑓 1.1 1.8
[𝜕𝑥2 𝜕𝑥1 𝜕𝑥2 2 ]
1. Direction of search
3.4 −3.4
𝑑𝑘 = −∇𝑓 = − [ ]=[ ]
0 0
2. Determine the optimal step length α in the direction of 𝒅𝒊
−3.4
𝒅𝟎 𝑻 𝒅𝟎 [−3.4 0] [ ] 11.560
α= = 0 = = 0.4167
𝒅𝟎 𝑻 𝑯𝒅𝟎 2.4 1.1 −3.4
[−3.4 0] [ ][ ] 27.744
1.1 1.8 0
3. Check the optimum

Hence, the new point is

1 −3.4 −0.4167
𝑥1 = 𝑥0 + 𝛼𝑑0 = [ ] + 0.4167 [ ]=[ ]
0 0 0

1 + 2.4𝑥1 + 1.1𝑥2 1 + 2.4 ∗ (−0.4167) + 1.1 ∗ 0 0

∇f(𝑥1 ) = [ ]=[ ]=[ ]
−1.1 + 1.1𝑥1 + 1.8𝑥2 −1.1 + 1.1 ∗ (−0.4167) + 1.8 ∗ 0 −1.5584
0
≠ [ ] − − − 𝑿𝟏 𝒊𝒔 𝒏𝒐𝒕 𝒐𝒑𝒕𝒊𝒎𝒖𝒎
0

So move next iteration.

Iteration 2

1. Direction of search
0 0
𝑑2 = −∇𝑓 = − [ ]=[ ]
−1.5584 1.5584
2. Step length α in the direction of 𝒅𝟏

Page | 25
 STRUCTURAL OPTIMIZATION ASSIGNMENT

0
𝒅𝟏 𝑻 𝒅𝟏 [0 1.5584] [ ] 2.4286
α= = 1.5584 = = 0.5556
𝒅𝟏 𝑻 𝑯𝒅𝟏 2.4 1.1 0
[0 1.5584] [ ][ ] 4.3715
1.1 1.8 1.5584

Hence, the new point is

−0.4167 0 −0.4167
𝑥2 = 𝑥1 + 𝛼𝑑1 = [ ] + 0.5556 [ ]=[ ]
0 1.5584 0.8658

3. Check the optimum

1 + 2.4𝑥1 + 1.1𝑥2 1 + 2.4 ∗ (−0.4167) + 1.1 ∗ 0.8658 0.9524
∇f(𝑥2 ) = [ ]=[ ]=[ ]
−1.1 + 1.1𝑥1 + 1.8𝑥2 −1.1 + 1.1 ∗ (−0.4167) + 1.8 ∗ 0.8658 0
0
≠ [ ] − − − 𝑿𝟐 𝒊𝒔 𝒏𝒐𝒕 𝒐𝒑𝒕𝒊𝒎𝒖𝒎
0

So move next iteration.

Iteration 3

1. Direction of search
0.9524 −0.9524
𝑑2 = −∇𝑓 = − [ ]=[ ]
0 0
2. Step length α in the direction of 𝒅𝟏
−0.9524
𝒅𝟐 𝑻 𝒅𝟐 [−0.9524 0] [ ] 0.8538
α= = 0 = = 0.4167
𝒅𝟐 𝑻 𝑯𝒅𝟐 1.8 0 −0.9524 2.0491
[−0.9524 0] [ ][ ]
0 1.8 0

Hence, the new point is

−0.4167 −0.9524 −0.8017
𝑥3 = 𝑥2 + 𝛼𝑑2 = [ ] + 0.4167 [ ]=[ ]
0.8658 0 0.8658

3. Check the optimum

1 + 2.4𝑥1 + 1.1𝑥2 1 + 2.4 ∗ (−0.8017) + 1.1 ∗ 0.8658 0.0283
∇f(𝑥3 ) = [ ]=[ ]=[ ]
−1.1 + 1.1𝑥1 + 1.8𝑥2 −1.1 + 1.1 ∗ (−0.8017) + 1.8 ∗ 0.8658 −0.4234
0
≠ [ ] − − − 𝑿𝟑 𝒊𝒔 𝒏𝒐𝒕 𝒐𝒑𝒕𝒊𝒎𝒖𝒎
0

So move next iteration.

Iteration 4

1. Direction of search

Page | 26
 STRUCTURAL OPTIMIZATION ASSIGNMENT

0.0283 −0.0283
𝑑3 = −∇𝑓 = − [ ]=[ ]
−0.4234 0.4234
2. Step length α in the direction of 𝒅𝟏
−0.0283
𝒅𝟑 𝑻 𝒅𝟑 [−0.0283 0.4234] [ ] 0.1801
α= = 0.4234 = = 0.6038
𝒅𝟑 𝑻 𝑯𝒅𝟑 1.8 0 −0.0283
[−.0283 0.4234] [ ][ ] 0.2984
0 1.8 0.4234

Hence, the new point is

−0.8017 −0.0283 −0.8188
𝑥4 = 𝑥3 + 𝛼𝑑3 = [ ] + 0.6038 [ ]=[ ]
0.8658 0.4234 1.1214

3. Check the optimum

1 + 2.4𝑥1 + 1.1𝑥2 1 + 2.4 ∗ (−0.8188) + 1.1 ∗ 1.1214 0.2684
∇f(𝑥4 ) = [ ]=[ ]=[ ]
−1.1 + 1.1𝑥1 + 1.8𝑥2 −1.1 + 1.1 ∗ (−0.8188) + 1.8 ∗ 1.1214 0.01784
0
≠ [ ] − − − 𝑿𝟒 𝒊𝒔 𝒏𝒐𝒕 𝒐𝒑𝒕𝒊𝒎𝒖𝒎
0

So move next iteration. But it does not converge

b) 𝒇(𝒙𝟏 , 𝒙𝟐 ) = 𝟎. 𝟗𝒙𝟏 𝟐 + 𝟎. 𝟗𝒙𝟐 𝟐 − 𝟏𝟎𝟎

Let’s start with initial point (1,0)

Step1. Gradient of 𝑓(𝑥1 , 𝑥2 ) ⇒

𝜕𝑓
𝜕𝑥1 1.8𝑥1 1.8
𝑮𝒓𝒂𝒅𝒊𝒆𝒏𝒕 of 𝑓 is ∇𝑓(𝑥1 , 𝑥2 ) = =[ ]=[ ]
𝜕𝑓 1.8𝑥2 0
[𝜕𝑥2 ]
𝜕2𝑓 𝜕2𝑓
𝜕𝑥1 2 𝜕𝑥1 𝜕𝑥2 1.8 0
𝑯𝒆𝒔𝒔𝒊𝒂𝒏 𝑴𝒂𝒕𝒓𝒊𝒙 𝑖𝑠 𝐻 = =[ ]
𝜕2𝑓 𝜕2𝑓 0 1.8
[𝜕𝑥2 𝜕𝑥1 𝜕𝑥2 2 ]
Direction of search
1.8 −1.8
𝑑𝑘 = −∇𝑓 = − [ ]=[ ]
0 0

Step-2: Determine the optimal step length α in the direction of 𝒅𝒊

−1.8
𝒅𝟎 𝑻 𝒅𝟎 [−1.8 0] [ ] 3.24
α= = 0 = = 0.555
𝒅𝟎 𝑻 𝑯𝒅𝟎 1.8 0 −1.8 5.832
[−1.8 0] [ ][ ]
0 1.8 0

Hence, the new point is

Page | 27
 STRUCTURAL OPTIMIZATION ASSIGNMENT

𝑥𝑖+1 = 𝑥𝑖 + 𝛼𝑑𝑘

1 −1.8 0
𝑥1 = 𝑥0 + α𝑑0 = [ ] + 0.5556 [ ]=[ ]
0 0 0

Step-3: Check the optimum

1.8𝑥1 1.8 ∗ 0 0 0
∇f(𝑥1 ) = [ ]=[ ] = [ ] = [ ] − − − 𝑿𝟏 𝒊𝒔 𝒐𝒑𝒕𝒊𝒎𝒖𝒎
1.8𝑥2 1.8 ∗ 0 0 0
The steepest descent method converges in just one iteration with starting point (1,0).
𝑓′(0,0) = 0.9𝑥1 2 + 0.9𝑥2 2 − 100 = 0.9(0)2 + 0.9(0)2 − 100 = −100
∴ (0, 0) is a minimum point for 𝑓(𝑥) and 𝑓 ′ = −100

Page | 28
 STRUCTURAL OPTIMIZATION ASSIGNMENT

Dynamic Programming
1. Bahir Dar University want to allocate the available water resource to the three selected campuses. If the
total available water resource is 60000m3 (6 unites) which is to be allocated for the three campuses the
return in supplying the respective unit of water is given below in the table-1. How much unit of water
must be allocated to each users to get the maximum benefit?

Amount of Water Return from

Allocated
Campus -1 (peda) Campus -2 (poly) Campus -3 (Yibab)
0 0 0 0
1 5 5 7
2 8 6 12
3 9 3 15
4 8 -4 16
5 5 -15 15
6 0 -30 12
Solution

Stage-1: Let us use Backward Recursion

 Sub-optimization function for the 3rduser: F3 ( x3 )  Max R3  x3 

0 x3  S 3
0 S3 Q

State
S3
X3 R3(X3) F3(X3) X3*

0 0 0 0 0
0 0
1 7 1
1 7
0 0
2 1 7 12 2
2 12
0 0
1 7
3 15 3
2 12
3 15
0 0
1 7
4 2 12 16 4
3 15
4 16
0 0
5 1 7 16 4
2 12

Page | 29
 STRUCTURAL OPTIMIZATION ASSIGNMENT

3 15
4 16
5 15
0 0
1 7
2 12
6 3 15 16 4
4 16
5 15
6 12

Stage-2: Considering the last two stages together, the sub-optimization function is:
 
f 2* ( S 2 )  Max R2 x2   f 3* ( S 2  x2 )
0 x2  S 2
0 S 2 Q

State
X2 R2(x2) (S2-X2) f3(S2-X2) f2(X2)= R2(x2)+f3(S2-X2) f2*(S2) X2*
S2
0 0 0 0 0 0 0 0
0 0 1 7 7
1 7 0
1 5 0 0 5
0 0 2 12 12
2 1 5 1 7 12 12 0,1
2 6 0 0 6
0 0 3 15 15
1 5 2 12 17
3 17 1
2 6 1 7 13
3 3 0 0 3
0 0 4 16 16
1 5 3 15 20
4 2 6 2 12 18 20 1
3 3 1 7 10
4 -4 0 0 -4
0 0 5 15 15
1 5 4 16 21
2 6 3 15 21
5 21 1,2
3 3 2 12 15
4 -4 1 7 3
5 -15 0 0 -15
0 0 6 12 12
1 5 5 15 20
2 6 4 16 22
6 3 3 3 15 18 22 2
4 -4 2 12 8
5 -15 1 7 -8
6 -30 0 0 -30

Page | 30
 STRUCTURAL OPTIMIZATION ASSIGNMENT


Stage-3: Considering all the three stages together, f 1* (Q)  Max R1 x1   f 2* ( S1  x1 )
0 x1 Q

S1 Q

State
X1 R1(X1) Q-X1 f2(Q-X1) f1(S1) = R1(X1) + f2 (Q-X1) f1*(S1) X1*
S1– Q

0 0 6 22 22
1 5 5 21 26
2 8 4 20 28
6 3 9 3 17 26 28 2
4 8 2 12 20
5 5 1 7 12
6 0 0 0 0

Backtrack through each table,

Optimal allocation for user 1, X1 = 2 and S1 = 6

Thus, S2 = S1 – X1 = 4

From the 2nd stage, the optimal allocation for user 2, X2 = 1

Now, S3 = S2 – X2= 3

From 3rd stage calculations, X3 = 3

Maximum total net benefit from all the users = 28

Check
X1 = 2 (8)
X2 = 1 (5)
X3 = 3 (15)
Therefore, Max ∑3𝑖=1 𝑅𝑖 = 8+5+15 = 28,

Page | 31