An outcome-space finite algorithm for solving linear multiplicative programming

[1]  Kristin P. Bennett,et al.  Global Tree Optimization: A Non-greedy Decision Tree Algorithm , 2007 .

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

[3]  Yong Shi,et al.  New Frontiers of Decision Making for the Information Technology Era , 2000 .

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

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

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

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

[8]  Takahito Kuno.  Solving a Class of Multiplicative Programs with 0–1 Knapsack Constraints , 1999 .

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

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

[11]  H. Konno,et al.  BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING: A PARTIAL OPTIMIZATION APPROACH , 1996 .

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

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

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

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

[16]  A. Mas-Colell,et al.  Microeconomic Theory , 1995 .

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

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

[19]  Hiroshi Konno,et al.  A mean-absolute deviation-skewness portfolio optimization model , 1993, Ann. Oper. Res..

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

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

[22]  Takahito Kuno.  Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set , 1993, Oper. Res. Lett..

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

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

[25]  Hiroshi Konno,et al.  Parametric simplex algorithms for a class of NP-Complete problems whose average number of steps is polynomial , 1992, Comput. Optim. Appl..

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

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

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

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

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

[31]  William R. Heller,et al.  On finding Most Optimal Rectangular Package Plans , 1982, 19th Design Automation Conference.

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

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