Aspects of optimization with stochastic dominance
William B. Haskell (),
J. George Shanthikumar () and
Z. Max Shen ()
Additional contact information
William B. Haskell: National University of Singapore
J. George Shanthikumar: Purdue University
Z. Max Shen: University of California Berkeley
Annals of Operations Research, 2017, vol. 253, issue 1, No 12, 247-273
Abstract:
Abstract We consider stochastic optimization problems with integral stochastic order constraints. This problem class is characterized by an infinite number of constraints indexed by a function space of increasing concave utility functions. We are interested in effective numerical methods and a Lagrangian duality theory. First, we show how sample average approximation and linear programming can be combined to provide a computational scheme for this problem class. Then, we compute the Lagrangian dual problem to gain more insight into this problem class.
Keywords: Stochastic dominance; Convex optimization; Sample average approximation; Duality (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://link.springer.com/10.1007/s10479-016-2299-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:253:y:2017:i:1:d:10.1007_s10479-016-2299-9
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1007/s10479-016-2299-9
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().