On Improving Bounds for Variables in Linear Integer Programs by Surrogate Constraints.

Abstract

The problem of deriving lower and upper bounds for integer variables in integer programming problems by means of surrogate constraints is studied. The method of Hammer, Padberg, and Peled is generalized to the use of the whole system of original constraints with strictly sharper results. An equivalent formulation as a zero-sum two person constrained game is also derived, and further conclusions about the sharpness of bounds derived from surrogate constraints are made. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1973
Accession Number
AD0783072

Entities

People

  • Abraham Charnes
  • Daniel Granot
  • Frieda Granot

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Computing-Related Activities
  • Integer Programming
  • Interdisciplinary Science
  • Mathematical Programming
  • Mathematics
  • Sharpness

Readers

  • Computational Modeling and Simulation
  • Computer Vision.
  • Mathematical Modeling and Probability Theory.