Equivalent Knapsack-type Formulations of Bounded Integer Linear Programs.

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)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1970
Accession Number
AD0723104

Entities

People

  • Manfred W. Padberg

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Convex Programming
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Linear Algebra
  • Systems Analysis and Design

Technology Areas

  • Space