0% found this document useful (0 votes)
161 views

Tutorial 2018 Optimization

This document outlines a tutorial on structural optimization for a mechanical engineering semester 2 course. It covers various topics in optimization including classical optimization methods like Lagrange multipliers and Kuhn-Tucker conditions, linear programming solved using graphical and simplex methods, plastic design methods, and nonlinear programming techniques. Example problems are provided for each topic to help explain the concepts and solution approaches.

Uploaded by

burhan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
161 views

Tutorial 2018 Optimization

This document outlines a tutorial on structural optimization for a mechanical engineering semester 2 course. It covers various topics in optimization including classical optimization methods like Lagrange multipliers and Kuhn-Tucker conditions, linear programming solved using graphical and simplex methods, plastic design methods, and nonlinear programming techniques. Example problems are provided for each topic to help explain the concepts and solution approaches.

Uploaded by

burhan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Structural Optimization(2722012) ME Semester II Tutorial

1. Introduction to Optimization
[1] Give a brief description of various types of optimization Methods.
[2] Enlist various engineering applications of optimization.
[3] Explain the significance of optimization.
2. Classical Optimization
[1] Explain necessary and sufficiency condition for unconstrained and constrained
Optimization.
[2] Explain Stationary points, relative and global optimum points for a function.
[3] Explain Lagrange Multiplier technique.
[4] Explain Concave and Convex function for single and two variables with their properties.
[5] Explain the relative maxima and relative minima with necessary sketches.
[6] Explain the term: canonical form with taking simple example.
[7] Find the optimum value of the function f(x) and states if the function attains maximum or
minimum. f(x) = x2 + 3x- 5.
[8] Find the dimensions of cylindrical tin with top and bottom made up of sheet metal to
maximize its volume such that the total surface are equals to 24π, using Lagrange Multiplier
Method.
[9] Maximize the function f (x, y) = 2x + 3y subject to g(x, y) = x 2 + y2 ≤ 2, using any method of
optimization.
[10] Determine the critical points and locate any relative minima, maxima and saddle points of
following functions f defined by
(1) f(x, y) = 2x2 + 2xy + 2y2 - 6x.
(2) f(x) = 18x2 - 45x3 + 40x4 + 5x + 9.
(3) f(x1,x2) = x1 3 + x23 + 2x12 + 4x22+6.
[11] Find whether the given function is convex, concave or neither,
(1) f(x1,x2,x3) = 12x12 + 5x22 + 9x32 + 7x1 x2 + 9x1 x3.
(2) f(x1,x2,x3) = 4x12 + 3x22 + 5x32 + 6x1x2 + x1x3 -3x1 -2x2 + 15.
[12] Use the method of Lagrange multipliers to maximize the function
(1) f = x3y5 subjected to the constraint x + y = 8.
(2) f(x, y) = k x -1 y -2 subjected to g(x, y) = x2 + y2 - a2
(3) f(x)=x12 + x22 + x32 subjected to g1(x) = [x12/4] + [x22/5] + [x32/25]-1 and g2(x)=x1 + x2 - x3.
(4) f(x)=3x12 + x22 + 2x1x2 +6x1+2x2 subjected to 2x1-x2 =4
[13] Derive Kuhn Tucker’s condition to maximize
(1) f(x1, x2) = 4x1 + 3x2 subject to 2x1+ x2 ≤ 10 and x1, x2 ≥ 0
(2) f(x1, x2) = 3x12 - 2x2 subject to 2x1+ x2 = 4 , x12 + x22 ≤ 19.4 and x1 ≥ 0
(3) f(x1, x2) = 12x12 - 8x2 subject to 4x1 + x2 = 16, x12+ x22 ≤ 11.4, and 3x + y ≤ 18, x ≥ 0
(4) f(x, y, z) = x.y.z subject to g1 = x2 + y2 ≤ 1 and g2 = x + z ≥ 1.
[14] Derive Kuhn Tucker’s condition to minimize
(1) Z = x12 + 2x22 + 3x32 subject to g1= x1- x2 -2x3 ≤ 12 and g2= x1+2x2 -3x3 ≤ 8
(2) f(x)=x12 + x22 + x32 subject to x1+x2+x3≥ 5 , 2-x2x3≤ 0 and x1> 0, x2 > 0, x3 >2. Determine
whether Kuhn Tucker’s conditions are satisfied at following points
3 4
2 3 2
𝑥1 = 3 , 𝑥2 = 2 , 𝑥3 = {1}
2 3 2
{2} {3}
3. Linear Programming

