Informatics and Applications
2018, Volume 12, Issue 2, pp 60-68
A VISUALIZATION ALGORITHM FOR THE PLANE PROBABILITY MEASURE KERNEL
- S. N. Vasil'eva
- Yu. S. Kan
Abstract
The authors propose an algorithm for constructing a probability measure kernel polyhedral approximation for a two-dimensional random vector with independent components. The kernel is one of the important concepts used in algorithms for solving stochastic programming problems with probabilistic criteria. The kernel is most effectively used in cases when the statements of the indicated problems have the property of linearity with respect to random parameters. Because of linearity, the maximum in random parameters is determined by searching all vertices of the approximating polyhedron. The authors propose an algorithm for constructing a polyhedral approximation of the kernel of a probability measure for a two-dimensional random vector with independent components. The algorithm is based on construction of the intersection of a finite number of confidence half-spaces, the parameters of which are estimated by the Monte-Carlo method. The result of the proposed algorithm is the definition of the set of vertices of the approximating polyhedron. Approximation of the nucleus is their convex hull. The results of calculations for a number of typical continuous distribution laws are presented.
[+] References (9)
- Kibzun, A. I., and Yu. S. Kan. 2009. Zadachi stokhasticheskogo programmirovaniya s veroyatnostnymi kriteriyami
[Stochastic programming problems with probabilistic criteria]. Moscow: Fizmatlit. 372 p.
- Malyshev, V.V., and A.I. Kibzun. 1987. Analiz i sintez vysokotochnogo upravleniya letatel'nymi apparatami
[Analysis and synthesis of high-precision aircraft control].
Moscow: Mashinostroenie. 303 p.
- Kan, Yu. S., and A. V. Rusyaev 1998. Quantile minimization with bilinear loss function. Automat. Rem. Contr.
59(7(1)):960-966.
- Kan, Yu. S., and R. T. Surinov. 2004. O neravenstve
treugol'nika dlya kriteriya VaR [On the triangle inequality
for the VAR criterion]. Modeling and Analysis of Safety and
Risk in Complex Systems: Scientific School (International) MASR-2004 Proceedings. St. Petersburg: SPbGUAP 10.
243-248.
- Kibzun, A. I., and V. Yu. Kurbakovskiy. 1991. Guaranteeing approach to solving quantile optimization problem.
Ann. Oper. Res. 30:81-93.
- Kibzun, A.I., and V. Yu. Kurbakovskij. 1992. Chislennye algoritmy kvantil'noy optimizatsii i ikh primenenie
k resheniyu zadach s veroyatnostnymi ogranicheniyami
[Numerical algorithms for quantitative optimization and
their application to solving problems with probability constraints]. J. Comput. Sys. Sc. Int. 1:75-81.
- Van Moeseke, P 1965. Stochastic linear programming.
Yale Econ. Essays 5:197-253.
- Vasil'eva, S. N., and Yu. S. Kan. 2015. A method for solving quantile optimization problems with a bilinear loss
function. Automat. Rem. Contr. 76(9):1582-1597.
- Vasil'eva, S.N., and Yu. S. Kan. 2017. Linearization
method for solving quantile optimization problems with
loss function depending on a vector of small random
parameters. Automat. Rem. Contr. 78(7):1248-1260.
[+] About this article
Title
A VISUALIZATION ALGORITHM FOR THE PLANE PROBABILITY MEASURE KERNEL
Journal
Informatics and Applications
2018, Volume 12, Issue 2, pp 60-68
Cover Date
2018-05-30
DOI
10.14357/19922264180209
Print ISSN
1992-2264
Publisher
Institute of Informatics Problems, Russian Academy of Sciences
Additional Links
Key words
quantile optimization problem; linearization method; probability measure kernel
Authors
S. N. Vasil'eva  and Yu. S. Kan
Author Affiliations
Moscow Aviation Institute (National Research University), 4 Volokolamskoe Shosse, Moscow 125993, Russian Federation
|