Primal Decomposition of Mathematical Programs by Resource Allocation: I—Basic Theory and a Direction-Finding Procedure

DOI10.1287/OPRE.20.1.58zbMath0249.90058OpenAlexW2069725198MaRDI QIDQ5663657

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.58

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (7)

A hierarchical decomposition for large-scale optimal control problems with parallel processing structure ⋮ Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs ⋮ Hierarchical multi-objective decision systems for general resource allocation problems ⋮ On a stochastic program with simple recourse ⋮ Multilevel decomposition of nonlinear programming problems by dynamic programming ⋮ Multiple Modular Design Over a Finite Time Horizon ⋮ Optimization with an approximate Lagrangian

This page was built for publication: Primal Decomposition of Mathematical Programs by Resource Allocation: I—Basic Theory and a Direction-Finding Procedure