Max-plus algebra and mathematical fear in dynamic optimization (Q1583983)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1523576
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Max-plus algebra and mathematical fear in dynamic optimization |
scientific article; zbMATH DE number 1523576 |
Statements
Max-plus algebra and mathematical fear in dynamic optimization (English)
0 references
22 March 2001
0 references
The reviewed paper is devoted to the max-plus algebra, a special case of Maslov's idempotent algebras, consisting of the set \(\overline R = R \cup \{ -\infty \}\) endowed with the operations \(\max\) and \(+\). Basic notions of the max-plus algebra and the corresponding linear algebra are presented. Its applications for solving a production scheduling problem as well as for discrete dynamic programming are illustrated. Interrelations between cost and probability measures are shown and the notion of Mathematical Fear -- an analogue of expectation -- are introduced and analyzed. Some applications for design and control in the imperfect information case are outlined.
0 references
max-plus algebra
0 references
cost measures
0 references
mathematical fear
0 references
control in imperfect information
0 references
production scheduling
0 references
discrete dynamic programming
0 references
0.8357483148574829
0 references
0.8041571378707886
0 references
0.7683974504470825
0 references
0.7655026912689209
0 references
