Technical Note—Solving Integer Programming Problems by Aggregating Constraints

1 April 1977

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research

Vol. 25 (2) , 346-351
https://doi.org/10.1287/opre.25.2.346

Abstract

Integer programming problems with bounded variables can be solved by combining the constraints into an equivalent single constraint. This note presents a refinement to earlier work that reduces the size of the coefficients in the equivalent constraint and points out advantages as well as computational considerations for solving problems by this method.

Keywords

SOLVING
NOTE
INTEGER PROGRAMMING
PROGRAMMING PROBLEMS
CONSTRAINT
REFINEMENT
AGGREGATING
EARLIER
COEFFICIENTS

This publication has 0 references indexed in Scilit: