A generalized upper bounding method for doubly coupled linear programs

DOI10.1002/nav.3800170402zbMath0249.90044OpenAlexW2090968592MaRDI QIDQ5663641

J. K. Hartman, L. S. Lasdon

Publication date: 1970

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

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

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

Dynamic factorization in large-scale optimization, Modeling of building evacuation problems by network flows with side constraints, The basis suppression method, The factorization approach to large-scale linear programming, Compact LP bases for a class of IP problems, Linear programming for weighted deviation problems using compact basis techniques

Cites Work

• Generalized upper bounding techniques
• A decomposition method for structured linear and nonlinear programs