An efficient method for generalized linear multiplicative programming problem with multiplicative constraints

We present a practical branch and bound algorithm for globally solving generalized linear multiplicative programming problem with multiplicative constraints. To solve the problem, a relaxation programming problem which is equivalent to a linear programming is proposed by utilizing a new two-phase relaxation technique. In the algorithm, lower and upper bounds are simultaneously obtained by solving some linear relaxation programming problems. Global convergence has been proved and results of some sample examples and a small random experiment show that the proposed algorithm is feasible and efficient.

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

[2]  Sanyang Liu,et al.  Global minimization of a generalized linear multiplicative programming , 2012 .

[3]  H. Raiffa,et al.  Decisions with Multiple Objectives , 1993 .

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

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

[6]  Harold P. Benson,et al.  Multiplicative Programming Problems: Analysis and Efficient Point Search Heuristic , 1997 .

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

[8]  X. J. Liu,et al.  Heuristic Methods for Linear Multiplicative Programming , 1999, J. Glob. Optim..

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

[10]  Mir Mohsen Pedram,et al.  Fuzzy pricing, marketing and service planning in a fuzzy inventory model: A geometric programming approach , 2013 .

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

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

[13]  Harold P. Benson,et al.  Outcome-Space Cutting-Plane Algorithm for Linear Multiplicative Programming , 2000 .

[14]  Hoang Tuy,et al.  Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms , 1991, J. Glob. Optim..

[15]  Takahito Kuno.  A Finite Branch-and-Bound Algorithm for Linear Multiplicative Programming , 2001, Comput. Optim. Appl..

[16]  Yingfeng Zhao,et al.  Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints , 2015 .

[17]  R. Hoprst.  Deterministic global optimization with partition sets whose feasibility is not known: application to concave minimization reverse convex , 1988 .

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

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

[20]  Peiping Shen,et al.  A new rectangle branch-and-pruning approach for generalized geometric programming , 2006, Appl. Math. Comput..

[21]  Yanjun Wang,et al.  A deterministic global optimization algorithm for generalized geometric programming , 2005, Appl. Math. Comput..

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

[23]  J. Zurada,et al.  Convergence of batch gradient learning with smoothing regularization and adaptive momentum for neural networks , 2016, SpringerPlus.

[24]  Harold P. Benson,et al.  Vector maximization with two objective functions , 1979 .

[25]  Yuan Ma,et al.  A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints , 2008, Appl. Math. Comput..

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

[27]  I. E. Grossmann,et al.  Alternative Bounding Approximations for the Global Optimization of Various Engineering Design Problems , 1996 .

[28]  R. Horst.  Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization , 1988 .

[29]  Yongqiang Chen,et al.  A nonisolated optimal solution of general linear multiplicative programming problems , 2009, Comput. Oper. Res..

[30]  Guorong Wu,et al.  A new global optimization approach for convex multiplicative programming , 2010, Appl. Math. Comput..