.png){kind=icon}
Return
Discrete dynamic programming with outcomes in random variable structures
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2005.10.019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multiobjective approach is the common way of generalization single-criterion dynamic programming models. Another way is to consider partially ordered criteria structures. That approach is rather rare. The aim of the paper is to present such a model. Generalization of Bellman's principle of optimality is employed to create a forward procedure to find the set of all maximal elements. As this set is usual large, the second problem under consideration is to find its subsets. To reduce the number of solutions presented to decision maker we propose to apply a family of narrowing relations. That approach is similar to scalarization in multiobjective programming. Ordered structures of random variables based on mean-variance, stochastic dominance and inverse stochastic dominance are considered. Numerical illustration is given at the end of the paper. (c) 2005 Elsevier B.V. All rights reserved.
Keywords:
dynamic programming
discrete optimization
multiobjective decision making
stochastic orders
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveCarbon-bonded carbon fiber composites containing uniformly distributed silicon carbide.png)
RSC Advances
RSC AdvancesIF0
PREAI
ShareSave
ShareSave
View more