
238 Optimization: Algorithms and Applications
x
2
0 640312
*
.=
x
3
1 56205
*
.=
x
4
1 280625
*
.=
x
5
0 8
*
.=
x
6
2 31147
*
.=
W = 125.7667
Chapter Highlights
• In geometric programming, the objective function and constraints
are written in posynomial form.
• In geometric programming, the objective function is determined
rst and then design variables are evaluated. The initial guess of the
variables has no role in geometric programming.
• The degree of difculty refers to the number of unknowns minus
the number of equations (orthogonality and normal conditions).
• The dual problem structure is helpful in solving geometric pro-
gramming problem ...