A new algorithm for geometric programming based on the linear structure of its dual problem
In this article, we present an algorithm for the resolution of a nonlinear optimization problem, concretely the posynomial geometric programming model. The solution procedure that we develop extends the condensation techniques for geometric programming, allowing us to find the optimal solutions to the dual geometric problems that we get from the interior of the corresponding feasible regions, in the line that interior point methods for linear programming work, which leads us to obtain considerable computational advantages with respect of the classical solution procedures. (C) 2000 Elsevier Science Ltd. All rights reserved.
geometric programming primal-dual methods