IDEAS home Printed from
   My bibliography  Save this paper

Optimization Under First Order Stochastic Dominance Constraints


  • Darinka Dentcheva

    (Stevens Institute of Technology)

  • Andrzej Ruszczynski

    (Rutgers University)


We consider stochastic optimization problems involving stochastic dominance constraints of first order, also called stochastic ordering constraints. They are equivalent to a continuum of probabilistic constraints or chance constraints. We develop first order necessary and sufficient conditions of optimality for these models. We show that the Lagrange multipliers corresponding to stochastic dominance constraints are piecewise constant nondecreasing utility functions. These results extend our theory of stochastic dominance-constrained optimization to the first order case, in which the main challenge is the potential non- convexity of the problem. We also show that the convexification of stochastic ordering relation is equivalent to second order stochastic dominance under rather weak assumptions. This paper appeared as "Semi-Infinite Probabilistic Optimization: First Order Stochastic Dominance Constraints" in "Optimization" 53(2004) 583-- 601.

Suggested Citation

  • Darinka Dentcheva & Andrzej Ruszczynski, 2004. "Optimization Under First Order Stochastic Dominance Constraints," GE, Growth, Math methods 0403002, University Library of Munich, Germany, revised 07 Aug 2005.
  • Handle: RePEc:wpa:wuwpge:0403002
    Note: Type of Document - pdf; prepared on WinXP; to print on any;

    Download full text from publisher

    File URL:
    Download Restriction: no

    References listed on IDEAS

    1. Ronald E. Gangnon & William N. King, 2002. "Minimum distance estimation of the distribution functions of stochastically ordered random variables," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 51(4), pages 485-492, October.
    2. A. Charnes & W. W. Cooper & G. H. Symonds, 1958. "Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil," Management Science, INFORMS, vol. 4(3), pages 235-263, April.
    3. Hadar, Josef & Russell, William R, 1969. "Rules for Ordering Uncertain Prospects," American Economic Review, American Economic Association, vol. 59(1), pages 25-34, March.
    4. Darinka Dentcheva & Andrzej Ruszczynski, 2004. "Convexification of Stochastic Ordering," GE, Growth, Math methods 0402005, University Library of Munich, Germany, revised 05 Aug 2005.
    Full references (including those not matched with items on IDEAS)

    More about this item


    Stochastic dominance; stochastic ordering; stochastic programming; utility functions; semi-infinite optimization; optimality conditions; convexification.;

    JEL classification:

    • C6 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling
    • D5 - Microeconomics - - General Equilibrium and Disequilibrium
    • D9 - Microeconomics - - Micro-Based Behavioral Economics

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpge:0403002. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.