Revision as of 17:13, 3 August 2024 edit Alaexis (talk \| contribs) Extended confirmed users, Pending changes reviewers 18,882 edits No edit summary ← Previous edit		Revision as of 17:13, 3 August 2024 edit undo Alaexis (talk \| contribs) Extended confirmed users, Pending changes reviewers 18,882 edits No edit summary Next edit →
Line 1: '''Chance Constrained Programming (CCP)''' is a mathematical optimization technique used to handle problems under uncertainty. It was first introduced by [[Abraham Charnes\|Charnes]] and [[William W. Cooper\|Cooper]] in 1959 and further developed by Miller and Wagner in 1965.<ref>{{cite journal \|last1=Charnes \|first1=Abraham \|last2=Cooper \|first2=William W. \|title=Chance-Constrained Programming \|journal=Management Science \|date=1959 \|volume=6 \|issue=1 \|pages=73-79 \|doi=10.1287/mnsc.6.1.73}}</ref> ~~and further developed by Miller and Wagner in 1965~~<ref>{{cite journal \|last1=Miller \|first1=L. R. \|last2=Wagner \|first2=H. M. \|title=Chance-constrained programming with joint constraints \|journal=Operations Research \|date=1965 \|volume=13 \|issue=6 \|pages=930-945 \|doi=10.1287/opre.13.6.930}}</ref>. 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. == Theoretical Background ==

Chance constrained programming: Difference between revisions