Accession Number : AD0723104

Title :   Equivalent Knapsack-type Formulations of Bounded Integer Linear Programs.

Descriptive Note : Research rept.,

Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP

Personal Author(s) : Padberg,Manfred W.

Report Date : SEP 1970

Pagination or Media Count : 20

Abstract : The paper shows that every bounded integer linear program can be transformed into an integer program involving one single linear constraint and upper and lower bounds on the variables, such that the solution space of the original problem coincides with that one of the equivalent knapsack-type problem. (Author)

Descriptors :   (*LINEAR PROGRAMMING, MATRICES(MATHEMATICS)), SET THEORY, NUMBER THEORY, INEQUALITIES, NUMERICAL ANALYSIS

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE