Sequential minimaxization under dynamic programming structure (Q1080369): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q238069 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Milan Vlach / rank | |||
Normal rank | |||
Revision as of 11:28, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sequential minimaxization under dynamic programming structure |
scientific article |
Statements
Sequential minimaxization under dynamic programming structure (English)
0 references
1985
0 references
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)].
0 references
sequential minimaximization
0 references
minimax theorem
0 references
separability
0 references
monotonicity
0 references
