Probabilistic Programming

Handbooks in Operations Research and Management Science

Volumn 10, Issue C, 2003, Pages 267-351

  Prékopa, András ^a  

^a the State University of New Jersey   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77950465567     PISSN: 09270507     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0927-0507(03)10005-9     Document Type: Review

References (158)

1. Abadie, J., J. Carpentier (1969). Generalization of Wolfe reduced gradient method to the case of nonlinear constraints, in: R. Fletcher (ed.), Optimization, Academic Press.
2. Andersson F., Mausser H., Rosen D., and Uryasev S. Credit risk optimization with conditional value at risk criterion. Math. Programming Ser. B 89 (2001) 273-291
3. Armstrong R.D., and Balintfy J.L. A chance constrained multiple choice algorithm. Oper. Res. 23 (1975) 494-510
4. Balintfy, J.L., R.D. Armstrong (1980). A chance constrained multiple choice programming algorithm with applications in: Stochastic Programming (Proc. Internat. Conf., Univ. Oxford, Oxford, England, 1974, M.A.H. Dempster). Academic Press, London, New York, pp. 301-325
5. Balintfy, J.L., A. Prékopa (1996). Nature of random variation in the nutrient composition of meals. Health Services Research 1, 148-169
6. Barndorff-Nielsen O. Unimodality and exponential families. Comm. Stat. 1 (1973) 189-216
7. Becker T., and Weispfenning V. Gröbner Bases (1993), Springer, New York
8. Beraldi, P., A. Ruszczyński (1999). The probabilistic set covering problem. RUTCOR Research Reports 88-99. Op. Res. 50, 956-967
9. Beraldi, P., A. Ruszczyński (2002). A branch and bound method for stochastic integer problems under probabilistic constraints. RUTCOR Research Reports 16, 2001. Optimization Method and Software 17, 359-382
10. Bisthoven O.J., Schuchewytsch d.P., and Smeers Y. Power generation planning with uncertain demand, in:. In: Ermeliev Y., and Wets R.J.-B. (Eds). Numerical Techniques for Stochastic Optimization (1988), Springer-Verlag, New York 465-480
11. Bloom J.A., Caramanis M., and Charny L. Long-range generation planning using generalized Benders' decomposition: implementation and experience. Operations Research 32 (1984) 290-313
12. Bloom J.A. Solving an electricity generating capacity expansion planning problem by generalized Benders' decomposition. Operations Research 31 (1988) 84-100
13. Bogentoft E., Romeijn H.E., and Uryasev S. Pension Funds Using CVaR constraints. The Journal of Risk Finance (2001) 57-71
14. Bonferroni, C.E. (1937). Teoria Statistica Delle Classi e Calcolo Delle Probabilità. Volume in onore di Riccardo Dalla Volta, Università di Firenze, 1-62
15. Boole, G. (1854). Laws of Thought. Americam reprint of 1854 edition. Dover, New York
16. Borell C. Convex set functions in d-space. Periodica Mathematica Hungarica 6 (1975) 111-136
17. Boros E., and Prékopa A. Closed form two-sided bounds for probabilities that exactly r and at least r out of n events occur. Math. Opns. Res. 14 (1989) 317-342
18. Brascamp H.J., and Lieb E.H. On extensions of the Brunn-Minkowski and Prékopa-Leindler theorems, including inequalities for log concave functions, and with an application to the diffusion equations. Journal of Functional Analysis 22 (1976) 366-389
19. Bukszár, J., A. Prékopa (2001). probability bounds with cherry trees. Math. of Oper. Res. 26, 174-192
20. Bukszár J., and Szántai T. Probability bounds given by hypercherry trees. Optimization Methods and Software 17 (2002) 409-422
21. Bukszár J. Probability bounds with multitrees. Adv. Appl. Prob. 33 (2001) 437-452
22. Burkauskas A. On the convexity problem of probabilistic constrained stochastic programming problems (in Hungarian). Alkalmazott Matematikai Lapok (Applied Mathematical Papers) 12 (1986) 77-90
23. Charnes A., Cooper W.W., and Symonds G.H. Cost horizons and certainty equivalents; an approach to stochastic programming of heating oil. Management Science 4 (1958) 235-263
24. Cooper, W.W., Z. Huang, S.X. Li, O.B. Olesen (1998). Chance constrained programming formulations for stochastic characterizations of efficiency and dominance in DEA. J. of Productivity Anal. 9, 53-79
25. Coté, C., M. Laughton (1982). Stochastic production costing in generation planning: a large-scale mixed integer model. Mathematical Programming Study
26. Davidovich, Yu.S., B.L. Korenblum, B.I. Hacet (1969). A property of logarithmically concave functions. Soviet Mathematics, Doklady 10, 477-480 (English Translation)
27. Dawson D., and Sankoff A. A inequality for probabilities. Proc. Am. Math. Soc. 18 (1967) 504-507
28. Deák, I. (1980). Three digit Accurate Multiple Normal Probabilities. Numerische Mathematik, 35, 369-380
29. Deák I. Random Number Generators and Simulation (1990), Akadémiai Kiadó, Budapest
30. Deák I. Linear regression estimators for multinormal distributions in optimization of stochastic programming problems. EJOR III (1998) 555-568
31. Deák, I. (1971). Computer evaluation of a stochastic programming model. Thesis, L. Eötvös Univ. of Budapest (in Hungarian)
32. Deák I. Computing probabilities of rectangles in case of multidimensional distribution. Journal of Statistical Computation and Simulation 26 (1986) 101-114
33. Deák I. Multidimensional integration and stochastic programming, in:. In: Ermoliev Y., and Wets R.J.-B. (Eds). Numerical Techniques for Stochastic Optimization, (1988), Springer-Verlag, Berlin 187-200
34. Deák, I. (2000a). Solving stochastic programming problems by successive regression approximations. Computational Optimization and Applications (submitted)
35. Deák, I. (2000b). Subroutins for computing normal probabilities of sets - computer experinces. Annals of Oper. Res. 100, 103-122
36. Deák, I. (2001). Two-stage stochastic problems with correlated normal variables: computational experiences. Annals of Oper. Res., to appear
37. Deák, I. (2002). Probabilities of simple n-dimensional sets for the normal distribution. I.I.E. Transactions, to appear
38. Dentcheva D., Prékopa A., and Ruszczyński A. Concavity and efficient points of discrete distributions in probabilistic programming. Mathematical Programming Series A. 89 (2000) 55-77
39. Dert C.L. Asset-Liability Management for Pension Funds: A Multistage Chance-Constrained Programming Approach, PhD Thesis (1995), Erasmus University, Rotterdam
40. Dodu J.C., Goursat M., Hertz A., Quadrat J.P., and Viot M. Methode de gradient stochastique pour l'optimization des investissement dans un Réseau Électrique, Electricité de France. Bulletin Dir. Etudes et Rech. Seriec. Math. 2 (1981) 133-164 (in French)
41. Dupačová, J. (1991). Statistical security analysis in stochastic programming. Annals of Operations Research 30, 199-214
42. Dupačová J., A. Gaivoronski, Z. Kos, T. Szántai (1991). Stochastic programming in water management: a case study and a comparsion of solution techniques. Journal of Operations Research 52, 28-44
43. Fekete, M. and Gy. Pólya (1912). Über ein Problem von Laguerre. Rediconti del Circolo Matematico di Palermo 23, 89-120
44. Fiacco A.V., and McCormick G.P. Nonlinear Programming: Sequential Unconstrained Minimization Techniques (1968), John Wiley & Sons, New York
45. Galambos J., and Simonelli J. Bonferroni-Type Inequalities with Applications (1996), Springer, New York
46. Gao, L., A. Prékopa (2001). On performance prediction of cellular telephone networks. RUTCOR Research Report
47. Gassmann H.I. Conditional probability and conditional expectation of a random vector, in:. In: Ermeliev Y., and Wets R.J.-B. (Eds). Numerical Techniques for Stochastic Optimization, (1988), Springer Verlag, Berlin, Heidelberg, New York 237-254
48. Gassmann, H.I., A. Prékopa (2001). On stages and constraint replication in stochastic programming. Manuscript
49. Gassmann, H.I., I. Deák, T. Szántai (2002). Computing multivariate normal probabilities. J. of Computational and Graphical Stat. 11, 920-949
50. Genz A. Numerical computation of the multivariate normal probabilities. Journal of Computational and Graphical Statistics 1 (1992) 141-150
51. Gröwe N. Numerical Solution and Asymptotic Analysis of Stochastic Programs. Thesis (1995), Humboldt University, Berlin
52. Gröwe N. Estimated stochastic programs with chance constraint. EJOR 101 (1997) 285-305
53. Hailperin, Th. (1965). Best possible inequalities for the probability of a logical functions of events, Am. Math. Monthly 72, 343-359
54. Heikkinen, T., A. Prékopa (2002). Optimal power control under probabilistic quality-of-service constraints. Manuscript
55. Heikkinen, T.M. (2001). On resource allocation in externality networks. Thesis, RUTCOR, Rutgers Center for Operations Research
56. Henrion, R., A. Möller (2002). Optimization of a continuous distillation process under random inflow rate. Computers and Math. with App., to appear
57. Henrion R., Li P., Möller A., Wendt M., and Wozny G. Optimal control of a continuous distillation process under probabilistic constraints, in:. In: Grötschel M., Krumke S., and Rambau J. (Eds). Optimization of Large Scale Systems (2001), Springer, Berlin 499-517
58. Henrion R., and Römisch W. Metric regularity and quantitative stability in stochastic programs with probabilistic constraints. Mathematical Programming 84 (1998) 55-88
59. Henrion R., and Römisch W. Stability of solutions to chance constrained stochastic programs. In: Guddat J., et al. (Ed). Parametric Optimization and Related Topics V (2000), Peter Lang, Frankfurt a. M 95-114
60. Henrion R. Qualitative stability of convex programs with probabilistic constraints. Lecture Notes in Economics and Math. Systems 481 (2000) 164-180
61. Hunter D. Bounds for the probability of a union. Journal of Applied Probability 13 (1976) 597-603
62. Kall, P. (1987). On approximations and stability in stochastic programming, in: Parametric Optimization and Related Topics, Akademie-Verlag, Berlin, pp. 387-407
63. Kall P., and Mayer J. SLP-IOR: an interactive model management system for stochastic linear programs. Mathematical Programming 75 (1996) 221-240
64. Kataoka S. A stochastic progamming model. Econometrica 31 (1963) 181-196
65. Kelle P. On the safety stock problem for random delivery processes. European Journal of Operational Research 17 (1984) 191-200
66. Kelle P. Safety stock planning in a multi-stage production-inventory system. Engineering Costs and Production Economics 9 (1985) 231-237
67. Kelman J., Damazio J.M., Mariën J.L., and da Costa J.P. The determination of flood control volumes in a multireservoir system. Water Resources Research 25 (1989) 337-344
68. Kibzun A.I., and Kan Y.S. Stochastic Programming Problems with Probability and Quantile Functions (1996), Wiley, New York
69. Kibzun A.I., and Kurbakovszkij V.Y. Guaranteeing approach to solving quantile optimization problems. Annals of Operations Research 30 (1991) 81-99
70. Klein Haneveld W.K. Duality in Stochastic Linear and Dynamic Programming. Lecture Notes in Economics and Mathematical Systems (1986), Springer-Verlag, New York
71. Komáromi É. Duality in probabilistic constrained programming, in: A. Prékopa et al. (eds.), System Modelling and Optimization. Proceedings of the 12th IFIP Conference 1986 (1986) 423-429
72. Komáromi É. A dual method of probabilistic constrained problem. Mathematical Programming Study 28 (1986) 94-112
73. Komáromi É. On properties of the probabilistic constrained linear programming problem and its dual. Journal of Optimization Theory and Applications 55 (1987) 337-390
74. Kruskal J.B. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7 (1956) 48-50
75. Kwerel S.M. Most stringent bounds on aggregated probabilities of partially specified dependent probability systems. J. Am. Statist. Assoc. (1975) 472-479
76. Kwerel S.M. Bounds on the probability of a union and intersection of m events. Adv. Appl. Prob. 7 (1975) 431-448
77. Lancaster, L.M. (1992). The evolution of the diet model in managing food systems. Interfaces 22, 59-68
78. Luc D.T. Duality in programming under probabilistic constrained problems. Problems of Control and Information Theory 12 (1983) 429-437
79. Markowitz H. Portfolio selection. Journal of Finance 7 (1952) 77-91
80. Markowitz H. Portfolio Selection (1959), Wiley, New York
81. Markowitz H. Mean-Variance Analysis in Portfolio Choice and Capital Markets (1987), Blackwell, New York
82. Marti, K. (1988). Descent Directions and Efficient Solutions in Descretely Distributed Stochastic Programs, in: Lecture Notes in Economics and Mathematical Systems 299, Springer Verlag, Berlin, New York
83. Mayer, J. (1980). A nonlinear programming method for the solution of a stochastic programming model of A. Prékopa, in: A. Prékopa (ed.), Survey of Mathematical Programming, Vol. 2, North-Holland, pp. 129-139
84. Mayer, J. (1988). Probabilistic constrained programming: a reduced gradient algorithm implemented on PC. IIASA Working Paper, WP-88-39
85. Mayer J. Probabilistic Constrained Optimization: Methodology and Applications (2000), Kluwer Academic Publishers
86. Mayer J. Stochastic Optimization, Numerical Methods and Technical Applications (1992), Springer Verlag, Berlin
87. Mayer J. Stochastic linear programming algorithms: a comparsion based on a model management system (1998), Gordon and Breach Science Publishers
88. Medova, E.A., J.E. Scott (2000). Management of quality of service through chance constraint in multimedia networks, in: S.P. Uryasev (ed.), Probabilistic Constrained Optimization, Kluwer Academic Publishers, pp. 236-251
89. Murr M.R., and Prékopa A. Solution of a product substitution problem using stochastic programming, in:. In: Uryasev S.P.(ed.) (Ed). Probabilistic Constrained Optimization, (2000), Kluwer, Dordrecht
90. Nash S.G., and Sofer A. A barrier-method for large-scale constrained optimization. ORSA Journal on Computing 5 (1993) 40-53
91. Nash, S.G., A. Sofer (1998). Why extrapolation helps barrier methods. Working paper, Department of Operations Research and Engineering, George Mason University, Fairfax, Va
92. Norkin V.I., N.V. Roenko (1991). α-concave functions and measures and their applications Kibernet. Sistem. Anal. 189, 77-88. (in Russian). Translation in: Cybernet. Systems Anal. 27 (1991) 860-869
93. Ogryczak W., and Ruszczyński A. Dual stochastic dominance and related mean risk models. SIAM Journal on Optimization 13 (2002) 60-78
94. Panne, van de C., W. Popp (1963). Minimum Cost Cattle Feed under Probabilistic Problem Constraints. Management Science 9, 405-430
95. Pedersen J.G. On strong unimodality and m-ancillarity with applications to contingency tables. Scandinavian Journal of Statistics 2 (1975) 127-137
96. Pickens J.B., Hof J.G., and Kent B.M. Use of chance-constrained programming to account for stochastic variation in the A-matrix of large scale linear programs: a forestry application. Annals of Operations Research 31 (1991) 511-526
97. Pintér, J. (1991). Stochastic modelling and optimization for envirenmental management. Annals of Operations Research 31, 527-544
98. Prékopa A. The use of discrete moment bounds in probabilistic constrained stochastic programming models. Annals of Operations Research 85 (1999) 21-38
99. Prékopa A. A class of stochastic programming decision problems. Matematische Operations forschung und Statistik (1972) 349-354
100. Prékopa A. On logarithmic concave measures and functions. Acta Scientiarium Mathematicarum (Szeged) 34 (1973) 335-343
101. Prékopa A. On the concavity of multivariate probability distributions. Operations Research Letters 29 (2001) 1-4
102. Prékopa, A., B. Vízvári, T. Badics (1998). Programming under probabilistic constraint with discrete random variable, in: Giannessi et al. (ed.), New Trends in Mathematical Programming, Kluwer, Dordrecht, Boston, pp. 235-255
103. Prékopa A., and Kelle P. Reliability-type inventory models based on stochastic programming. Math. Programming Study 9 (1978) 43-58
104. Prékopa A., and Szántai T. On Multi-Stage Stochastic Programming. Colloquia Mathematica Societas János Bolyai (1976), North Holland Publishing Company 733-755
105. Prékopa A., and Szántai T. A new multivariate gamma distribution and its fitting to empirical streamflow data. Water Resources Research 14 (1978) 19-24
106. Prékopa A., and Szántai T. Flood control reservoir system design using stochastic programming. Math. Programming Study 9 (1978) 138-151
107. Prékopa, A., T. Szántai (1979). On optimal regulation of a storage level with application to the water level regulation of a lake. European Journal of Operations Research 3, 175-189, also in: Survey of Math Prog Publ. House of the H. A. S. Budapest, Vol. II, 183-210
108. Prékopa A., B. Vízvári, G. Regös, L. Gao (2001). Bounding the probability of the union of events by the use of aggregation and disaggregation of linear programs. RUTCOR Research Report 99-97. Submitted to Discrete Applied Math
109. Prékopa A., Rapcsák T., and Zsuffa I. Serially linked reservoir system design using stochastic programming. Water Resources Research 14 (1978) 672-678
110. Prékopa, A., S. Ganczer, I. Deák, K. Patyi (1980). The STABIL stochastic programming model and its experimental application to the electrical energy sector of the Hungarian economy, in: M.A.H. Dempster (ed.), Stochastic Programming, Academic Press, London, pp. 369-385
111. Prékopa, A. (1965). Reliability equation for an inventory problem and its asymptotic solutions. Colloquium on Appl. of Math. to Economics, Publ. House. of the Hungarian Acad. Sci., Budapest, pp. 317-327
112. Prékopa A. On Probabilistic Constrained Programming Proceedings of the Princeton Symposium on Math. Prog (1970), Princeton University Press, Princeton, NJ
113. Prékopa A. Logarithmic concave measures with applications to stochastic programming. Acta Scientiarium Mathematicarum (Szeged) 32 (1971) 301-316
114. Prékopa A. Contributions to the theory of stochastic programming. Math. Progr. 4 (1973) 202-221
115. Prékopa, A. (1973c). Stochastic programming models for inventory control and water storage. Coll. Math. Soc. J. Bolyai 7, North-Holland, Amsterdam, pp. 229-245
116. Prékopa A. Programming under probabilistic constraints with a random technology matrix. Matematische Operationsforschung und Statistik, Ser. Optimization (1974) 109-116 5
117. Prékopa A. In: M.A.H D. (Ed). Stochastic Programming (1980), Academic Press, London
118. Prékopa A. Recent Results in Stochastic Programming, Lecture Notes in Economics and Mathematical Systems (1980), Springer-Verlag, Berlin
119. Prékopa, A. (1985). Recent results in optimization of electro-energetic systems. Proceedings of the Conference Applied Optimization Techniques in Energy Problems (June 25-29, 1984, Linz, Austrlia, Hj. Wacker, ed.), Teubner, Stuttgart, pp. 354-383
120. Prékopa A. Boole-Bonferoni inequalities and linear programming. Operations Research 36 (1988) 145-162
121. Prékopa A. Numerical Techniques for Stochastic Optimization (1988), Springer, New York
122. Prékopa A. Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probality distribution. ZOR Methods and Models of Operations Research 34 (1990) 441-461
123. Prékopa A. Sharp bound on probabilities using linear programming. Operations Research 38 (1990) 227-239
124. Prékopa A. Stochastic Programming (1995), Kluwer Academic Publishers, Dordrecht, Boston
125. Prékopa A. Discrete higher order convex functions and their applications. Generalized convexity and monotonicity. In: Hadjisavva N., et al. (Ed). Lecture Notes in Economics and Mathematical Systems (2001), Springer, Berlin 21-47
126. Raik, E. (1971). The quantile function in stochastic nonlinear programming (in Russian). Eesti NSV Teaduste Akademia Toimetised (News of the Estonian Academy of Sciences) Füüs. Mat. 20, 229-231
127. Raik, E. (1972). On the stochastic programming problem with the probability and quantile functionals (in Russian). Eesti NSV Teaduste Akademia Toimetised (News of the Estonian Academy of Sciences) Füüs. Mat. 21, 142-148
128. Raik, E. (1970). Inequalities in problems of stochastic programming (in Russian). Eesti NSV Teaduste Akademia Toimetised (News of the Estonian Academy of Sciences) Füüs. Mat. 19, 292-298
129. Raik, E. (1971). Qualitative research into the stochastic nonlinear programming problems (in Russian). Eesti NSV Teaduste Akademia Toimetised (News of the Estonian Academy of Sciences) Füüs. Mat. 20, 8-14
130. Rapcsák, T. (1974). On the Numerical Solution of a Reservoir Model. Ph.D. Thesis, University of Debrecen, Hungary (in Hungarian)
131. Rinott Y. On convexity of measures. Annals of Probability 4 (1976) 1020-1026
132. Rockafellar R.T., and Uryasev S. Optimization of conditional value at risk. The Journal of Risk 2 (2000) 21-41
133. Römisch W., and Schultz R. Distribution sensitivity for certain classes of chance-constrained models with application to power dispatch. J. Optimization Theory Appl. 71 (1991) 569-588
134. Roy A.D. Safety first and the holding of assets. Econometrica 20 (1952) 431-449
135. Salinetti G. Approximations for chance constrained programming problems. Stochastics 10 (1983) 157-169
136. Sathe Y.S., Pradhan M., and Shah S.P. Inequalities for the probability of the occurence of at least m out of n events. J. Appl. Prob. 17 (1980) 1127-1132
137. Sen S. Relaxations for the probabilistically constrained programs with discrete random variables. Operations Research Letters 11 (1992) 81-86
138. Shapiro, A.F. (1986). Applications of operations research techniques in insurance, in: Goovaerts et al. (eds.), Insurance and Risk Theory, pp. 129-143
139. Singh, M.R., C.T. Abraham, R. Akella (1990). Wafer design problem in semiconductor manufacturing for reliable customer service. IEEE Transaction on Components. Hybrids and Manufacturing Technology 13, 103-108
140. Slepian, D. (1962). On the one-sided barrier problem for Gaussian noise. Bell System Technical Journal 41, 463-501
141. Stancu-Minasian I.M. Stochastic Programming with Multiple Objective Functions (1984), Reidel Publishing Company, Boston
142. Szántai, T. (1985). On the numerical computation on probabilities in connection with multivariate probability distributions. Thesis, Hung. Acad. Sci. (in Hungarian)
143. Szántai T. A computer code for solution of probabilistic-constrained stochastic programming problems. In: Ermoliev Y., and Wets R.J.-B. (Eds). Numerical Techniques for Stochastic Optimization (1988), Springer-Verlag, Berlin 229-235
144. Szántai T. Evaluation of a special multivariate gamma distribution. Mathematical Programming Study 27 (1986) 1-16
145. Szántai, T. (2000). Improved bounds and simulation procedures on the value of the multivariate normal probability distribution function. Annals of Oper. Res.100, 85-101
146. Szántai, T. (2001). Approximation of multivariate probability integrals, in: P.M. Pardalos, C.A. Floudas (eds.) Encyclopedia of Optimization, Kluwer Academic Publishers
147. Takács, L. (1967). On the method of inclusion and exclusion. J. of the Amer. Math. Association 62, 102-113
148. Tamm, E. (1977). On g-concave functions and probability measures. Eesti NSV Teaduste Akademia Toimetised (News of the Estonian Academy of Sciences) Füüs. Mat. 26, 376-379
149. Tayur S.L., R.L. Thomas, N.R. Natraj (1995). An algebraic geometry algorithm for scheduling in the presence of setups and correlated demands. Mathematical Programming 69, 369-401
150. Thoft-Christensen, P., Y. Murotsu (1986). Applications of Structural Systems Reliability Theory, Springer-Verlag, New York
151. Uryas'ev, S. (1989). A differentiation formula for integrals over sets given by inclusion. Numerical Functional Analysis and Optimization 10, 827-841
152. Uryasev, S. (2001). Derivatives of probability and integral functions, in: P.M. Pardalos, C. M. Floudas (eds.), Encyclopedia of Optimization, Kluwer Academic Publishers
153. Vanderbei R.J., D.F. Shanno (2000). Interior-point algorithms for nonconvex nonlinear programming: orderings and higher-order methods, Math. Prog. 87, 303-316
154. Veinott, A.F. (1967). The supporting hyperplane method for unimodal programming. Operations Research 15, 147-152
155. Vízvári, B. (1987). Beiträge zum Frobenius Problem, D. Sc. Nat. Dissertation, Technische Hochschule Carl Schorlemmer, Leuna-Merseburg, Germany
156. Vízvári, B. (2002). The integer programming background of a stochastic integer programming algorithm of Dentcheva-Prékopa-Ruszczyński, Optimization Methods and Software 17, 543-559
157. Worsley, K.J. (1982). An improved Bonferroni inequality and applications. Biometrica 69, 297-302
158. Zoutendijk, G. (1960). Methods of Feasible Directions. Elsevier Publishing Co. Amsterdam, New York