A Branch and Bound Method for Solving Integer Separable Concave Problems

Abstract : A branch and bound algorithm is proposed for solving integer separable concave problems. The method uses Lagrangian duality to obtain lower and upper bounds. We show that the dual program of a separable concave problem is a linear program. Moreover, we identify an excellent candidate to test on each region of the branch and we show an optimality sufficient condition for this candidate. Preliminary computational results are reported.
Type de document :
Article dans une revue
Comput. Optim. Appl., Kluwer Academic Publishers, 2003, 26 (2), pp.155--171. 〈10.1023/A:1025746430535〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00376095
Contributeur : Patricio Reyes <>
Soumis le : jeudi 16 avril 2009 - 16:20:57
Dernière modification le : jeudi 11 janvier 2018 - 06:12:21

Identifiants

Collections

Citation

Oscar Barrientos, Rafael Correa, Patricio Reyes, Alvaro Valdebenito. A Branch and Bound Method for Solving Integer Separable Concave Problems. Comput. Optim. Appl., Kluwer Academic Publishers, 2003, 26 (2), pp.155--171. 〈10.1023/A:1025746430535〉. 〈inria-00376095〉

Partager

Métriques

Consultations de la notice

31