.png){kind=icon}
Return
Dynamic programming with ordered structures: Theory, examples and applications
.png){kind=icon}
PRE
AI
DOI：10.1016/j.fss.2010.03.012.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The paper presents a dynamic, discrete optimization model with returns in ordered structures. It generalizes multiobjective methods used in vector optimization in two ways: from real vector spaces to ordered structures and from the static model to the dynamic model. The proposed methods are based on isotone homomorphisms. These methods can be applied in dynamic programming with returns in ordered structures. The provided numerical example shows an application of fuzzy numbers and random variables with stochastic dominance in dynamic programming. The paper also proposes applications in the following problems: a problem of allocations in the market model, a location problem, a railway routing problem, and a single-machine scheduling problem. (C) 2010 Elsevier B.V. All rights reserved.
Keywords:
Dynamic programming
Multiobjective programming
Ordered structures
Fuzzy numbers
Stochastic dominance
Journal
IF:
2.7
Papers:
7.6K
Citations:
1.5W
Organization
No organization information available
Cited Papers
ShareSaveShareSave05.15: Development of circular tube slenderness classifications under axial and bending actions.png)
ce/papers
ce/papersIF0
PREAI
ShareSaveShareSave
View more