Sequential minimaxization under dynamic programming structure

DOI10.1016/0022-247X(85)90023-XzbMath0598.90089OpenAlexW1992576247MaRDI QIDQ1080369

Seiichi Iwamoto

Publication date: 1985

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(85)90023-x

zbMATH Keywords

monotonicityseparabilityminimax theoremsequential minimaximization

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (1)

Iterative integral versus dynamic programming

Cites Work

• Reverse function, reverse program, and reverse theorem in mathematical programming
• Inverse theorem in dynamic programming. III
• Categorical axiomatics of dynamic programming
• Dynamic programming and principles of optimality
• Monotonicity and the principle of optimality
• On the maximum transform
• On a new functional transform in analysis: The maximum transform
• Mathematical Programming and the Maximum Transform
• On the maximum transform and semigroups of transformations
• Composition Principles for Synthesis of Optimal Multistage Processes
• Scheduling to Minimize Interaction Cost
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sequential minimaxization under dynamic programming structure