On Improving Bounds for Variables in Linear Integer Programs by Surrogate Constraints.
TEXAS UNIV AUSTIN CENTER FOR CYBERNETIC STUDIES
Pagination or Media Count:
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
- Operations Research