Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms

DOI10.1016/0022-247X(70)90303-3zbMath0205.47903OpenAlexW1976388415MaRDI QIDQ2542395

Katsuhisa Ohno, Hisashi Mine

Publication date: 1970

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(70)90303-3

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Dynamic programming (90C39)

Related Items (9)

Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms ⋮ Parallel processing of optimal-control problems by dynamic programming ⋮ Differential dynamic programming and separable programs ⋮ Decomposition of nonlinear chance-constrained programming problems by dynamic programming ⋮ Comparison of generalized geometric programming algorithms ⋮ Multilevel decomposition of nonlinear programming problems by dynamic programming ⋮ Decomposition of multiple criteria mathematical programming problems by dynamic programming ⋮ A dynamic approach to multiple-objective resource allocation problem ⋮ Fuzzy dynamic programming approach to hybrid multiobjective multistage decision-making problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic programming. Sequential scientific management
• Decomposition Principle for Linear Programs
• Composition Principles for Synthesis of Optimal Multistage Processes
• Decomposition of linear programs by dynamic programming
• Scheduling to Minimize Interaction Cost
• Decomposition of Large-Scale Systems
• Optimization and Suboptimization: The Method of Extended Models in the Non-Linear Case
• Generalized Polynomial Optimization
• An Algorithm for Separable Nonconvex Programming Problems
• Decentralization in Separable Programming
• Structuring of Parallel Algorithms
• Parametric Optimization by Primal Method in Multilevel Systems
• Duality and Decomposition in Mathematical Programming

This page was built for publication: Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms