Outcome-Space Cutting-Plane Algorithm for Linear Multiplicative Programming

This article presents an outcome-space pure cutting-plane algorithm for globally solving the linear multiplicative programming problem. The framework of the algorithm is taken from a pure cutting-plane decision set-based method developed by Horst and Tuy for solving concave minimization problems. By adapting this method to an outcome-space reformulation of the linear multiplicative programming problem, rather than applying directly the method to the original decision-set formulation, it is expected that considerable computational savings can be obtained. Also, we show how additional computational benefits might be obtained by implementing the new algorithm appropriately. To illustrate the new algorithm, we apply it to the solution of a sample problem.

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

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

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

[4]  Hiroshi Konno,et al.  Multiplicative Programming Problems , 1995 .

[5]  Abdellah Salhi,et al.  Global Optimization: Deterministic Approaches (2nd Edition) , 1994 .

[6]  H. P. Benson,et al.  Analysis Of An Outcome Space Formulation Of The Multiplicative Programming Problem , 2000 .

[7]  Panos M. Pardalos,et al.  Polynomial time algorithms for some classes of constrained nonconvex quadratic problems , 1990 .

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

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

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

[11]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[12]  Hoang Tuy,et al.  An efficient solution method for rank two quasiconcave minimization problems , 1992 .

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

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

[15]  Le Dung Muu,et al.  Minimizing the sum of a convex function and the product of two affine functions over a convex set , 1992 .

[16]  Nikolaos V. Sahinidis,et al.  A branch-and-reduce approach to global optimization , 1996, J. Glob. Optim..

[17]  Hoang Tuy,et al.  Polyhedral annexaton, dualization and dimension reduction technique in global optimization , 1991, J. Glob. Optim..

[18]  Takahito Kuno.  A PRACTICAL ALOGORITHM FOR MINIMIZING A RANK-TWO SADDLE FUNCTION ON A POLYTOPE , 1996 .

[19]  Siegfried Schaible,et al.  Finite algorithm for generalized linear multiplicative programming , 1995 .

[20]  Susan W. Palocsay,et al.  Image space analysis of generalized fractional programs , 1994, J. Glob. Optim..

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