2011
DOI: 10.4236/ajor.2011.14023
|View full text |Cite
|
Sign up to set email alerts
|

Multiobjective Stochastic Linear Programming: An Overview

Abstract: Many Optimization problems in engineering and economics involve the challenging task of pondering both conflicting goals and random data. In this paper, we give an up-to-date overview of how important ideas from optimization, probability theory and multicriteria decision analysis are interwoven to address situations where the presence of several objective functions and the stochastic nature of data are under one roof in a linear optimization context. In this way users of these models are not bound to caricatur… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
11
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 16 publications
(11 citation statements)
references
References 68 publications
0
11
0
Order By: Relevance
“…Findings from several research works [5] leave no doubt about the fact that these values may be useful in providing the range of possible outcomes. Nevertheless, they ignore such important factors as the size and the probability of deviation outside the likely range as well as other aspects concerning the dispersions of involved probabilities.…”
Section: Stochastic Multiobjective Programming Problemsmentioning
confidence: 99%
“…Findings from several research works [5] leave no doubt about the fact that these values may be useful in providing the range of possible outcomes. Nevertheless, they ignore such important factors as the size and the probability of deviation outside the likely range as well as other aspects concerning the dispersions of involved probabilities.…”
Section: Stochastic Multiobjective Programming Problemsmentioning
confidence: 99%
“…From literature [21][22][23], we know that if the transition probability matrix P is irreducible and non-periodic, From definition 1, 3, 4, 5 and equation (7), we can see that the matrix P is positive transition matrix, hence, matrix P is irreducible and non-periodic [24], therefore, CI will converge to a reasonable value.…”
Section: The Formulation Of Ciam-mcmmentioning
confidence: 99%
“…An elegant way to find the optimal control actions for each state is provided by the classical value or policy iteration algorithms [1][2][3][4][5][6][7][8][9][10][11]. The value iteration (VI) algorithm is arguably the most popular algorithm, in part because of its simplicity and ease of implementation.…”
Section: Introductionmentioning
confidence: 99%