Finite Exact Branch-and-Bound Algorithms for Concave Minimization over Polytopes

Journal of Global Optimization

Volumn 18, Issue 2, 2000, Pages 107-128

  Locatelli, Marco ^a,b   Thoai, Nguyen V ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITY OF TRIER   (Germany)

Author keywords

Branch and bound; Concave minimization problems; Concavity cuts; Local searches

Indexed keywords

EID: 0346111798     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008324430471     Document Type: Article

References (18)

1. Benson, H.P. (1985) A finite algorithm for concave minimization over a polyhedron, Naval Research Logistics Quarterly 32: 165-177.
2. Benson, H.P. and Sayin, S. (1994) A finite concave minimization algorithm using branch and bound and neighbor generation, Journal of Global Optimization, 5: 1-14.
3. Benson, H.P. (1995) Concave minimization: theory, applications and algorithms in R. Horst, P. Pardalos (eds.), Handbook of Global Optimization, pp. 43-148, Kluwer Academic Publishers, Dordrecht, The Netherlands
4. Hamami M., Jacobsen S.E., (1988) Exhaustive nondegenerate conical processes for concave minimization on convex polytopes, Mathematics of Operations Research 13, 479-487.
5. Horst R., (1976) An algorithm for nonconvex programming problems, Mathematical Programming 10: 312-321.
6. Horst R., (1984) On the global minimization of concave functions. Introduction and survey, Operations Research Spektrum 6: 195-205.
7. Horst R., Thoai N.V., (1988) Modification, implementation and comparison of three algorithms for globally solving concave minimization problems, Computing, 42: 271-289
8. Horst R., Pardalos P.M. and Thoai N.V., (1995) 'Introduction to global optimization', Kluwer Academic Publishers, Dordrecht, The Netherlands
9. Horst R. and Tuy H., (1996) Global optimization: deterministic approaches, (third edition), Springer-Verlag Berlin Heidelberg New York (1996)
10. Nast M., (1996) Subdivision of simplices relative to a cutting plane and finite concave minimization, Journal of Global Optimization, 9: 65-93
11. Papadimitriou C.H., Steiglitz K., (1982) Combinatorial optimization: algorithms and complexity, Prentice-Hall, Inc., Englewood Cliffs, New Jersey.
12. Pardalos P.M., Rosen J.B., (1986) Methods for global concave optimization: a bibliographic survey, SIAM Review 26, 367-379.
13. Pardalos P.M., Schnitger G., (1988) Checking local optimality in constrained quadratic programming is NP-hard, Operations Research Letters, 7: 33-35.
14. Shectman J.P., Sahinidis N.V., (1998) A finite algorithm for global minimization of separable concave function, Journal of Global Optimization 12: 1-36
15. Tam B.T., Ban V.T., (1985) Minimization of a concave function under linear constraints, Economika i Mathematicheskie Metody 21: 709-714, in Russian
16. Tuy, H. (1991) Concave programming under linear constraints, Soviet Mathematics 5: 1437-1440
17. Tuy, H. Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms, Journal of Global Optimization, 1: 23-36
18. Tuy, H. (1991) Normal conical algorithmfor concave minimization over polytopes, Mathematical Programming 51: 229-245