The use of discrete moment bounds in probabilistic constrained stochastic programming models

Annals of Operations Research

Volumn 85, Issue , 1999, Pages 21-38

  Prékopa, András ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043263539     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018921811281     Document Type: Article

References (25)

1. E.M.L. Beale, On minimizing a convex function subject to linear inequalities, Journal of the Royal Statistical Society B47(1955)173-184.
2. C.E. Bonferroni, Teoria Statistica Delle Classi e Calcolo Delle Probabilità, Volume in onor di Riccardo Dalla Volta, Università di Firenze, 1937, pp. 1-62.
3. G. Boole, Laws of Thought (American reprint of 1854 edition), Dover, New York, 1954.
4. E. Boros and A. Prékopa, Closed form two-sided bounds for probabilities that exactly r and at least r out of n events occur, Mathematics of Operations Research 14(1989)317-342.
5. A. Charnes, W.W. Cooper and G.H. Symonds, Cost horizons and certainty equivalents: An approach to stochastic programming of heating oil, Management Science 4(1958)235-263.
6. G.B. Dantzig, Linear programming under uncertainty, Management Science 1(1955)197-206.
7. D. Dawson and A. Sankoff, An inequality for probabilities, Proceedings of the American Mathematical Society 18(1967)504-507.
8. Th. Hailperin, Best possible inequalities for the probability of a logical function of events, The American Mathematical Monthly 72(1965)343-359.
9. P. Hansen, B. Jaumard and G.-B.D. Nguesté, Best second order bounds for two-terminal network reliability with dependent edge failures, Discrete Applied Mathematics, to appear.
10. D. Hunter, Bounds for the probability of a union, Journal of Applied Probability 13(1976)597-603.
11. S.M. Kwerel, Most stringent bounds on aggregated probabilities of partially specified dependent probability systems, Journal of the American Statistical Association 70(1975)472-448.
12. L.B. Miller and H. Wagner, Chance-constrained programming with joint constraints, Operations Research 13(1965)930-945.
13. T. Popoviciu, Les fonctions convexes, in: Actualités Scientifiques et Industrielles 992, Hermann, Paris, 1945.
14. A. Prékopa, On probabilistic constrained programming, Proceedings of the Princeton Symposium on Mathematical Programming, Princeton University Press, 1970, pp. 113-138.
15. A. Prékopa, Contributions to the theory of stochastic programming, Mathematical Programming 4(1973)202-221.
16. A. Prékopa, Boole-Bonferroni inequalities and linear programming, Operations Research 36 (1988)145-162.
17. A. Prékopa, Sharp bounds on probabilities using linear programming, Operations Research 38 (1990)227-239.
18. A. Prékopa, The discrete moment problem and linear programming, Discrete Applied Mathematics 27(1990)235-254.
19. A. Prékopa, Inequalities on expectations based on the knowledge of multivariate moments, in: Stochastic Inequalities, eds. M. Shaked and Y.L. Tong, Institute of Mathematical Statistics, Lecture Notes - Monograph Series 22(1992)309-331.
20. A. Prékopa, Stochastic Programming, Kluwer Scientific, 1995.
21. A. Prékopa, Bounds on probabilities and expectations using multivariate moments of discrete distributions, Studia Sci. Math. Hungar. 34(1998)349-380.
22. A. Prékopa, On the concavity of multivariate probability distributions, RUTCOR Research Report, 1998, to appear.
23. O. Ruff-Fiedler, A. Prékopa and C.I. Fábián, On a dual method for a specially structured linear programming problem, Mathematical Methods of Operations Research (1998), to appear.
24. T. Szántai, A computer code for solution of probabilistic constrained stochastic programming problems, in: Numerical Techniques for Stochastic Optimization, eds. Yu. Ermoliev and R.J-B Wets, Springer, New York, 1988, pp. 229-235.
25. R.J-B Wets, Programming under uncertainty: The complete problem, Zeitschrift für Wahrsch. 4 (1966)316-339.