Outcome-space cutting-plane algorithm for linear multiplicative programming

Journal of Optimization Theory and Applications

Volumn 104, Issue 2, 2000, Pages 301-322

  Benson, H P ^a   Boger, G M ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Cutting plane; Extreme point search; Global optimization; Multiplicative programming; Nonconvex programming; Outcome space

Indexed keywords

PROBLEM SOLVING;

CONCAVE MINIMIZATION; CUTTING PLANE ALGORITHMS; CUTTING PLANES; EXTREME POINTS; EXTREME-POINT SEARCH; GLOBAL OPTIMISATION; MULTIPLICATIVE PROGRAMMING; NON-CONVEX PROGRAMMING; OUTCOME SPACE; PROGRAMMING PROBLEM;

GLOBAL OPTIMIZATION;

EID: 0034348924     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1004657629105     Document Type: Article

References (27)

1. 1. KONNO, H., and KUNO, T., Generalized Linear Multiplicative and Fractional Programming, Annals of Operations Research, Vol. 25, pp. 147-161, 1990.
2. 2. MATSUI, T., NP-Hardness of Linear Multiplicative Programming and Related Problems, Journal of Global Optimization, Vol. 9, pp. 113-119, 1996.
3. 3. HORST, R., and TUY, H., Global Optimization: Deterministic Approaches, 2nd Edition, Springer Verlag, Berlin, Germany, 1993.
4. 4. KONNO, H., and INORI, M., Bond Portfolio Optimization by Bilinear Fractional Programming, Journal of the Operations Research Society of Japan, Vol. 32, pp. 143-158, 1988.
5. 5. HENDERSON, J. M., and QUANDT, R. E., Microeconomic Theory, McGraw-Hill, New York, NY, 1971.
6. 6. MALING, K., MUELLER, S. H., and HELLER, W. R., On Finding Most Optimal Rectangular Package Plans, Proceedings of the 19th Design Automation Conference, pp. 663-670, 1982.
7. 7. KONNO, H., and KUNO, T., Multiplicative Programming Problems, Handbook of Global Optimization, Edited by R. Horst and P. M. Pardalos, Kluwer Academic Publishers, Dordrecht, Netherlands, pp. 369-405, 1995.
8. 8. KONNO, H., and KUNO, T., Linear Multiplicative Programming, Mathematical Programming, Vol. 56, pp. 51-64, 1992.
9. 9. KONNO, H., YAJIMA, Y., and MATSUI, T., Parametric Simplex Algorithms for Solving a Special Class of Nonconvex Minimization Problems, Journal of Global Optimization, Vol. 1, pp. 65-81, 1991.
10. 10. SCHAIBLE, S., and SODINI, C., Finite Algorithm for Generalized Linear Multiplicative Programming, Journal of Optimization Theory and Applications, Vol. 87, pp. 441-455, 1995.
11. 11. KUNO, T., A Practical Algorithm for Minimizing a Rank-Two Saddle Function on a Polytope, Journal of the Operations Research Society of Japan, Vol. 39, pp. 63-76, 1996.
12. 12. MUU, L. D., and TAM, B. T., Minimizing the Sum of a Convex Function and the Product of Two Affine Functions over a Convex Set, Optimization, Vol. 24, pp. 57-62, 1992.
13. 13. PARDALOS, P. M., Polynomial Time Algorithms for Some Classes of Constrained Nonconvex Quadratic Problems, Optimization, Vol. 21, pp. 843-853, 1990.
14. 14. TUY, H., and TAM, B. T., An Efficient Solution Method for Rank-Two Quasiconcave Minimization Problems, Optimization, Vol. 24, pp. 43-56, 1992.
15. 15. RYOO, H. S., and SAHINIDIS, N. V., A Branch-and-Reduce Approach to Global Optimization, Journal of Global Optimization, Vol. 8, pp. 107-138, 1996.
16. 16. TUY, H., Polyhedral Annexation, Dualization, and Dimension Reduction Technique in Global Optimization, Journal of Global Optimization, Vol. 1, pp. 229-244, 1991.
17. 17. FALK, J. E., and PALOCSAY, S. W., Image Space Analysis of Generalized Fractional Programs, Journal of Global Optimization, Vol. 4, pp. 63-88, 1994.
18. 18. THOAI, N. V., A Global Optimization Approach for Solving the Convex Multiplicative Programming Problem, Journal of Global Optimization, Vol. 1, pp. 341-357, 1991.
19. 19. BENSON, H. P., and BOGER, G. M., Analysis of an Outcome Space Formulation of the Multiplicative Programming Problem, Working Paper, Warrington College of Business Adminstration, University of Florida, Gainesville, Florida, 1998.
20. 20. BAZARAA, M. S., SHERALI, H. D., and SHETTY, C. M., Nonlinear Programming: Theory and Algorithms, 2nd Edition, John Wiley and Sons, New York, NY, 1993.
21. 21. BENSON, H. P., and BOGER, G. M., Multiplicative Programming Problems: Analysis and Efficient Point Search Heuristic, Journal of Optimization Theory and Applications, Vol. 94, pp. 487-510, 1997.
22. 22. BENSON, H. P., and SUN, E., Pivoting in an Outcome Polyhedron, Part II: Executing the Pivot Process, Working Paper, Warrington College of Business Administration, University of Florida, Gainesville, Florida, 1998.
23. 23. MURTY, K. G., Linear Programming, John Wiley and Sons, New York, NY, 1983.
24. 24. CARVAJAL-MORENO, R., Minimization of Concave Functions Subject to Linear Constraints, Operations Research Center Report ORC 72-3, University of California, Berkeley, California, 1972.
25. 25. ROCKAFELLAR, R. T., Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.
26. 26. BENSON, H. P., A Generalized γ-Valid Cut Procedure, Working Paper, Warrington College of Business Administration, University of Florida, Gainesville, Florida, 1998.
27. 27. BENSON, H. P., Pivoting in an Outcome Polyhedron, Part 1: Motivation and Initialization, Working Paper, Warrington College of Business Administration, University of Florida, Gainesville, Florida, 1998.