An Algorithm for the Solution of Mixed Integer Programming Problems

Norman J. Driebeek
Additional contact information
Norman J. Driebeek: Arthur D. Little, Inc., Cambridge, Massachusetts

Management Science, 1966, vol. 12, issue 7, 576-587

Abstract: An algorithm is presented for the solution of mixed integer programming problems. The method was developed to solve primarily those programming problems which contain a large number of continuous variables in addition to a few variables that are restricted to discrete values. The algorithm solves a continuous, non-integer constrained problem first. Subsequently, a search for the optimum integer solution is made on the basis of those changes in the value of the objective function that are produced by activating integer constraints.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.12.7.576 (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:ormnsc:v:12:y:1966:i:7:p:576-587

Access Statistics for this article

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