A New Global Optimization Algorithm for Solving a Class of Nonconvex Programming Problems

A new two-part parametric linearization technique is proposed globally to a class of nonconvex programming problems (NPP). Firstly, a two-part parametric linearization method is adopted to construct the underestimator of objective and constraint functions, by utilizing a transformation and a parametric linear upper bounding function (LUBF) and a linear lower bounding function (LLBF) of a natural logarithm function and an exponential function with e as the base, respectively. Then, a sequence of relaxation lower linear programming problems, which are embedded in a branch-and-bound algorithm, are derived in an initial nonconvex programming problem. The proposed algorithm is converged to global optimal solution by means of a subsequent solution to a series of linear programming problems. Finally, some examples are given to illustrate the feasibility of the presented algorithm.

[1]  H. Konno,et al.  Minimizing sums and products of linear fractional functions over a polytope , 1999 .

[2]  Hiroshi Konno,et al.  A Branch and Bound Algorithm for Solving Low Rank Linear Multiplicative and Fractional Programming Problems , 2000, J. Glob. Optim..

[3]  Hanif D. Sherali,et al.  New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems , 1997, Oper. Res. Lett..

[4]  Michael C. Dorneich,et al.  GLOBAL OPTIMIZATION ALGORITHMS FOR CHIP LAYOUT AND COMPACTION , 1995 .

[5]  Takahito Kuno,et al.  A branch-and-bound algorithm for maximizing the sum of several linear ratios , 2002, J. Glob. Optim..

[6]  Peiping Shen,et al.  Linearization method for a class of multiplicative programming with exponent , 2006, Appl. Math. Comput..

[7]  S. Schaible.  A note on the sum of a linear and linear‐fractional function , 1977 .

[8]  Harold P. Benson,et al.  A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem , 2007, Eur. J. Oper. Res..

[9]  A. Cambini,et al.  On Maximizing a Sum of Ratios , 1989 .

[10]  Robert J. Vanderbei,et al.  Robust Optimization of Large-Scale Systems , 1995, Oper. Res..

[11]  Kristin P. Bennett,et al.  Bilinear separation of two sets inn-space , 1993, Comput. Optim. Appl..

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

[13]  Jean B. Lasserre,et al.  Semidefinite Programming vs. LP Relaxations for Polynomial Programming , 2002, Math. Oper. Res..

[14]  TAKAHITO KUNO,et al.  A Revision of the Trapezoidal Branch-and-Bound Algorithm for Linear Sum-of-Ratios Problems , 2005, J. Glob. Optim..

[15]  R. Horst,et al.  Solving sum-of-ratios fractional programs using efficient points , 2001 .

[16]  Hanif D. Sherali,et al.  Global Optimization of Nonconvex Polynomial Programming Problems Having Rational Exponents , 1998, J. Glob. Optim..

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

[18]  Ignacio E. Grossmann,et al.  A global optimization algorithm for linear fractional and bilinear programs , 1995, J. Glob. Optim..

[19]  Tomomi Matsui,et al.  Parametric simplex algorithms for solving a special class of nonconvex minimization problems , 1991, J. Glob. Optim..

[20]  I. Androulakis,et al.  Solving long-term financial planning problems via global optimization , 1997 .

[21]  Hiroshi Konno,et al.  Linear multiplicative programming , 1992, Math. Program..

[22]  Chun-Feng Wang,et al.  Global optimization for sum of generalized fractional functions , 2008 .

[23]  R. Horst,et al.  Global Optimization: Deterministic Approaches , 1992 .

[24]  Xiaodi Bai,et al.  A new accelerating method for globally solving a class of nonconvex programming problems , 2009 .

[25]  Peiping Shen,et al.  Linearization method of global optimization for generalized geometric programming , 2005, Appl. Math. Comput..

[26]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[27]  Siegfried Schaible,et al.  Fractional Programming , 2009, Encyclopedia of Optimization.

[28]  Siegfried Schaible,et al.  Fractional programming: The sum-of-ratios case , 2003, Optim. Methods Softw..

[29]  Hoang Tuy,et al.  A Unified Monotonic Approach to Generalized Linear Fractional Programming , 2003, J. Glob. Optim..

[30]  Nikolaos V. Sahinidis,et al.  Global Optimization of Multiplicative Programs , 2003, J. Glob. Optim..

[31]  Xue-Gang Zhou,et al.  A method of acceleration for a class of multiplicative programming problems with exponent , 2009 .

[32]  Hiroshi Konno,et al.  BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING , 1989 .

[33]  Peter Frederic Thomson,et al.  Quadratic programming method in numerical simulation of metal forming process , 2002 .

[34]  Hongwei Jiao,et al.  A branch and bound algorithm for globally solving a class of nonconvex programming problems , 2009 .

[35]  Tomomi Matsui,et al.  NP-hardness of linear multiplicative programming and related problems , 1996, J. Glob. Optim..

[36]  D. Simchi-Levi,et al.  Queueing‐location problems on the plane , 1990 .