Optimization Online


Ambiguous Probabilistic Programs

Zhaolin Hu(huzhaolin***at***gmail.com)
Jeff L Hong(hongl***at***ust.hk)
Man-Cho Anthony So(manchoso***at***se.cuhk.edu.hk)

Abstract: Probabilistic programs are widely used decision models. When implemented in practice, however, there often exists distributional ambiguity in these models. In this paper, we model the ambiguity using the likelihood ratio (LR) and use LR to construct various ambiguity sets. We consider ambiguous probabilistic programs which optimize under the worst case. Ambiguous probabilistic programs can be classified as ambiguous probability minimization problems (PM) and ambiguous chance constrained programs (CCP). We show that the ambiguous PM can be transformed to a pure PM under the nominal distribution, and that the ambiguous CCP can be transformed to a pure CCP with only the confidence level being rescaled from the original CCP. Our study indicates that ambiguous probabilistic programs with ambiguity modeled by LR essentially have the same complexity as the corresponding pure probabilistic programs and that risk and uncertainty have strong connections in probabilistic programs.

Keywords: probability minimization, chance constrained program, ambiguity, distributionally robust optimization

Category 1: Stochastic Programming

Category 2: Robust Optimization


Download: [PDF]

Entry Submitted: 09/10/2013
Entry Accepted: 09/10/2013
Entry Last Modified: 09/10/2013

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 Optimization Society