Chance constrained programming: Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
Alter: pages, issue. Added issue. Formatted dashes. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Stochastic optimization | #UCB_Category 13/27
Link suggestions feature: 2 links added.
Line 20:
 
== Solution Approaches ==
To solve CCP problems, the [[stochastic optimization]] problem is often relaxed into an equivalent deterministic problem. There are different approaches depending on the nature of the problem:
* '''Linear CCP''': For linear systems, the feasible region is typically convex, and the problem can be solved using [[linear programming]] techniques.
* '''Nonlinear CCP''': For nonlinear systems, the main challenge lies in computing the probabilities and their gradients. These problems often require [[nonlinear programming]] solvers.
* '''Dynamic Systems''': Dynamic systems involve time-dependent uncertainties, and the solution approach must account for the [[propagation of uncertainty]] over time.<ref name=pu/>
 
== Practical Applications ==