A Branch and Bound Method for Solving Integer Separable Concave Problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Comput. Optim. Appl. Year : 2003

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.

Dates and versions

inria-00376095 , version 1 (16-04-2009)

Identifiers

Cite

Oscar Barrientos, Rafael Correa, Patricio Reyes, Alvaro Valdebenito. A Branch and Bound Method for Solving Integer Separable Concave Problems. Comput. Optim. Appl., 2003, 26 (2), pp.155--171. ⟨10.1023/A:1025746430535⟩. ⟨inria-00376095⟩
28 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More