A generalized upper bounding method for doubly coupled linear programs

DOI10.1002/NAV.3800170402MaRDI QIDQ5663641zbMATH OpenOpenAlexFDO

Authors J. K. Hartman, Leon 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)

Cites work

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

Cited in

(6)

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

This page was built for publication: A generalized upper bounding method for doubly coupled linear programs

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