2012
DOI: 10.1016/j.ejor.2011.07.044
|View full text |Cite
|
Sign up to set email alerts
|

Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 22 publications
(15 citation statements)
references
References 24 publications
0
15
0
Order By: Relevance
“…As a relation of model (11), model (12) has a larger set of feasible solutions and subsequently its optimal value gives a lower bound for model. Besides, the relaxed model is more likely to satisfy the Slater condition which is closely related to numerical stability [9].…”
Section: The Second Order Stochastic Dominance Modelmentioning
confidence: 99%
See 4 more Smart Citations
“…As a relation of model (11), model (12) has a larger set of feasible solutions and subsequently its optimal value gives a lower bound for model. Besides, the relaxed model is more likely to satisfy the Slater condition which is closely related to numerical stability [9].…”
Section: The Second Order Stochastic Dominance Modelmentioning
confidence: 99%
“…the probability distribution of ξ [9]. The constraints of model (7) are based on the definition of second order stochastic dominance, Fábián [7] and Ogryczak [22] prove that the constraint g(x, ξ) 2 g(y, ξ) is equivalent to the following two inequalities:…”
Section: The Second Order Stochastic Dominance Modelmentioning
confidence: 99%
See 3 more Smart Citations