Justification of the dynamic programming method as applied to standardization-type problems (Q1571157)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Justification of the dynamic programming method as applied to standardization-type problems |
scientific article; zbMATH DE number 1472900
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Justification of the dynamic programming method as applied to standardization-type problems |
scientific article; zbMATH DE number 1472900 |
Statements
Justification of the dynamic programming method as applied to standardization-type problems (English)
0 references
18 February 2004
0 references
The authors prove sufficient conditions of existence, boundedness, lower semicontinuity, and continuity of the Bellman function for standardization-type problems in the form of a minimization function \(f(x)\) on the given set \(X\). As a result, the applicability of the dynamic programming method to standardization-type problems is rigorously proved.
0 references
dynamic programming
0 references
minimization problem
0 references
standardization
0 references
existence
0 references
continuity
0 references
0.9535349
0 references
0.91333544
0 references
0.87835366
0 references
0.8371737
0 references
0.83702505
0 references
0.8326623
0 references
