Accession Number : AD0774199
Title : An Algorithm for the Bounded Variable Integer Programming Problem.
Descriptive Note : Technical summary rept.,
Corporate Author : WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER
Personal Author(s) : Trotter,L. E. , Jr. ; Shetty,C. M.
Report Date : DEC 1973
Pagination or Media Count : 24
Abstract : TSR-1355DA-31-124-ARO(D)-462*Mathematical programming, Linear programming, Computer programming, Computations, Algorithms*Integer programmingAn algorithm is proposed for the bounded variable pure integer programming problem which treats general integer variables directly in an implicit enumeration procedure closely related to that advanced by Balas and Geoffrion for binary programming problems. Means of obtaining near optimum solutions through a slight modification of the algorithm are discussed. Techniques which use bounds on variables to improve algorithmic efficiency are developed and examined computationally. Further computational results indicate that direct treatment of general integer variables is significantly more effective than binary expansion. (Author)
Descriptors : *MATHEMATICAL PROGRAMMING, LINEAR PROGRAMMING, COMPUTER PROGRAMMING, COMPUTATIONS, ALGORITHMS
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE