1. A new global optimization approach for convex multiplicative programming
- Author
-
Gao, Yuelin, Wu, Guorong, and Ma, Weimin
- Subjects
- *
GLOBAL analysis (Mathematics) , *MATHEMATICAL optimization , *CONVEX programming , *ALGORITHMS , *APPROXIMATION theory , *NUMERICAL analysis , *MATHEMATICAL analysis - Abstract
Abstract: In this paper, by solving the relaxed quasiconcave programming problem in outcome space, a new global optimization algorithm for convex multiplicative programming is presented. Two kinds of techniques are employed to establish the algorithm. The first one is outer approximation technique which is applied to shrink relaxation area of quasiconcave programming problem and to compute appropriate feasible points and to raise the capacity of bounding. And the other one is branch and bound technique which is used to guarantee global optimization. Some numerical results are presented to demonstrate the effectiveness and feasibility of the proposed algorithm. [Copyright &y& Elsevier]
- Published
- 2010
- Full Text
- View/download PDF