Duality and Decomposition in Mathematical Programming

DOI10.1109/TSSC.1968.300135zbMath0181.22804OpenAlexW2130300008MaRDI QIDQ5571496

L. S. Lasdon

Publication date: 1968

Published in: IEEE Transactions on Systems Science and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tssc.1968.300135

zbMATH Keywords

operations research

Related Items (18)

Lagrangian coordination and analytical target cascading: Solving ATC-decomposed problems with Lagrangian duality ⋮ On max‐min problems ⋮ A unified theory of optimal multi-level control ⋮ Optimal decentralized control of dynamic systems ⋮ Extension of dual coordination to a class of non-linear systems ⋮ Comments on “ Extension of dual coordination to a class of non-linear systems ” ⋮ Uncertain random multilevel programming with application to production control problem ⋮ Decentralized control systems theory A critical evaluation ⋮ The Lagrange method and SAO with bounds on the dual variables ⋮ On the periodic coordination of linear stochastic systems ⋮ Multilevel methodology for a class of non-separable optimization problems ⋮ An interaction-coordination algorithm with modified performance index for nonlinear optimal control problems ⋮ Multilevel decomposition of nonlinear programming problems by dynamic programming ⋮ On coordination strategies for the interaction prediction principle using gradient and multiplier methods ⋮ Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms ⋮ Decomposition in separable geometric programming ⋮ Conjugate convex functions, duality, and optimal control problems. I: Systems governed by ordinary differential equations ⋮ Envelope programming and a minimax theorem

This page was built for publication: Duality and Decomposition in Mathematical Programming