Birge J.R., Louveaux F. Introduction to Stochastic Programming
Подождите немного. Документ загружается.
454 References
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 dy-
namic 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 prob-
lems,” 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 Polit-
ical 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 con-
fidence levels,” Mathematical Programming 102(2005) pp. 25-46.
78. D.R. Cari˜no, 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 con-
strained 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 stochas-
tic 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).
References 455
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´atal, 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 Program-
ming,” 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 sam-
pling 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 un-
certainty,” 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´ak, “Three-digit accurate multiple normal probabilities,” Numerische Mathematik 35
(1980) pp. 369–380.
105. I. De´ak, “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´ak, Random Number Generators and Simulation (Akad´emiai Kiad´o, 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 Dif-
ferential 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,” Stochas-
tics 25 (1988) pp. 15–42.
112. M.A.H. Dempster, “Sequential importance sampling algorithms for dynamic stochastic pro-
gramming,” Jounral of Mathematical Sciences 133 (2006), pp. 1422–1444.
113. M.A.H. Dempster and A. Papagaki-Papoulias, “Computational experience with an approxi-
mate method for the distribution problem” in: M.A.H. Dempster, Ed., Stochastic Program-
ming (Academic Press, New York, NY, 1980) pp. 223–243.
456 References
114. V.F. Demyanov and L.V. Vasiliev, Nedifferentsiruemaya optimizatsiya (Nondifferentiable op-
timization) (Nauka, Moscow, 1981).
115. D. Dentcheva and A. Ruszczy´nski, “Robust stochastic dominance and its application to risk-
averse 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´a, “An upper bound on the expectation of simplicial functions of multivariate random
variables,” Mathematical Programming 55 (1991) pp. 69–80.
119. V. Dupaˇc, “A dynamic stochastic approximation method,” Annals of Mathematical Statistics
6 (1965) pp. 1695–1702.
120. J. Dupaˇcov´a, “Minimax stochastic programs with nonconvex nonseparable penalty func-
tions” in: A. Pr´ekopa, Ed., Progress in Operations Research (Janos Bolyai Math. Soc., 1976)
pp. 303–316.
121. J. Dupaˇcov´a, “The minimax approach to stochastic linear programming and the moment
problem,” Ekonom.-Mat. Obzor 13 (1977) pp. 297–307.
122. J. Dupaˇcov´a, “Stability in stochastic programming with recourse-contaminated distribu-
tions,” Mathematical Programming Study 28 (1984) pp. 72–83.
123. J. Dupaˇcov´a, “Stability and sensitivity analysis for stochastic programming,” Annals of Op-
erations Research 27 (1990) pp. 115–142.
124. J. Dupaˇcov´a, N. Gr¨owe-Kuska and W. R¨omisch, “Scenario reduction in stochastic program-
ming: An approach using probability metrics,” Mathematical Programming, Ser. A 95 (2003)
pp. 493–511.
125. J. Dupaˇcov´a 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 optimisa-
tion,” SPORReport 2002-05, Dept. of Mathematics and Computer Science, Eindhoven Tech-
nical 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. Disser-
tation, 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. M. Eisner and P. Olsen, “Duality for stochastic programming interpreted as l.p. in L
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,” Op-
erations 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,” Kiber-
netika 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 optimiza-
tion,” Stochastics 9 (1983) pp. 1–36.
139. Y. Ermoliev, “Stochastic quasigradient methods” in: Y. Ermoliev and R. Wets, Eds., Numer-
ical Techniques for Stochastic Optimization (Springer-Verlag, Berlin, 1988) pp. 141–186.
References 457
140. Y. Ermoliev, A. Gaivoronski, and C. Nedeva, “Stochastic optimization problems with par-
tially 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 Tech-
niques 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˚am, “Nonanticipativity in stochastic programming,” Journal of Optimization Theory
and Applications 46 (1985) pp. 23–30.
146. S.D. Fl˚am, “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 set-
ting: gradient descent without a gradient,” In Proceedings of the Sixteenth Annual ACM-SIAM
Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, Jan-
uary 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 dy-
namic networks,” Networks 23 (1993) pp. 575–595.
156. K. Frauendorfer, “Solving SLP recourse problems:The case of stochastic technology ma-
trix, 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 pro-
gramming problems,” Manuskripte, Institut f¨ur 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 The-
ory 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).
458 References
163. S.J. Gartska, “An economic interpretation of stochastic programs,” Mathematical Program-
ming 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 (Springer-
Verlag, Berlin, 1988) pp. 237–254.
167. H.I. Gassmann, “Optimal harvest of a forest in the presence of uncertainty,” Canadian Jour-
nal 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 func-
tion 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´eguin, “Stochastic vehicle routing,” European Journal of
Operational Research 88 (1996) pp. 3–12.
172. M. Gendreau, G. Laporte, and R. S´eguin, “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 de-
velopment,” 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 Pro-
gramming 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 Opti-
mization 24 (1986) pp. 1246–1260.
181. A. Gupta, M. P´al, 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´al, R. Ravi, and A. Sinha, “What about Wednesday? Approximation algo-
rithms 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 Combinato-
rial Optimization Problems, APPROX 2005, and 9th International Workshop on Randomiza-
tion and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceed-
ings, 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).
References 459
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 right-
hand 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, Pro-
ceedings. 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 program-
ming,” Mathematical Programming 94 (2003) pp. 323–341.
191. D.P. Heyman and M.J. Sobel, Stochastic Models in Operations Research, Volume II, Stochas-
tic 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´ecessaires d’optimalit´e pour un programme stochastique
avec recours,” SIAM Journal on Control and Optimization 16 (1978) pp. 317–329.
196. C. Hj¨orring 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 Pro-
gramming 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 con-
strained 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 concern-
ing 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 Prob-
lems,” 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 Sad-
dle 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 (Stan-
ford, 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.
460 References
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 rev-
enue management with customer choice,” Working Paper, Stanford University (Stanford,
CA, 2010).
215. J.L. Jensen, “Sur les fonctions convexes et les in´egalit´es 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 prob-
lems,” 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 prob-
lem,” Zeitschrift f¨ur Operations Research 31 (1987) pp. A119–A141.
219. P. Kall, “An upper bound for stochastic linear programming using first and total second mo-
ments,” 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 uncer-
tainty,” 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,” Mathe-
matics of Operations Research 8 (1983) pp. 74–85.
230. J. Kemperman, “The general moment problem, a geometric approach,” Annals of Mathemat-
ical 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 optimiza-
tion problems,” Annals of Operations Research 30 (1991) pp. 81–93.
233. A. King, “Finite generation method” in: Y. Ermoliev and R. Wets, Eds., Numerical Tech-
niques 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,” Math-
ematical Programming 27 (1983) pp. 320–341.
References 461
238. P. Klaassen, “Financial asset-pricing theory and stochastic programming models for as-
set/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 Prefer-
ences,” Journal Of Economic Theory 20(1979) pp. 81–10.
245. Daniel Kuhn,“ Aggregation and Discretization in Multistage Stochastic Program-
ming,”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 pro-
gramming by dynamic programming” in: Y. Ermoliev and R. Wets, Eds., Numerical Tech-
niques 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 pro-
grams 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 capac-
itated 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´echal, “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,” Mathemat-
ical Programming Study 28 (1986) pp. 48–62.
261. F.V. Louveaux and D. Peeters, “A dual-based procedure for stochastic facility location,” Op-
erations Research 40 (1992) pp. 564–573.
462 References
262. F. Louveaux and R. Schultz, “Stochastic integer programming,” in: A. Ruszczy´nski 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 (Springer-
Verlag, 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 re-
course,” Mathematical Programming 61 (1993) pp. 301–325.
266. J. Luedtke and S. Ahmed, “A sample approximation approach for optimization with proba-
bilistic 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 Sci-
ence 6 (1960) pp. 197–204.
269. M. Maddox and J.R. Birge, “Bounds on the distribution of tardiness in a PERT net-
work,” 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 prob-
lems,” 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¨ur 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´erentiel pour des fonctions lipschitziennes et non
lipschitziennes,” Comptes Rendus des Seances de l’Acad´emie des Sciences Paris. Serie 1.
Math´ematique 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.
References 463
286. D.P. Morton, “Stopping rules for a class of sampling-based stochastic programming algo-
rithms,” Operations Research 46 (1998) pp. 710–718.
287. J.M. Mulvey and A. Ruszczy´nski, “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 solu-
tion,” 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,” Au-
tomatica 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 net-
work 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 Supercom-
puting and Applications 7 (1993b) pp. 349–364.
301. M.-C. No¨el 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´nski, “On optimal allocation of indivisibles under
uncertainty,” Operations Research 46 (1998) pp. 381–395.
303. V.I. Norkin, G.Ch. Pflug, and A. Ruszczy´nski, “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 hydroelec-
tric 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 quasigra-
dient 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 dis-
cretization,” 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.