A JuMP extension for probabilistic (chance) constraints
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
doc
src
test
.travis.yml
LICENSE.md
NEWS.md
README.md
REQUIRE
appveyor.yml

README.md

JuMPChance

Build Status Build Status Coverage Status

JuMPChance (formerly CCJuMP) is an extension to JuMP for formulating and solving optimization problems with chance constraints (also known as probabilistic constraints). JuMPChance currently supports only a particular class of chance constraints involving affine combinations of jointly normal random variables, a classical formulation that's known to be efficiently solvable by using second-order conic programming (SOCP) (although JuMPChance also provides an outer-approximation algorithm which solves a sequence of linear problems).

JuMPChance supports an extension of the classical model to distributionally robust (or ambiguous) chance constraints where the parameters of the normal distributions are known to fall in a symmetric interval or more general uncertainty set.

See the documentation for installation installation instructions, a quick start guide, and a more detailed discussion of the methods implemented.

Please cite JuMPChance using DOI.