Abstract
AbstractA risk-aware decision-making problem can be formulated as a chance-constrained linear program in probability measure space. Chance-constrained linear program in probability measure space is intractable, and no numerical method exists to solve this problem. This paper presents numerical methods to solve chance-constrained linear programs in probability measure space for the first time. We propose two solvable optimization problems as approximate problems of the original problem. We prove the uniform convergence of each approximate problem. Moreover, numerical experiments have been implemented to validate the proposed methods.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization
Reference37 articles.
1. Berthold, H., Heitsch, H., Henrion, R., Schwienteck, J.: On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints. Math. Methods Oper. Res. 96, 1–37 (2022)
2. Blackmore, L., Ono, M., Williams, B.C.: Chance-constrained optimal path planning with obstacles. IEEE Trans. Rob. 27(6), 1080–1094 (2011)
3. Bertsekas, D.P., Tsitsiklis, J.N.: Introduction to Probability. Athena Scientific, Belmont (2002)
4. Billingsley, P.: Probability and Measure. John Wiley & Sons, New York (1995)
5. Calariore, G., Campi, M.C.: The scenario approach to robust control design. IEEE Trans. Autom. Control 51(5), 742–753 (2006)