[1] Explain the terms with sketch: Free Point, Bound Acceptable Point and Feasible Region.
[2] Explain on “Objective function” and “Design Constraint”.
[3] Minimize the function given below using graphical method.
(1)f = 5x1 - x2 subjected to x1 + x2 ≥ 2, x1 + 2x2 ≤ 2, 2x1 + x2 ≤ 2 and x1, x2 ≥ 0
(2)Z= 20x1 + 10x2 subjected to x1 + 2x2 ≤ 40, 3x1 + x2 ≥ 30, 4x1 + 3x2 ≥ 60 and x1, x2 ≥ 0
(3)Z= 3x1 + 2x2 subjected to 8x1 + x2 ≥ 8, 2x1 + x2 ≥ 6, x1 + 3x2 ≥ 6, x1 + 6x2 ≥ 8 and x1, x2
≥0
[4] Use simplex method to minimize
(1)f = 5x1 + 3x2 + x3 subjected to 2x1 + x2 + x3 ≤ 3, -x1 + 2x3 ≤ 4 and x1, x2, x3 ≥ 0
(2)Z = 3x1 + 5x2 + 4x3 subjected to 2x1 + 3x2 ≤ 8, 2x2 + 5x3 ≤ 10, 3x1 + 2x2 + 4x3 ≤ 15 and
x1, x2, x3 ≥ 0
(3)Z(x, y) = 3x + 2y subject to 2x+y≤ 18, 2x+3y≤42, 3x+y≤ 24 and x,y ≥ 0.
[5] Use Simplex method maximize : A= 5x + 7y subject to : x + y ≤ 4, 2x + y ≤5 and x ,y≥0.
[6] Maximize 2x1+6x2 subject to: -x1+x2 ≤ 1, 2x1+x2 ≤ 2 and x1, x2 > 0 by graphical method.
[7] Minimize x1+3x2 subject to: -4x1+3x2 ≤ 12, x1+x2 ≤ 7, x1- 4x2 ≤ 2 and x1, x2 > 0 by simplex
method.
4. Plastic Design Method

1 Formulate the cantilever beam of length of 1.5 m for minimum weight subjected to
deflection of beam should not exceed span/350. Density of PCC is 24 kN/m3 and E =
20000 MPa. Also obtain the solution for the problem, with the assumption that width of
beam should not exceed 150mm.
2 Formulate constraint equations & objective function for following structure using plastic
method. Obtain solution for minimum weight by graphical method.

3 Using plastic method, formulate the objective function and constraint equations for the
Figure Also obtain the solution for minimum weight.

4 Formulate constraint equations & objective function for following structure using plastic
method. Obtain solution for minimum weight by graphical method.
5 A beam column of rectangular cross section is required to carry an axial load of 2 kN and
transverse load of 1 kN as shown in figure. It is to be designed to avoid possibility of
yielding and buckling and minimum weight. Formulate the optimization problem by
assuming that the beam column can bend only in vertical (xy) plane. Assume the
material to be steel with a specific weight of 78.5 kN/m3. E=2 x 108 kN/m2. The
permissible yield stress is 2.15 x 105 kN/m2. The width of the beam should be at least
12mm and not greater than twice the depth. Take Critical buckling load as ( 2EI/4L2).

Py = 1 kN

Px = 1 kN

10 m

6 Analyze and design the portal frame shown in fig for minimum volume, if permissible
horizontal sway of joints in given frame is 5mm and allowable bending stress in
members is 150 MPa.

7 Design the portal frame shown in fig for minimum cost, if permissible horizontal sway
in frame is 6mm and bending stress in members is 120 MPa.

8 Design a pin jointed steel frame shown in fig. for minimum weight. The horizontal
deflection is limited to 2.5mm and vertical deflection is limited to 4mm. The allowable
stress in each member is limited to 160MPa.
9 Design the following fixed based portal frame structure for minimum volume. The
permissible sway is 5 mm and permissible bending stress is 0.15 kN/mm2. Use matrix
force or displacement method. Axial deformation may be neglected.

10 Using displacement method, design statically determinate pin jointed truss shown in
Figure Adopt E = 2 x 105 MPa, σ(comp.) = 0.12 kN/mm2, σ(ten.) = 0.18 kN/mm2,
displacement at 1 = 5 mm

11 Design the following pin jointed statically determinate truss structure for minimum
weight. The horizontal and vertical deflections at joint D are both limited to 5 mm and
the numerical value of stress in any member is limited to 1.2 × 106 kN/m2. Use matrix
force or displacement method.
5. Non-Linear Programming
[1] Enlist unconstrained non-linear programming methods and explain any two in details.
[2] Minimize f(x) = 4x12 + 3x22 – 5 x1x2 – 8x1 using Quasi-Newton method with starting point
at origin.
[3] Explain the Dynamic programming & Davidon-Fletcher-Powell method
[4] Minimize f(x) = x1 – x2 + 2x12 + 2x1x2 + x22 using Fletcher – Reeves method with starting
point at origin.
[5] What is Genetic algorithm for optimization? Why Genetic algorithm is required?
[6] Minimize f(x) = x12 + x22 – 2x1 – 4x2 + 5 using Univariate method with starting point at
origin.
[7] Minimize f(x) = x12 + x22 – 2x1 – 4x2 + 5 using Steepest Descent method with starting point
at origin.

You might also like