
223
8
Geometric Programming
8.1 Introduction
Geometric programming can be applied to optimization problems in which
the objective function and constraints have a special structure. The conven-
tional format of the objective function and constraints can be converted into the
format required for geometric programming. Once the problem is written in
the required format, it is much easier to solve the optimization problem using
geometric programming than using nonlinear programming (NLP) methods
described in previous chapters. The geometric programming technique pro-
posed by Zener, Dufn, and Peterson can solve large-scale optimization prob-
lems with ...