Sequential minimaxization under dynamic programming structure

DOI10.1016/0022-247X(85)90023-XMaRDI QIDQ1080369zbMATH OpenOpenAlexFDO

Authors 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

minimax theoremmonotonicityseparabilitysequential minimaximization

Mathematics Subject Classification ID

Dynamic programming (90C39)

Review text

First a principle of dynamic programming is presented and compared with analogous propositions of Mitten, Nemhauser, and Clement. Then a minimax theorem is established without convex-concavity assumptions. These assumptions are replaced by separability and monotonicity in the sense of \textit{L. Mitten} [Oper. Res. 12, 610-619 (1964; Zbl 0127.365)] and \textit{G. L. Nemhauser} [Introduction to dynamic programming (1966)].

Recommendations

• Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints
• A class of nonseparable dynamic programming problems
• scientific article; zbMATH DE number 4020856
• From dynamic programming to bynamic programming
• Theory and applications of generalized dynamic programming: An overview

Cites work

• Categorical axiomatics of dynamic programming
• Composition Principles for Synthesis of Optimal Multistage Processes
• Dynamic programming and principles of optimality
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3718842 (Why is no real title available?)
• scientific article; zbMATH DE number 3503242 (Why is no real title available?)
• scientific article; zbMATH DE number 3288230 (Why is no real title available?)
• scientific article; zbMATH DE number 3073200 (Why is no real title available?)
• Inverse theorem in dynamic programming. III
• Mathematical Programming and the Maximum Transform
• Monotonicity and the principle of optimality
• On a new functional transform in analysis: The maximum transform
• On the maximum transform
• On the maximum transform and semigroups of transformations
• Reverse function, reverse program, and reverse theorem in mathematical programming
• Scheduling to Minimize Interaction Cost

Cited in

(5)

• Iterative integral versus dynamic programming
• Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints
• scientific article; zbMATH DE number 3856802 (Why is no real title available?)
• scientific article; zbMATH DE number 4020856 (Why is no real title available?)
• scientific article; zbMATH DE number 175722 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1080369)