DEPARTMENT OF MECHANICS AND APPLIED MATHEMATICS
HEAD OF THE PROJECT Riho LEPP, Ph.D.
Two types of stochastic programming (SP) models are widely known: two-stage SP-s (or stochastic programs with recourse) and chance-constrained (or probabilistic) SP-s. Last ones include the probability function
)
) = P { f (x,
) <
}
where is a random parameter and x is the control parameter. The problem is to maximize
)
.
The inverse to the problem (1), the quantile minimization problem is defined in such a way that the probability level
,
< 1
:
(x) =
min
{ v (x,
)
}
,
and then to minimize (x)
Both problems (1), (2) are mathematically quite uncomfortable to handle:
)
(x)
and to function
)
)
(x)
The mathematical model of the correction is given by the following recursion relation:
) =
0 + x (1 +
1)
0
1
0
0
1
(x)
(x) = min
{
: P (
| | d (x,
) |
}
and the quantile minimization problem is for this model the following: minimize over certain class of strategies )
(x)
is near to 1, e.g.
= 0,9999
In general, there are two ways to find an optimal strategy: mean square and minimax ones. If the fixed probability level
is around 0,9 then differences between the two strategies are quite small, but in the case of
0,999
and
of mean square and minimax straregies in the figure for correction of the satellite orbit (3), respectively.
10/04/1998 webmaster