---
title: Chance constrained programming
slug: chance-constrained-programming
qid: 
snapshot: enwiki-001361551980
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1361551980
tags: [23603337, 26220375, 26709330]
---

# Chance constrained programming

> [!note] Provenance
> Snapshot `enwiki-001361551980` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1361551980> · Licensed CC BY-SA 4.0

Chance constrained programming (CCP) is a mathematical optimization approach used to handle problems under uncertainty. It was first introduced by Charnes and Cooper in 1959 and further developed by Miller and Wagner in 1965. CCP is widely used in various fields, including finance, engineering, and operations research, to optimize decision-making processes where certain constraints need to be satisfied with a specified probability.

Chance constrained programming (CCP) is a mathematical optimization approach used to handle problems under uncertainty. It was first introduced by Charnes and Cooper in 1959 and further developed by Miller and Wagner in 1965. CCP is widely used in various fields, including finance, engineering, and operations research, to optimize decision-making processes where certain constraints need to be satisfied with a specified probability. \text{s.t. } g(x, u, \xi) = 0, \Pr\{ h(x, u, \xi) \geq 0 \} \geq \alpha Here, f is the objective function, g represents the equality constraints, h represents the inequality constraints, x represents the state variables, u represents the control variables, \xi represents the uncertain parameters, and \alpha is the confidence level. Common objective functions in CCP involve minimizing the expected value of a cost function, possibly combined with minimizing the variance of the cost function.
