Page cuts for integer interval linear programming

DOI10.1016/0166-218X(79)90011-8zbMath0416.90051MaRDI QIDQ754756

A. Charnes, Ronald D. Armstrong, Fred Y. Phillips

Publication date: 1979

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

integer linear programmingcomputational experienceinteger matrixlinear relaxationfinitely convergent cutting plane methodillustrative exampleinterval constraintspage cuts

Mathematics Subject Classification ID

Integer programming (90C10) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items (3)

Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective ⋮ A simple finite cutting plane algorithm for integer programs ⋮ Complexity and computability of solutions to linear programming systems

Cites Work

• Unnamed Item
• Unnamed Item
• A suboptimization method for interval linear programming: A new method for linear programming
• An Algorithm for Solving Interval Linear Programming Problems
• Trivial integer programs unsolvable by branch-and-bound
• An Explicit Solution of a Special Class of Linear Programming Problems
• A finiteness proof for modified dantzig cuts in integer programming
• Technical Note—Strengthened Dantzig Cuts for Integer Programming
• Optimality and Degeneracy in Linear Programming

This page was built for publication: Page cuts for integer interval linear programming