Page cuts for integer interval linear programming

DOI10.1016/0166-218X(79)90011-8zbMATH Open0416.90051MaRDI QIDQ754756FDOQ754756

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

• Title not available (Why is that?)
• Optimality and Degeneracy in Linear Programming
• An Algorithm for Solving Interval Linear Programming Problems
• Title not available (Why is that?)
• Trivial integer programs unsolvable by branch-and-bound
• A suboptimization method for interval linear programming: A new method for linear programming
• 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

Cited In (3)

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

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)