Page cuts for integer interval linear programming

DOI10.1016/0166-218X(79)90011-8MaRDI QIDQ754756zbMATHFDO

Authors 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 programminginteger matrixlinear relaxationcomputational experiencefinitely convergent cutting plane methodillustrative exampleinterval constraintspage cuts

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3175708 (Why is no real title available?)
• scientific article; zbMATH DE number 3410784 (Why is no real title available?)
• A finiteness proof for modified dantzig cuts in integer programming
• A suboptimization method for interval linear programming: A new method for linear programming
• An Algorithm for Solving Interval Linear Programming Problems
• An Explicit Solution of a Special Class of Linear Programming Problems
• Optimality and Degeneracy in Linear Programming
• Technical Note—Strengthened Dantzig Cuts for Integer Programming
• Trivial integer programs unsolvable by branch-and-bound

Cited in

(3)

• Complexity and computability of solutions to linear programming systems
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754756)