The Triangular E-Model of Chance-Constrained Programming with Stochastic A-Matrix

The triangular model of chance-constrained programming with stochastic A-matrix and deterministic right-hand side is considered. The use of conditional probabilities makes it possible to solve this problem for any type of distribution function of the elements of the A-matrix provided that there is only one decision variable at each stage. The extension of the model to several decision variables per stage is possible under certain conditions and for special distribution (stable distributions) of the elements of A.

• 저널Management Science · 20(9) · 1284–1291
• 토픽Economic and Technological Systems Analysis · Management of Technology and Innovation
• DOI10.1287/mnsc.20.9.1284
• 저자Willy Gochet, Manfred Padberg