# Stochastic program

### From Glossary

It is written in the form of a mathematical program extended to a parameter space whose values are random variables (generally with known distribution function). This is converted to a standard form by forming a ** certainty equivalent**.

- Here are some certainty equivalents:
*Average value*. Replace all random variables with their means.*Chance constraint*. Given a stochastic program with a random variable, p, in its constraint: a*certainty equivalent*is to replace this with the constraint, where is a (known) probability function on the range of , and is some*acceptance level*( means the constraint must hold*for all*values of , except on a set of measure zero). Some models separate constraints with several levels:

The case of one chance constraint with the only random variable being the right-hand side is particularly simple. Suppose is the cumulative distribution function of for the chance constraint If is a continuous random variable and is continuous and strictly increasing, the chance constraint is equivalent to (where is the inverse function of ). In particular, if the program remains linear.*Recourse model*. This assumes decisions are made over time where the effect of an early decision can be compensated by later decisions. The objective is to optimize the expected value. The 2-stage model has the form:

(Sums could be replaced by other operators.) Once is implemented, becomes known and is chosen. The certainty equivalent is: where

for all p2 (except on set of measure zero). (E[] denotes the expected value.) The 'Sup' is used to define the second stage value for a particular value of because the choice of might be infeasible. The nature of the recourse model is pessimistic: must be chosen such that the original constraints hold no matter what the values of the random variables. With a finite number of possibilities, this means a system of constraints for each possible realization of This extends recursively to a k-stage model. The linear 2-stage recourse model has the form:

where

Here the second stage variable is denoted it is determined after has been set and the random variable has been realized. The LP data depend on as functions, and The*fixed recourse*model has The*complete recourse*model assumes it fixed and is all of (where = number of rows of ). This means that no matter what value of is chosen for the first stage, there is feasible recourse This is*simple recourse*if so we can think of y as having two parts: and The second stage LP simplifies to the following:

Also see robust optimization. The certainty equivalent depends upon the underlying decision process. If it is adaptive, the recourse model applies (but RO might be more practical). The chance constraint model represents a notion of an allowed frequency of violations, as in environmental control models.