Cutting Planes for Low-Rank-Like Concave Minimization Problems

References

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