A note on ‘a dual-ascent approach to the fixed-charge capacitated network design problem’

A note on ‘a dual-ascent approach to the fixed-charge capacitated network design problem’

0.00 Avg rating0 Votes
Article ID: iaor20022972
Country: Netherlands
Volume: 138
Issue: 3
Start Page Number: 671
End Page Number: 675
Publication Date: May 2002
Journal: European Journal of Operational Research
Authors:
Abstract:

We show by a counterexample that the dual-ascent procedure proposed by Herrmann, Ioannou, Minis and Proth in a 1996 issue of the European Journal of Operational Research is incorrect in the sense that it does not generate a valid lower bound to the optimal value of fixed-charge capacitated network design problems. We provide a correct dual-ascent procedure based on the same ideas and we give an interpretation of it in terms of a simple Lagrangean relaxation. Although correct, this procedure is not effective, as in general, it provides a less tight bound than the linear programming relaxation.

Reviews

Required fields are marked *. Your email address will not be published.