Page Cuts for Integer Interval Linear Programming.
TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES
Pagination or Media Count:
In this paper a cutting plane algorithm is developed to solve Integer Interval Linear Programming IILPs. As in other cutting plane algorithms the integer restrictions are dropped first and the resulting interval programming problem is solved. The cuts which are constructed are valid cuts since an optimal noninteger solution will be eliminated but all feasible integer solutions will satisfy the cut constraint.
- Theoretical Mathematics