-

 

 

 




Optimization Online





 

Convexification of Stochastic Ordering

Darinka Dentcheva (ddentche***at***stevens.edu)
Andrzej Ruszczynski (rusz***at***rutcor.rutgers.edu)

Abstract: We consider sets defined by the usual stochastic ordering relation and by the second order stochastic dominance relation. Under fairy general assumptions we prove that in the space of integrable random variables the closed convex hull of the first set is equal to the second set.

Keywords: Stochastic Dominance, Convexity

Category 1: Stochastic Programming

Category 2: Convex and Nonsmooth Optimization

Category 3: Applications -- OR and Management Sciences (Finance and Economics )

Citation:

Download: [PDF]

Entry Submitted: 02/14/2004
Entry Accepted: 02/17/2004
Entry Last Modified: 08/05/2005

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society