Interior Path Methods for Heuristic Integer Programming Procedures

Bruce H. Faaland and Frederick S. Hillier
Additional contact information
Bruce H. Faaland: University of Washington, Seattle, Washington
Frederick S. Hillier: Stanford University, Stanford, California

Operations Research, 1979, vol. 27, issue 6, 1069-1087

Abstract: This paper considers heuristic procedures for general mixed integer linear programming with inequality constraints. It focuses on the question of how to most effectively initialize such procedures by constructing an “interior path” from which to search for good feasible solutions. These paths lead from an optimal solution for the corresponding linear programming problem (i.e., deleting integrality restrictions) into the interior of the feasible region for this problem. Previous methods for constructing linear paths of this kind are analyzed from a statistical viewpoint, which motivates a promising new method. These methods are then extended to piecewise linear paths in order to improve the direction of search in certain cases where constraints that are not binding on the optimal linear programming solution become particularly relevant. Computational experience is reported.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.6.1069 (application/pdf)

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:inm:oropre:v:27:y:1979:i:6:p:1069-1087

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().