An advanced dual algorithm with constraint relaxation for all‐integer programming

Larry M. Austin and Parviz Ghandforoush

Naval Research Logistics Quarterly, 1983, vol. 30, issue 1, 133-143

Abstract: In this article we present an all‐integer cutting plane algorithm called the Reduced Advanced Start Algorithm (RASA). The technique incorporates an infeasible advanced start based on the optimal solution to the LP relaxation, and initially discards nonbinding constraints in this solution. We discuss the results of computational testing on a set of standard problems and illustrate the operation of the algorithm with three small examples.

Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (1)

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

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:1:p:133-143

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 ().