Computing bounds for the optimal value in linear programming

DOI10.1002/nav.3800240209zbMath0371.90098OpenAlexW2029443440MaRDI QIDQ4147869

Markku Kallio

Publication date: 1977

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800240209

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (4)

Weights improvement in column aggregation ⋮ A posteriori error bounds in linear programming aggregation ⋮ Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach ⋮ Solving large-scale linear programs by aggregation

Cites Work

• Generalized upper bounding techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing bounds for the optimal value in linear programming