An Approach to Zero-One Integer Programming

A. Victor Cabot and Arthur P. Hurter
Additional contact information
A. Victor Cabot: Indiana University, Bloomington, Indiana
Arthur P. Hurter: Northwestern University, Evanston, Illinois

Operations Research, 1968, vol. 16, issue 6, 1206-1211

Abstract: By starting with an all-integer zero-one linear programming problem, it is possible to develop a modified, possibly linear, programming problem that provides a characterization of the basis corresponding to a feasible zero-one solution to the integer problem. This characterization is based on the number of variables equal to one in the feasible solution. This paper develops an approach to zero-one programming based on this characterization. The method uses the criterion function of the original problem as a constraint, and then generates a sequence of feasible zero-one solutions, each with a greater value of the objective function. The solution technique is terminated when no more feasible solutions can be found, indicating that the last feasible solution determined is the optimum.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.6.1206 (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:16:y:1968:i:6:p:1206-1211

Access Statistics for this article

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