Optimization Online


From CVaR to Uncertainty Set: Implications in Joint Chance Constrained Optimization

Melvyn Sim (dscsimm***at***nus.edu.sg)
Chung Piaw Teo (bizteocp***at***nus.edu.sg)
Wenqing Chen (chenwenqing***at***gmail.com)
Sun Jie (jsun***at***nus.edu.sg)

Abstract: In this paper we review the different tractable approximations of individual chance constraint problems using robust optimization on a varieties of uncertainty set, and show their interesting connections with bounds on the condition-value-at-risk CVaR measure popularized by Rockafellar and Uryasev. We also propose a new formulation for approximating joint chance constrained problems that improves upon the standard approach. The standard approach decomposes the joint chance constraint into a problem with m individual chance constraints and then applies safe robust optimization approximation on each one of them. Our approach builds on a classical worst case bound for order statistics problem, and is applicable even if the constraints are correlated. We provide an application of the model on a network resource allocation network with uncertain demand. The new chance constrained formulation led to more than 8-12% improvement over the standard approach.

Keywords: robust optimization, chance constraint, stochastic programming, conditional value at risk

Category 1: Robust Optimization

Category 2: Stochastic Programming

Citation: Working paper, NUS Business School

Download: [PDF]

Entry Submitted: 01/12/2007
Entry Accepted: 01/13/2007
Entry Last Modified: 01/18/2007

Modify/Update this entry

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


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