Multilevel decomposition of nonlinear programming problems by dynamic programming

DOI10.1016/0022-247X(76)90141-4zbMath0395.90065MaRDI QIDQ1253184

Katsuhisa Ohno, Masao Fukushima, Hisashi Mine

Publication date: 1976

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

zbMATH Keywords

Nonlinear ProgrammingDynamic ProgrammingLarge-Scale Optimization ProblemsMultilevel Decomposition

Mathematics Subject Classification ID

Nonlinear programming (90C30) Dynamic programming (90C39)

Related Items

Differential dynamic programming and separable programs, Decomposition of nonlinear chance-constrained programming problems by dynamic programming, Decomposition of multiple criteria mathematical programming problems by dynamic programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decomposition method for structured linear and nonlinear programs
• Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms
• The Simplex Method for Quadratic Programming
• The Decomposition Algorithm for Linear Programs
• Two-Level Planning
• Functional Decomposition and Switching Circuit Design
• Scheduling to Minimize Interaction Cost
• A Representation Theorem for Continuous Functions of Several Variables
• Parametric Optimization by Primal Method in Multilevel Systems
• Duality and Decomposition in Mathematical Programming
• Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• Necessary and Sufficient Conditions for Dynamic Programming of Combinatorial Type
• On an Allocation Problem with Multistage Constraints
• Primal Decomposition of Mathematical Programs by Resource Allocation: I—Basic Theory and a Direction-Finding Procedure