Email this article 
Parametric Algorithm for Finding a Guaranteed Solution to a Quantile Optimization Problem
- Authors: Ivanov S.V.1, Kibzun A.I.1, Akmaeva V.N.1
-
Affiliations:
- Moscow Aviation Institute (National Research University)
- Issue: No 8 (2023)
- Pages: 73-87
- Section: Stochastic systems
- URL: https://journals.rcsi.science/0005-2310/article/view/142062
- DOI: https://doi.org/10.31857/S0005231023080056
- EDN: https://elibrary.ru/HBFTOO
- ID: 142062
Cite item
Open Access
Access granted
Subscription Access
Abstract
The problem of stochastic programming with a quantile criterion for a normal distribution is studied in the case of a loss function that is piecewise linear in random parameters and convex in strategy. Using the confidence method, the original problem is approximated by a deterministic minimax problem parameterized by the radius of a ball inscribed in a confidence polyhedral set. The approximating problem is reduced to a convex programming problem. The properties of the measure of the confidence set are investigated when the radius of the ball changes. An algorithm is proposed for finding the radius of a ball that provides a guaranteeing solution to the problem. A method for obtaining a lower estimate of the optimal value of the criterion function is described. The theorems are proved on the convergence of the algorithm with any predetermined probability and on the accuracy of the resulting solution.
About the authors
S. V. Ivanov
Moscow Aviation Institute (National Research University)
Email: sergeyivanov89@mail.ru
Moscow, Russia
A. I. Kibzun
Moscow Aviation Institute (National Research University)
Email: kibzun@mail.ru
Moscow, Russia
V. N. Akmaeva
Moscow Aviation Institute (National Research University)
Author for correspondence.
Email: akmaeva@mail.ru
Moscow, Russia
References
- Kibzun A.I., Kan Y.S. Stochastic Programming Problems with Probability and Quantile Functions. Chichester, New York, Brisbane, Toronto, Singapore: John Wiley & Sons, 1996.
- Кибзун А.И., Кан Ю.С. Задачи стохастического программирования с вероятностными критериями. М.: Физматлит, 2009.
- Кибзун А.И., Наумов А.В. Гарантирующий алгоритм решения задачи квантильной оптимизации // Космические исследования. 1995. Т. 33. № 2. С. 160-165.
- Наумов А.В., Иванов С.В. Исследование задачи стохастического линейного программирования с квантильным критерием // АиТ. 2011. № 2. С. 142-158.
- Кан Ю.С. Расширение задачи квантильной оптимизации с линейной по случайным параметрам функцией потерь // АиТ. 2020. № 12. С. 67-81.
- Васильева С.Н., Кан Ю.С. Метод решения задачи квантильной оптимизации с билинейной функцией потерь // АиТ. 2015. № 9. С. 83-101.
- Васильева С.Н., Кан Ю.С. Аппроксимация вероятностных ограничений в задачах стохастического программирования с использованием ядра вероятностной меры // АиТ. 2019. № 11. C. 93-107.
- Pr'ekopa A. Stochastic Programming. Dordrecht-Boston: Kluwer, 1995.
- Shapiro A., Dentcheva D., Ruszczyn'ski A. Lectures on Stochastic Programming. Modeling and Theory. Philadelphia: Society for Industrial and Applied Mathematics (SIAM), 2014.
- Lejeune M.A., Pr'ekopa A. Relaxations for Probabilistically Constrained Stochastic Programming Problems: Review and Extensions // Ann. Oper. Res. 2018. https://doi.org/10.1007/s10479-018-2934-8
- Dentcheva D., Pr'ekopa A., Ruszczyn'ski A. On Convex Probabilistic Programming with Discrete Distributions // Nonlinear Anal.-Theor. 2001. V. 47. No. 3. P. 1997-2009.
- Van Ackooij W., Berge V., de Oliveira W., Sagastiza'bal C. Probabilistic Optimization via Approximate p-E cient Points and Bundle Methods // Comput. Oper. Res. 2017. V. 77. P. 177-193.
- Иванов С.В., Кибзун А.И. Общие свойства двухэтапных задач стохастического программирования с вероятностными критериями // АиТ. 2019. № 6. С. 70-90.
- Boyd S., Vandenberghe L. Convex Optimization. Cambridge: University Press, 2009.
- Ширяев А.Н. Вероятность. М.: МЦНМО, 2017.
Supplementary files
