Cutting planes for low-rank-like concave minimization problems

Operations Research

Volumn 52, Issue 6, 2004, Pages 942-953

  Porembski, Marcus ^a  

^a PHILIPPS UNIVERSITY MARBURG   (Germany)

Author keywords

Algorithms; Programming: nonlinear

Indexed keywords

ALGORITHMS; CUSTOMER SATISFACTION; FUNCTIONS; MATRIX ALGEBRA; NONLINEAR PROGRAMMING; PROBLEM SOLVING; RESOURCE ALLOCATION;

CONCAVE MINIMIZATION; CONCAVE QUADRATIC FUNCTION; MINIMIZATION ALGORITHMS; PERMUTATIONS;

GLOBAL OPTIMIZATION;

EID: 12344263102     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.1040.0151     Document Type: Article

References (31)

1. Benson, H. P. 1995. Concave minimization: Theory, applications and algorithms. R. Horst, P. M. Pardalos, eds. Handbook of Global Optimization, Kluwer, Dordrecht, The Netherlands, 43-148.
2. Benson, H. P. 1996. Deterministic algorithms for constrained concave minimization: A unified critical survey. Naval Res. Logist, 43 765-795.
3. Benson, H. P. 1999. Generalized γ-valid cut procedure for concave minimization. J. Optim. Theory Appl. 102 289-298.
4. Benson, H. P., S. S. Erenguc. 1988. Using convex envelopes to solve the interactive fixed-charge linear programming problem. J. Optim. Theory Appl. 59 223-246.
5. Bretthauer, K. M., V. A. Cabot. 1994. A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron. Comput. Oper. Res. 21 777-785.
6. Bretthauer, K. M., V. A. Cabot, M. A. Venkataramanan. 1994. An algorithm and new penalties for concave integer minimization over a polyhedron. Naval Res. Logist. 41 435-454.
7. Falk, J. E. 1973. A linear max-min problem. Math. Programming 5 169-188.
8. Holmberg, K., H. Tuy. 1999. A production-transportation problem with stochastic demand and concave production costs. Math. Programming 85 157-179.
9. Horst, R., N. V. Thoai. 1989. Modification, implementation and comparision of three algorithms for globally solving linearly constrained concave minimization problems. Computing 89 271-289.
10. Horst, R., H. Tuy. 1996. Global Optimization (Deterministic Approaches), 3rd ed. Springer, Berlin, Germany.
11. Kalantari, B. 1986. Quadratic functions with exponential number of local maxima. Oper. Res. Lett. 5 47-49.
12. Konno, H. 1976. Maximization of a convex quadratic function under linear constraints. Math. Programming 11 117-127.
13. Konno, H. 1988. Minimum concave cost production system: A further generalization of multi-echelon model. Math. Programming 41 185-193.
14. Konno, H., T. Kuno. 1992. Linear multiplicative programming. Math. Programming 56 51-64.
15. Konno, H., A. Wijayanayake. 2001. Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints. Math. Programming 89 233-250.
16. Konno, H., C. Gao, I. Seitoh. 1998. Cutting plane/tabu search algorithms for low rank concave quadratic programming problems. J. Global Optim. 13 225-240.
17. Konno, H., P. T. Thach, H. Tuy. 1997. Optimization on Low Rank Non-convex Structures. Kluwer, Dordrecht, The Netherlands.
18. Locatelli, M., N. V. Thoai. 2000. Finite exact branch-and-bound algorithms for concave minimization over polytopes. J. Global Optim. 18 107-128.
19. Mangasarian, O. L. 1978. Characterization of linear complementarity problems as linear programs. Math. Programming Stud. 7 74-87.
20. Nonas, S. L., A. Thorstenson. 2000. A combined cutting-stock and lotsizing problem. Eur. J. Oper. Res. 120 327-342.
21. Pardalos, P. M., G. Schnitger. 1988. Checking local optimality in constrained quadratic programming is NP-hard. Oper. Res. Lett. 7 33-35.
22. Philip, J. 1972. Algorithms for the vector maximization problem. Math. Programming Stud. 2 207-229.
23. Porembski, M. 1999. How to extend the concept of convexity cuts to derive deeper cutting planes. J. Global Optim. 15 371-404.
24. Rosen, J. B. 1983. Global minimization of a linearly constrained concave function by partition of feasible domain. Math. Oper. Res. 8 215-230.
25. Thach, P. T. 1991. Quasiconjugates of functions, duality relationship between quasiconcave minimization under a reverse-convex constraint and quasiconcave minimization under a convex constraint, and applications. J. Math. Anal. Appl. 159 299-322.
26. Thieu, T. V. 1980. Relationship between bilinear programming and concave programming. Acta Math. Vietnam 2 106-113.
27. Tuy, H. 1964. Concave programming under linear constraints. Soviet Math. 5 1437-1440.
28. Tuy, H. 1998. Convex Analysis and Global Optimization. Kluwer, Dordrecht, The Netherlands.
29. Tyagi, R., C. Das. 1999. Grouping customers for better allocation of resources to serve correlated demands. Comput. Oper. Res. 26 1041-1058.
30. Veroy, B., V. Zwass. 1988. Embedding a point-to-point network in the expansion of infrastructure for information systems. J. Management Inform. Systems 4 50-63.
31. Zwass, V., B. Veroy. 1988. Capacity expension for information flow distribution in multi-path computer communication. J. Management Inform. Systems 5 57-70.