Primal Decomposition of Mathematical Programs by Resource Allocation: II—Computational Algorithm with an Application to the Modular Design Problem

DOI10.1287/opre.20.1.75zbMath0249.90059OpenAlexW2133064020MaRDI QIDQ5663658

Gary J. Silverman

Publication date: 1972

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.20.1.75

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Generalized bilinear programming. I: Models, applications and linear programming relaxation, Methods of parametric non-linear programming, Multiple Modular Design Over a Finite Time Horizon