Introduction to Stochastic Programming

Springer Series in Operations Research and Financial Engineering

Volumn , Issue , 2011, Pages 1-469

  Birge, John R ^a   Louveaux, François ^b  

^a UNIVERSITY OF CHICAGO   (United States)

^b UNIVERSITY OF NAMUR   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84926477808     PISSN: 14318598     EISSN: 21971773     Source Type: Book Series    
DOI: None     Document Type: Chapter

References (442)

1. P.G. Abrahamson, “A Nested Decomposition Approach for Solving Staircase Linear Programs,” Ph.D. Dissertation, Stanford University (Stanford, CA, 1983).
2. D. Adelman, “Dynamic bid prices in revenue management,” Operations Research 55 (2007) pp. 647–661.
3. S. Ahmed, “Convexity and decomposition of mean-risk stochastic programs,” Mathematical Programming Series A 106 (2006) pp. 433–446.
4. S. Ahmed, M. Tawarmalani, and N. V. Sahinidis, “A finite branch and bound algorithm for two-stage stochastic integer programs,” Mathematical Programming 100 (2004) pp.355-377.
5. E.D. Andersen, “ The homogeneous and self-dual model and algorithm for linear optimization,” MOSEK Technical report: TR-1-2009, Copenhagen, DK, 2009.
6. S.A. Andreou, “A capital budgeting model for product-mix flexibility,” Journal of Manufacturing and Operations Management 3 (1990) pp. 5–23.
7. K.M. Anstreicher, “A combined Phase I–Phase II projective algorithm for linear programming,” Mathematical Programming 43 (1989) pp. 209–223.
8. K.A. Ariyawansa and D.D. Hudson, “Performance of a benchmark parallel implementation of the Van Slyke and Wets algorithm for two-stage stochastic programs on the Sequent/Balance,” Concurrency Practice and Experience 3 (1991) pp. 109–128.
9. P. Artzner, F. Delbaen, J-M. Eber and D. Heath, “Coherent measures of risk,” Mathematical Finance 9 (1999) pp. 203-228.
10. R. Ashford, “Bounds and an approximate solution method for multistage stochastic production problems,” Warwick Papers in Industry, Business and Administration, No. 15, University of Warwick, Coventry, UK (1984).
11. S. Asmussen and P. Glynn, Stochastic Simulation: Algorithms and Analysis, Springer, New York, 2007.
12. H. Attouch and R.J-B Wets, “Approximation and convergence in nonlinear optimization” in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, Eds., Nonlinear programming, 4 (Academic Press, New York–London, 1981) pp. 367–394.
13. M. Avriel and A.C. Williams, “The value of information and stochastic programming,” Operations Research 18 (1970) pp. 947–954.
14. O. Bahn, J.-L. Goffin, O. du Merle, and J.-Ph. Vial, “A cutting plane method from analytic centers for stochastic programming,” Mathematical Programming, 69 (1995) pp. 45–73.
15. G. Bayraksan and D.P. Morton, “A sequential sampling procedure for stochastic programming,” Working Paper, University of Arizona, July, 2009.
16. M.S. Bazaraa and C.M. Shetty, Nonlinear Programming: Theory and Algorithms (John Wiley, Inc., New York, NY, 1979).
17. M.S. Bazaraa, J.J. Jarvis, and H.D. Sherali, Linear Programming and Network Flows (John Wiley, Inc., New York, NY, 1990).
18. E.M.L. Beale, “On minimizing a convex function subject to linear inequalities,” J. Royal Statistical Society, Series B 17 (1955) pp. 173–184.
19. E.M.L. Beale, “The use of quadratic programming in stochastic linear programming,” Rand Report P-2404-1, The Rand Corporation (1961).
20. E.M.L. Beale, J.J.H. Forrest, and C.J. Taylor, “Multi-time-period stochastic programming” in: M.A.H. Dempster, Ed., Stochastic Programming (Academic Press, New York, NY, 1980) pp. 387–402.
21. E.M.L. Beale, G.B. Dantzig, and R.D. Watson, “A first order approach to a class of multi-time-period stochastic programming problems,” Mathematical Programming Study 27 (1986) pp. 103–117.
22. R. Bellman, Dynamic Programming (Princeton University Press, Princeton, NJ, 1957).
23. Ben-Tal, A., Boyd, S., Nemirovski, A., Extending the Scope of Robust Optimization: Comprehensive Robust Counterparts of Uncertain Problems, Mathematical Programming 107:1-2 (2006), 63–89.
24. Ben-Tal, A. and Arkadi Nemirovski, A. (2002). Robust optimizationmethodology and applications, Mathematical Programming, Series B 92, 453–480.
25. A. Ben-Tal and M. Teboulle, “Expected utility, penalty functions, and duality in stochastic nonlinear programming,” Management Science 32 (1986) pp. 1445–1466.
26. J. F. Benders, “Partitioning procedures for solving mixed-variables programming problems,” Numerische Mathematik 4 (1962) pp. 238–252.
27. B. Bereanu, “Some numerical methods in stochastic linear programming under risk and uncertainty” in: M.A.H. Dempster, Ed., Stochastic Programming (Academic Press, New York, NY, 1980) pp. 169–205.
28. J.O. Berger, Statistical Decision Theory and Bayesian Analysis (Springer-Verlag, New York, NY, 1985).
29. O. Berman, R.C. Larson, and S.S. Chiu, “Optimal server location on a network operating as a M/G/1 queue,” Operations Research 33 (1985) pp. 746–770.
30. D.P. Bertsekas, Dynamic Programming and Optimal Control, Volume II, Third Edition (Athena Scientific, Boston, 2007).
31. D.P. Bertsekas and J.N. Tsitsiklis, Neuro-Dynamic Programming (Athena Scientific, Boston, 1995).
32. D. Bertsimas, D.A. Iancu, and P.A. Parrilo, “Optimality of affine policies in multistage robust optimization,” Mathematics of Operations Research 35 (2010) pp. 363–394.
33. D. Bertsimas, P. Jaillet, and A. Odoni, “A priori optimization,” Operations Research 38 (1990) pp. 1019–1033.
34. D. Bertsimas, K. Natarajan, and C-P. Teo, “Probabilistic combinatorial optimization: Moments, semidefinite programming and asymptotic bounds,” SIAM J. of Optimization 15 (2004) pp. 185-209.
35. D. Bertsimas and I. Popescu, “ Optimal inequalities in probability: A convex programming approach,” SIAM Journal of Optimization, 15 (2004) pp. 780–804.
36. D. Bertsimas and M. Sim, “Tractable approximations to robust conic optimization problems,” Mathematical Programming 107 (2006) pp. 5–36.
37. D. Bienstock and J.F. Shapiro, “Optimizing resource acquisition decisions by stochastic programming,” Management Science 34 (1988) pp. 215–229.
38. P. Billingsley, Convergence of Probability Measures (John Wiley, Inc., New York, NY, 1968).
39. J.R. Birge, “Solution Methods for Stochastic Dynamic Linear Programs,” Ph.D. Dissertation and Technical Report SOL 80-29, Systems Optimization Laboratory, Stanford University (Stanford, CA, 1980).
40. J.R. Birge, “The value of the stochastic solution in stochastic linear programs with fixed recourse,” Mathematical Programming 24 (1982) pp. 314–325.
41. J.R. Birge, “Using sequential approximations in the L-shaped and generalized programming algorithms for stochastic linear programs,” Technical Report 83-12, Department of Industrial and Operations Engineering, University of Michigan (Ann Arbor, MI, 1983); available at http://hdl.handle.net/2027.42/3642.
42. J.R. Birge, “Aggregation in stochastic production problems,” Proceedings of the 11th IFIP Conference on System Modelling and Optimization (Springer-Verlag, New York, 1984).
43. J.R. Birge, “Aggregation in stochastic linear programming,” Mathematical Programming 31 (1985a) pp. 25–41.
44. J.R. Birge, “Decomposition and partitioning methods for multi–stage stochastic linear programs,” Operations Research 33 (1985b) pp. 989–1007.
45. J.R. Birge, “Exhaustible recourse models with uncertain returns from exploration investment” in: Y. Ermoliev and R. Wets, Eds., Numerical Techniques for Stochastic Optimization (Springer-Verlag, Berlin, 1988a) pp. 481–488.
46. J.R. Birge, “The relationship between the L-shaped method and dual basis factorization for stochastic linear programming” in: Y. Ermoliev and R. Wets, Eds., Numerical Techniques for Stochastic Optimization (Springer-Verlag, Berlin, 1988b) pp. 267–272.
47. J.R. Birge, “Multistage stochastic planning models using piecewise linear response functions” in: G. Dantzig and P. Glynn, Eds., Resource Planning under Uncertainty for Electric Power Systems (NSF, 1989).
48. J.R. Birge, “Quasi-Monte Carlo methods for option evaluation,” Technical Report, Department of Industrial and Operations Engineering, University of Michigan (Ann Arbor, MI, 1994); available at http://hdl.handle.net/2027.42/3632.
49. J.R. Birge, “Option methods for incorporating risk into linear capacity planning models,” Manufacturing and Service Operations Management 2 (2000), pp. 189–194.
50. J.R. Birge and M.A.H. Dempster, “Optimality conditions for match-up strategies in stochastic scheduling and related dynamic stochastic optimization problems,” Technical Report 92-58, Department of Industrial and Operations Engineering, University of Michigan (Ann Arbor, MI, 1992); available at http://hdl.handle.net/2027.42/3645.
51. J.R. Birge, C.J. Donohue, D.F. Holmes, and O.G. Svintsiski, “A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs,” Mathematical Programming 75 (1996) pp. 327–352.
52. J.R. Birge and J. Dulá, “Bounding separable recourse functions with limited distribution information,” Annals of Operations Research 30 (1991) pp. 277–298.
53. J.R. Birge, R.M. Freund, and R.J. Vanderbei, “Prior reduced fill-in in the solution of equations in interior point algorithms,” Operations Research Letters 11 (1992) pp. 195–198.
54. J.R. Birge and D.F. Holmes, “Efficient solution of two-stage stochastic linear programs using interior point methods,” Computational Optimization and Applications 1 (1992) pp. 245– 276.
55. J.R. Birge and F.V. Louveaux, “A multicut algorithm for two-stage stochastic linear programs,” European Journal of Operations Research 34 (1988) pp. 384–392.
56. J.R. Birge and M.J. Maddox, “Bounds on expected project tardiness,” Operations Research 43 (1995) pp. 838–850.
57. J.R. Birge and M.J. Maddox, “Using second moment information in stochastic scheduling” in: G. Yin and Q. Zhang, Eds., Recent Advances in Control and Manufacturing Systems (Springer-Verlag, New York, NY, 1996) pp. 99–120.
58. J.R. Birge and L. Qi, “Computing block-angular Karmarkar projections with applications to stochastic programming,” Management Science 34 (1988) pp. 1472–1479.
59. J.R. Birge and L. Qi, “Semiregularity and generalized subdifferentials with applications to optimization,” Mathematics of Operations Research 18 (1993) pp. 982–1006.
60. J.R. Birge and L. Qi, “Subdifferential convergence in stochastic programs,” SIAM J. Optimization 5 (1995) pp. 436–453.
61. J.R. Birge and C.H. Rosa, “Parallel decomposition of large-scale stochastic nonlinear programs,” Annals of Operations Research 64 (1996), pp. 39–65.
62. J.R. Birge and M. Teboulle, “Upper bounds on the expected value of a convex function using subgradient and conjugate function information,” Mathematics of Operations Research 14 (1989) pp. 745–759.
63. J.R. Birge and S.W. Wallace, “Refining bounds for stochastic linear programs with linearly transformed independent random variables,” Operations Research Letters 5 (1986) pp. 73– 77.
64. J.R. Birge and S.W. Wallace, “A separable piecewise linear upper bound for stochastic linear programs,” SIAM Journal on Control and Optimization 26 (1988) pp. 725–739.
65. J.R. Birge and R.J-B Wets, “Approximations and error bounds in stochastic programming” in: Y. Tong, Ed., Inequalities in Statistics and Probability (IMS Lecture Notes—Monograph Series, 1984) pp. 178–186.
66. J.R. Birge and R.J-B Wets, “Designing approximation schemes for stochastic optimization problems, in particular, for stochastic programs with recourse,” Mathematical Programming Study 27 (1986) pp. 54–102.
67. J.R. Birge and R.J-B Wets, “Computing bounds for stochastic programming problems by means of a generalized moment problem,” Mathematics of Operations Research 12 (1987) pp. 49–162.
68. J.R. Birge and R.J-B Wets, “Sublinear upper bounds for stochastic programs with recourse,” Mathematical Programming 43 (1989) pp. 131–149.
69. J.R. Birge and G. Zhao, “Successive linear approximation solution of infinite horizon dynamic stochastic programs,”SIAM Journal on Optimization 18 (2007) pp. 1165–1186.
70. G.R. Bitran and D. Sarkar, “On upper bounds of sequential stochastic production planning problems,” European Journal of Operational Research 34 (1988) pp. 191–207.
71. G.R. Bitran and H. Yanasse, “Deterministic approximations to stochastic production problems,” Operations Research 32 (1984) pp. 999–1018.
72. C.E. Blair and R.G. Jeroslow, “The value function of an integer program,” Mathematical Programming 23 (1982) pp. 237–273.
73. F. Black and M. Scholes, “The pricing of options and corporate liabilities,” Journal of Political Economy 81 (1973) pp. 737–654.
74. D. Blackwell, “Discounted dynamic programming,” Annals of Mathematical Statistics 36 (1965) pp. 226–235.
75. C. Borell, “Convex set functions in d-spaces,” Periodica Mathematica Jungarica 6 (1975) pp. 111–136.
76. S.L. Brumelle and J.I. McGill, “Airline seat allocation with multiple nested fare classes,” Operations Research 41 (1993) pp. 127–137.
77. G. Calafiore and M.C. Campi, “Uncertain convex programs: randomized solutions and confidence levels,” Mathematical Programming 102(2005) pp. 25-46.
78. D.R. Cariño, T. Kent, D.H. Myers, S. Stacy, M. Sylvanus, A.L. Turner, K. Watanabe, and W.T. Ziemba, “The Russel-Yasuda Kasai model: An asset/liability model for a Japanese insurance company using multistage stochastic programming,” Interfaces 24 (1994) pp. 29-49.
79. C.C. Carøe and J. Tind, “L-shaped decomposition of two-stage stochastic programs with integer recourse,” Mathematical Programming 83 (1998) pp. 451-464.
80. T. Carpenter, I. Lustig, and J. Mulvey, “Formulating stochastic programs for interior point methods,” Operations Research 39 (1991) pp. 757–770.
81. H.P. Chao, “Exhaustible resource models: the value of information,” Operations Research 29 (1981) pp. 903–923.
82. A. Charnes and W.W. Cooper, “Chance-constrained programming,” Management Science 5 (1959) pp. 73–79.
83. A. Charnes and W.W. Cooper, “Deterministic equivalents for optimizing and satisficing under chance constraints,” Operations Research 11 (1963) pp. 18–39.
84. A. Charnes and W.W. Cooper, “Response to ‘Decision problems under risk and chance constrained programming: dilemmas in the transition’,” Management Science 29 (1983) pp. 750– 753.
85. A. Charnes, W.W. Cooper, and G.H. Symonds, “Cost horizons and certainty equivalents: an approach to stochastic programming of heating oil,” Management Science 6 (1958) pp. 235–263.
86. M. Chen and S. Mehrotra, “Epi-convergent scenario generation method for stochastic problems via sparse grid,” Technical Report 8, Northwestern University, December 2007 (Stochastic Programming E-print Series,http://edoc.hu-berlin.de/docviews/abstract. php?lang=ger&id=28882).
87. I.C. Choi, C.L. Monma, and D.F. Shanno, “Further development of a primal-dual interior point method,” ORSA Journal on Computing 2 (1990) pp. 304–311.
88. K. L. Chung, A Course in Probability Theory (Academic Press, New York, NY, 1974).
89. V. Chvátal, Linear Programming (Freeman, New York/San Francisco, CA, 1980).
90. T. Cipra, “Moment problem with given covariance structure in stochastic programming,” Ekonom.-Mat. Obzor 21 (1985) pp. 66–77.
91. T. Cipra, “Stochastic programming with random processes,” Annals of Operations Research 30 (1991) pp. 95–105.
92. F. Clarke, Optimization and Nonsmooth Analysis (John Wiley, Inc., New York, NY, 1983).
93. A.R. Conn, N.I.M. Gould, and P.L. Toint, Trust-Region Methods (SIAM/MPS, Philadelphia, PA, 2000).
94. J. Cox and S. Ross, “The valuation of options for alternative stochastic processing,” Journal of Financial Economics 3 (1976) pp. 145–166.
95. L. Dai, C. Chen, and J.R. Birge, “Convergence Properties of Two-Stage Stochastic Programming,” Journal Of Optimization Theory And Applications 106 (2000) pp. 489-509.
96. G.B. Dantzig, “Linear programming under uncertainty,” Management Science 1 (1955) pp. 197–206.
97. G.B. Dantzig, Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963).
98. G.B. Dantzig and P. Glynn, “Parallel processors for planning under uncertainty,” Annals of Operations Research 22 (1990) pp. 1–21.
99. G.B. Dantzig and G. Infanger, “Large-scale stochastic linear programs—Importance sampling and Benders decomposition” in: C. Brezinski and U. Kulisch, Eds., Computational and applied mathematics, I (Dublin, 1991) (North-Holland, Amsterdam, 1991) pp. 111–120.
100. G.B. Dantzig and A. Madansky, “On the solution of two–stage linear programs under uncertainty,” Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, (University of California Press, Berkeley, CA, 1961).
101. G.B. Dantzig and A. Wald, “On the fundamental lemma of Neyman and Pearson,” The Annals of Mathematical Statistics 22 (1951) pp. 87–93.
102. G.B. Dantzig and P. Wolfe, “The decomposition principle for linear programs,” Operations Research 8 (1960) pp. 101–111.
103. D. Dawson and A. Sankoff, “An inequality for probabilities,” Proceedings of the American Mathematical Society 18 (1967) pp. 504–507.
104. I. Deák, “Three-digit accurate multiple normal probabilities,” Numerische Mathematik 35 (1980) pp. 369–380.
105. I. Deák, “Multidimensional integration and stochastic programming,” in: Y. Ermoliev and R. Wets, Eds., Numerical Techniques for Stochastic Optimization (Springer-Verlag, Berlin, 1988) pp. 187–200.
106. I. Deák, Random Number Generators and Simulation (Akadémiai Kiadó, Budapest, 1990).
107. D.P. de Farias and B. Van Roy, “ On constraint sampling in the linear programming approach to approximate dynamic programming,”Mathematics of Operations Research 29 (2004) pp. 462-478.
108. M.H. DeGroot, Optimal Statistical Decisions (McGraw-Hill, New York, NY, 1970).
109. M.A.H. Dempster, “Introduction to Stochastic Programming” in: M.A.H. Dempster, Ed., Stochastic Programming (Academic Press, New York, NY, 1980) pp. 3–59.
110. M.A.H. Dempster, “The expected value of perfect information in the optimal evolution of stochastic problems” in: M. Arato, D. Vermes, and A.V. Balakrishnan, Eds., Stochastic Differential Systems (Lecture Notes in Information and Control, Vol. 36, 1981) pp. 25–40.
111. M.A.H. Dempster, “On stochastic programming II: dynamic problems under risk,” Stochastics 25 (1988) pp. 15–42.
112. M.A.H. Dempster, “Sequential importance sampling algorithms for dynamic stochastic programming,” Jounral of Mathematical Sciences 133 (2006), pp. 1422–1444.
113. M.A.H. Dempster and A. Papagaki-Papoulias, “Computational experience with an approximate method for the distribution problem” in: M.A.H. Dempster, Ed., Stochastic Programming (Academic Press, New York, NY, 1980) pp. 223–243.
114. V.F. Demyanov and L.V. Vasiliev, Nedifferentsiruemaya optimizatsiya (Nondifferentiable optimization) (Nauka, Moscow, 1981).
115. D. Dentcheva and A. Ruszczyński, “Robust stochastic dominance and its application to riskaverse optimization,”Mathematical Programming, Series B 123 (2010) pp. 85–100.
116. C.J. Donohue, “Stochastic Network Programming And The Dynamic Vehicle Allocation Problem,” Ph.D. Dissertation, University of Michigan (Ann Arbor, MI, 1996).
117. Christopher J. Donohue and John R. Birge, “The Abridged Nested Decomposition Method for Multistage Stochastic Programs,” Algorithmic Operations Research 1 (2006) pp. 20–30.
118. J.H. Dulá, “An upper bound on the expectation of simplicial functions of multivariate random variables,” Mathematical Programming 55 (1991) pp. 69–80.
119. V. Dupač, “A dynamic stochastic approximation method,” Annals of Mathematical Statistics 6 (1965) pp. 1695–1702.
120. J. Dupačová, “Minimax stochastic programs with nonconvex nonseparable penalty functions” in: A. Prékopa, Ed., Progress in Operations Research (Janos Bolyai Math. Soc., 1976) pp. 303–316.
121. J. Dupačová, “The minimax approach to stochastic linear programming and the moment problem,” Ekonom.-Mat. Obzor 13 (1977) pp. 297–307.
122. J. Dupačová, “Stability in stochastic programming with recourse-contaminated distributions,” Mathematical Programming Study 28 (1984) pp. 72–83.
123. J. Dupačová, “Stability and sensitivity analysis for stochastic programming,” Annals of Operations Research 27 (1990) pp. 115–142.
124. J. Dupačová, N. Gröwe-Kuska and W. Römisch, “Scenario reduction in stochastic programming: An approach using probability metrics,” Mathematical Programming, Ser. A 95 (2003) pp. 493–511.
125. J. Dupačová and R.J-B Wets, “Asymptotic behavior of statistical estimators and of optimal solutions of stochastic optimization problems,” Annals of Statistics 16 (1988) pp. 1517–1549.
126. S. Dye, L. Stougie, and A. Tomasgard, “The stochastic single resource service-provision problem,”Naval Research Logistics 50 (2003) pp. 869887.
127. M. Dyer, R. Kannan, and L. Stougie, “A simple randomised algorithm for convex optimisation,” SPORReport 2002-05, Dept. of Mathematics and Computer Science, Eindhoven Technical University, Eindhoven, 2002.
128. M. Dyer and L. Stougie, “Computational complexity of stochastic programming problems,” Mathematical Programming, Ser. A 106 (2006) pp. 423–432.
129. B.C. Eaves and W.I. Zangwill, “Generalized cutting plane algorithms,” SIAM J. Control 9 (1971) pp. 529–542.
130. N.C.P. Edirisinghe, “Essays on Bounding Stochastic Programming Problems,” Ph.D. Dissertation, The University of British Columbia (Vancouver, BC, 1991).
131. N.C.P. Edirisinghe, “New second-order bounds on the expectation of saddle functions with applications to stochastic linear programming,” Operations Research 44 (1996) pp. 909–922.
132. H.P. Edmundson, “Bounds on the expectation of a convex function of a random variable,” RAND Corporation Paper 982, Santa Monica, CA (1956).
133. p-space,” SIAM Journal of Applied Mathematics 28 (1975) pp. 779–792.
134. G.D. Eppen, R.K. Martin, and L. Schrage, “A scenario approach to capacity planning,” Operations Research 37 (1989) pp. 517–527.
135. Epstein, L. and S. Zin, “Substitution, risk aversion and the temporal behavior of consumption and asset returns: A theoretical framework,” Econometrica 57 (1989), pp. 937-969.
136. Y. Ermoliev, “On the stochastic quasigradient method and quasi-Feyer sequences,” Kibernetika 5 (2) (1969) pp. 73–83 (in Russian; also published in English as Cybernetics 5 (1969) pp. 208–220).
137. Y. Ermoliev, Methods of Stochastic Programming (Nauka, Moscow (in Russian) 1976).
138. Y. Ermoliev, “Stochastic quasigradient methods and their applications to systems optimization,” Stochastics 9 (1983) pp. 1–36.
139. Y. Ermoliev, “Stochastic quasigradient methods” in: Y. Ermoliev and R. Wets, Eds., Numerical Techniques for Stochastic Optimization (Springer-Verlag, Berlin, 1988) pp. 141–186.
140. Y. Ermoliev, A. Gaivoronski, and C. Nedeva, “Stochastic optimization problems with partially known distribution functions,” SIAM Journal on Control and Optimization 23 (1985) pp. 377–394.
141. Y. Ermoliev and R. Wets, “Introduction” in: Y. Ermoliev and R. Wets, Eds., Numerical Techniques for Stochastic Optimization (Springer-Verlag, Berlin, 1988).
142. L.F. Escudero, P.V. Kamesam, A.J. King, and R.J-B Wets, “Production planning via scenario modeling,” Annals of Operations Research 43 (1993) pp. 311–335.
143. W. Feller, An Introduction to Probability Theory and Its Applications (John Wiley, Inc., New York, NY, 1971).
144. A. Ferguson and G.B. Dantzig, “The allocation of aircraft to routes: an example of linear programming under uncertain demands,” Management Science 3 (1956) pp. 45–73.
145. S.D. Flåm, “Nonanticipativity in stochastic programming,” Journal of Optimization Theory and Applications 46 (1985) pp. 23–30.
146. S.D. Flåm, “Asymptotically stable solutions to stochastic problems of Bolza” in: F. Archetti, G. Di Pillo, and M Lucertini, Eds., Stochastic Programming (Lecture Notes in Information and Control 76, 1986) pp. 184–193.
147. A.D. Flaxman, A. Frieze, and M. Krivelevich, “On the random 2-stage minimum spanning tree,” Random Structures and Algorithms 28 (2006) pp. 24–36.
148. A. Flaxman, A.T. Kalai, and H.B. McMahan, “Online convex optimization in the bandit setting: gradient descent without a gradient,” In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005 (SIAM, Philadelphia, PA, 2005) pp. 385-394.
149. W. Fleming and R. Rischel, Deterministic and Stochastic Control (Springer-Verlag, New York, NY, 1975).
150. R. Fourer, “A simplex algorithm for piecewise-linear programming. I: derivation and proof,” Mathematical Programming 33 (1985) pp. 204–233.
151. R. Fourer, “A simplex algorithm for piecewise-linear programming. II: finiteness, feasibility, and degeneracy,” Mathematical Programming 41 (1988) pp. 281–315.
152. R. Fourer, D.M. Gay, and B.W. Kernighan, AMPL: A Modeling Language for Mathematical Programming (Scientific Press, South San Francisco, CA, 1993).
153. B. Fox, “Implementation and relative efficiency of quasirandom sequence generators,” ACM Transactions on Mathematical Software 12 (1986) pp. 362–376.
154. L. Frantzeskakis and W. Powell, “A successive linear approximation procedure for stochastic, dynamic vehicle allocation problems,” Transportation Science 24 (1990) pp. 40–57.
155. L.F. Frantzeskakis and W.B. Powell, “Bounding procedures for multistage stochastic dynamic networks,” Networks 23 (1993) pp. 575–595.
156. K. Frauendorfer, “Solving SLP recourse problems:The case of stochastic technology matrix, RHS, and objective,” Proceedings of 13th IFIP Conference on System Modelling and Optimization (Springer-Verlag, Berlin, 1988a).
157. K. Frauendorfer, “Solving S.L.P. recourse problems with arbitrary multivariate distributions – the dependent case,” Mathematics of Operations Research 13 (1988b) pp. 377–394.
158. K. Frauendorfer, “A simplicial approximation scheme for convex two-stage stochastic programming problems,” Manuskripte, Institut für Operations Research, University of Zurich (Zurich, 1989).
159. K. Frauendorfer, Stochastic Two-Stage Programming (Lecture Notes in Economics and Mathematical Systems 392, 1992).
160. K. Frauendorfer and P. Kall, “A solution method for SLP recourse problems with arbitrary multivariate distributions—the independent case,” Problems in Control and Information Theory 17 (1988) pp. 177–205.
161. A.A. Gaivoronski, “Implementation of stochastic quasigradient methods” in: Y. Ermoliev and R. Wets, Eds., Numerical Techniques for Stochastic Optimization (Springer-Verlag, Berlin, 1988) pp. 313–352.
162. J. Galambos, The Asymptotic Theory of Extreme Order Statistics (John Wiley, Inc., New York, 1978).
163. S.J. Gartska, “An economic interpretation of stochastic programs,” Mathematical Programming 18 (1980) pp. 62–67.
164. S.J. Gartska and D. Rutenberg, “Computation in discrete stochastic programs with recourse,” Operations Research 21 (1973) pp. 112–122.
165. S.J. Gartska and R.J-B Wets, “On decision rules in stochastic programming,” Mathematical Programming 7 (1974) pp. 117–143.
166. H.I. Gassmann, “Conditional probability and conditional expectation of a random vector” in: Y. Ermoliev and R. Wets, Eds., Numerical Techniques for Stochastic Optimization (SpringerVerlag, Berlin, 1988) pp. 237–254.
167. H.I. Gassmann, “Optimal harvest of a forest in the presence of uncertainty,” Canadian Journal of Forest Research 19 (1989) pp. 1267–1274.
168. H.I. Gassmann, “MSLiP: a computer code for the multistage stochastic linear programming problem,” Mathematical Programming 47 (1990) pp. 407–423.
169. H.I. Gassmann and W.T. Ziemba, “A tight upper bound for the expectation of a convex function of a multivariate random variable,” Mathematical Programming Study 27 (1986) pp. 39–53.
170. D.M. Gay, “A variant of Karmarkar’s linear programming algorithm for problems in standard form,” Mathematical Programming 37 (1987) pp. 81–90.
171. M. Gendreau, G. Laporte, and R. Séguin, “Stochastic vehicle routing,” European Journal of Operational Research 88 (1996) pp. 3–12.
172. M. Gendreau, G. Laporte, and R. Séguin, “An exact algorithm for the vehicle routing problem with stochastic demands and customers,” Transportation Science 29 (1995) pp. 143–155.
173. A.M. Geoffrion, “Elements of large-scale mathematical programming,” Management Science 16 (1970) pp. 652–675.
174. A.M. Geoffrion, “Duality in nonlinear programming: a simplified applications-oriented development,” SIAM Rev. 13 (1971) pp. 1–37.
175. I. Gilboa and D. Schmeidler, “Maxmin expected utility with non-unique prior,” Journal of Mathematical Economics 18 (1989) pp. 141-153.
176. C.R. Glassey, “Nested decomposition and multistage linear programs,” Management Science 20 (1973) pp. 282–292.
177. J. Gondzio and A. Grothey, “Exploiting structure in parallel implementation of interior point methods for optimization,” Computational Management Science 6 (2009) pp. 135-160.
178. R.C. Grinold, “A new approach to multistage stochastic linear programs,” Mathematical Programming Study 6 (1976) pp. 19–29.
179. R.C. Grinold, “Model building techniques for the correction of end effects in multistage convex programs,” Operations Research 31 (1983) pp. 407–431.
180. R.C. Grinold, “Infinite horizon stochastic programs,” SIAM Journal on Control and Optimization 24 (1986) pp. 1246–1260.
181. A. Gupta, M. Pál, R. Ravi, and A. Sinha, “Boosted sampling: Approximation algorithms for stochastic optimization problems,” in: L. Babai, Ed., Proc. 36th Annual ACM Sympos. Theory Comput., Chicago, IL,USA, June 13-16, 2004 (ACM Press, New York, 2004) pp. 417-425.
182. A. Gupta, M. Pál, R. Ravi, and A. Sinha, “What about Wednesday? Approximation algorithms for multistage stochastic optimization, ” in C. Chekuri, K. Jansen, J.D.P. Rolim, and L. Trevisan, Eds., Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005, and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings, Lecture Notes in Computer Science 3624 (Springer, Berlin, 2005) pp. 86-98.
183. A. Gupta, R. Ravi, and A. Sinha, “LP rounding approximation algorithms for stochastic network design,” Mathematics of Operations Research 32 (2007) pp. 345–364.
184. L.P. Hansen and T. Sargent, “Discounted linear exponential quadratic gaussian control,” IEEE Transactions on Automatic Control 40 (1995) pp. 968-971.
185. J.M. Harrison, Brownian Motion and Stochastic Flow Systems (John Wiley, Inc., New York, NY, 1985).
186. J.M. Harrison and D.M. Kreps, “Martingales and arbitrage in multiperiod securities markets,” Journal of Economic Theory 20 (1979) pp. 381–408.
187. J.M. Harrison and L.M. Wein, “Scheduling networks of queues:Heavy traffic analysis of a two-station closed network,” Operations Research 38 (1990) pp. 1052–1064.
188. D. Haugland and S.W. Wallace, “Solving many linear programs that differ only in the righthand side,” European Journal of Operational Research 37 (1988) pp. 318–324.
189. E. Hazan, A. Kalai, S. Kale, and A. Agarwal, “Logarithmic regret algorithms for online convex optimization,” in: G. Lugosi and H-U. Simon, Eds., Learning Theory, 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings. Lecture Notes in Computer Science 4005 (Springer, Berlin, 2006) pp. 499–513.
190. R. Hemmecke and R. Schultz, “Decomposition of test sets in stochastic integer programming,” Mathematical Programming 94 (2003) pp. 323–341.
191. D.P. Heyman and M.J. Sobel, Stochastic Models in Operations Research, Volume II, Stochastic Optimization (McGraw-Hill, New York, NY, 1984).
192. J. Higle and S. Sen, “Statistical verification of optimality conditions for stochastic programs with recourse,” Annals of Operations Research 30 (1991a) pp. 215–240.
193. J. Higle and S. Sen, “Stochastic decomposition: an algorithm for two stage linear programs with recourse,” Mathematics of Operations Research 16 (1991b) pp. 650–669.
194. J.L. Higle and S. Sen, Stochastic Decomposition: A Statistical Method for Large Scale Stochastic Linear Programming (Kluwer Academic Publisher, Dordrecht, 1996).
195. J.-B. Hiriart-Urruty, “Conditions nécessaires d’optimalité pour un programme stochastique avec recours,” SIAM Journal on Control and Optimization 16 (1978) pp. 317–329.
196. C. Hjörring and J. Holt, “New optimality cuts for a single vehicle stochastic routing problem,” Annals of Operations Research 86 (1999), pp. 569–584.
197. J.K. Ho and A.S. Manne, “Nested decomposition for dynamic models,” Mathematical Programming 6 (1974) pp. 121–140.
198. W. Hoeffding, “Probability inequalities for sums of bounded random variables,” Journal of the American Statistical Association 58 (1963) pp. 13–30.
199. A. Hogan, J. Morris, and H. Thompson, “Decision problems under risk and chance constrained programming: dilemmas in the transition,” Management Science 27 (1981) pp. 698– 716.
200. A. Hogan, J. Morris, and H. Thompson, “Reply to Professors Charnes and Cooper concerning their response to ‘Decision problems under risk and chance constrained programming: dilemmas in the transition’,” Management Science 30 (1984) pp. 258–259.
201. R.A. Howard, Dynamic Programming and Markov Processes (MIT Press, Cambridge, MA, 1960).
202. K. Høyland and S.W. Wallace, “Generating Scenario Trees for Multistage Decision Problems,” Management Science 47 (2001) pp. 295-307.
203. C.C. Huang, W.T. Ziemba, and A. Ben-Tal, “Bounds on the expectation of a convex function of a random variable: with applications to stochastic programming,” Operations Research 25 (1977) pp. 315–325.
204. P.J. Huber, “The behavior of maximum likelihood estimates under nonstandard conditions,” Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, (University of California, Berkeley, CA, 1967).
205. P.J. Huber, Robust Statistics, John Wiley, 1981.
206. J.C. Hull, Options, Futures and Other Derivatives, third edition, (Prentice-Hall, Upper Saddle River, NJ, 1997).
207. G. Infanger, “Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs; Extended version: including results of large-scale problems,” Technical Report SOL 91-6, Systems Optimization Laboratory, Stanford University (Stanford, CA, 1991).
208. G. Infanger, Planning under Uncertainty: Solving Large-Scale Stochastic Linear Programs (Boyd and Fraser, Danvers, MA, 1994).
209. R. Jagganathan, “A minimax procedure for a class of linear programs under uncertainty,” Operations Research 25 (1977) pp. 173–177.
210. R. Jagganathan, “Use of sample information in stochastic recourse and chance-constrained programming models,” Management Science 31 (1985) pp. 96–108.
211. R. Jagganathan, “Linear programming with stochastic processes as parameters as applied to production planning,” Annals of Operations Research 30 (1991) pp. 107–114.
212. P. Jaillet, “A priori solution of a traveling salesman problem in which a random subset of the customers are visited,” Operations Research 36 (1988) pp. 929–936.
213. R.A. Jarrow and A. Rudd, Option Pricing (Irwin, Homewood, IL, 1983).
214. S. Jasin and S. Kumar, “A re-solving heuristic with bounded revenue loss for network revenue management with customer choice,” Working Paper, Stanford University (Stanford, CA, 2010).
215. J.L. Jensen, “Sur les fonctions convexes et les inégalités entre les valeurs moyennes,” Acta. Math. 30 (1906) pp. 175–193.
216. P. Kall, Stochastic Linear Programming (Springer-Verlag, Berlin, 1976).
217. P. Kall, “Computational methods for solving two-stage stochastic linear programming problems,” Journal of Applied Mathematics and Physics 30 (1979) pp. 261–271.
218. P. Kall, “Stochastic programs with recourse: an upper bound and the related moment problem,” Zeitschrift für Operations Research 31 (1987) pp. A119–A141.
219. P. Kall, “An upper bound for stochastic linear programming using first and total second moments,” Annals of Operations Research 30 (1991) pp. 267–276.
220. P. Kall and J. Mayer, “SLP-IOR: an interactive model management system for stochastic linear programs,” Mathematical Programming 75 (1996) pp. 221–240.
221. P. Kall and D. Stoyan, “Solving stochastic programming problems with recourse including error bounds,” Math. Operationsforsch. Statist. Ser. Optim. 13 (1982) pp. 431–447.
222. P. Kall and S.W. Wallace, Stochastic Programming (John Wiley and Sons, Chichester, UK, 1994).
223. J.G. Kallberg, R.W. White, and W.T. Ziemba, “Short term financial planning under uncertainty,” Management Science 28 (1982) pp. 670–682.
224. J.G. Kallberg and W.T. Ziemba, “Comparison of alternative utility functions in portfolio selection problems,” Management Science 29 (1983) pp. 1257–1276.
225. M. Kallio and E. Porteus, “Decomposition of arborescent linear programs,” Mathematical Programming 13 (1977) pp. 348–356.
226. R.E. Kalman, Topics in Mathematical System Theory (McGraw-Hill, New York, NY, 1969).
227. E. Kao and M. Queyranne, “Budgeting costs of nursing in a hospital,” Management Science 31 (1985) pp. 608–621.
228. N. Karmarkar, “A new polynomial-time algorithm for linear programming,” Combinatorica 4 (1984) pp. 373–395.
229. A. Karr, “Extreme points of certain sets of probability measure, with applications,” Mathematics of Operations Research 8 (1983) pp. 74–85.
230. J. Kemperman, “The general moment problem, a geometric approach,” Annals of Mathematical Statistics 39 (1968) pp. 93–122.
231. A.I. Kibzun and Y.S. Kan, Stochastic Programming Problems with Probability and Quantile Functions (John Wiley Inc., Chichester, UK, 1996).
232. A.I. Kibzun and V.Yu. Kurbakovskiy, “Guaranteeing approach to solving quantile optimization problems,” Annals of Operations Research 30 (1991) pp. 81–93.
233. A. King, “Finite generation method” in: Y. Ermoliev and R. Wets, Eds., Numerical Techniques for Stochastic Optimization (Springer-Verlag, Berlin, 1988a) pp. 295–312.
234. A. King, “Stochastic programming problems:Examples from the literature” in: Y. Ermoliev and R. Wets, Eds., Numerical Techniques for Stochastic Optimization (Springer-Verlag, Berlin, 1988b) pp. 543–567.
235. A. King and R.T. Rockafellar, “Asymptotic theory for solutions in generalized M-estimation and stochastic programming,” Mathematics of Operations Research 18 (1993) pp. 148–162.
236. A.J. King and R.J-B Wets, “Epiconsistency of convex stochastic programs,” Stochastics and Stochastics Reports 34 (1991) pp. 83–92.
237. K.C. Kiwiel, “An aggregate subgradient method for nonsmooth convex minimization,” Mathematical Programming 27 (1983) pp. 320–341.
238. P. Klaassen, “Financial asset-pricing theory and stochastic programming models for asset/liability managment: a synthesis,” Management Science 44 (1998) pp. 31–48.
239. W.K. Klein Haneveld, Duality in Stochastic Linear and Dynamic Programming (Lecture Notes in Economics and Mathematical Systems 274, Springer-Verlag, Berlin, 1985).
240. W.K. Klein Haneveld, “Robustness against dependence in PERT: an application of duality and distributions with known marginals,” Mathematical Programming Study 27 (1986) pp. 153–182.
241. N. Kong, A.J. Schaefer, and B.K. Hunsaker, “Two-stage integer programs with stochastic right-hand sides-A superadditive dual approach,” Mathematical Programming 108 (2006) pp. 275–296.
242. R. Kouwenberg, “Scenario generation and stochastic programming models for asset-liability management,” European Journal of Operations Research 134 (2001) pp. 279–292.
243. M.G. Krein and A.A. Nudel’man, The Markov Moment Problem and Extremal Problems (Translations of Mathematical Monographs 50, 1977).
244. D.M. Kreps and E.L. Porteus, “Temporal von Neumann-Morgenstern and Induced Preferences,” Journal Of Economic Theory 20(1979) pp. 81–10.
245. Daniel Kuhn,“ Aggregation and Discretization in Multistage Stochastic Programming,”Mathematical Programming A 113 (2008) pp. 61–94.
246. H. Kushner, Introduction to Stochastic Control (Holt, New York, NY, 1971).
247. M. Kusy and W.T. Ziemba, “A bank asset and liability management model,” Operations Research 34 (1986) pp. 356–376.
248. B.J. Lageweg, J.K. Lenstra, A.H.G. Rinnooy Kan, and L. Stougie, “Stochastic integer programming by dynamic programming” in: Y. Ermoliev and R. Wets, Eds., Numerical Techniques for Stochastic Optimization (Springer-Verlag, Berlin, 1988) pp. 403–412.
249. G. Laporte and F.V. Louveaux, “The integer L-shaped method for stochastic integer programs with complete recourse,” Operations Research Letters 13 (1993) pp. 133–142.
250. G. Laporte, F.V. Louveaux, and H. Mercure, “Models and exact solutions for a class of stochastic location-routing problems,” European Journal of Operational Research 39 (1989) pp. 71–78.
251. G. Laporte, F.V. Louveaux, and H. Mercure, “An exact solution for the a priori optimization of the probabilistic traveling salesman problem,” Operations Research 42 (1994) pp. 543– 549.
252. G. Laporte, F.V. Louveaux, and L. Van Hamme, “Exact solution to a location problem with stochastic demands,” Transportation Science 28 (1994) pp. 95–103.
253. G. Laporte, F.V. Louveaux and L. Van hamme, “An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands,” Operations Research 50 (2002) pp. 415–423.
254. L. Lasdon, Optimization Theory for Large Systems (Macmillan, New York, NY, 1970).
255. C. Lemaréchal, “Bundle methods in nonsmooth optimization” in: Nonsmooth optimization (Proc. IIASA Workshop) (Pergamon, Oxford-Elmsford, New York, NY, 1978) pp. 79–102.
256. J. Linderoth and S. Wright, “Decomposition algorithms for stochastic programming on a computational grid,” Computational Optimization and its Applications 24 (2003) pp. 207– 250.
257. A.W. Lo, “Semi-parametric upper bounds for option prices and expected payoffs,” Journal of Financial Economics 19 (1987) pp. 373–387.
258. F.V. Louveaux, “Piecewise convex programs,” Mathematical Programming 15 (1978) pp. 53–62.
259. F.V. Louveaux, “A solution method for multistage stochastic programs with recourse with application to an energy investment problem,” Operations Research 28 (1980) pp. 889–902.
260. F.V. Louveaux, “Multistage stochastic programs with block-separable recourse,” Mathematical Programming Study 28 (1986) pp. 48–62.
261. F.V. Louveaux and D. Peeters, “A dual-based procedure for stochastic facility location,” Operations Research 40 (1992) pp. 564–573.
262. F. Louveaux and R. Schultz, “Stochastic integer programming,” in: A. Ruszczyński and A. Shapiro, Eds., Handbooks in Operations Research and Management Science 10, (Elsevier, Amsterdam, 2003) pp. 213–266.
263. F.V. Louveaux and Y. Smeers, “Optimal investments for electricity generation: a stochastic model and a test-problem” in: Numerical Techniques for Stochastic Optimization (SpringerVerlag, Berlin, 1988) pp. 33–64.
264. F.V. Louveaux and Y. Smeers, “Stochastic optimization for the introduction of a new energy technology,” Stochastics (to appear) (2011).
265. F.V. Louveaux and M. van der Vlerk, “Stochastic programming with simple integer recourse,” Mathematical Programming 61 (1993) pp. 301–325.
266. J. Luedtke and S. Ahmed, “A sample approximation approach for optimization with probabilistic constraints,” SIAM Journal on Optimization 19 (2008) pp. 674–699.
267. A. Madansky, “Bounds on the expectation of a convex function of a multivariate random variable,” Annals of Mathematical Statistics 30 (1959) pp. 743–746.
268. A. Madansky, “Inequalities for stochastic linear programming problems,” Management Science 6 (1960) pp. 197–204.
269. M. Maddox and J.R. Birge, “Bounds on the distribution of tardiness in a PERT network,” Technical Report, Department of Industrial and Operations Engineering, University of Michigan (Ann Arbor, MI, 1991).
270. W. Mak, D.P. Morton, and R.K.Wood, “Monte Carlo bounding techniques for determining solution quality in stochastic programs,” Operations Research Letters 24 (1999) pp. 47–56.
271. O. Mangasarian and J.B. Rosen, “Inequalities for stochastic nonlinear programming problems,” Operations Research 12 (1964) pp. 143–154.
272. A.S. Manne, “Waiting for the breeder” in: Review of Economic Studies Symposium (1974) pp. 47–65.
273. A.S. Manne and R. Richels, Buying Greenhouse Insurance—The Economic Costs of Carbon Dioxide Emission Limits (MIT Press, Cambridge, MA, 1992).
274. H.M. Markowitz, Portfolio Selection; Efficient Diversification of Investments (John Wiley, Inc., New York, NY, 1959).
275. K. Marti, “Approximationen von Entscheidungsproblemen mit linearer Ergebnisfunktion und positiv homogener, subadditiver Verlusfunktion,” Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 31 (1975) pp. 203–233.
276. K. Marti, Descent Directions and Efficient Solutions in Discretely Distributed Stochastic Programs, (Lecture Notes in Economics and Mathematical Systems 299, Springer-Verlag, Berlin, 1988).
277. R.K. Martin, Large Scale Linear and Integer Optimization: A Unified Approach (Kluwer Academic, Boston, 1999).
278. L. McKenzie, “Turnpike theory,” Econometrica 44 (1976) pp. 841–864.
279. R.C. Merton, “On the pricing of corporate debt: the risk structure of interest rates,” The Journal of Finance 29 (1974) pp. 449-470 (Papers and Proceedings of the Thirty-Second Annual Meeting of the American Finance Association, New York, New York, December 28-30, 1973).
280. P. Michel and J.-P. Penot, “Calcul sous-différentiel pour des fonctions lipschitziennes et non lipschitziennes,” Comptes Rendus des Seances de l’Académie des Sciences Paris. Serie 1. Mathématique 298 (1984) pp. 269–272.
281. J. Miller and H. Wagner, “Chance-constrained programming with joint chance constraints,” Operations Research 12 (1965) pp. 930–945.
282. G.J. Minty, “On the maximal domain of a ‘monotone’ function,” Michigan Mathematics Journal 8 (1961) pp. 135–137.
283. F. Mirzoachmedov and S. Uriasiev, “Adaptive step-size control for stochastic optimization algorithm,” Zhurnal vicisl. mat. i mat. fiz. 6 (1983) pp. 1314–1325 (in Russian).
284. B. Mordukhovich, “Approximation methods and extremum conditions in nonsmooth control systems,” Soviet Mathematics Doklady 36 (1988) pp. 164–168.
285. D.P. Morton, “An enhanced decomposition algorithm for multistage stochastic hydroelectric scheduling,” Annals of Operations Research64 (1996) pp. 211–235.
286. D.P. Morton, “Stopping rules for a class of sampling-based stochastic programming algorithms,” Operations Research 46 (1998) pp. 710–718.
287. J.M. Mulvey and A. Ruszczyński, “A new scenario decomposition method for large scale stochastic optimization,” Operations Research 43 (1995) pp. 477–490.
288. J.M. Mulvey and H. Vladimirou, “Stochastic network optimization models for investment planning,” Annals of Operations Research 20 (1989) pp. 187–217.
289. J.M. Mulvey and H. Vladimirou, “Applying the progressive hedging algorithm to stochastic generalized networks,” Annals of Operations Research 31 (1991a) pp. 399–424.
290. J.M. Mulvey and H. Vladimirou, “Solving multistage stochastic networks: an application of scenario aggregation,” Networks 21 (1991b) pp. 619–643.
291. J.M. Mulvey and H. Vladimirou, “Stochastic network programming for financial planning problems,” Management Science 38 (1992) pp. 1642–1664.
292. K.G. Murty, “Linear programming under uncertainty: a basic property of the optimal solution,” Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 10 (1968) pp. 284–288.
293. K.G. Murty, Linear Programming (John Wiley, Inc., New York, NY, 1983).
294. J.L. Nazareth and R.J-B Wets, “Algorithms for stochastic programs: the case of nonstochastic tenders,” Mathematical Programming Study 28 (1986) pp. 1–28.
295. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization (Wiley Interscience, New York, NY, 1988).
296. A. Nemirovksi and A. Shapiro, “Convex approximations of chance constrained programs,” SIAM Journal on Optimization 17 (2006) 969-996.
297. Yu. Nesterov and J.-Ph. Vial, “Confidence level solutions for stochastic programming,” Automatica 44 (2008), 1559–1568.
298. H. Niederreiter, “Quasi–Monte Carlo methods and pseudorandom numbers,” Bulletin of the American Mathematical Society 84 (1978) pp. 957–1041.
299. S.S. Nielsen and S.A. Zenios, “A massively parallel algorithm for nonlinear stochastic network problems,” Operations Research 41 (1993a) pp. 319–337.
300. S.S. Nielsen and S.A. Zenios, “Proximal minimizations with D-functions and the massively parallel solution of linear stochastic network programs,” International Journal of Supercomputing and Applications 7 (1993b) pp. 349–364.
301. M.-C. Noël and Y. Smeers, “Nested decomposition of multistage nonlinear programs with recourse,” Mathematical Programming 37 (1987) pp. 131–152.
302. V.I. Norkin, Y.M. Ermoliev, and A. Ruszczyński, “On optimal allocation of indivisibles under uncertainty,” Operations Research 46 (1998) pp. 381–395.
303. V.I. Norkin, G.Ch. Pflug, and A. Ruszczyński, “A branch and bound method for stochastic global optimization,” Mathematical Programming 83 (1998) pp. 425–450.
304. L. Ntaimo and S. Sen,“ A Branch-and-Cut algorithm for two-stage stochastic mixed-binary programs with continuous first-stage variables,” International Journal of Computational Science and Engineering 3 (2008a) pp. 231–241.
305. L. Ntaimo and S. Sen, “A comparative study of decomposition algorithms for stochastic combinatorial optimization,” Computational Optimization and Applications 40 (2008b) pp. 299–319.
306. S. Parikh, Lecture Notes on Stochastic Programming (University of California, Berkeley, CA, 1968).
307. M.V.F. Pereira and L.M.V.G. Pinto, “Stochastic optimization of a multireservoir hydroelectric system—A decomposition approach,” Water Resources Research 21 (1985) pp. 779–792.
308. M.V.F. Pereira and L.M.V.G. Pinto, “Multistage Stochastic Optimization Applied to Energy Planning,” Mathematical Programming 52 (1991) pp. 359-375.
309. G.Ch. Pflug, “Stepsize rules, stopping times and their implementation in stochastic quasigradient algorithms” in: Y. Ermoliev and R. Wets, Eds., Numerical Techniques for Stochastic Optimization (Springer-Verlag, Berlin, 1988) pp. 353–372.
310. G.Ch. Pflug, “Scenario tree generation for multiperiod financial optimization by optimal discretization,” Mathematical Programming, Ser. B 89 (2001) pp. 251271.
311. G.Ch. Pflug and L. Halada, “A note on the recursive and parallel structure of the Birge and Qi factorization,” Computational Optimization and Applications 24 (2003) pp. 251–265.
312. J. Pintér, “Deterministic approximations of probability inequalities,” ZOR—Methods and Models of Operations Research, Series Theory 33 (1989) pp. 219–239.
313. A.B. Philpott and Z. Guan, “On the convergence of stochastic dual dynamic programming and related methods,” Operations Research Letters 36 (2008) pp. 450-455.
314. E.L. Plambeck, B-R. Fu, S.M. Robinson, and R. Suri, “Sample-path optimization of convex stochastic performance functions,” Mathematical Programming 75 (1996) pp. 137–176.
315. W.B. Powell, “A comparative review of alternative algorithms for the dynamic vehicle allocation program” in: B. Golden and A. Assad, Eds., Vehicle Routing: Methods and Studies (North-Holland, Amsterdam, 1988).
316. W.B. Powell, Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley, New York, 2007).
317. A. Prékopa, “Logarithmic concave measures with application to stochastic programming,” Acta. Sci. Math. (Szeged) 32 (1971) pp. 301–316.
318. A. Prékopa, “Contributions to the theory of stochastic programs,” Mathematical Programming 4 (1973) pp. 202–221.
319. A. Prékopa, “Programming under probabilistic constraints with a random technology matrix,” Mathematische Operationsforschung und Statistik 5 (1974) pp. 109–116.
320. A. Prékopa, “Logarithmically concave measures and related topics” in: M.A.H. Dempster, Ed., Stochastic Programming (Academic Press, New York, NY, 1980).
321. A. Prékopa, “Boole-Bonferroni inequalities and linear programming,” Operations Research 36 (1988) pp. 145–162.
322. A. Prékopa, Stochastic Programming (Kluwer Academic Publishers, Dordrecht, Netherlands, 1995).
323. A. Prékopa and T. Szántai, “On optimal regulation of a storage level with application to the water level regulation of a lake,” Survey of Mathematical Programming (Proc. Ninth Internat. Math. Programming Sympos., Budapest, 1976), Vol. 2 (North-Holland, Amsterdam, 1976).
324. H.N. Psaraftis, “On the practical importance of asymptotic optimality in certain heuristic algorithms,” Networks (1984) pp. 587–596.
325. L. Qi, “Forest iteration method for stochastic transportation problem,” Mathematical Programming Study (1985) pp. 142–163.
326. L. Qi, “An alternating method for stochastic linear programming with simple recourse,” Stochastic Processes and Their Applications 841 (1986) pp. 183–190.
327. H. Raiffa, Decision Analysis (Addison-Wesley, Reading, MA, 1968).
328. H. Raiffa and R. Schlaifer, Applied Statistical Decision Theory (Harvard University, Boston, MA, 1961).
329. R. Ravi and A. Sinha, “Hedging uncertainty: Approximation algorithms for stochastic optimization problems,” Mathematical Programming Ser. A 108 (2006) pp. 97-114.
330. W. Rei, J.-F. Cordeau, M. Gendreau and P. Soriano, “Accelerating Benders’ decomposition by local branching,” INFORMS Journal on Computing 21 (2009) pp. 333-345.
331. H. Robbins and S. Monro, “A stochastic approximation method,” Annals of Mathematical Statistics 22 (1951) pp. 400–407.
332. S.M. Robinson and R.J-B Wets, “Stability in two-stage stochastic programming,” SIAM Journal on Control and Optimization 25 (1987) pp. 1409–1416.
333. R.T. Rockafellar, Convex Analysis (Princeton University Press, Princeton, NJ, 1969).
334. R.T. Rockafellar, Conjugate Duality and Optimization (Society for Industrial and Applied Mathematics, Philadelphia, PA, 1974).
335. R.T. Rockafellar, “Monotone operators and the proximal point algorithm,” SIAM Journal on Control and Optimization 14 (1976a) pp. 877–898.
336. R.T. Rockafellar, Integral Functionals, Normal Integrands and Measurable Selections (Lecture Notes in Mathematics 543, 1976b).
337. R.T. Rockafellar and S. Uryasev, “Optimization of Conditional Value-At-Risk,” The Journal of Risk 2:3 (2000) pp. 21–41.
338. R.T. Rockafellar and S. Uryasev, “Conditional Value-at-Risk for general loss distributions,” Journal of Banking and Finance 26 (2002) pp. 1443–1471.
339. R.T. Rockafellar and R.J-B Wets, “Stochastic convex programming: basic duality,” Pacific Journal of Mathematics 6 (1976a) pp. 173–195.
340. R.T. Rockafellar and R.J-B Wets, “Stochastic convex programming, relatively complete recourse and induced feasibility,” SIAM Journal on Control and Optimization 14 (1976b) pp. 574–589.
341. R.T. Rockafellar and R.J-B Wets, “A Lagrangian finite generation technique for solving linear-quadratic problems in stochastic programming,” Mathematical Programming Study 28 (1986) pp. 63–93.
342. R.T. Rockafellar and R.J-B Wets, “Scenarios and policy aggregation in optimization under uncertainty,” Mathematics of Operations Research 16 (1991) pp. 119–147.
343. W. Römisch, “Stability of stochastic programming problems,” in A. Ruszczyński and A. Shapiro (eds.), Handbooks in Operations Research and Management Science, Volume 10: Stochastic Programming (Elsevier, Amsterdam, 2003) pp. 483–554.
344. W. Römisch and R. Schultz, “Distribution sensitivity in stochastic programming,” Mathematical Programming 50 (1991a) pp. 197–226.
345. W. Römisch and R. Schultz, “Stability analysis for stochastic programs,” Annals of Operations Research 31 (1991b) pp. 241–266.
346. C. Roos, T. Terlaky, and J-P. Vial, Interior Point Methods for Linear Optimization, Second Edition (Springer, New York, 2005).
347. S.M. Ross, Introduction to Stochastic Dynamic Programming (Academic Press, New York, London, 1983).
348. H.L. Royden, Real Analysis (Macmillan, London, NY, 1968).
349. R.Y. Rubinstein, Simulation and the Monte Carlo Method (John Wiley Inc., New York, NY, 1981).
350. A. Ruszczyński, “A regularized decomposition for minimizing a sum of polyhedral functions,” Mathematical Programming 35 (1986) pp. 309–333.
351. A. Ruszczyński, “Parallel decomposition of multistage stochastic programming problems,” Mathematical Programming 58 (1993a) pp. 201–228.
352. A. Ruszczyński, “Regularized decomposition of stochastic programs: algorithmic techniques and numerical results,” Working Paper WP-93-21, International Institute for Applied Systems Analysis, Laxenburg, Austria (1993b).
353. A. Ruszczyński, “Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra,” Mathematical Programming 93 (2002) pp.195–215.
354. G. Salinetti, “Approximations for chance constrained programming problems,” Stochastics 10 (1983) pp. 157–169.
355. B. Sandikçi, N. Kong, and A.J. Schaefer, “A hierarchy of bounds for stochastic mixed-integer programs,” Chicago Booth Research Paper No. 09-21 (Chicago, IL, June 3, 2009); available at SSRN: http://ssrn.com/abstract=1413774.
356. Y.S. Sathe, M. Pradhan, and S.P. Shah, “Inequalities for the probability of the occurrence of at least m out of n events,” Journal of Applied Probability 17 (1980) pp. 1127–1132.
357. H. Scarf, “A minimax solution of an inventory problem” in: K.J. Arrow, S. Karlin, and H. Scarf, Eds., Studies in the Mathematical Theory of Inventory and Production (Stanford University Press, Stanford, CA, 1958).
358. R. Schultz, “Continuity properties of expectation functionals in stochastic integer programming,” Mathematics of Operations Research 18 (1993) pp. 578–589.
359. R. Schultz, L. Stougie and M.H. van der Vlerk, “Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions,” Mathematical Programming 83 (1998) pp. 229–252.
360. N. Secomandi and F. Margot, “Reoptimization approaches for the vehicle-routing problem with stochastic demands,” Operations Research 57 (2009) pp. 214–230.
361. S. Sen, “Algorithms for stochastic mixed-integer programming”, in: K. Aardal, G.L. Nemhauser, R. Weismantel, Eds., Handbooks in Operations Research and Management Science (Elsevier, Amsterdam, 2005) pp. 515–558.
362. 2 algorithm for large scale stochastic mixed-integer programming,” Mathematical Programming 104 (2005) pp. 1–20.
363. S. Sen and H.D. Sherali, “Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming,” Mathematical Programming 106 (2006) pp. 203– 223
364. D.B. Shmoys and C. Swamy, “An approximation scheme for stochastic linear programming and its application to stochastic integer programs,” Journal of the ACM 53 (2006) pp. 978– 1012.
365. A. Shapiro, “Asymptotic analysis of stochastic programs,” Annals of Operations Research 30 (1991) pp. 169–186.
366. A. Shapiro, “Inference of statistical bounds for multistage stochastic programming problems,” Mathematical Methods of Operations Research 58 (2003) pp. 57–68.
367. A. Shapiro and T. Homem-de-Mello, “On the rate of convergence of optimal solutions of Monte Carlo approximations of stochastic programs,” SIAM Journal on Optimization 11 (2000) pp. 70–86.
368. W.F. Sharpe, “Capital asset prices: a theory of market equilibrium under conditions of risk,” Journal of Finance 19 (1964) pp. 425–442.
369. D.B. Shmoys and C. Swamy,“ An approximation scheme for stochastic linear programming and its application to stochastic integer programs,” Journal of the ACM 53 (2006) pp. 978– 1012.
370. a,” Dokl. Akad. Nauk SSSR 131 (1960) pp. 1028-1031.
371. L. Somlyódi and R.J-B Wets, “Stochastic optimization models for lake eutrophication management,” Operations Research 36 (1988) pp. 660–681.
372. G.J. Stigler, “The cost of subsistence,” Journal of Farm Economics 27 (1945), 303–314.
373. L. Stougie, Design and Analysis of Algorithms for Stochastic Integer Programming (Centrum voor Wiskunde en Informatica, Amsterdam, 1987).
374. B. Strazicky, “Some results concerning an algorithm for the discrete recourse problem,” in: M.A.H. Dempster, Ed., Stochastic Programming (Academic Press, New York, NY, 1980).
375. A.H. Stroud, Approximate Calculation of Multiple Integrals (Prentice-Hall, Inc., Englewood Cliffs, NJ, 1971).
376. J. Sun, L. Qi, and K-H. Tsai, “A simplex method for network programs with convex separable piecewise linear costs and its application to stochastic transshipment problems,” in: D.Z. Du and P.M. Pardalos, Eds., Network Optimization Problems: Algorithms, Applications and Complexity (World Scientific Publishing Co., London, 1993) pp. 281–300.
377. C. Swamy and D.B. Shmoys, “Sampling-based approximation algorithms for multistage stochastic optimization, in: Proceedings of FOCS 2005 (IEEE Computer Society, Los Alamitos, CA, 2005) pp. 357–366.
378. C. Swamy and D.B. Shmoys, “Approximation Algorithms for 2-Stage Stochastic Optimization Problems,” ACM SIGACT News 37:March (2006) pp. 33–46.
379. G.H. Symonds, “Chance-constrained equivalents of stochastic programming problems,” Operations Research 16 (1968) pp. 1152–1159.
380. T. Szántai, “Evaluation of a special multivariate gamma distribution function,” Mathematical Programming Study 27 (1986) pp. 1–16.
381. G. Taguchi, Introduction to Quality Engineering (Asian Productivity Center, Tokyo, Japan, 1986).
382. G. Taguchi, E.A. Alsayed, and T. Hsiang, Quality Engineering in Production Systems (McGraw-Hill Inc., New York, NY, 1989).
383. H.A. Taha, Operations Research: An Introduction, Fifth edition (Macmillan, New York, NY, 1992).
384. S. Takriti, “On-line Solution of Linear Programs with Varying Right-Hand Sides,” Ph.D. Dissertation, Department of Industrial and Operations Engineering, University of Michigan (Ann Arbor, MI, 1994).
385. S. Takriti and J.R. Birge, “Using integer programming to refine Lagrangian-based unit commitment solutions,” IEEE Transactions on Power Systems 15 (2000a), pp. 151-156.
386. S. Takriti and J.R. Birge, “Lagrangian solution techniques and bounds for loosely-coupled mixed-integer stochastic programs,” Operations Research 48 (2000b) pp. 91–98.
387. K.T. Talluri and G.J. van Ryzin, Theory and Practice of Revenue Management (Springer, New York, 2005).
388. M.J. Todd and B.P. Burrell, “An extension of Karmarkar’s algorithm for linear programming using dual variables,” Algorithmica 1 (1986) pp. 409–424.
389. D.M. Topkis and A.F. Veinott, Jr., “On the convergence of some feasible Eddirection algorithms for nonlinear programming,” SIAM Journal on Control 5 (1967) pp. 268–279.
390. C. Toregas, R. Swain, C. Revelle, and L. Bergmann, “The location of emergency service facilities,” Operations Research 19 (1971) pp. 1363–1373.
391. S. Uriasiev, “Adaptive stochastic quasigradient methods” in: Y. Ermoliev and R. Wets, Eds., Numerical Techniques for Stochastic Optimization (Springer-Verlag, Berlin, 1988) pp. 373– 384.
392. F.A. Valentine, Convex Sets (McGraw-Hill Inc., New York, NY, 1964).
393. M. H. van der Vlerk, “Convex approximations for complete integer recourse models,” Mathematical Programming 99 (2004) pp. 297–310.
394. M. H. van der Vlerk, Stochastic Programming Bibliography on the World Wide Web, http://mally.eco.rug.nl/spbib.html, 1996-2007.
395. R. Van Slyke and R.J-B Wets, “L-shaped linear programs with application to optimal control and stochastic programming,” SIAM Journal on Applied Mathematics 17 (1969) pp. 638– 663.
396. L. Vandenberghe and S. Boyd,“ Semidefinite Programming,” SIAM Review 38 (1996) pp. 49–95.
397. P. Varaiya and R.J-B Wets, “Stochastic dynamic optimization approaches and computation” in: M. Iri and K. Tanabe, Eds., Mathematical Programming: Recent Developments and Applications (Kluwer, Dordrecht, Netherlands, 1989) pp. 309–332.
398. O. Vasiček, “Probability of loss on loan portfolio,” KMV Corporation, Technical Report (San Francisco, CA, 1987); available at: www.moodyskmv.com/research/files/wp/Probability of Loss on Loan Portfolio.pdf.
399. O. Vasiček, “Limiting loan loss portfolio distribution,” KMV Corporation, Technical Report (San Francisco, CA, 1991); available at: www.moodyskmv.com/research/files/wp/Probability of Loss on Loan Portfolio.pdf.
400. O. Vasiček, “Loan portfolio value,” Risk 15:12 (2002) pp. 160-162.
401. J.A. Ventura and D.W. Hearn, “Restricted simplicial decomposition for convex constrained problems,” Mathematical Programming 59 (1993) pp. 71–85.
402. B. Verweij, S. Ahmed, A.J. Kleywegt, G. Nemhauser, and A. Shapiro, “The sample average approximation method applied to stochastic routing problems: a computational study,” Computational Optimization and Applications 24 (2003) pp. 289–333.
403. J. von Neumann and O. Morgenstern, Theory of Games and Economic Behavior (Princeton University Press, Princeton, NJ, 1944).
404. A. Wald, Statistical Decision Functions (John Wiley, Inc. New York, NY, 1950).
405. D. Walkup and R.J-B Wets, “Stochastic programs with recourse,” SIAM Journal on Applied Mathematics 15 (1967) pp. 1299–1314.
406. D. Walkup and R.J-B Wets, “Stochastic programs with recourse II: on the continuity of the objective,” SIAM Journal on Applied Mathematics 17 (1969) pp. 98–103.
407. S.W. Wallace, “Decomposing the requirement space of a transportation problem into polyhedral cones,” Mathematical Programming Study 28 (1986a) pp. 29–47.
408. S.W. Wallace, “Solving stochastic programs with network recourse,” Networks 16 (1986b) pp. 295–317.
409. S.W. Wallace, “A piecewise linear upper bound on the network recourse function,” Networks 17 (1987) pp. 87–103.
410. S.W. Wallace, “Decision making under uncertainty: is sensitivity analysis of any use?” Operations Research 48 (2000) pp. 20–25.
411. S.W. Wallace and R.J-B Wets, “Preprocessing in stochastic programming: the case of linear programs,” ORSA Journal on Computing 4 (1992) pp. 45–59.
412. S.W. Wallace and T.C. Yan, “Bounding multi-stage stochastic programs from above,” Mathematical Programming 61 (1993) pp. 111–129.
413. S.W. Wallace and W.T. Ziemba, Eds., Applications of Stochastic Programming: MPS-SIAM Book Series on Optimization 5 (SIAM/MPS, Philadelphia, PA, 2005).
414. R.J-B Wets, “Programming under uncertainty: the equivalent convex program,” SIAM Journal on Applied Mathematics 14 (1966) pp. 89–105.
415. R.J-B Wets, “Characterization theorems for stochastic programs,” Mathematical Programming 2 (1972) pp. 166–175.
416. R.J-B Wets, “Stochastic programs with fixed recourse: the equivalent deterministic problem,” SIAM Review 16 (1974) pp. 309–339.
417. R.J-B Wets, “Convergence of convex functions, variational inequalities and convex optimization problems” in: R.W. Cottle, F. Giannessi and J.-L. Lions, Eds., Variational Inequalities and Complementarity Problems (John Wiley, Inc., New York, NY, 1980a) pp. 375–404.
418. R.J-B Wets, “Stochastic multipliers, induced feasibility and nonanticipativity in stochastic programming” in: M.A.H. Dempster, Ed., Stochastic Programming (Academic Press, New York, NY, 1980b).
419. R.J-B Wets, “Solving stochastic programs with simple recourse,” Stochastics 10 (1983a) pp. 219–242.
420. R.J-B Wets, “Stochastic programming: solution techniques and approximation schemes” in: A. Bachem, M. Grötschel, and B. Korte, Eds., Mathematical Programming: State-of-the-Art 1982 (Springer-Verlag, Berlin, 1983b) pp. 560–603.
421. R.J-B Wets, “Large-scale linear programming techniques in stochastic programming” in: Y. Ermoliev and R. Wets, Eds., Numerical Techniques for Stochastic Optimization (SpringerVerlag, Berlin, 1988).
422. R.J-B Wets, “Stochastic programming” in: G.L. Nemhauser, A.H.G. Rinnooy Kan, and M.J. Todd, Eds., Optimization (Handbooks in Operations Research and Management Science; Vol. 1, North–Holland, Amsterdam, Netherlands, 1990).
423. R.J-B Wets and C. Witzgall, “Algorithms for frames and lineality spaces of cones,” Journal of Research of the National Bureau of Standards Section B 71B (1967) pp. 1–7.
424. P. Whittle, Risk-sensitive Optimal Control (John Wiley & Sons, Chichester, UK, 1990).
425. A.C. Williams, “A stochastic transportation problem,” Operations Research 11 (1963) pp. 759–770.
426. A.C. Williams, “Approximation formulas for stochastic linear programming,” SIAM Journal on Applied Mathematics 14 (1966) pp. 668–677.
427. E.L. Williamson,“Airline Network Seat Control,” Ph.D. Dissertation, MIT (Cambridge, MA, 1992).
428. R.J. Wittrock, “Advances in a nested decomposition algorithm for solving staircase linear programs,” Technical Report SOL 83-2, Systems Optimization Laboratory, Stanford University (Stanford, CA, 1983).
429. R. Wollmer, “Two stage linear programming under uncertainty with 0-1 integer first stage variables,” Mathematical Programming 19 (1980) pp. 279–288.
430. L. Wolsey, Integer Programming (John Wiley and Sons, New York, 1998).
431. H. Woźniakowski, “Average-case complexity of multivariate integration,” Bulletin of the American Mathematical Society (new series) 24 (1991) pp. 185–194.
432. S.E. Wright, “Primal-dual aggregation and disaggregation for stochastic linear programs,” Mathematics of Operations Research 19 (1994) pp. 893–908.
433. D. Yang and S.A. Zenios, “A scalable parallel interior point algorithm for stochastic linear programming and robust optimization,” in: A. Murli and G. Toraldo, Eds., Computational Issues in High Performance Software for Nonlinear Optimization (Springer, New York, 1997) pp. 143–158.
434. Y. Ye, Interior Point Algorithms: Theory and Analysis (John Wiley and Sons, New York, 1997).
435. J.W. Yen and J.R. Birge, “A stochastic programming approach to the airline crew scheduling Problem,” Transportation Science 40 (2006) pp. 3–14.
436. J. Žáčková, “On minimax solutions of stochastic linear programming problems,” Časopis pro Pěstování Matematiky 91 (1966) pp. 423–430.
437. S.A. Zenios, Financial Optimization (Cambridge University Press, Cambridge, UK, 1993).
438. W.T. Ziemba, “Computational algorithms for convex stochastic programs with simple recourse,” Operations Research 18 (1970) pp. 414–431.
439. W.T. Ziemba and R.G. Vickson, Stochastic Optimization Models in Finance (Academic Press, New York, NY, 1975).
440. M. Zinkevich, “Online convex programming and generalized infinitesimal gradient ascent,” in: T. Fawcett and N. Mishra, Eds., Proceedings of the Twentieth International Conference on Machine Learning (The AAAI Press, Menlo Park, CA, 2003) pp. 928–936.
441. P. Zipkin, “Bounds for row-aggregation in linear programming,” Operations Research 28 (1980a) pp. 903–916.
442. P. Zipkin, “Bounds on the effect of aggregating variables in linear programs,” Operations Research 28 (1980b) pp. 403–418.