A new global optimization approach for convex multiplicative programming

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.

[1]  Hiroshi Konno,et al.  A parametric successive underestimation method for convex multiplicative programming problems , 1991, J. Glob. Optim..

[2]  Arthur M. Geoffrion,et al.  Solving Bicriterion Mathematical Programs , 1967, Oper. Res..

[3]  Yongjian Yang,et al.  An outcome-space finite algorithm for solving linear multiplicative programming , 2006, Appl. Math. Comput..

[4]  Hiroshi Konno,et al.  Generalized linear multiplicative and fractional programming , 1991 .

[5]  Reiner Horst,et al.  Introduction to Global Optimization (Nonconvex Optimization and Its Applications) , 2002 .

[6]  Hiroshi Konno,et al.  Global minimization of a generalized convex multiplicative function , 1994, J. Glob. Optim..

[7]  Hiroshi Konno,et al.  An outer approximation method for minimizing the product of several convex functions on a convex set , 1993, J. Glob. Optim..

[8]  William R. Heller,et al.  On finding Most Optimal Rectangular Package Plans , 1982, DAC 1982.

[9]  Panos M. Pardalos,et al.  Introduction to Global Optimization , 2000, Introduction to Global Optimization.

[10]  Nguyen V. Thoai.  A global optimization approach for solving the convex multiplicative programming problem , 1991, J. Glob. Optim..

[11]  Harold P. Benson,et al.  An Outcome Space Branch and Bound-Outer Approximation Algorithm for Convex Multiplicative Programming , 1999, J. Glob. Optim..

[12]  Anatoliy D. Rikun,et al.  A Convex Envelope Formula for Multilinear Functions , 1997, J. Glob. Optim..

[13]  Brigitte Jaumard,et al.  Generalized Convex Multiplicative Programming via Quasiconcave Minimization , 1995, J. Glob. Optim..