A bounded dual (all‐integer) integer programming algorithm with an objective cut

Larry M. Austin and Michael E. Hanna

Naval Research Logistics Quarterly, 1983, vol. 30, issue 2, 271-281

Abstract: In this article, we describe a new algorithm for solving all‐integer, integer programming problems. We generate upper bounds on the decision variables, and use these bounds to create an advanced starting point for a dual all‐integer cutting plane algorithm. In addition, we use a constraint derived from the objective function to speed progress toward the optimal solution. Our basic vehicle is the dual all‐integer algorithm of Gomory, but we incorporate certain row‐ and column‐selection criteria which partially avoid the problem of dual‐degenerate iterations. We present the results of computational testing.

Date: 1983
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800300208

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:30:y:1983:i:2:p:271-281

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().