Optimum Design

in Mechanical Engineering

..



Local
optimization
Matlab
2

(Constraints)
Toolbox
Matlab
2

 ( )
Shape and Topology optimization

Shape and Topology optimization

Optistruct .


1. - 40
2. 60


1. Rao, S. , Engineering Optimization, Theory and
rd
Practice 3 Edition, New York, Wiley, 2006
Call number : TA342 R291e 1996

1. (Design)
2. (Analysis)
3. (Fabrication)
4. (Test)
5. (Research and development)

1. (System needs and objective)

2. (System specifications)

3. (Preliminary design)

4. (Detailed design)

(Maximize systerm worth)
(Minimum cost effective)

4. ()

5. (Prototype system fabrication)

6. (System testing)

()
(Final design)
(Trial and
error)
(Detailed design)



-


-




1 (Efficient)

2 (Cost-effective)


(Optimum design)




Optimization

2 50%

(Objective, cost, function)

min f (b, h) bhL

(1)

b =
h =

L = ()
=

 b h

b0

(2)

h0

(3)

h 3b

(4)

Von

ut

SF
2 mm

(5)
(6)

(2) (6) (Constraint equations)


Optimization
1. (Objective function or cost function)

2.

(Design variables)

3.

Explicit Implicit

(Mixed)

(Constrained
equations)

Equality Inequality

 Optimization
1. Size (Parametric) optimization optimization
() ..

2. Topology optimization - optimization

( ) ( )
.

 Optimization ( )
3. Shape optimization - optimization

4. Topography optimization optimization

( )

 Topology optimization

 Shape optimization

 Topography optimization

 Optimization

5000
4
(1)
- Wire diameter (d),
(2) Spring diameter (D)
(N)

 Optimization ( )

1. 0.1
2. 10,000 psi
3. 100 Hz
k = , = , fn =

 Optimization ( )
G = = 12 x 106 psi
w =
0.3 lb/in3
Ks = = 1.05
F =

 Optimization ( )

 Optimization ( )

F = 5000/4 = 1250 lb

 Optimization ( )

Workshop 1 Optimization
(Design variables)
(Objective function)(Constraints)

1.
V
2.
h r

Single variable optimization without constraint

Optimization

f(x)

 Single variable optimization

without constraint

1. First order necessary condition (local) relative minimum f(x)
x = x*
df *
f x x 0
dx
*

(1)

relative minimum relative maximum
(Saddle point)

Proof x* local minimum f(x) x

d x x and f f x f x 0 (a) local minimum
*

Taylor series f(x) x*

1
f x f x f x d f x* d 2 R (Remainder)
2
Or
*

1
f f x f x f x d f x* d 2 R
2
*

(b)

(a) local minimum

(b)
d (a) f
(x*) = 0 (1)

2. Sufficient condition local minimum f(x) x = x*

2
d
f *
*

f x 2 x 0
dx

(2)

Sufficient condition local maximum

2
d f *
f x 2 x 0
dx
*

(3)

(4)
d2 f *
f x 2 x 0
dx
*

(4)

Higher-order (order 3rd 4th)

Proof x* local minimum f(x) x

f x* 0

1
f f x* d 2 R
2

(c)

(a) local minimum

(c)
d
(a) f (x*) > 0
(2) (c) f (x*) = 0
High-order term x* local minimum

f" f'

f ' 0

f ' 0
f ' 0

 ( )
. f = 0

f " 0
f " 0

f " 0
x

 Single variable optimization

f(x) = 12x5 - 45x4 + 40x3+ 5
1
f ( x) 60 x 4 3x3 2 x 2 60 x 2 x 1 x 2 0
x* 0,1, 2

f ( x) 60 4 x3 9 x 2 4 x

 Single variable optimization( )

x = 1,

f(x) = -60 x = 1 local maximum

fmax = f( x = 1) = 12
x = 2, f(x) = 240 x = 2 local minimum
fmin = f( x = 2) = -11
x = 0, f(x) = 0
f (x) =60(12x2 -18x +4) = 240
f (x) 0 minimum maximum
(Saddle point or inflection point)

Workshop 2 Optimization
()

f (x) = 4x3 18x2 + 27x 7