Integer Programming Via Modular Representations

Robert Wilson ()

Management Science, 1970, vol. 16, issue 5, 289-294

Abstract: Modular representations of the integers are used to identify the successive integer grid points encountered as one varies the objective value of an all-integer programming problem. One can, therefore, proceed from a noninteger solution to an integer solution by monotonic variation of the objective value. Ordinarily, it is necessary to perturb the objective function of a problem to fit the prescribed format for the algorithm: although this is easily done for small problems, the limited number of digits carried by most computing machines prevents it for problems with many variables. The features of the algorithm are virtually independent of the number and the linearity (or nonlinearity) of the constraints, provided the variables are constrained to be nonnegative and bounded above.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.16.5.289 (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:16:y:1970:i:5:p:289-294

Access Statistics for this article

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