Stochastic Programming Bibliography

Stochastic Programming Bibliography

Maarten H. van der Vlerk
Department of Operations
University of Groningen
PO Box 800, NL-9700 AV Groningen, The Netherlands
E-mail:

October 8, 2007
One of the sources for this bibliography has been the list of Books on Stochastic Programming, compiled by J. Dupacová, which was first published in Wets and Ziemba [4033].

Please send additions (preferably in BibTeX format) or comments to the e-mail address mentioned above.

This bibliography can be cited as
Maarten H. van der Vlerk. Stochastic Programming Bibliography. World Wide Web, http://mally.eco.rug.nl/spbib.html, 1996-2007.
The BibTex entry I use is 
        @MISC{SPB9607,
          author = {Maarten H. {van der Vlerk}},
          title = {Stochastic Programming Bibliography},
          year = {1996-2007},
          howpublished = {World Wide Web, \url{http://mally.eco.rug.nl/spbib.html}}
        }
where the macro \url is defined in the LATEX style file url.sty.

Quick jumps:

[A] [B] [C] [D] [E] [F] [G] [H] [I] [J] [K] [L] [M] [N] [O] [P] [Q] [R] [S] [T] [U] [V] [W] [X] [Y] [Z]

References

  1. I.N. Kamal Abadi, Nicholas G. Hall, and Chelliah Sriskandarajah. Minimizing cycle time in a blocking flowshop. Oper. Res., 48(1):177-180, 2000.
  2. J. Abaffy and E. Allevi. A modified L-shaped method. J. Optim. Theory Appl., 123(2):255-270, 2004.
  3. Moncef Abbas and Fatima Bellahcene. Cutting plane method for multiple objective stochastic integer linear programming. European J. Oper. Res., 168(3):967-984, 2006.
  4. N. E. Abboud, M. Y. Jaber, and N. A. Noueihed. Economic lot sizing with the consideration of random machine unavailability time. Comput. Oper. Res., 27(4):335-351, 2000.
  5. P. Abel. Decisions in stochastic linear programming models under partial information. Z. Angew. Math. Mech. 73, No.7-8, T 737-T 738, 1993.
  6. Peter Abel. Stochastische Optimierung bei partieller Information, volume 96 of Mathematical Systems in Economics. Verlagsgruppe Athenäum/Hain/Hanstein, Königstein/Ts., 1984.
  7. Peter Abel. Stochastic linear programming with recourse under partial information. In Probability and Bayesian statistics (Innsbruck, 1986), pages 1-6. Plenum, New York, 1987.
  8. Peter Abel and Reiner Thiel. Mehrstufige stochastische Produktionsmodelle. Eine praxisorientierte Darstellung mit programmierten Beispielen. Schriften zur Quantitativen Wirtschaftsforschung, Bd. 5. Frankfurt am Main: Rita G. Fischer Verlag., 1981.
  9. Jinane Abounadi, Dimitri P. Bertsekas, and Vivek Borkar. Stochastic approximation for nonexpansive maps: application to Q-learning algorithms. SIAM J. Control Optim., 41(1):1-22 (electronic), 2002.
  10. L.M. Abramov and I.I. Bockareva. A stochastic programming problem with probabilistic constraints. Optimal. Planirovanie, 16:3-9, 1970.
  11. G.M. Adamenko. Solution of extremal problems under conditions of incomplete information. Automat. Control Comput. Sci., 14(4):48-55, 1980.
  12. M. Ju. Afanas'ev. An example of the cycling of a stochastic integer algorithm in a bilevel multicommodity problem. In Methods of function analysis in mathematical economics (Russian), pages 111-114. Izdat. "Nauka", Moscow, 1978.
  13. P. K. Agarwal, B. K. Bhattacharya, and S. Sen. Improved algorithms for uniform partitions of points. Algorithmica, 32(4):521-539, 2002.
  14. R.A. Agnew and R.B. Hempley. Finite statistical games and linear programming. Naval Res. Logist. Quart. 18, 99-102, 1971.
  15. Saligrama Agnihothri, Uday S. Karmarkar, and Peter Kubat. Stochastic allocation rules. Oper. Res. 30, 545-555, 1982.
  16. G.A. Agranovich and L.N. Kanov. A method of computing the gradient and the Hessian of the quality criterion in parametric optimization of continuous-discrete stochastic systems. J. Math. Sci., 82(3):3412-3415, 1996. Dynamical systems, No. 13.
  17. S.C. Agrawal. On mixed integer quadratic programs. Naval Res. Logist. Quart., 21:289-297, 1974.
  18. Vipul Agrawal and Sridhar Seshadri. Distribution free bounds for service constrained (Q,r) inventory systems. Naval Res. Logist., 47(8):635-656, 2000.
  19. C.C. Agunwamba. Optimality condition: constraint regularization. Math. Programming, 13(1):38-48, 1977.
  20. Rudolf Ahlswede and Ingo Wegener. Search problems. (Zadachi poiska). Transl. from the German. Moskva: Mir., 1982.
  21. S. Ahmed and N. V. Sahinidis. Robust process planning under uncertainty. Industrial & Engineering Chemistry Research, 37(5):1883-1892, 1998.
  22. Shabbir Ahmed. Mean-risk objectives in stochastic programming. Stochastic Programming E-Print Series, http://www.speps.org, 2004.
  23. Shabbir Ahmed. Convexity and decomposition of mean-risk stochastic programs. Math. Program., 106(3, Ser. A):433-446, 2006.
  24. Shabbir Ahmed. Smooth minimization of two-stage stochastic linear programs. Optimization Online, http://www.optimization-online.org, 2006.
  25. Shabbir Ahmed, Ulas Cakmak, and Alexander Shapiro. Coherent risk measures in inventory problems. Stochastic Programming E-Print Series, http://www.speps.org, 2006.
  26. Shabbir Ahmed, Alan J. King, and Gyana Parija. A multi-stage stochastic integer programming approach for capacity expansion under uncertainty. Stochastic Programming E-Print Series, http://www.speps.org, 2001.
  27. Shabbir Ahmed, Alan J. King, and Gyana Parija. A multi-stage stochastic integer programming approach for capacity expansion under uncertainty. Optimization Online, http://www.optimization-online.org, 2001.
  28. Shabbir Ahmed and Alexander Shapiro. The sample average approximation method for stochastic programs with integer recourse. Optimization Online, http://www.optimization-online.org, 2002.
  29. Shabbir Ahmed, Mohit Tawarmalani, and Nikolaos V. Sahinidis. A finite branch-and-bound algorithm for two-stage stochastic integer programs. Math. Program., 100(2, Ser. A):355-377, 2004.
  30. Shabbir Ahmed, Mohit Tawarmalani, and Nikolas V. Sahinidis. A finite branch and bound algorithm for two-stage stochastic integer programs. Stochastic Programming E-Print Series, http://www.speps.org, 2000.
  31. Byong-Hun Ahn and Bo-Woo Nam. Multiperiod optimal power plant mix under demand uncertainty. J. Oper. Res. Soc. Jap. 31, No.3, 353-370, 1988.
  32. M. Aicardi, G. Casalino, F. Davoli, R. Minciardi, and R. Zoppoli. A decentralized closed-loop solution to the routing problem in networks. Annu. Rev. Autom. Program. 13, Part 2, 9-17, 1986.
  33. Z.Zh. Akhmetzhanova and G.M. Bakan. Solution of a programming problem with inexactly specified initial data. Sov. J. Autom. Inf. Sci. 21, No.2, 55-58 translation from Avtomatika 1988, No.2, 54-56 (1988)., 1988.
  34. Hisham Al-Mharmah and James M. Calvin. Optimal random non-adaptive algorithm for global optimization of Brownian motion. J. Global Optim., 8(1):81-90, 1996.
  35. Hisham A. Al-Mharmah and James M. Calvin. Comparison of one-dimensional composite and non-composite passive algorithms. J. Global Optim., 15(2):169-180, 1999.
  36. Aureli Alabert i Romero. On the optimization of hydroelectric power generation with random water inflows. Qüestiió, 15(3):307-348, 1991.
  37. Chris M. Alaouze and Peter J. Lloyd. A generalization of Gurland's theorem, with applications to economic behavior under uncertainty. Am. Stat. 40, 70-71, 1986.
  38. Horst Albach. Capital budgeting and risk management. In Quant. Wirtsch.-Forsch., W. Krelle zum 60. Geb., 7-24, 1977.
  39. Maria Albareda-Sambola and Elena Fernández. The stochastic generalised assignment problem with Bernoulli demands. Top, 8(2):165-190, 2000.
  40. Maria Albareda-Sambola, Maarten H. van der Vlerk, and Elena Fernández. Exact solutions to a class of stochastic generalized assignment problems. European J. Oper. Res., 173(2):465-487, 2006.
  41. Ya. Alber. Dynamical processes of stochastic approximation. Funct. Differ. Equ., 4(3-4):239-256 (1998), 1997.
  42. Ya. I. Al'ber and S.V. Shil'man. Stochastic programming methods: convergence and nonasymptotic estimation of the convergence rate. In Stochastic optimization (Kiev, 1984), volume 81 of Lecture Notes in Control and Inform. Sci., pages 249-257. Springer, Berlin, 1986.
  43. Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, and Rüdiger Schultz. 05031 Summary - Algorithms for Optimization with Incomplete Information. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  44. V. Albornoz, J. Arrate, and L. Contesse. Solucion de modelos de dimensionamiento de lotes no capacitados bajo incertidumbre en las demandas. Revista del Instituto Chileno de Investigacion Operativa, 6(1-2):52-62, 2001.
  45. V. Albornoz and C. Canales. Planificacion de la conservacion y explotacion del langostino colorado usando un modelo de optimizacion estoc stica no-lineal con recurso. Informacion Tecnologica, 13(4):??, 2002.
  46. V. Albornoz and L. Contesse. Modelos de optimizacion robusta para un problema de planificacion agregada de la produccion bajo incertidumbre en las demandas. Investigacion Operativa, 7(3):1-16, 1999.
  47. A. Albrecht, S.K. Cheung, K.C. Hui, K.S. Leung, and C.K. Wong. Optimal placements of flexible objects. I. Analytical results for the unbounded case. IEEE Trans. Comput., 46(8):890-904, 1997.
  48. A. Albrecht, S.K. Cheung, K.C. Hui, K.S. Leung, and C.K. Wong. Optimal placements of flexible objects. II. A simulated annealing approach for the bounded case. IEEE Trans. Comput., 46(8):905-929, 1997.
  49. S.Christian Albright. A Markov-decision-chain approach to a stochastic assignment problem. Operations Res. 22, 61-64, 1974.
  50. Michael Albritton, Alexander Shapiro, and Mark Spearman. Finite capacity production planning with random demand and limited information. Stochastic Programming E-Print Series, http://www.speps.org, 2000.
  51. David Aldous. Minimization algorithms and random walk on the d-cube. Ann. Probab., 11(2):403-413, 1983.
  52. I.A. Aleksandrov, V.P. Bulatov, S.B. Ognivtsev, and F.I. Yereshko. Solution of a stochastic programming problem concerning the distribution of water resources. In Stochastic optimization (Kiev, 1984), volume 81 of Lecture Notes in Control and Inform. Sci., pages 258-264. Springer, Berlin, 1986.
  53. V.M. Aleksandrov, V.I. Sysoev, and V.V. Semeneva. Stochastische Optimierung von Systemen. Izv. Akad. Nauk SSSR, Tekh. Kibern. 1968, No. 5, 14-19, 1968.
  54. A. Alessandri and T. Parisini. Nonlinear modelling of complex large-scale plants using neural networks and stochastic approximation. IEEE Transactions on Systems, Man, and Cybernetics - A, 27:750-757, 1997.
  55. David L. J. Alexander, David Bulger, James M. Calvin, H. Edwin Romeijn, and Ryan L. Sherriff. Approximate implementations of pure random search in the presence of noise. J. Global Optim., 31(4):601-612, 2005.
  56. M. Montaz Ali, Charoenchai Khompatraporn, and Zelda B. Zabinsky. A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J. Global Optim., 31(4):635-672, 2005.
  57. M.M. Ali and C. Storey. Topographical multilevel single linkage. J. Global Optim., 5(4):349-358, 1994.
  58. M.M. Ali, A. Törn, and S. Viitanen. A numerical comparison of some modified controlled random search algorithms. J. Global Optim., 11(4):377-385, 1997.
  59. Montaz M. Ali. A probabilistic hybrid differential evolution algorithm. In Models and algorithms for global optimization, volume 4 of Springer Optim. Appl., pages 173-184. Springer, New York, 2007.
  60. F.M. Allen, R.N. Braswell, and P.V. Rao. Distribution-free approximations for chance constraints. Operations Res., 22(3):610-621, 1974.
  61. Sira Allende and Carlos Bouza. Stochastic programming approaches to the estimation of the mean in stratified population. Investigación Oper., 14(2-3):109-118, 1993. Workshop on Stochastic Optimization: the State of the Art (Havana, 1992).
  62. Sira Allende and Carlos Bouza. Random demands: optimum lot size and the newsboy problem. Investigación Oper., 23(3):124-129, 2002.
  63. A. Alonso-Ayuso, L. F. Escudero, C. Pizarro, H. E. Romeijn, and D. Romero Morales. On solving the multi-period single-sourcing problem under uncertainty. Comput. Manag. Sci., 3(1):29-53, 2006.
  64. Mahmoud H. Alrefaei. Stochastic optimization using the standard clock simulation. Int. J. Appl. Math., 8(3):317-333, 2002.
  65. Mahmoud H. Alrefaei and Ameen J. Alawneh. Solution quality of random search methods for discrete stochastic optimization. Math. Comput. Simulation, 68(2):115-125, 2005.
  66. Mahmoud H. Alrefaei and Mohammad Almomani. Subset selection of best simulated systems. J. Franklin Inst., 344(5):495-506, 2007.
  67. Mahmoud H. Alrefaei and Sigrún Andradóttir. A simulated annealing algorithm with constant temperature for discrete stochastic optimization. Management Science, 45:748-764, 1999.
  68. Mahmoud H. Alrefaei and Sigrún Andradóttir. A modification of the stochastic ruler method for discrete stochastic optimization. European J. Oper. Res., 133(1):160-182, 2001.
  69. Mahmoud H. Alrefaei and Sigrún Andradóttir. Discrete stochastic optimization using variants of the stochastic ruler method. Naval Res. Logist., 52(4):344-360, 2005.
  70. M.H. Alrefaei and S. Andradóttir. A new search algorithm for discrete stochastic optimization. Proceedings of the 1995 Winter Simulation Conference 236-241, 1995.
  71. M.H. Alrefaei and S. Andradóttir. Discrete stochastic optimization via a modification of the stochastic ruler method. Proceedings of the 1996 Winter Simulation Conference 406-411, 1996.
  72. A.Z. Al'terman. On a realization of random search for the construction of a separating metric. Probl. Sluchajnogo Poiska 7, 307-313, 1978.
  73. A. Altman, M. Amann, G. Klaassen, A. Ruszczy\'nski, and W. Schöpp. Cost-effective sulphur emission under uncertainty. European Journal of Operational Research, 90:395-412, 1996.
  74. Adel A. Aly and John A. White. Probabilistic formulations of the multifacility Weber problem. Naval Res. Logist. Quart., 25(3):531-547, 1978.
  75. Yakov Amihud. The effect of uncertainty in input quantities on the optimal expected input combination. Manage. Sci. 23, 957-962, 1977.
  76. H. M. Amman and D. A. Kendrick. Stochastic policy design in a learning environment with rational expectations. J. Optim. Theory Appl., 105(3):509-520, 2000. Special Issue in honor of Professor David G. Luenberger.
  77. Hans M. Amman, David A. Kendrick, and Sudhakar Achath. Solving stochastic optimization models with learning and rational expectations. Econom. Lett., 48(1):9-13, 1995.
  78. G. Anandalingam. A stochastic programming process model for investment planning. Comput. Oper. Res. 14, 521-536, 1987.
  79. Yu. G. Anastasyan, V.I. Gershovich, B.A. Yaroshevich, È. I. Nenakhov, O.T. Burlak, M.B. Shchepakin, and G.G. Murauskas. O nekotorykh algoritmakh negladkoi optimizatsii i diskretnogo programmirovaniya, volume 6 of Preprint 81. Akad. Nauk Ukrain. SSR Inst. Kibernet., Kiev, 1981.
  80. E. J. Anderson and A. B. Philpott. On supply function bidding in electricity markets. In C. Greengard and A. Ruszczy\'nski, editors, Decision Making under Uncertainty: Energy and Power, volume 128 of IMA volumes on Mathematics and its Applications, pages 115-134. Springer-Verlag, 2002.
  81. S. Andradóttir. A method for discrete stochastic optimization. Management Science 1946-1961, 1995.
  82. S. Andradóttir. A stochastic approximation algorithm with varying bounds. Operations Research 1037-1048, 1995.
  83. S. Andradóttir. A global search method for discrete stochastic optimization. SIAM Journal on Optimization 513-530, 1996.
  84. S. Andradóttir. Optimization of the transient and steady-state behavior of discrete event systems. Management Science 717-737, 1996.
  85. S. Andradóttir. A scaled stochastic approximation algorithm. Management Science 475-498, 1996.
  86. S. Andradóttir. Simulation optimization. Handbook on Simulation (edited by Jerry Banks), Chapter 9, John Wiley and Sons New York, to appear.
  87. Mikhail Andramonov, Jerzy Filar, Panos Pardalos, and Alexander Rubinov. Hamiltonian cycle problem via Markov chains and min-type approaches. In Approximation and complexity in numerical optimization (Gainesville, FL, 1999), pages 31-47. Kluwer Acad. Publ., Dordrecht, 2000.
  88. G. Andreatta. Shortest path models in stochastic networks. In G. Andreatta, F. Mason, and P. Serafini, editors, Stochastics in Combinatorial Optimization, pages 178-186, Singapore, 1987. CISM, Udine, World Scientific Publishing Co. Pte. Ltd.
  89. G. Andreatta and F. Mason. k-Eccentricity and absolute k-centrum of a probabilistic tree. Eur. J. Oper. Res. 19, 114-117, 1985.
  90. G. Andreatta and G. Romanin-Jacur. Aircraft flow management under congestion. Transportation Science, 21(4):249-253, 1987.
  91. G.B. Andreatta, G. Salinetti, and R.J.-B. Wets, editors. Stochastic programming. Baltzer Science Publishers BV, Amsterdam, 1995. Papers from the Sixth International Conference held in Udine, September 14-18, 1992, Ann. Oper. Res. 56 (1995).
  92. Giovanni Andreatta and Luciano Romeo. Stochastic shortest paths with recourse. Networks 18, No.3, 193-204, 1988.
  93. Giovanni Andreatta and Wolfgang J. Runggaldier. An approximation scheme for stochastic dynamic optimization problems. Math. Programming Stud., 27:118-132, 1986. Stochastic programming 84. I.
  94. Colette Andrieu. Sur les solutions fiables d'un problème stochastique d'optimisation sous contrainte. Rev. Roumaine Math. Pures Appl., 25(5):677-694, 1980.
  95. Colette Andrieu. Sur certaines solutions fiables d'un problème stochastique de recherche optimale. Math. Operationsforsch. Statist. Ser. Optim., 12(1):115-122, 1981.
  96. Y.P. Aneja and K.P.K. Nair. Maximal expected flow in a network subject to arc failures. Networks 10, 45-57, 1980.
  97. R. Anghelescu and V. Anghelescu. Recherches sur la programmation lineaire stochastique a recours. (Research on linear stochastic programming with recourse). In Proc. Symp. Math. Appl., Timisoara/Rom. 1985, 163-165, 1986.
  98. R. Anghelescu and V. Anghelescu. étude sur la programmation linéaire stochastique. In Proceedings of the Second Symposium of Mathematics and its Applications (Timi soara, 1987), pages 217-220, Timi soara, 1988. Res. Centre Acad. SR Romania.
  99. R. Anghelescu and V. Anghelescu. Modalités d'approche des problèmes stochastiques d'optimum vectoriel. I. In Proceedings of the Third Symposium of Mathematics and its Applications (Timi soara, 1989), pages 123-128, Timi soara, 1990. Rom. Acad.
  100. R. Anghelescu and V. Anghelescu. Solution optimale dans la programmation stochastique vectorielle. I. In Proceedings of the Fourth Symposium of Mathematics and its Applications (Timi soara, 1991), pages 16-21, Timi soara, 1992. Mirton.
  101. Rodica Anghelescu and V. Anghelescu. Methods in determinating the optimal solution in problems of linear stochastic programming. Bul. Stiin t. Tehn. Univ. Tehn. Timi soara Mat. Fiz., 38(52):94-101, 1993.
  102. Z.P. Anisimova and O.R. Petrenko. Limit theorems of stochastic optimization procedures in Markov random environments. In Stochastic systems and their applications (Russian), pages 4-8. Akad. Nauk Ukrain. SSR Inst. Mat., Kiev, 1990.
  103. A.N. Antamoshkin and M.A. Valishevskij. Complete effectivity investigation of methods optimizing functionals with Boolean derivatives taking random search as example. In Applications of random search to the solution of applied problems, Collect. sci. Works, Kemerovo 1982, 48-54, 1982.
  104. K.A. Antanavichyus and S.S. Chirba. A stochastic programming problem for preparing rational production programs for branch complexes. Ehkon. Mat. Metody 21, 1048-1057, 1985.
  105. K.A. Antanavichyus and S.S. Chirba. A problem of stochastic programming for preparation of rational production programs for branch complexes. Èkonom. i Mat. Metody, 21(6):1048-1057, 1985.
  106. P.L. Antonelli and J.M. Skowronski. Adaptive identification of environmental stress for the management of plant growth. Math. Comput. Modelling 10, No.1, 27-35, 1988.
  107. G.E. Antonov and V. Ja. Katkovnik. A generalization of the concept of statistical gradient. Avtomat. i Vycisl. Tehn. (Riga), 4:25-30, 1972.
  108. I.L. Antonov. A steady-state process in a two-dimensional extremal system in the presence of prohibited regions and a random method of search. Vestnik Moskov. Univ. Ser. I Mat. Meh., 25(5):117-122, 1970.
  109. I.L. Antonov. A transition process in a two-dimensional extremal system in the presence of forbidden domains, in a random method of search. In Problems of statistical optimization (Russian), pages 69-80. Izdat. "Zinatne", Riga, 1971.
  110. Bruno Apolloni and Ferdinando Pezzella. Confidence intervals in the solution of stochastic integer linear programming problems. In Stochastics and optimization, Sel. Pap. ISSO Meet., Gorguano/Italy 1982, Ann. Oper. Res. 1, 67-78, 1984.
  111. N.I. Arbuzova. Ueber die stochastische .-Stabilitaet der Loesung einer Aufgabe der quadratischen Programmierung. Izv. Akad. Nauk SSSR, tehn. Kibernet. 1967, Nr. 3, 35-40, 1967.
  112. N.I. Arbuzova. Interdependence of the stochastic e-stabilities of linear and linear fractional programming problems of a special form. Èkonom. i Mat. Metody, 4:108-110, 1968.
  113. N.I. Arbuzova and V.L. Danilov. Zur Erweiterung des Begriffs der Stabilitaet des Problems der linearen Programmierung. Kibernetika, Kiev 1970, No.4, 139-140, 1970.
  114. F. Archetti. Evaluation of random gradient techniques for unconstrained optimization. Calcolo 12, 83-94, 1975.
  115. F. Archetti, G. Di Pillo, and M. Lucertini, editors. Stochastic programming, volume 76 of Lecture Notes in Control and Information Sciences, Berlin, 1986. Springer-Verlag. Papers from the conference held in Gargnano, September 15-21, 1983.
  116. F. Archetti and F. Frontini. The application of a global optimization method to some technological problems. In Towards global optimisation 2, Work shops Varenna 1976 and Bergamo 1977, 179-188, 1978.
  117. F. Archetti, A. Gaivoronski, and A. Sciomachen. Sensitivity analysis and optimization of stochastic Petri nets. Discrete Event Dyn. Syst. 3, No.1, 5-37, 1993.
  118. F. Archetti and F. Schoen. A survey on the global optimization problem: General theory and computational approaches. In Stochastics and optimization, Sel. Pap. ISSO Meet., Gorguano/Italy 1982, Ann. Oper. Res. 1, 87-110, 1984.
  119. Francesco Archetti. Analysis of stochastic strategies for the numerical solution of the global optimization problem. In Numerical techniques for stochastic systems, Conf., Gargnano/Italy 1979, 275-295, 1980.
  120. Francesco Archetti. A probabilistic algorithm for global optimization problems with a dimensionality reduction technique. In Optimization techniques (Proc. Ninth IFIP Conf., Warsaw, 1979), Part 2, volume 23 of Lecture Notes in Control and Information Sci., pages 36-42, Berlin, 1980. Springer.
  121. Francesco Archetti and Bruno Betrò. Stochastic models and optimization. Boll. Un. Mat. Ital. A (5), 17(2):295-301, 1980.
  122. T. W. Archibald, C. S. Buchanan, K. I. M. McKinnon, and L. C. Thomas. Nested Benders decomposition and dynamic programming for reservoir optimisation. Journal of the Operational Research Society, 50(5):468-479, 1999.
  123. T. W. Archibald, C. S. Buchanan, L. C. Thomas, and K. I. M. McKinnon. Controlling multi-reservoir systems. European Journal of Operational Research, 129(3):619-626, 2001.
  124. R. Ardanuy and A. Alcalá. Weak infinitesimal operators and stochastic differential games. Stochastica, 13(1):5-12, 1992.
  125. K. A. Ariyawansa, C. Cacho, and A. J. Felt. A family of stochastic programming test problems based on a model for tactical manpower planning. J. Math. Model. Algorithms, 4(4):369-390, 2005.
  126. K. A. Ariyawansa and Andrew J. Felt. On a new collection of stochastic linear programming test problems. INFORMS J. Comput., 16(3):291-299, 2004.
  127. K. A. Ariyawansa and Yuntao Zhu. Stochastic semidefinite programming: a new paradigm for stochastic optimization. 4OR, 4(3):239-253, 2006.
  128. K. A. Ariyawansa and Yuntao Zhu. A class of volumetric barrier decomposition algorithms for stochastic quadratic programming. Appl. Math. Comput., 186(2):1683-1693, 2007.
  129. K.A. Ariyawansa. Performance of a benchmark implementation of the Van Slyke and Wets algorithm for stochastic programs on the alliant FX/8. In Dongarra, Jack (ed.) et al., Proceedings of the fifth SIAM conference on parallel processing for scientific computing, held in Houston, TX, USA, March 25-27, 1991. Philadelphia, PA: SIAM, (ISBN 0-89871-303-X/pbk). 186- 192, 1992.
  130. Vadim I. Arkin. Stochastic optimization approach to dynamic problems with jump changing structure. In Stochastic programming methods and technical applications (Neubiberg/Munich, 1996), pages 104-110. Springer, Berlin, 1998.
  131. V.I. Arkin. Economic dynamics and discretely varying technology. Probabilistic approach. In Probability and mathematical economics, Moskva, 3-30, 1988.
  132. V.I. Arkin and I.V. Evstigneev. Probabilistic models of control and economic dynamics. (Veroyatnostnye modeli upravleniya i ehkonomicheskoj dinamiki). Moskva: "Nauka"., 1979.
  133. V.I. Arkin, A. Shiraev, and R. Wets, editors. Stochastic Optimization. Proceedings of the International Conference, Kiev 1984. Springer, Berlin, 1986. LN in Control and Information Sciences 81.
  134. V.I. Arkin and S.A. Smolyak. On the structure of optimality criteria in stochastic optimization models. In Stochastic optimization, Proc. Int. Conf., Kiev/USSR 1984, Lect. Notes Control Inf. Sci. 81, 275-286, 1986.
  135. Ronald D. Armstrong and Joseph L. Balintfy. A chance constrained multiple choice programming algorithm with applications. In Stochastic programming (Proc. Internat. Conf., Univ. Oxford, Oxford, 1974), pages 301-325. Academic Press, London, 1980.
  136. Klaus-Peter Arnold. Stochastische Transportprobleme. Verlag Dr. Kovac, Hamburg, 1987.
  137. H. Arsham. Performance extrapolation in discrete-event systems simulation. International Journal of Systems Science, 27(9):863-869, 1996.
  138. H. Arsham. Stochastic optimization of discrete event systems simulation. International Journal of Microelectronics and Reliability, 36(10):1357-1368, 1996.
  139. H. Arsham. Goal seeking problem in discrete event systems simulation. International Journal of Microelectronics and Reliability, 37(3):391-395, 1997.
  140. H. Arsham. Algorithms for sensitivity information in discrete-event systems simulation. Simulation Practice and Theory, 6(1):1-22, 1998.
  141. H. Arsham. Techniques for Monte Carlo optimizing. Monte Carlo Methods Appl., 4(3):181-229, 1998.
  142. Zvi Artstein. Convergence rates for the optimal values of allocation processes. Math. Oper. Res. 9, 348-355, 1984.
  143. Zvi Artstein. Limit laws for multifunctions applied to an optimization problem. In Multifunctions and integrands (Catania, 1983), volume 1091 of Lecture Notes in Math., pages 66-79. Springer, Berlin, 1984.
  144. Zvi Artstein. Probing for information in two-stage stochastic programming and the associated consistency. In Asymptotic statistics (Prague, 1993), Contrib. Statist., pages 21-33. Physica, Heidelberg, 1994.
  145. Zvi Artstein. Sensitivity with respect to the underlying information in stochastic programs. J. Comput. Appl. Math., 56(1-2):127-136, 1994. Stochastic programming: stability, numerical methods and applications (Gosen, 1992).
  146. Zvi Artstein. Gains and costs of information in stochastic programming. Ann. Oper. Res., 85:129-152, 1999. Stochastic programming. State of the art, 1998 (Vancouver, BC).
  147. Zvi Artstein and Roger J.-B. Wets. Approximating the integral of a multifunction. J. Multivariate Anal., 24(2):285-308, 1988.
  148. Zvi Artstein and Roger J.-B. Wets. Sensors and information in optimization under stochastic uncertainty. Math. Oper. Res., 18(3):523-547, 1993.
  149. Zvi Artstein and Roger J.-B. Wets. Stability results for stochastic programs and sensors, allowing for discontinuous objective functions. SIAM J. Optim., 4(3):537-550, 1994.
  150. Zvi Artstein and Roger J.-B. Wets. Consistency of minimizers and the SLLN for stochastic programs. J. Convex Anal., 2(1-2):1-17, 1995.
  151. Enrique R. Arzac. Profits and safety in the theory of the firm under price uncertainty. Internat. econom. Review 17, 163-171, 1976.
  152. R.W. Ashford and E.M.L. Beale. A cross-estimation technique for using control variables in stochastic simulations. European J. Oper. Res., 40(3):352-362, 1989.
  153. Soeren Asmussen and Reuven Rubinstein. Performance evaluation for the score function method in sensitivity analysis and stochastic optimization. In Simulation and optimization, Proc. Int. Workshop Comput. Intensive Methods Simulation Optimization, Laxenburg/Austria 1990, Lect. Notes Econ. Math. Syst. 374, 1-13, 1992.
  154. P.G. Asojanc. A problem of Robbins. Kibernetika (Kiev), 2:105-106, 1976.
  155. A. S. Asratyan and N. N. Kuzyurin. Approximation of optima of integer programs of covering-packing type. Diskret. Mat., 12(1):96-106, 2000.
  156. N.V. Astanovskaya, V.I. Varshavskij, V.P. Grigorenko, and V.M. Revako. Adaptive algorithms for the decentralized distribution of resources under conditions of uncertainty. Probl. Sluchajnogo Poiska 7, 296-303, 1978.
  157. H. Attouch. Variational averaging of problems with stochastic data. In Inverse methods in action, Proc. Multicent. Meet., Montpellier/Fr. 1989, 396-404, 1990.
  158. H. Attouch and R.J-B. Wets. Quantitative stability of variational systems i: the epigraphical distance. Transactions of the American Mathematical Society, 328:695-729, 1991.
  159. Kelly T. Au, Julia L. Higle, and Suvrajeet Sen. Inexact subgradient methods with applications in stochastic programming. Math. Programming, 63(1, Ser. A):65-82, 1994.
  160. I.L. Averbakh. An algorithm for solving an m-dimensional knapsack problem with random coefficients. Diskret. Mat., 2(3):3-9, 1990.
  161. I.L. Averbakh. An additive method for optimization of two-stage stochastic systems with discrete variables. Sov. J. Comput. Syst. Sci. 28, No.4, 161-165 translation from Izv. Akad. Nauk SSSR, Tekh. Kibern. 1990, No.1, 162-166 (1990)., 1990.
  162. I.L. Averbakh. An iterative decomposition method in one-stage problems of stochastic integer programming. Zh. Vychisl. Mat. i Mat. Fiz., 30(10):1467-1476, 1990.
  163. I.L. Averbakh. An iterative method of solving two-stage discrete stochastic programming problems with additively separable variables. Comput. Math. Math. Phys. 31, No.6, 21-27 translation from Zh. Vychisl. Mat. Mat. Fiz. 31, No.6, 810-818 (1991)., 1991.
  164. David Avis. On the extreme rays of the metric cone. Canad. J. Math., 32(1):126-144, 1980.
  165. M. Avriel and D.J. Wilde. Stochastic geometric programming. In Proceedings of the Princeton Symposium on Mathematical Programming (Princeton Univ., 1967), pages 73-91, Princeton, N.J., 1970. Princeton Univ. Press.
  166. M. Avriel and A.C. Williams. The value of information and stochastic programming. Oper. Res. 18, 947-954, 1970.
  167. S.V. Avrutik and N.P. Dekanova. Two approaches in nonlinear and stochastic programming. In Numerical methods in analysis (applied mathematics) (Russian), pages 5-11. Akad. Nauk SSSR Sibirsk. Otdel. Sibirsk. Ènerget. Inst., Irkutsk, 1976.
  168. S.V. Avrutin. On the formulation and solution of some non-linear stochastic problems. In Optimization methods and their applications, 9, Work Collect., Irkutsk 1979, 5-13, 1979.
  169. Shimon Awerbuch, Joseph G. Ecker, and William A. Wallace. A note: Hidden nonlinearities in the application of goal programming. Management Sci. 22, 918-920, 1976.
  170. Abbas N. Azad and Naveed Saleem. A chance constrained approach to bank balance sheet management: A simple model with a computational example. J. Inf. Optimization Sci. 12, No.3, 363-386, 1991.
  171. F. Azadivar and J. Talavage. Optimization of stochastic simulation models. Math. Comput. Simulation 22, 231-241, 1980.
  172. Farhad Azadivar and Young-Hae Lee. Optimization of discrete variable stochastic systems by computer simulation. Math. Comput. Simulation 30, No.4, 331-345, 1988.
  173. Yossi Azar and Yossi Richter. An improved algorithm for CIOQ switches. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  174. N. Baba. Global optimization of functions by the random optimization method. Int. J. Control 30, 1061-1065, 1979.
  175. N. Baba. Convergence of a random optimization method for constrained optimization problems. J. Optimization Theory Appl. 33, 451-461, 1981.
  176. N. Baba. A hybrid algorithm for finding a global minimum. Int. J. Control 37, 929-942, 1983.
  177. Norio Baba and Akira Morimoto. Three approaches for solving the stochastic multiobjective programming problem. In Stochastic optimization. Numerical methods and technical applications, Proc. GAMM/IFIP-Workshop, Neubiberg/Ger. 1990, Lect. Notes Econ. Math. Syst. 379, 93-109, 1992.
  178. Norio Baba and Akira Morimoto. Stochastic approximation method for solving the stochastic multiobjective programming problem. Internat. J. Systems Sci., 24(4):789-796, 1993.
  179. A.S. Babanin. A generalization of the arctangent law. Teor. Veroyatnost. i Mat. Statist., 28:3-5, 1983.
  180. Léonard Bacaud, Claude Lemaréchal, Arnaud Renaud, and Claudia Sagastizábal. Bundle methods in stochastic optimal power management: a disaggregated approach using preconditioners. Comput. Optim. Appl., 20(3):227-244, 2001.
  181. Thomas Bäck. Evolutionary algorithms in theory and practice. The Clarendon Press Oxford University Press, New York, 1996. Evolution strategies, evolutionary programming, genetic algorithms.
  182. Anna Badach. An application of reliability theory to stochastic linear programming problems. Przeglk ad Statyst., 22(4):569-584, 1975.
  183. A.M. Bagdasarov and G.A. Samatov. Ein Modell der Perspektivplanung der Arbeit eines Transportsystems. Dokl. Akad. Nauk UzSSR 1978, No.11, 15-17, 1978.
  184. Adib Bagh and Michael Casey. An ergodic theorem for random lagrangians with an application to stochastic programming. Stochastic Programming E-Print Series, http://www.speps.org, 2003.
  185. Adib Bagh and Michael S. Casey. An ergodic theorem for random Lagrangians with an application to stochastic programming. Int. J. Pure Appl. Math., 14(3):343-363, 2004.
  186. O. Bahn, O. Du Merle, J.-L. Goffin, and J.-P. Vial. A cutting plane method from analytic centers for stochastic programming. Math. Programming, 69(1, Ser. B):45-73, 1995. Nondifferentiable and large-scale optimization (Geneva, 1992).
  187. D. Bai, T.J. Carpenter, and J.M. Mulvey. Making a case for robust models. Management Science, 43:895-907, 1997.
  188. Matthew D. Bailey, Steven M. Shechter, and Andrew J. Schaefer. SPAR: stochastic programming with adversarial recourse. Oper. Res. Lett., 34(3):307-315, 2006.
  189. Michael P. Bailey. Solving a class of stochastic minimization problems. Oper. Res. 42, No.3, 428-438, 1994.
  190. T.G. Bailey, P. Jensen, and D.P. Morton. Response surface analysis of two-stage stochastic linear programming with recourse. Naval Research Logistics, 46:753-778, 1999.
  191. M.M. Bajzel' and G.S. Tarasenko. The investigation of an adaptive optimization algorithm in the situation of noise. Probl. Sluchajnogo Poiska 9, 106-124, 1981.
  192. V. Balachandran. Generalized transportation networks with stochastic demands: an operator-theoretic approach. Networks, 9(2):169-184, 1979.
  193. A.V. Balakrishnan. Stochastic optimization theory in Hilbert spaces. I. Appl. Math. Optimization 1, 97-120, 1974.
  194. Egon Balas. Nonconvex quadratic programming via generalized polars. SIAM J. Appl. Math., 28:335-349, 1975.
  195. E.J. Balder. An extension of the usual model in statistical decision theory with applications to stochastic optimization problems. J. Multivariate Anal., 10(3):385-397, 1980.
  196. Erik J. Balder. Existence without explicit compactness in stochastic dynamic programming. Math. Oper. Res., 17(3):572-580, 1992.
  197. J.F. Balducchi, G. Cohen, J.-C. Dodu, M. Goursat, Herz, J.-P. Quadrat, and M. Viot. Three methods for optimizing the capacities of an electrical transmission network. 8th IFAC World Congress, Kyoto, Japan, 1981.
  198. J.L. Balintfy. Nonlinear programming for models with joint chance constraints. In Integer nonlin. Program., 337-352, 1970.
  199. Joseph L. Balintfy. Applications of mathematical programming to optimize human diets. In Symp. Math. 19, Program. mat. Appl., Convegno 1974, 313-339, 1976.
  200. Michael O. Ball, Robert Hoffman, Amedeo R. Odoni, and Ryan Rifkin. A stochastic integer program with dual network structure and its application to the ground-holding problem. Oper. Res., 51(1):167-171, 2003.
  201. Enrique Ballestero. Stochastic goal programming: a mean-variance approach. European J. Oper. Res., 131(3):476-481, 2001.
  202. Enrique Ballestero. Stochastic linear programming with scarce information: an approach from expected utility and bounded rationality applied to the textile industry. Eng. Optim., 38(4):425-440, 2006.
  203. Simonetta Balsamo, Vittoria de Nitto Personé, and Raif Onvural. Analysis of queueing networks with blocking. Kluwer Academic Publishers, Boston, MA, 2001.
  204. Shumeet Baluja. Using a priori knowledge to create probabilistic models for optimization. Internat. J. Approx. Reason., 31(3):193-220, 2002. Synergies between evolutionary computation and probabilistic graphical models.
  205. A.K. Balyko. A problem of stochastic programming. Engrg. Cybernetics, 20(1):43-49 (1983), 1982.
  206. Julio R. Banga and Warren D. Seider. Global optimization of chemical processes using stochastic algorithms. In State of the art in global optimization (Princeton, NJ, 1995), volume 7 of Nonconvex Optim. Appl., pages 563-583. Kluwer Acad. Publ., Dordrecht, 1996.
  207. Peter Bank and Frank Riedel. Optimal consumption choice with intertemporal substitution. Ann. Appl. Probab., 11(3):750-788, 2001.
  208. G. Bao and C.G. Cassandras. Stochastic comparison algorithm for continuous optimization with estimation. J. Optim. Theory Appl., 91(3):585-615, 1996.
  209. A.P. Baranov. Convergence of a class of stochastic approximation procedures. Kibernetika (Kiev), 4:64-69, 135, 1987.
  210. V.V. Baranov. A dynamic programming algorithm in stochastic systems. U.S.S.R. Comput. Math. Math. Phys. 18, No.6, 55-68 translation from Zurn. vycislit. Mat. mat. Fiz. 18, No.6, 1416-1429 (1978)., 1979.
  211. V.V. Baranov. Optimal dynamic pattern recognition and decision making. Zh. Vychisl. Mat. i Mat. Fiz., 34(7):984-1000, 1994.
  212. V.V. Baranov and N.V. Tret'yakova. The averaging sequence method in Markov decision processes with periodic strategies. Vestnik Khar' kov. Gos. Univ., 286:34-50, ii, 1986.
  213. J. F. Bard, D. P. Morton, and Y. Wang. Workforce planning at USPS mail processing distribution centers using stochastic optimization. Annals of Operations Research, 155:51-78, 2007.
  214. Jacob Barhen, Vladimir Protopopescu, and David Reister. TRUST: a deterministic algorithm for global optimization. Science, 276(5315):1094-1097, 1997.
  215. Bill Baritompa and Eligius M. T. Hendrix. On the investigation of stochastic global optimization algorithms. J. Global Optim., 31(4):567-578, 2005.
  216. W. P. Baritompa, M. Dür, E. M. T. Hendrix, L. Noakes, W. J. Pullan, and G. R. Wood. Matching stochastic algorithms to objective function landscapes. J. Global Optim., 31(4):579-598, 2005.
  217. W.P. Baritompa, Zhang Baoping, R.H. Mladineo, G.R. Wood, and Z.B. Zabinsky. Towards pure adaptive search. J. Global Optim., 7(1):93-110, 1995.
  218. David P. Baron. Information in two-stage programming under uncertainty. Naval Res. Logist. Quart., 18:169-176, 1971.
  219. Diana Barro and Elio Canestrelli. A decomposition approach in multistage stochastic programming. Rend. Studi Econ. Quant., pages 73-88, 2005.
  220. F.Hutton Barron and Kenneth D. Mackenzie. A constrained optimization model of risky decisions. J. math. Psychology 10, 60-72, 1973.
  221. Russell R. Barton. Minimization algorithms for functions with random noise. Amer. J. Math. Management Sci., 4(1-2):109-138, 1984. Statistics and optimization : the interface.
  222. A.M. Bartsalkin and D.K. Zambitskij. On an allocation problem with probabilistic demands. Mat. Issled. 87, 10-15, 1986.
  223. Kengy Barty, P. Carpentier, J.-P. Chancelier, G. Cohen, M. de Lara, and T. Guilbaud. Dual effect free stochastic controls. Stochastic Programming E-Print Series, http://www.speps.org, 2003.
  224. Kengy Barty, Jean-Sebastien Roy, and Cyrille Strugarek. A perturbed gradient algorithm in hilbert spaces. Optimization Online, http://www.optimization-online.org, 2005.
  225. Kengy Barty, Jean-Sebastien Roy, and Cyrille Strugarek. A stochastic gradient type algorithm for closed loop problems. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  226. A.I. Barvinok. Statistical sums in optimization and computational problems. Algebra i Analiz, 4(1):3-53, 1992.
  227. Alexander Barvinok. Approximate counting via random optimization. Random Structures Algorithms, 11(2):187-198, 1997.
  228. A.M. Barzalkin and D.K. Zambitskij. An algorithm for the solution of a stochastic allocation problem. Mat. Issled. 96, 3-7, 1987.
  229. Tamer Ba sar. A general theory for Stackelberg games with partial state information. Large Scale Systems, 3(1):47-56, 1982.
  230. John Basel, III and Thomas R. Willemain. Random tours in the traveling salesman problem: analysis and application. Comput. Optim. Appl., 20(2):211-217, 2001.
  231. Cock Bastian and Alexander H.G. Rinnooy Kan. The stochastic vehicle routing problem revisited. Eur. J. Oper. Res. 56, No.3, 407-412, 1992.
  232. Fabian Bastin. An adaptive trust-region approach for nonlinear stochastic optimisation with an application in discrete choice theory. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  233. Fabian Bastin, Cinzia Cirillo, and Philippe L. Toint. Convergence theory for nonconvex stochastic programming with an application to mixed logit. Math. Program., 108(2-3, Ser. B):207-234, 2006.
  234. Vic Baston and Anatole Beck. Generalizations in the linear search problem. Israel J. Math., 90(1-3):301-323, 1995.
  235. Dipak R. Basu and Alexis Lazaridis. Evaluation of intersectoral investment allocation in India, 1951-1970. An application of stochastic optimal control by pseudo-inverse. Int. J. Syst. Sci. 11, 889-906, 1980.
  236. Vladimir Batagelj. Notes on the dynamic clusters method. In IV conference on applied mathematics (Split, 1984), pages 139-146. Univ. Split, Split, 1985.
  237. John Bather. Randomised allocation of treatments in sequential trials. Adv. Appl. Probab. 12, 174-181, 1980.
  238. V.D. Batukhtin and L.N. Korotaeva. A stochastic method for searching of an extremum of discontinuous functions. In Nonsmooth problems of optimization and control (Russian), pages 4-11, 111, Sverdlovsk, 1988. Akad. Nauk SSSR Ural. Otdel.
  239. V.D. Batukhtin and L.A. Maiboroda. Optimization of Discontinuous Functions. Nauka, Moscow, 1984. (in Russian).
  240. V.D. Batukhtin and L.A. Majboroda. On a formalization of extremal problems. Sov. Math., Dokl. 21, 1-5 translation from Dokl. Akad. Nauk SSSR 250, 11-14 (1980)., 1980.
  241. Vijay S. Bawa. On chance constrained programming problems with joint constraints. Management Sci., 19:1326-1331, 1972/73.
  242. V.S. Bawa. A simple concavity condition for a class of chance-constrained programming problems with joint constraints. Operations Res. 24, 378-380, 1976.
  243. David S. Bayard. Proof of quasi-adaptivity for the m-measurement feedback class of stochastic control policies. IEEE Trans. Autom. Control AC-32, 447-451, 1987.
  244. Güzin Bayraksan and David P. Morton. Assessing solution quality in stochastic programs. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  245. Güzin Bayraksan and David P. Morton. Assessing solution quality in stochastic programs. Math. Program., 108(2-3, Ser. B):495-514, 2006.
  246. M.S. Bazaraa, J.J. Goode, and M.Z. Nashed. On the cones of tangents with applications to mathematical programming. J. Optimization Theory Appl., 13:389-426, 1974.
  247. L.G. Bazenov and A.M. Gupal. A certain stochastic analogue of the method of feasible directions. Kibernetika (Kiev), 5:94-95, 1973.
  248. Z.A. Bazhenova. Choice models for rational strategies to develop specialized and industrial capacities of the industrial base in case of indetermination. Issled. Oper. ASU 20, 36-44, 1982.
  249. E.M.L. Beale. Some uses of mathemtical programming systems to solve problems that are not linear. Operational Res. Quart., 26(3, part 2):609-618, 1975.
  250. 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. Math. Programming Stud., 27:103-117, 1986. Stochastic programming 84. I.
  251. E.M.L. Beale, J.J.H. Forrest, and C.J. Taylor. Multi-time-period stochastic programming. In Stochastic programming (Proc. Internat. Conf., Univ. Oxford, Oxford, 1974), pages 387-402. Academic Press, London, 1980.
  252. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guidouca Schaefer, and Tjark Vredeveld. Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  253. A.A. Bedel'baev, A.B. Kopeikin, and Ju.S. Popkov. Efficiency of mixed strategies in optimization problems. Autom. Remote Control 3 1372-1377 (1977), translation from Avtom. Telemekh. 1976, No.9, 90-95 (1976)., 1976.
  254. C.N. Beer and B.L. Foote. A procedure to rank bases by probability of being optimal using imbedded hyperspheres. Math. Programming, 9(1):123-128, 1975.
  255. Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matus Mihalak, and L. Shankar Ram. Network Discovery and Verification. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  256. H. Beigy and M. R. Meybodi. Stochastic optimization using continuous action-set learning automata. Sci. Iran., 12(1):14-25, 2005.
  257. ¯I. V. Beiko and P.N. Zin'ko. Some probability estimates for algorithms of stochastic programming with a constant step multiplier. Kibernetika (Kiev), 2:91-95, 1978.
  258. V.Z.(ed.) Belen'kii and V.A.(ed.) Volkonskii. Iterative Methoden in der Theorie der Spiele und Programmierung. (Iterativnye metody v teorii igr i programmirovanii.). Ekonomiko-matematiceskaja biblioteka. Moskau: Verlag 'Nauka', Hauptredaktion fuer physikalisch-mathematische Literatur., 1974.
  259. Claude Bélisle, Arnon Boneh, and Richard J. Caron. Convergence properties of hit-and-run samplers. Comm. Statist. Stochastic Models, 14(4):767-800, 1998.
  260. R. Bellman and M. Roosta. A stochastic travelling salesman problem. Stochastic Anal. Appl. 1, 159-161, 1983.
  261. Ju. A. B¯elov. A two-level stochastic programming problem. Dokl. Akad. Nauk Ukrain. SSR Ser. A, 5:371-375, 400, 1979.
  262. Ju. A. B¯elov. Block stochastic optimization problem with probabilistic constraints and deterministic solution. Dokl. Akad. Nauk Ukrain. SSR Ser. A, 8:63-66, 89, 1980.
  263. Ju. A. B¯elov. Monotonicity of a functional for an iterative algorithm for the block problem with random parameters. Zh. Vychisl. Mat. i Mat. Fiz., 20(2):298-305, 549, 1980.
  264. Ju. A. B¯elov. Two-level optimization for a single-step stochastic programming problem with probability constraints. Vychisl. Prikl. Mat. (Kiev), 43:78-85, 158, 1981.
  265. Yu. A. B¯elov. The block two-stage stochastic programming problem with continuous distribution of the constraint vector. Cybernetics, 16(1):145-148, 1980.
  266. Yu. A. B¯elov. Decomposition of two-stage problems of stochastic programming of block type. Dokl. Akad. Nauk SSSR, 255(4):811-813, 1980.
  267. Yu. A. Belov. A stochastic normal model with solving distributions for block-type extremal problems. Cybernetics, 19(2):239-247, 1983.
  268. Yu.A. Belov. Two-level problem of stochastic programming. Dopov. Akad. Nauk Ukr. RSR, Ser. A 1979, 370-374, 1979.
  269. Yu.A. Belov. Monotonicity with respect to functional of an iterative algorithm for the block problem with random parameters. U.S.S.R. Comput. Math. Math. Phys. 20, No.2, 24-32 translation from Zh. Vychisl. Mat. Mat. Fiz. 20, 298-305 (1980)., 1980.
  270. Yu.A. Belov. A single-stage block type stochastic problem with row probability constraints. U.S.S.R. Comput. Math. Math. Phys. 21, No.5, 58-64 translation from Zh. Vychisl. Mat. Mat. Fiz. 21, 1133-1139 (1981)., 1981.
  271. Yu.A. Belov, A.I. Yastremskij, and D.V. Usovskij. Experimental design in the imitative modelling with the help of methods of stochastic programming. Vychisl. Prikl. Mat., Kiev 48, 133-139, 1982.
  272. L.S. Belyaev. Some statements and ways of solving dynamic optimization problems under uncertainty. In Optim. Techn., IFIP techn. Conf. Novosibirsk 1974, Lect. Notes Comput. Sci. 27, 18-21, 1975.
  273. L.S. Belyaev. The solution of complex optimization problems under uncertainty conditions. (Reshenie slozhnykh optimizatsionnykh zadach v usloviyakh neopredelennosti). Akademiya Nauk SSSR, Sibirskoe Otdelenie, Sibirskij Ehnergeticheskij Institut. Novosibirsk: Izdatel'stvo "Nauka", Sibirskoe Otdelenie., 1978.
  274. F. Ben Abdelaziz, P. Lang, and R. Nadeau. Pointwise efficiency in multiobjective stochastic linear programming. J. Oper. Res. Soc. 45, No.11, 1324-1334, 1994.
  275. F. Ben Abdelaziz, P. Lang, and R. Nadeau. Distributional unanimity in multiobjective stochastic linear programming. In Multicriteria analysis (Coimbra, 1994), pages 225-236. Springer, Berlin, 1997.
  276. F. Ben Abdelaziz, P. Lang, and R. Nadeau. Dominance and efficiency in multiobjective stochastic linear programming. In Advances in multiple objective and goal programming (Torremolinos, 1996), volume 455 of Lecture Notes in Econom. and Math. Systems, pages 160-169. Springer, Berlin, 1997.
  277. F. Ben Abdelaziz and H. Masri. Stochastic programming with fuzzy linear partial information on probability distribution. European J. Oper. Res., 162(3):619-629, 2005.
  278. Yakov Ben-Haim and Isaac Elishakoff. Convex models of uncertainty in applied mechanics. Studies in Applied Mechanics 25. Elsevier, Amsterdam, 1990.
  279. Adi Ben-Israel and Aharon Ben-Tal. Duality and equilibrium prices in economics of uncertainty. Math. Methods Oper. Res., 46(1):51-85, 1997.
  280. A. Ben-Tal and E. Hochman. More bounds on the expectation of a convex function of a random variable. J. Appl. Probability, 9:803-812, 1972.
  281. A. Ben-Tal and M. Teboulle. Penalty functions and duality in stochastic programming via f-divergence functionals. Math. Oper. Res., 12(2):224-240, 1987.
  282. Aharon Ben-Tal. The entropic penalty approach to stochastic programming. Math. Oper. Res., 10(2):263-279, 1985.
  283. Aharon Ben-Tal and Adi Ben-Israel. A recourse certainty equivalent for decisions under uncertainty. Ann. Oper. Res., 30(1-4):3-44, 1991. Stochastic programming, Part I (Ann Arbor, MI, 1989).
  284. Aharon Ben-Tal and Eithan Hochman. Stochastic programs with incomplete information. Operations Res., 24(2):336-347, 1976.
  285. Aharon Ben-Tal, Tamar Margalit, and Arkadi Nemirovski. Robust modeling of multi-stage portfolio problems. In High performance optimization, pages 303-328. Kluwer Acad. Publ., Dordrecht, 2000.
  286. Aharon Ben-Tal, Tamar Margalit, and Arkadi Nemirovski. Robust modeling of multi-stage portfolio problems. In High performance optimization, volume 33 of Appl. Optim., pages 303-328. Kluwer Acad. Publ., Dordrecht, 2000.
  287. Aharon Ben-Tal and Marc Teboulle. The duality between expected utility and penalty in stochastic linear programming. In Stochastic programming (Gargnano, 1983), volume 76 of Lecture Notes in Control and Inform. Sci., pages 151-161. Springer, Berlin, 1986.
  288. Aharon Ben-Tal and Marc Teboulle. Expected utility, penalty functions, and duality in stochastic nonlinear programming. Management Sci., 32(11):1445-1466, 1986.
  289. Aharon Ben-Tal and Marc Teboulle. Portfolio theory for the recourse certainty equivalent maximizing investor. Ann. Oper. Res. 31, 479-499, 1991.
  290. P. Benedek, A. Darazs, and J.D. Pinter. Risk management of accidental water pollution: An illustrative application. Water Science and Technology, 22:265-274, 1990.
  291. Viktor Benes. Conservative expectation estimators by means of an optimization moment problem. Ekon.-Mat. Obz. 21, 407-417, 1985.
  292. A. Benveniste, P. Bernhard, and G. Cohen. On the decomposition of stochastic control problems. 1rst IFAC Symposium on Large Scale Systems Theory and Applications, Udine, Italie, 1976.
  293. A. Benveniste and P. Crepel. Normalite asymptotique: Approximation diffusion pour les algorithmes recursifs: Et applications. Cah. Cent. Etud. Rech. Oper. 23, 3-26, 1981.
  294. Albert Benveniste. Introduction a la methode de l'equation differentielle moyenne pour l'etude des algorithmes recursifs. Exemples. Cah. Cent. Etud. Rech. Oper. 22, 219-241, 1980.
  295. Regina Benveniste. A note on the set covering problem. J. Oper. Res. Soc., 33(3):261-265, 1982.
  296. P. Beraldi and A. Ruszczynski. A branch and bound method for stochastic integer problems under probabilistic constraints. Optimization Methods and Software, 17(3):359-382, 2002.
  297. Patrizia Beraldi, Roberto Musmanno, and Chefi Triki. Solving stochastic linear programs with restricted recourse using interior point methods. Comput. Optim. Appl., 15(3):215-234, 2000.
  298. Patrizia Beraldi, Roberto Musmanno, and Chefi Triki. Solving stochastic linear programs with restricted recourse using interior point methods. Comput. Optim. Appl., 15(3):215-234, 2000.
  299. Patrizia Beraldi and Andrzej Ruszczy\'nski. The probabilistic set-covering problem. Oper. Res., 50(6):956-967, 2002.
  300. Patrizia Beraldi and Andrzej Ruszczy\'nski. Beam search heuristic to solve stochastic integer problems under probabilistic constraints. European J. Oper. Res., 167(1):35-47, 2005.
  301. Rustem Berc. Robust optimal policy methods for nonlinear models. In Operations research proceedings 1990, Pap. 19th Annu. Meet. DGOR, Vienna/Austria 1990, 262-271, 1992.
  302. B. Bereanu. On stochastic linear programming. Comun. Acad. Republ. popul. Romine 13, 517-522, 1963.
  303. B. Bereanu. Stochastic transportation problem. I: Random costs. Comun. Acad. Republ. popul Romine 13, 325-331, 1963.
  304. B. Bereanu. Stochastic transportation problem. II: Random consumptions. Comun. Acad. Republ. popul. Romine 13, 333-337, 1963.
  305. B. Bereanu. On the distribution of the optimum in stochastic linear programming. An. Univ. Bucuresti, Ser. Sti. Natur., Mat.-Mec. 14, No.2, 41-47, 1965.
  306. B. Bereanu. Renewal processes and some stochastic programming problems in economics. SIAM J. Appl. Math. 19, 308-322, 1970.
  307. B. Bereanu. Programmation stochastique et quelques-unes de ses applications économiques. Publ. Économétriques, 5:143-161, 1972.
  308. B. Bereanu. On the use of computers in planning under conditions of uncertainty. Computing 15, 11-32, 1975.
  309. B. Bereanu. The continuity of the optimum in parametric programming and applications to stochastic programming. J. Optimization Theory Appl., 18(3):319-333, 1976.
  310. B. Bereanu. Corrigenda: "Stochastic-parametric linear programs. I."\ [Rev. Roumaine Math. Pures Appl. 22 (1977), no. 10, 1367-1380; MR 57 #5092]. Rev. Roumaine Math. Pures Appl., 24(3):509, 1979.
  311. B. Bereanu. Linear optimization with mixed indeterminacies in data. Stud. Cerc. Mat., 33(6):601-610, 1981.
  312. B. Bereanu. Minimum risk criterion in stochastic optimization. Econom. Comput. Econom. Cybernet. Stud. Res., 15(2):31-39, 1981.
  313. B. Bereanu and G. Peeters. A "wait-and-see" problem in stochastic linear programming. An experimental computer code. Cah. Cent. Etud. Rech. Oper. 12, 133-148, 1970.
  314. Bernard Bereanu. Quasi-convexity, strictly quasi-convexity and pseudo-convexity of composite objective functions. Rev. Française Automat. Informat. Recherche Opérationnelle, 6(R-1):15-26, 1972.
  315. Bernard Bereanu. The Cartesian integration method in stochastic linear programming. In Numerische Methoden bei Optimierungsaufgaben (Tagung, Math. Forschungsinst., Oberwolfach, 1971), pages 9-20. Internat. Schriftenreihe Numer. Math., Band 17, Basel, 1973. Birkhäuser.
  316. Bernard Bereanu. On stochastic linear programming. IV. Some numerical methods and their computer implementation. In Proceedings of the Fourth Conference on Probability Theory (Bra sov, 1971), pages 13-36. Editura Acad. R.S.R., Bucharest, 1973.
  317. Bernard Bereanu. The Cartesian integration method in stochastic linear programming. In Numer. Meth. Optimierungsaufg., Tagung Oberwolfach 1971, ISNM 17, 9-20 , 1973.
  318. Bernard Bereanu. Stable stochastic linear programs and applications. Math. Operationsforsch. Statist., 6(4):593-607, 1975.
  319. Bernard Bereanu. The generalized distribution problem of stochastic linear programming. In Symposia Mathematica, Vol. XIX (Convegno sulla Programmazione Matematica e sue Applicazioni, INDAM, Roma, 1974), pages 229-267, London, 1976. Academic Press.
  320. Bernard Bereanu. On some distribution-free, optimal solutions/bases, in stochastic linear programming. Rev. Roumaine Math. Pures Appl., 21(6):643-657, 1976.
  321. Bernard Bereanu. A unifying approach to stochastic linear programming. In Proc. 5th Conf. Probab. Theory, Brasov 1974, 23-31, 1977.
  322. Bernard Bereanu. Stochastic-parametric linear programs. I. Revue Roumaine Math. Pur. Appl. 22, 1367-1380, 1977.
  323. Bernard Bereanu. Stochastic-parametric linear programs. I. Rev. Roumaine Math. Pures Appl., 22(10):1367-1380, 1977.
  324. Bernard Bereanu. Some numerical methods in stochastic linear programming under risk and uncertainty. In Stochastic programming (Proc. Internat. Conf., Univ. Oxford, Oxford, 1974), pages 169-205. Academic Press, London, 1980.
  325. Bernard Bereanu. Stochastic-parametric linear programs. II. In Recent results in stochastic programming (Proc. Meeting, Oberwolfach, 1979), volume 179 of Lecture Notes in Econom. and Math. Systems, pages 3-20. Springer, Berlin, 1980.
  326. Bernard Bereanu. An approach to complexity of optimization linear models. In Proceedings of the Sixth Conference on Probability Theory (Bra sov, 1979), pages 385-394, Bucharest, 1981. Ed. Acad. R.S. România.
  327. Bernard Bereanu. Programming with composite indeterminacies in data. Methods Oper. Res. 41, 117-120, 1981.
  328. Bernard Bereanu. Programming with objective and conventional perturbation in data. In Studies in probability and related topics, pages 21-38. Nagard, Rome, 1983.
  329. S.A. Berezin and B.L. Lavrovskij. Probability models of optimization. Textbook. (Veroyatnostnye modeli optimizatsii. Uchebnoe posobie). Ministerstvo Vysshego i Srednego Spetsial'nogo Obrazovaniya RSFSR. Novosibirskij Gosudarstvennyj Universitet im. Leninskogo Komsola. Novosibirsk: Novosibirskij Gosudarstvennyj Universitet., 1980.
  330. V.A. Bereznev. A stochastic programming problem with probabilistic constraints. Engrg. Cybernetics, 9(4):613-619 (1972), 1971.
  331. V.A. Bereznev. Zwei stochastische Modelle der Planung der Produktion von Halbfabrikaten. Izv. Akad. Nauk SSSR, tehn. Kibernet. 1975, Nr. 1, 26-31, 1975.
  332. Menachem Berg. Optimal replacement policies for two-unit machines with increasing running costs. I. Stochastic Processes Appl. 4, 89-106, 1976.
  333. Adam J. Berger, John M. Mulvey, and Andrzej Ruszczy\'nski. An extension of the DQA algorithm to convex stochastic programs. SIAM J. Optim., 4(4):735-753, 1994.
  334. Adam J. Berger, John M. Mulvey, and Andrzej Ruszczy\'nski. Restarting strategies for the DQA algorithm. In Large scale optimization (Gainesville, FL, 1993), pages 1-25. Kluwer Acad. Publ., Dordrecht, 1994.
  335. J.O. Berger and G. Salinetti. Approximations of Bayes decision problems: the epigraphical approach. Ann. Oper. Res., 56:1-13, 1995. Stochastic programming (Udine, 1992).
  336. H. Berglann and S. D. Flåm. Stochastic approximation, momentum, and Nash play. In Applications of stochastic programming, volume 5 of MPS/SIAM Ser. Optim., pages 337-345. SIAM, Philadelphia, PA, 2005.
  337. Milan Berka. Stochastic methods for global optimization of dynamical systems. Kniznice Odborn. Ved. Spis\.u Vysoké. Ucení\ Tech. v Brne B, 111:7-23, 1986.
  338. Arjan Berkelaar, Cees Dert, Bart Oldenkamp, and Shuzhong Zhang. A primal-dual decomposition-based interior point approach to two-stage stochastic linear programming. Oper. Res., 50(5):904-915, 2002.
  339. Arjan Berkelaar, Joaquim A. S. Gromicho, Roy Kouwenberg, and Shuzhong Zhang. A primal-dual decomposition algorithm for multistage stochastic convex programming. Math. Program., 104(1, Ser. A):153-177, 2005.
  340. E.M. Berkovic. The approximation of two-stage stochastic extremal problems. U.S.S.R. Comput. Math. math. Phys. 1 Nr. 5, 69-88 (1973)., 1971.
  341. E.M. Berkovic. Differenzenapproximationen fuer Zweietappenprobleme der stochastischen optimalen Steuerung. Vestnik Moskov. Univ., Ser. I 27, No.3. 43-51, 1972.
  342. E.M. Berkovic. Ueber Existenzsaetze in Zweietappenproblemen der stochastischen optimalen Steuerung. Vestnik Moskov. Univ., Ser. I 27, No.2, 64-70, 1972.
  343. E.M. Berkovich. The approximation of two-stage stochastic extrem problems. Zh. vycislit. Mat. Mat. Fiz. 11, 1150-1165, 1971.
  344. E.M. Berkovich and M.I. Ron'kin. Mathematical models for optimization of reference information services. Autom. Doc. Math. Linguist. 23, No.6, 14-21 translation from Nauchno-Tekh. Inf., Ser. 2 1989, No.11, 19-23 (1989)., 1989.
  345. Nils Jacob Berland and Kjetil K. Haugen. Mixing stochastic dynamic programming and scenario aggregation. Ann. Oper. Res., 64:1-19, 1996. Stochastic programming, algorithms and models (Lillehammer, 1994).
  346. Oded Berman, Zvi Ganz, and Janet M. Wagner. A stochastic optimization model for planning capacity expansion in a service industry under uncertain demand. Nav. Res. Logist. 41, No.4, 545-564, 1994.
  347. Oded Berman and David Simchi-Levi. Finding the optimal a priori tour and location of a traveling salesman with nonhomogeneous customers. Transp. Sci. 22, No.2, 148-154, 1988.
  348. W. Bernard and B. Hiller. Spektralanalyse als Identifikationsproblem. I. Regelungstechnik 30, 393-398, 1982.
  349. W. Bernard and B. Hiller. Spektralanalyse als Identifikationsproblem. II. Regelungstechnik 30, 422-427, 1982.
  350. Siegfried Berninghaus. Das "Multi-Armed-Bandit"-Paradigma. Mathematical Systems in Economics, 92. Koenigstein/Ts.: Verlagsgruppe Athenaeum/Hain/Hanstein., 1984.
  351. Marida Bertocchi, Vittorio Moriggia, and Jitka Dupacová. Horizon and stages in applications of stochastic programming in finance. Ann. Oper. Res., 142:63-78, 2006.
  352. Dimitri P. Bertsekas and John N. Tsitsiklis. An analysis of stochastic shortest path problems. Math. Oper. Res. 16, No.3, 580-595, 1991.
  353. D.P. Bertsekas. Stochastic optimization problems with nondifferentiable cost functionals. J. Optimization Theory Appl. 12, 218-231, 1973.
  354. Dimitris Bertsimas, Leonid Kogan, and Andrew W. Lo. Hedging derivative securities and incomplete markets: an e-arbitrage approach. Oper. Res., 49(3):372-397, 2001.
  355. Dimitris Bertsimas and José Niño-Mora. Restless bandits, linear programming relaxations, and a primal-dual index heuristic. Oper. Res., 48(1):80-90, 2000.
  356. Dimitris Bertsimas and Melvyn Sim. Tractable approximations to robust conic optimization problems. Math. Program., 107(1-2, Ser. B):5-36, 2006.
  357. Dimitris Bertsimas, Chungpiaw Teo, and Rakesh Vohra. On dependent randomized rounding algorithms. Oper. Res. Lett., 24(3):105-114, 1999.
  358. Dimitris Bertsimas and Aurélie Thiele. A robust optimization approach to supply chain management. In Integer programming and combinatorial optimization, volume 3064 of Lecture Notes in Comput. Sci., pages 86-100. Springer, Berlin, 2004.
  359. B. Betro' and L. De Biase. A Newton-like method for stochastic optimization. In Towards global optimisation 2, Workshops Varenna 1976 and Bergamo 1977, 269-289, 1978.
  360. B. Betrò and F. Schoen. Optimal and sub-optimal stopping rules for the multistart algorithm in global optimization. Math. Programming, 57(3, Ser. A):445-458, 1992.
  361. Bruno Betrò and Alessandra Guglielmi. Methods for global prior robustness under generalized moment conditions. In Robust Bayesian analysis, pages 273-293. Springer, New York, 2000.
  362. Bruno Betrò and Fabio Schoen. Sequential stopping rules for the multistart algorithm in global optimisation. Math. Programming, 38(3):271-286, 1987.
  363. Bruno Betrò and Fabio Schoen. A stochastic technique for global optimization. Comput. Math. Appl., 21(6-7):127-133, 1991.
  364. B. Bharath and V. S. Borkar. Robust parameter optimization of hidden Markov models. J. Indian Inst. Sci., 78(2):119-130, 1998.
  365. B. Bharath and V. S. Borkar. Stochastic approximation algorithms: overview and recent trends. S¯adhan¯a, 24(4-5):425-452, 1999. Chance as necessity.
  366. Kabekode V.S. Bhat. Minimization of disjunctive normal forms of fuzzy logic functions. J. Franklin Inst., 311(3):171-185, 1981.
  367. S. Bhatnagar, M.C. Fu, and S.I. Marcus. Rate-based ABR flow control using two timescale SPSA. In Proceedings of the SPIE, volume 3841, pages 142-149. The International Society for Optical Engineering, 1999.
  368. Sandeep N. Bhatt, Fan R.K. Chung, and Arnold L. Rosenberg. Partitioning circuits for improved testability. Algorithmica, 6(1):37-48, 1991.
  369. Malay Bhattacharyya. Joint randomized decisions in chance-constrained programming. J. Oper. Res. Soc. 35, 355-357, 1984.
  370. Malay Bhattacharyya. Superiority of randomised decisions in chance constrained programming (CCP). Bull. Inst. Internat. Statist., 52(2):391-406, 1987.
  371. Siddhartha Bhattacharyya and Marvin D. Troutt. Genetic search over probability spaces. European J. Oper. Res., 144(2):333-347, 2003.
  372. Horst Bialy and Michael Olbrich. Optimierung. Eine Einfuehrung mit Anwendungsbeispielen. Mathematik fuer Ingenieure. Leipzig: VEB Fachbuchverlag., 1975.
  373. D. Bienstock and J.F. Shapiro. Optimizing resource acquisition decisions by stochastic programming. Management Science, 34(2):215-229, 1988.
  374. S. \.Ilker Birbil, Gül Gürkan, and Ovidiu Liste s. Solving stochastic mathematical programs with complementarity constraints using simulation. Math. Oper. Res., 31(4):739-760, 2006.
  375. J. R. Birge, N. C. P. Edirisinghe, and W. T. Ziemba, editors. Research in stochastic programming. Kluwer Academic Publishers, Dordrecht, 2001. Papers from the 8th International Conference on Stochastic Programming held at the University of British Columbia, Vancouver, BC, August 8-16, 1998, Ann. Oper Res. 100 (2000).
  376. J. R. Birge, L. Qi, and Z. Wei. Convergence analysis of some methods for minimizing a nonsmooth convex function. J. Optim. Theory Appl., 97(2):357-383, 1998.
  377. J. R. Birge and C. H. Rosa. Modeling investment uncertainty in the costs of global CO2 emission policy. European Journal of Operational Research, 83(3):466-488, 1995.
  378. J. R. Birge, S. Takriti, and E. Long. Intelligent unified control of unit commitment and generation allocation. Technical Report 94-26 (revised 1995), Department of Industral and Operations Engineering, The University of Michigan, Ann Arbor, 1994.
  379. John Birge and Marc Teboulle. Upper bounds on the expected value of a convex function using gradient and conjugate function information. Math. Oper. Res., 14(4):745-759, 1989.
  380. John R. Birge. The value of the stochastic solution in stochastic linear programs with fixed recourse. Math. Programming, 24(3):314-325, 1982.
  381. John R. Birge. Aggregation bounds in stochastic linear programming. Math. Programming, 31(1):25-41, 1985.
  382. John R. Birge. Decomposition and partitioning methods for multistage stochastic linear programs. Oper. Res., 33(5):989-1007, 1985.
  383. John R. Birge. Stochastic programming: optimizing the uncertain. In Optimization, Vol. 1, 2 (Singapore, 1992), pages 613-632. World Sci. Publishing, River Edge, NJ, 1992.
  384. John R. Birge. Models and model value in stochastic programming. Ann. Oper. Res., 59:1-18, 1995. Models for planning under uncertainty.
  385. John R. Birge. Stochastic programming computation and applications. INFORMS J. Comput., 9(2):111-133, 1997.
  386. John R. Birge and M.A.H. Dempster. Optimal match-up strategies in stochastic scheduling. Discrete Appl. Math. 57, No.2-3, 105-120, 1995.
  387. John R. Birge and M.A.H. Dempster. Stochastic programming approaches to stochastic scheduling. J. Global Optim., 9(3-4):417-451, 1996. Optimization applications in scheduling theory.
  388. John R. Birge and José H. Dulá. Bounding separable recourse functions with limited distribution information. Ann. Oper. Res., 30(1-4):277-298, 1991. Stochastic programming, Part I (Ann Arbor, MI, 1989).
  389. John R. Birge and François Louveaux. Introduction to stochastic programming. Springer-Verlag, New York, 1997.
  390. John R. Birge and François V. Louveaux. A multicut algorithm for two-stage stochastic linear programs. European J. Oper. Res., 34(3):384-392, 1988.
  391. John R. Birge, Stephen M. Pollock, and Liqun Qi. A quadratic recourse function for the two-stage stochastic program. In Progress in optimization (Perth, 1998), pages 109-121. Kluwer Acad. Publ., Dordrecht, 2000.
  392. John R. Birge and Li Qun Qi. Computing block-angular Karmarkar projections with applications to stochastic programming. Management Sci., 34(12):1472-1479, 1988.
  393. John R. Birge and Li Qun Qi. Semiregularity and generalized subdifferentials with applications to optimization. Math. Oper. Res., 18(4):982-1005, 1993.
  394. John R. Birge and Li Qun Qi. Continuous approximation schemes for stochastic programs. Ann. Oper. Res., 56:15-38, 1995. Stochastic programming (Udine, 1992).
  395. John R. Birge and Li Qun Qi. Subdifferential convergence in stochastic programs. SIAM J. Optim., 5(2):436-453, 1995.
  396. John R. Birge and Charles H. Rosa. Parallel decomposition of large-scale stochastic nonlinear programs. Ann. Oper. Res., 64:39-65, 1996. Stochastic programming, algorithms and models (Lillehammer, 1994).
  397. John R. Birge and Robert L. Smith. Random procedures for nonredundant constraint identification in stochastic linear programs. Amer. J. Math. Management Sci., 4(1-2):41-70, 1984. Statistics and optimization : the interface.
  398. John R. Birge and Samer Takriti. Successive approximations of linear control models. SIAM J. Control Optim., 37(1):165-176 (electronic), 1999.
  399. John R. Birge and Stein W. Wallace. Refining bounds for stochastic linear programs with linearly transformed independent random variables. Oper. Res. Lett., 5(2):73-77, 1986.
  400. John R. Birge and Stein W. Wallace. A separable piecewise linear upper bound for stochastic linear programs. SIAM J. Control Optim., 26(3):725-739, 1988.
  401. John R. Birge and Roger J.-B. Wets. Approximations and error bounds in stochastic programming. In Inequalities in statistics and probability (Lincoln, Neb., 1982), volume 5 of IMS Lecture Notes-Monograph Ser., pages 178-186, Hayward, Calif., 1984. Inst. Math. Statist.
  402. John R. Birge and Roger J.-B. Wets. Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse. Math. Programming Stud., 27:54-102, 1986. Stochastic programming 84. I.
  403. John R. Birge and Roger J.-B. Wets. Computing bounds for stochastic programming problems by means of a generalized moment problem. Math. Oper. Res., 12(1):149-162, 1987.
  404. John R. Birge and Roger J.-B. Wets. Sublinear upper bounds for stochastic programs with recourse. Math. Programming (Ser. A), 43(2):131-149, 1989.
  405. J.R. Birge. An L-shaped method computer code for multistage stochastic linear programs. In Numerical techniques for stochastic optimization, Springer Ser. Comput. Math. 10, 255-266, 1988.
  406. J.R. Birge. Exhaustible resource models with uncertain returns from exploration investment. In Numerical techniques for stochastic optimization, Springer Ser. Comput. Math. 10, 481-488, 1988.
  407. J.R. Birge. The relationship between the L-shaped method and dual basis factorization for stochastic linear programming. In Numerical techniques for stochastic optimization, volume 10 of Springer Ser. Comput. Math., pages 267-272. Springer, Berlin, 1988.
  408. J.R. Birge and C.J. Donohue. An upper bound on the expected value of a non-increasing convex function with convex marginal return functions. Operations Research Letters 18:213-221, 1996.
  409. J.R. Birge, C.J. Donohue, D.F. Holmes, and O.G. Svintsitski. A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs. Mathematical Programming, 75(2):327-352, 1996.
  410. J.R. Birge and D.F. Holmes. Efficient solution of two-stage stochastic linear programs using interior point methods. Comput. Optim. Appl., 1(3):245-276, 1992.
  411. J.R. Birge and C.H. Rosa. Incorporating investment uncertainty into greenhouse policy models. The Energy Journal 17:79-90, 1996.
  412. J.R. Birge and C.H. Rosa. Parallel decomposition of large scale stochastic nonlinear programs. Annals of Operations Research, 64:39-65, 1996.
  413. J.R. Birge and R.J.-B. Wets, editors. Stochastic programming. Part I. J.C. Baltzer A.G., Basel, 1991. Papers from the Fifth International Conference held at the University of Michigan, Ann Arbor, Michigan, August 13-18, 1989, Ann. Oper. Res. 30 (1991), no. 1-4.
  414. J.R. Birge and R.J.-B. Wets, editors. Stochastic programming. Part II. J.C. Baltzer A.G., Basel, 1991. Papers from the Fifth International Conference held at the University of Michigan, Ann Arbor, Michigan, August 13-18, 1989, Ann. Oper. Res. 31 (1991), no. 1-4.
  415. M. P. Biswal, N. P. Sahoo, and Duan Li. Probabilistic linearly constrained programming problems with lognormal random variables. Opsearch, 42(1):70-76, 2005.
  416. Gabriel R. Bitran, Elizabeth A. Haas, and Hirofumi Matsuo. Production planning of style goods with high setup costs and forecast revisions. Oper. Res. 34, 226-236, 1986.
  417. G.R. Bitran and D. Tirupati. Hierarchical production planning. In S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin, editors, Handbooks on Operations Research and Management Science, volume 4, pages 523-568. North-Holland, Amsterdam, 1993.
  418. H. Bjørstad, D. Haugland, and R. Helming. A stochastic model for gasoline blending. In M. Breton and G. Zaccour, editors, Advances in Operations Research in the Oil and Gas Industry, pages 137-142, 1991.
  419. Charles Blair. Random inequality constraint systems with few variables. Math. Programming, 35(2):135-139, 1986.
  420. Roger A. Blau. Erratum: N job, one machine sequencing problems under uncertainty. Management Sci., Theory 20, 896-899, 1974.
  421. Roger A. Blau. Stochastic programming and decision analysis: an apparent dilemma. Management Sci., 21(3):271-276, 1974.
  422. Jean-Marie Blin, King-Sun Fu, Andrew B. Whinston, and Kenneth B. Moberg. Pattern recognition in micro-economics. J. Cybernetics 3, Nr. 4, 17-27, 1973.
  423. Jörgen Blomvall and Per Olov Lindberg. A Riccati-based primal interior point solver for multistage stochastic programming. European J. Oper. Res., 143(2):452-461, 2002. Interior point methods (Budapest, 2000).
  424. Jörgen Blomvall and Per Olov Lindberg. A Riccati-based primal interior point solver for multistage stochastic programming-extensions. Optim. Methods Softw., 17(3):383-407, 2002. Stochastic programming.
  425. Jörgen Blomvall and Alexander Shapiro. Solving multistage asset investment problems by the sample average approximation method. Math. Program., 108(2-3, Ser. B):571-595, 2006.
  426. J. A. Bloom. Solving an electricity generation capacity expansion planning problem by generalized Benders' decomposition. Operations Research, 31:84-100, 1983.
  427. Lawrence Blume, David Easley, and Maureen O'Hara. Characterization of optimal plans for stochastic dynamic programs. J. Econ. Theory 28, 221-234, 1982.
  428. John Board, Charles Sutcliffe, and William T. Ziemba. The application of operations research techniques to financial markets. Stochastic Programming E-Print Series, http://www.speps.org, 1999.
  429. I.I. Bockareva. The algorithm for the solution of a certain class of stochastic programming problems with probabilistic constraints. Optimal. Planirovanie, 16:10-15, 1970.
  430. C.E. Bocvarova. Optimierung der Struktur eines Flaecheninhalts fuer verschiedene Kulturen auf einer Flaeche ohne Bedarf an Bewaesserung und auf einem vorgegebenen Massiv, der aus einer nichteinregulierten Quelle bei stochastischen Schwankungen der Wasserverhaeltnisse bewaessert wird. Optimizacija 17(34), 67-72, 1975.
  431. C.E. Bocvarova. Ueber die Wahl der garantierten Wahrscheinlichkeiten in Problemen der stochastischen Programmierung mit Wahrscheinlichkeitsbeschraenkungen. Izv. Akad. Nauk SSSR, tehn. Kibernet. 1975, Nr. 6, 47-54, 1975.
  432. C.E. Bocvarova. Ueber ein stochastisches Modell der Bestimmung der Optimalzahl der staendig beschaeftigten Arbeiter und der Struktur der Produktion eines landwirtschaftlichen Unternehmens. Optimizacija 16(33), 73-83, 1975.
  433. V.A. Bodner, N.E. Rodnishchev, and E.P. Yurikov. Optimizatsiya terminal' nykh stokhasticheskikh sistem. "Mashinostroenie", Moscow, 1987.
  434. C. Guus E. Boender and H. Edwin Romeijn. Stochastic methods. In Handbook of global optimization, volume 2 of Nonconvex Optim. Appl., pages 829-869. Kluwer Acad. Publ., Dordrecht, 1995.
  435. C.G.E. Boender and A.H.G. Rinnooy Kan. Bayesian stopping rules for multistart global optimization methods. Math. Programming, 37(1):59-80, 1987.
  436. C.G.E. Boender, A.H.G. Rinnooy Kan, L. Stougie, and G.T. Timmer. Global optimization: a stochastic approach. In Numerical techniques for stochastic systems (Conf., Gargnano, 1979), pages 387-394, Amsterdam, 1980. North-Holland.
  437. C.G.E. Boender, A.H.G. Rinnooy Kan, and C. Vercellis. Stochastic optimization methods. In Stochastics in combinatorial optimization (Udine, 1986), pages 94-112. World Sci. Publishing, Singapore, 1987.
  438. Juergen Boettcher. Local decomposition for linear programs with dual block-angular structure. Methods Oper. Res. 58, 15-25, 1989.
  439. Alexander Bofinger. Numerical determination of response surface points with minimal absolute value for a lower bound estimate of multinormal integrals-gradient algorithms and their convergence. In Stochastic optimization techniques (Neubiberg/Munich, 2000), volume 513 of Lecture Notes in Econom. and Math. Systems, pages 59-78. Springer, Berlin, 2002.
  440. I.P. Boglaev. Finding a feasible optimal program in the problem of programmed control under disturbances. Autom. Remote Control 43, 1315-1321 translation from Avtom. Telemekh. 1982, No.10, 107-114 (1982)., 1983.
  441. M.G.V. Bogle and M.J. O'Sullivan. The effect of storage carryover on plant expansion planning. J. Oper. Res. Soc. 31, 319-324, 1980.
  442. V.A. Bol'shakov. Local-optimization algorithms of group supplies control. Podstawy Sterowania 13, 165-176, 1983.
  443. P. Bonami and M.A. Lejeune. An exact solution approach for portfolio optimization problems under stochastic and integer constraints. Stochastic Programming E-Print Series, http://www.speps.org, 2007.
  444. I.M. Bondar'. Application of stochastic programming methods in the construction of mathematical models of complex systems under conditions of incomplete information. In Methods of operations research and of reliability theory in systems analysis (Russian), pages 52-63, Kiev, 1977. Akad. Nauk Ukrain. SSR Inst. Kibernet.
  445. V.A. Bondarenko and A.A. Korotkin. Analysis of discrete optimization algorithms using incomplete information. Zh. Vychisl. Mat. i Mat. Fiz., 21(3):783-786, 814, 1981.
  446. J.G. Boon, J.D. Pinter, and L. Somlyody. A new stochastic approach for controlling point source river pollution. In Proc. 3rd Scientific Assembly of the International Association for Hydrologic Sciences (Baltimore, 1989), pages 241-249. IAHS Publications 180, 1989.
  447. A. E. Bopp, V. R. Kannan, S. W. Palocsay, and S. P. Stevens. An optimization model for planning natural gas purchases, transportation, storage and deliverability. Omega, International Journal of Management Science, 24(5):511-522, 1996.
  448. A.N. Bordunov, A.I. Yastremskij, and N. Utenliev. On duality relations and optimality conditions in linear problems of stochastic programming with discretely distributed random variables. Issled. Oper. ASU 29, 27-37, 1987.
  449. N.N. Bordunov. Optimality conditions for multistep control of stochastic convex mappings. Cybernetics, 19(1):48-56, 1983.
  450. N.N. Bordunov. Dynamic programming and conditions of optimality of control of stochastic convex mappings. Cybernetics, 20(2):233-239, 1984.
  451. N.N. Bordunov. Extremum conditions for a multistage problem of stochastic programming with smooth constraints. Kibernetika (Kiev), 6:iii, 77-82, 135, 1984.
  452. N.N. Bordunov. Convex multivalued mappings and stochastic models of the dynamics of economic systems. In Stochastic optimization, Proc. Int. Conf., Kiev/USSR 1984, Lect. Notes Control Inf. Sci. 81, 309-313, 1986.
  453. N.N. Bordunov. Dynamical optimization models under conditions of uncertainty: multistage problems of stochastic programming (from IIASA reports). (Dinamicheskie optimizatsionnye modeli v usloviyakh neopredelennosti: mnogoehtapnye zadachi stokhasticheskogo programmirovaniya (po materialam IIASA)). Institut Kibernetiki AN USSR, Kiev, 1991.
  454. N.N. Bordunov, N. Uteuliev, and A.I. Yastremskii. Duality relations and conditions for optimality in nonlinear stochastic programming problems. Issled. Operatsii i ASU, 31:19-22, 112, 1988.
  455. N.N. Bordunov, N. Uteuliev, and A.I. Yastremskii. Multistage problems in stochastic linear programming with discrete distributions. Vestnik Kiev. Univ. Model. Optim. Slozhn. Sist., 7:90-95, 109, 1988.
  456. N.N. Bordunov and N. Uteuliyev. The subdifferential form of optimality conditions for convex multistage stochastic programming problems. Soviet J. Automat. Inform. Sci., 21(3):52-56 (1989), 1988.
  457. N.N. Bordunov, A.I. Yastremskii, and N. Uteuliev. Duality relations and conditions for optimality in linear problems of stochastic programming with discretely distributed random variables. Issled. Operatsii i ASU, 29:27-37, 114, 1987.
  458. N.N. Bordunov, A.I. Yastremskii, and N. Uteuliev. Stochastic programming problems with discrete distributions. Kibernetika (Kiev), 3:121-122, 135, 1988.
  459. Karl-Heinz Borgwardt. Untersuchungen zur Asymptotik der mittleren Schrittzahl von Simplexverfahren in der linearen Optimierung., 1977.
  460. A.I. Borisenko, Ya.I. Zelyk, V.M. Kuntsevich, and M.M. Lychak. The convergence of a matrix stochastic control algorithm for a static object with constrained controls. Sov. J. Autom. Inf. Sci. 18, No.2, 41-49 translation from Avtomatika 1985, No.2, 43-51 (1985)., 1985.
  461. A. B. Borison, P. A. Morris, and S. S. Oren. A state-of-the-world decomposition approach to dynamics and uncertainty in electric utility generation expansion planning. Operations Research, 32:1052-1068, 1984.
  462. Vivek S. Borkar. Pathwise recurrence orders and simulated annealing. J. Appl. Probab., 29(2):472-476, 1992.
  463. N.I. Borodyanskii. Limit theorems for some problems of stochastic optimization. Issled. Operatsii i ASU, 23:16-19, 138, 1984.
  464. A.V. Borshchevskii. On the problem of identification of parameters of nonlinear models by the method of least absolute values. In Investigation of methods for solving extremal problems (Russian), pages 3-7, i, Kiev, 1986. Akad. Nauk Ukrain. SSR Inst. Kibernet.
  465. M.Z. Borshchevskij, I.V. German, and L.M. Shevchuk. Multistep process of taking decisions under conditions of uncertainty. In Approximate methods in the solution of operator equations and their applications, Collect. Artic., Irkutsk 1982, 182-193, 1982.
  466. Jürgen Böttcher. Stochastische lineare Programme mit Kompensation, volume 115 of Mathematical Systems in Economics. Athenäum Verlag GmbH, Frankfurt am Main, 1989.
  467. M. Bouhadi, R. Ellaia, and J. E. Souza de Cursi. Stochastic perturbation methods for affine restrictions. In Advances in convex analysis and global optimization (Pythagorion, 2000), volume 54 of Nonconvex Optim. Appl., pages 487-499. Kluwer Acad. Publ., Dordrecht, 2001.
  468. E.-K. Boukas, A. Haurie, and P. Michel. An optimal control problem with a random stopping time. J. Optim. Theory Appl., 64(3):471-480, 1990.
  469. Craig Boutilier, Richard Dearden, and Moisés Goldszmidt. Stochastic dynamic programming with factored representations. Artificial Intelligence, 121(1-2):49-107, 2000.
  470. C. Bouza, editor. Stochastic Programming: The State of the Art. 1993. Revista Investigación Operational 14, No.2-3.
  471. Carlos Bouza. Bootstrap estimation of the bound of the approximation error in stochastic programming with complete fixed recourse. Investigación Oper., 13(3):226-232, 1992.
  472. Carlos Bouza. Approximation of the value of the optimal solution in stochastic programming. Investigación Oper., 15(1):13-33, 1994.
  473. Carlos Bouza and Sira Allende. Use of L-estimate approximations for solving chance constrained programs. Investigación Oper., 14(2-3):119-126, 1993. Workshop on Stochastic Optimization: the State of the Art (Havana, 1992).
  474. Carlos Bouza Herrera. Bounding the expected approximation error in stochastic linear programming with complete fixed recourse. In System modelling and optimization (Zurich, 1991), volume 180 of Lecture Notes in Control and Inform. Sci., pages 541-545. Springer, Berlin, 1992.
  475. Carlos Bouza Herrera. Use of bootstrap approximations for solving stochastic linear programming problems. Investigación Oper., 16(1-2):3-10, 1995.
  476. Carlos Bouza Herrera and Sira Allende Alonso. Density function estimation and the approximation of convergence rates in stochastic linear programming. Investigación Oper., 10(3):135-140, 1989.
  477. Carlos Bouza Herrera and Sira Allende Alonso. Bounding the variance of the approximation error. Investigación Oper., 11(1):29-36, 1990.
  478. Aziz Bouzaher. Symmetric QP and linear programming under primal-dual uncertainty. Oper. Res. Lett. 6, 221-225, 1987.
  479. Aziz Bouzaher and Susan Offutt. A stochastic linear programming model for corn residue production. J. Oper. Res. Soc. 43, No.9, 843-857, 1992.
  480. Bruce L. Bowerman and Anne B. Koehler. An optimal policy for sampling from uncertain distributions. Comm. Statist. A-Theory Methods, 7(11):1041-1051, 1978.
  481. H. Woods Bowman and Anne Marie Laporte. Stochastic optimization in recursive equation systems with random parameters with an application to control of the money supply. In Studies in Bayesian econometrics and statistics (in honor of Leonard J. Savage), pages 441-462. Contributions to Economic Analysis, No. 86, North-Holland, Amsterdam, 1975. Reprinted from Ann. Econom. Social Measurement 1 (1972), 419-435.
  482. Friedrich Bozena and Klaus Tammer. Untersuchungen zur Stabilitaet einiger Ersatzprobleme der stochastischen Optimierung in bezug auf Aenderungen des zugrunde gelegten Zufallsvektors. Wiss. Z. Humboldt-Univ. Berlin, Math.-Naturwiss. Reihe 30, 373-376, 1981.
  483. Steven J. Brams and D. Marc Kilgour. The box problem: to switch or not to switch. Math. Mag., 68(1):27-34, 1995.
  484. Andries S. Brandsma and A.J. Hughes Hallett. A method for optimising risk sensitive decisions. Rev. Belg. Stat. Inf. Rech. Oper. 24, No.3, 30-43, 1983.
  485. Andrzej Brandt, Stefan Jendo, and Wojciech Marks. Probabilistic approach to reliability-based optimal structural design. Rozpr. Inz. 32, 57-74, 1984.
  486. Andrzej M. Brandt, Wojciech Dzieniszewski, Stefan Jendo, Wojciech Marks, Stefan Owczarek, and Zbigniew Wasiutynski. Criteria and methods of structural optimization. Ed. by Andrzej M. Brandt. Transl. from the Polish by Antoni Pol. Dordrecht/Boston/Lancaster: Martinus Nijhoff Publishers, 1986.
  487. C. Brasca, F. Romeo, R. Scattolini, and N. Schiavoni. Reduced-order modelling of large-scale stochastic systems: a two-level Newton-like algorithm. In Control applications of nonlinear programming and optimization, Coll. Pap., 2nd IFAC Workshop, Oberpfaffenhofen/Ger. 1980, 44-54, 1980.
  488. Michèle Breton and Saeb El Hachem. Algorithms for the solution of a large-scale single-controller stochastic game. In Advances in dynamic games and applications (Geneva, 1992), volume 1 of Ann. Internat. Soc. Dynam. Games, pages 195-216. Birkhäuser Boston, Boston, MA, 1994.
  489. Michèle Breton and Saeb El Hachem. Algorithms for the solution of stochastic dynamic minimax problems. Comput. Optim. Appl., 4(4):317-345, 1995.
  490. Michèle Breton and Saeb El Hachem. A scenario aggregation algorithm for the solution of stochastic dynamic minimax problems. Stochastics Stochastics Rep., 53(3-4):305-322, 1995.
  491. D.F. Broens and W.K. Klein Haneveld. Investment evaluation based on the commercial scope. the production of natural gas. Annals of Operations Research, 59:195-226, 1995.
  492. D.M. Brooks and C.T. Leondes. Use of isolated forecasts in Markov decision processes with imperfect information. AIIE Trans., 6:244-251, 1974.
  493. George W. Brown. Recursive sets of rules in statistical decision processes. In Statist. Papers in Honor of George W. Snedecor, 59-75, 1972.
  494. Gerald G. Brown and Herbert C. Rutemiller. Means and variances of stochastic vector products with applications to random linear models. Manage. Sci. 24, 210-216, 1977.
  495. Lawrence D. Brown. Closure theorems for sequential-design processes. In Statistical decision theory and related topics II, Proc. Symp., West Lafayette/Indiana 1976, 57-91, 1977.
  496. Lawrence D. Brown and Bharat T. Doshi. Existence of optimal policies in stochastic dynamic programming. Probab. Math. Statist., 1(2):171-184 (1981), 1980.
  497. R. Brunelli and G.P. Tecchiolli. Stochastic minimization with adaptive memory. J. Comput. Appl. Math., 57(3):329-343, 1995.
  498. Giordano Bruno and Angelo Gilio. Application of the simplex method to the fundamental theorem for the probabilities in the subjective theory. Statistica (Bologna), 40(3):337-344, 1980.
  499. Noel A. Bryson and Saul I. Gass. Solving discrete stochastic linear programs with simple recourse by the dualplex algorithm. Comput. Oper. Res. 21, No.1, 11-17, 1994.
  500. Z. Bubnicki. Optimization problems in large-scale systems modelling and identification. In Large scale systems: theory and applications, Proc. IFAC/IFORS Symp., Warsaw/Pol. 1983, IFAC Proc. Ser. 10, 411-416, 1984.
  501. Z. Bubnicki, M. Staro\'swiecki, and A. Lebrun. Stochastic approach to the two-level optimization of the complex of operations. In Optimization techniques (Proc. Ninth IFIP Conf., Warsaw, 1979), Part 2, volume 23 of Lecture Notes in Control and Information Sci., pages 281-290. Springer, Berlin, 1980.
  502. C. S. Buchanan, K. I. M. McKinnon, and G. K. Skondras. The recursive definition of stochastic linear programming problems within an algebraic modeling language. Ann. Oper Res., 104:15-32 (2002), 2001. Modeling languages and systems.
  503. J.J. Buckley. Fuzzy programming and the Pareto optimal set. Fuzzy Sets Syst. 10, 57-63, 1983.
  504. J.J. Buckley. Possibility and necessity in optimization. Fuzzy Sets and Systems, 25(1):1-13, 1988.
  505. J.J. Buckley. Solving possibilistic linear programming problems. Fuzzy Sets and Systems, 31(3):329-341, 1989.
  506. J.J. Buckley. Stochastic versus possibilistic multiobjective programming. In Stochastic versus fuzzy approaches to multiobjective mathematical programming under uncertainty, volume 6 of Theory Decis. Lib. Ser. D System Theory Knowledge Engrg. Probl. Solving, pages 353-364. Kluwer Acad. Publ., Dordrecht, 1990.
  507. G. Buehler. Informationsbedarf bei Produktions-Lagerhaltungs-Modellen. In Proc. Oper. Res. 6, DGOR, Pap. ann. Meet. 1976, 380-389, 1976.
  508. W. Buehler. Ein kombiniertes Kompensations-Chance-Constrained Modell der stochastischen linearen Programmierung. In Operations Res.-Verf. 12, IV. Oberwolfach-Tag. Operations Res. 1971, 61-68 , 1972.
  509. W. Buehler. Zur Loesung eines Zwei-Stufen-Risiko Modells der stochastischen linearen Optimierung. In Proc. Oper. Res., DGU Ann. Meet. 1971, 355-370, 1972.
  510. Wolfgang Buehler. Stochastische lineare Optimierung ueber halbgeordneten Ereignismengen. In Oper. Res. Verf. 21, VII. Oberwolfach-Tag. Oper. Res. 1974, 48-50, 1975.
  511. Wolfgang Bühler. Stochastische lineare Optimierung über halbgeordneten Ereignismengen. In Siebente Oberwolfach-Tagung über Operations Research (1974), pages 48-50. Operations Research Verfahren, Band XXI, Meisenheim am Glan, 1975. Hain.
  512. József Bukszár. Lower and upper bounds on the probability of the union of some events with applications. In Optimization theory (Mátraháza, 1999), volume 59 of Appl. Optim., pages 33-43. Kluwer Acad. Publ., Dordrecht, 2001.
  513. Jozsef Bukszar, René Henrion, Mihaly Hujter, and Tamas Szantai. Polyhedral inclusion-exclusion. Stochastic Programming E-Print Series, http://www.speps.org, 2004.
  514. József Bukszár and András Prékopa. Probability bounds with cherry trees. Math. Oper. Res., 26(1):174-192, 2001.
  515. József Bukszár and Tamás Szántai. Probability bounds given by hypercherry trees. Optim. Methods Softw., 17(3):409-422, 2002. Stochastic programming.
  516. D. W. Bulger, D. Alexander, W. P. Baritompa, G. R. Wood, and Z. B. Zabinsky. Expected hitting times for backtracking adaptive search. Optimization, 53(2):189-202, 2004.
  517. D. W. Bulger and G. R. Wood. Hesitant adaptive search for global optimisation. Math. Programming, 81(1, Ser. A):89-102, 1998.
  518. O. Bunke. Einige Hilfsmittel zur Loesung statistischer Probleme bei der linearen und nichtlinearen Optimierung. Monatsber. Deutsch. Akad. Wiss. Berlin 8, 699-703, 1966.
  519. O. Bunke. Einige statistische Probleme und Methoden bei der linearen und nichtlinearen Optimierung. In Operationsforsch. Math. Statistik 1 (Schriftenr. Inst. Math. Dtsch. Akad. Wiss. Berlin, Reihe B, H. 8), 19-34, 1968.
  520. O. Bunke. Ueber die Guete der linearen und nichtlinearen Optimierung bei geschaetzten Parametern. In Operationsforsch. Math. Statistik 1 (Schriftenr. Inst. Math. Dtsch. Akad. Wiss. Berlin, Reihe B, H. 8), 9-18, 1968.
  521. Derek W. Bunn and Spiros N. Paschentis. A model-switching criterion for a class of stochastic linear programs. Appl. Math. Modelling, 5(5):336-340, 1981.
  522. Derek W. Bunn and Spiros N. Paschentis. Development of a stochastic model for the economic dispatch of electric power. Eur. J. Oper. Res. 27, 179-191, 1986.
  523. Rainer E. Burkard and Helidon Dollani. Robust location problems with pos/neg weights on a tree. Networks, 38(2):102-113, 2001.
  524. A. Burkauskas. On convexity problems of the probabilistic constrained stochastic programming problems. Alkalmaz. Mat. Lapok, 12(1-2):77-90, 1986.
  525. V.N. Burkov and D.A. Novikov. Optimal stimulation mechanisms in an active system with probabilistic uncertainty. II. Avtomat. i Telemekh., 10:121-126, 1995.
  526. F.V. Burshtein and È. S. Korelov. Multicriteria decision making problems with indeterminacy and risk. In Theoretical cybernetics (Russian), pages 143-148, Tbilisi, 1980. "Metsniereba".
  527. K.V. Bury. Design optimization under cost uncertainty and risk aversion. INFOR, Canadian J. operat. Res. Inform. Processing 14, 250-258, 1976.
  528. J. C. Butler and J. S. Dyer. Optimizing natural gas flows with linear programming and scenarios. Decision Sciences, 30(2):563-580, 1999.
  529. Dan Butnariu. Fixed points for fuzzy mappings. Fuzzy Sets and Systems, 7(2):191-207, 1982.
  530. Dan Butnariu. Corrigendum: "Fixed points for fuzzy mappings" [Fuzzy Sets and Systems 7 (1982), no. 2, 191-207; MR 83d:90150]. Fuzzy Sets and Systems, 12(1):93, 1984.
  531. Dan Butnariu, Yair Censor, and Simeon Reich. Iterative averaging of entropic projections for solving stochastic convex feasibility problems. Comput. Optim. Appl., 8(1):21-39, 1997.
  532. Dan Butnariu, Alfredo N. Iusem, and Regina S. Burachik. Iterative methods of solving stochastic convex feasibility problems and applications. Comput. Optim. Appl., 15(3):269-307, 2000.
  533. Dan Butnariu, Alfredo N. Iusem, and Regina S. Burachik. Iterative methods of solving stochastic convex feasibility problems and applications. Comput. Optim. Appl., 15(3):269-307, 2000.
  534. Dan Butnariu and Elena Resmerita. The outer Bregman projection method for stochastic feasibility problems in Banach spaces. In Inherently parallel algorithms in feasibility and optimization and their applications (Haifa, 2000), volume 8 of Stud. Comput. Math., pages 69-86. North-Holland, Amsterdam, 2001.
  535. Richard H. Byrd, Thomas Derby, Elizabeth Eskow, Klaas P.B. Oldenkamp, and Robert B. Schnabel. A new stochastic/perturbation method for large-scale global optimization and its application to water cluster problems. In Large scale optimization (Gainesville, FL, 1993), pages 68-81. Kluwer Acad. Publ., Dordrecht, 1994.
  536. R. Caballero, E. Cerdá, M. M. Muñoz, L. Rey, and I. M. Stancu-Minasian. Efficient solution concepts and their relations in stochastic multiobjective programming. J. Optim. Theory Appl., 110(1):53-74, 2001.
  537. R. Caballero, E. Cerda, M. M. Muñoz, and L. Rey. Analysis and comparisons of some solution concepts for stochastic programming problems. Top, 10(1):101-123, 2002.
  538. Rafael Caballero, Emilio Cerdá, María del Mar Muñoz, and Lourdes Rey. Stochastic approach versus multiobjective approach for obtaining efficient solutions in stochastic multiobjective programming problems. European J. Oper. Res., 158(3):633-648, 2004.
  539. Yong Xin Cai, Bao Liu, and Ji Song Kou. A novel method for solving chance constrained stochastic programming problems. J. Tianjin Univ., 4:50-57, 1985.
  540. M. Cain and M.L.R. Price. Optimal mixture choice. J. R. Stat. Soc., Ser. C 35, 1-7, 1986.
  541. R. Cairoli and Robert C. Dalang. Sequential stochastic optimization. Wiley Series in Probability and Statistics: Probability and Statistics. John Wiley & Sons Inc., New York, 1996. A Wiley-Interscience Publication.
  542. G. C. Calafiore and L. El Ghaoui. On distributionally robust chance-constrained linear programs. J. Optim. Theory Appl., 130(1):1-22, 2006.
  543. Giuseppe Calafiore and Boris T. Polyak. Stochastic algorithms for exact and approximate feasibility of robust LMIs. IEEE Trans. Automat. Control, 46(11):1755-1759, 2001.
  544. J.R. Callahan and C.R. Bector. Optimization with general stochastic objective functions. In Proceedings of the Third Manitoba Conference on Numerical Mathematics (Winnipeg, Man., 1973), pages 127-137, Winnipeg, Man., 1974. Utilitas Math.
  545. J.R. Callahan and C.R. Bector. Optimization with general stochastic objective functions. Z. Angew. Math. Mech., 55(9):528-530, 1975.
  546. J. Calvin and A. Zilinskas. On the convergence of the P-algorithm for one-dimensional global optimization of smooth functions. J. Optim. Theory Appl., 102(3):479-495, 1999.
  547. J. Calvin and A. Zilinskas. One-dimensional P-algorithm with convergence rate O(n\sp -3+d) for smooth functions. J. Optim. Theory Appl., 106(2):297-307, 2000.
  548. J. Calvin and A. Zilinskas. One-dimensional P-algorithm with convergence rate O(n\sp -3+d) for smooth functions. J. Optim. Theory Appl., 106(2):297-307, 2000.
  549. J. M. Calvin and A. Zilinskas. One-dimensional global optimization for observations with noise. Comput. Math. Appl., 50(1-2):157-169, 2005.
  550. James M. Calvin. Non-adaptive coverings for optimization of Gaussian random fields. In Monte Carlo and quasi-Monte Carlo methods in scientific computing (Las Vegas, NV, 1994), volume 106 of Lecture Notes in Statist., pages 149-157. Springer, New York, 1995.
  551. James M. Calvin. Average performance of a class of adaptive algorithms for global optimization. Ann. Appl. Probab., 7(3):711-730, 1997.
  552. James M. Calvin. Nonadaptive univariate optimization for observations with noise. In Models and algorithms for global optimization, volume 4 of Springer Optim. Appl., pages 185-192. Springer, New York, 2007.
  553. James M. Calvin and Antanas Zilinskas. On the choice of statistical model for one-dimensional P-algorithms. Control Cybernet., 29(2):555-565, 2000.
  554. James M. Calvin and Antanas Zilinskas. On convergence of a P-algorithm based on a statistical model of continuously differentiable functions. J. Global Optim., 19(3):229-245, 2001. International Workshop on Global Optimization, Part 2 (Firenze, 1999).
  555. David Canning. Average behavior in learning models. J. Econom. Theory, 57(2):442-472, 1992.
  556. X. R. Cao. Single sample path-based optimization of Markov chains. J. Optim. Theory Appl., 100(3):527-548, 1999.
  557. Xi-Ren Cao. Convergence of parameter sensitivity estimates in a stochastic experiment. IEEE Trans. Autom. Control AC-30, 845-853, 1985.
  558. Andrew Caplin and John Leahy. The recursive approach to time inconsistency. J. Econom. Theory, 131(1):134-156, 2006.
  559. Robert Carbone. Public facilities location under stochastic demand. INFOR-Canad. J. Operational Res. and Information Processing, 12:261-270, 1974.
  560. David R. Cariño, David H. Myers, and William T. Ziemba. Concepts, technical issues, and uses of the Russell-Yasuda Kasai financial planning model. Oper. Res., 46(4):450-462, 1998.
  561. David R. Cariño and William T. Ziemba. Formulation of the Russell-Yasuda Kasai financial planning model. Oper. Res., 46(4):433-449, 1998.
  562. D.R. Cariño, T. Kent, D.H. Myers, C. 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(1):29-49, 1994.
  563. C.C. Carøe, A. Ruszczy\'nski, and R. Schultz. Unit commitment under uncertainty via two-stage stochastic programming. Technical Report DIKU-TR-97/23, Department of Computer Science, University of Copenhagen, 1997.
  564. C.C. Carøe and J. Tind. A cutting-plane approach to mixed 0-1 stochastic integer programs. European Journal of Operational Research, 101(2):306-316, 1997.
  565. Claus C. Carøe. Decomposition in stochastic integer programming. Ph.d. thesis, University of Copenhagen, Denmark, 1998.
  566. Claus C. Carøe and Rüdiger Schultz. Dual decomposition in stochastic integer programming. Oper. Res. Lett., 24(1-2):37-45, 1999.
  567. Claus C. Carøe and Jørgen Tind. L-shaped decomposition of two-stage stochastic programs with integer recourse. Math. Programming, 83(3, Ser. A):451-464, 1998.
  568. Richard J. Caron, Arnon Boneh, and Shahar Boneh. Redundancy. In Advances in sensitivity analysis and parametric programming, pages 13.1-13.41. Kluwer Acad. Publ., Boston, MA, 1997.
  569. R.J. Caron, M. Hlynka, and J.F. McDonald. On the best case performance of hit and run methods for detecting necessary constraints. Math. Programming, 54(2, Ser. A):233-249, 1992.
  570. P. Carpentier, G. Cohen, and J.-C. Culioli. Stochastic optimal control and decomposition-coordination methods - part i: Theory. In: Recent Developments in Optimization, Roland Durier and Christian Michelot (Eds.), LNEMS 429:72-87, Springer-Verlag, Berlin, 1995.
  571. P. Carpentier, G. Cohen, and J.-C. Culioli. Stochastic optimal control and decomposition-coordination methods - part ii: Application. In: Recent Developments in Optimization, Roland Durier and Christian Michelot (Eds.), LNEMS 429:88-103, Springer-Verlag, Berlin, 1995.
  572. P. Carpentier, G. Cohen, J.-C. Culioli, and A. Renaud. Stochastic optimization of unit commitment: a new decomposition framework. IEEE Transactions on Power Systems 11(2):1067-1073, 1996.
  573. Robert L. Carraway, Thomas L. Morin, and Herbert Moskowitz. Generalized dynamic programming for stochastic combinatorial optimization. Oper. Res., 37(5):819-829, 1989.
  574. Robert L. Carraway, Robert L. Schmidt, and Lawrence R. Weatherford. An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns. Naval Res. Logist., 40(2):161-173, 1993.
  575. E. Carrizosa, M. Muñoz-Márquez, and J. Puerto. Optimal positioning of a mobile service unit on a line. Ann. Oper. Res., 111:75-88, 2002. Recent developments in the theory and applications of location models, Part II.
  576. Gh. Cartianu and Edmond Nicolau, editors. Prelucrarea si transmiterea numerica a datelor si conducerea proceselor cu ajutorul calculatoarelor, volume 10 of Probleme de Automatizare [Problems of Automation]. Editura Academiei Republicii Socialiste România, Bucharest, 1978.
  577. D. Carton. Programmes linéaires stochastiques. Bull. Direction Études Recherches Sér. C Math. Informat., 1(3):43-60, 1968.
  578. A. Casado and R. Blanco. A method for transforming stochastic nonlinear programming problems into deterministic ones for a class T of functions. Investigación Oper., 7(2):3-9, 1986.
  579. A. Casado and J. Ruíz. On a stochastic quadratic programming problem. Investigación Oper., 5(1):3-11, 1984.
  580. Michael S. Casey and Suvrajeet Sen. The scenario generation algorithm for multistage stochastic linear programming. Math. Oper. Res., 30(3):615-631, 2005.
  581. R.G. Cassidy, C.A. Field, and M.J.L. Kirby. Two stage programming under uncertainty: a game theoretic approach. Cahiers Centre Etud. Rech. oper. 15, 39-55, 1973.
  582. David A. Castañon and Z. Bo Tang. A counterexample to: "Adaptive partitioned random search to global optimization" [IEEE Trans. Automat. Control 39 (1994), no. 11, 2235-2244; MR 95m:90123] by Tang. IEEE Trans. Automat. Control, 41(2):310, 1996.
  583. J. Casti. Forest monitoring and harvesting policies. Appl. Math. Comput. 12, 19-48, 1983.
  584. Zdenek Castorál. Stochastic nonlinear learning systems. Information Processing Machines, 18:233-262, 1975.
  585. Olivier Catoni. The energy transformation method for the Metropolis algorithm compared with simulated annealing. Probab. Theory Related Fields, 110(1):69-89, 1998.
  586. Douglas W. Caves and Joseph A. Herriges. Optimal dispatch of interruptible and curtailable service options. Oper. Res. 40, No.1, 104-112, 1992.
  587. Yair Censor, Alvaro R. De Pierro, and Alfredo N. Iusem. Optimization of Burg's entropy over linear constraints. Appl. Numer. Math., 7(2):151-165, 1991.
  588. Yair Censor and Arnold Lent. Optimization of "log x" entropy over linear equality constraints. SIAM J. Control Optim., 25(4):921-933, 1987.
  589. Yair Censor and Stavros A. Zenios. Parallel Optimization: Theory, Algorithms and Applications. Oxford University Press, Oxford, UK, 1997.
  590. I.P. Cernopiskii. Remarks on the existence of a saddle point in stochastic programming problems. In Mathematical methods for the study and optimization of systems (Proc. Sem. Theory of Optimal Decisions, Kiev, 1970) (Russian), pages 221-224, Kiev., 1971. Akad. Nauk Ukrain. SSR Inst. Kibernet.
  591. Cristiano Cervellera, Aihong Wen, and Victoria C. P. Chen. Neural network and regression spline value function approximations for stochastic dynamic programming. Comput. Oper. Res., 34(1):70-90, 2007.
  592. Debjani Chakraborty. Redefining chance-constrained programming in fuzzy environment. Fuzzy Sets and Systems, 125(3):327-333, 2002. Theme: decision and optimization.
  593. T.K. Chakraborty. Stochastic parameter single sampling plans of given strength. Bull., Calcutta Stat. Assoc. 41, No.161-164, 117-126, 1991.
  594. T.K. Chakraborty. Single sampling LTPD plans as a stochastic programming problem. Sankhy¯a Ser. B, 54(2):242-248, 1992.
  595. Raymond H. Chan and Wai Ki Ching. A direct method for stochastic automata networks. In Applied probability (Hong Kong, 1999), volume 26 of AMS/IP Stud. Adv. Math., pages 1-15. Amer. Math. Soc., Providence, RI, 2002.
  596. T. M. Chan. Geometric applications of a randomized optimization technique. Discrete Comput. Geom., 22(4):547-567, 1999. 14th Annual ACM Symposium on Computational Geometry (Minneapolis, MN, 1998).
  597. Suresh Chandra and T.R. Gulati. A duality theorem for a nondifferentiable fractional programming problem. Management Sci., 23(1):32-37, 1975/76.
  598. C.B. Chang and L.C. Youens. Measurement correlation for multiple sensor tracking in a dense target environment. IEEE Trans. Autom. Control AC-27, 1250-1252, 1982.
  599. H. S. Chang. On the probability of correct selection by distributed voting in the stochastic optimization. J. Optim. Theory Appl., 125(1):231-240, 2005.
  600. Hyeong Soo Chang. Multi-policy improvement in stochastic optimization with forward recursive function criteria. J. Math. Anal. Appl., 305(1):130-139, 2005.
  601. Hyeong Soo Chang, Michael C. Fu, Jiaqiao Hu, and Steven I. Marcus. An asymptotically efficient simulation-based algorithm for finite horizon stochastic dynamic programming. IEEE Trans. Automat. Control, 52(1):89-94, 2007.
  602. Ryong Sop Chang. An algorithm for stochastic extremum problems with upper-half gradient. Cho-son In-min Kong-hwa-kuk Kwa-hak-won T 'ong-bo, 5:10-15, 1983.
  603. Ryong Sop Chang. An algorithm of the modified stochastic conjugate gradient method and its convergence. Cho-son In-min Kong-hwa-kuk Kwa-hak-won T 'ong-bo, 2:18-22, 1984.
  604. Shih Sen Chang and Nan Jing Huang. Generalized random multivalued quasi-complementarity problems. Indian J. Math., 35(3):305-320, 1993.
  605. Pavel Charamza. Comparison of the stochastic approximation software. In Computational aspects of model choice (Prague, 1991), Contrib. Statist., pages 163-176. Physica, Heidelberg, 1993.
  606. Moses Charikar, Chandra Chekuri, and Martin Pál. Sampling bounds for stochastic optimization. In Approximation, randomization and combinatorial optimization, volume 3624 of Lecture Notes in Comput. Sci., pages 257-269. Springer, Berlin, 2005.
  607. V. Charles and D. Dutta. A method for solving linear stochastic fractional programming problem with mixed constraints. Acta Cienc. Indica Math., 30(3):497-506, 2004.
  608. V. Charles and D. Dutta. Linear stochastic fractional programming with sum-of-probabilistic-fractional objective. Optimization Online, http://www.optimization-online.org, 2005.
  609. V. Charles and D. Dutta. Non-linear stochastic fractional programming models of financial derivatives. Optimization Online, http://www.optimization-online.org, 2005.
  610. A. Charnes, Y.C. Chang, and J. Semple. Semi-infinite relaxation of joint chance constraints in chance-constrained programming. I. Zero-order stochastic decision rules. Internat. J. Systems Sci., 23(7):1051-1061, 1992.
  611. A. Charnes and W.W. Cooper. A comment on Blau's dilemma in stochastic programming and Bayesian decision analysis. Management Sci., 22(4):498-500, 1975/76.
  612. A. Charnes, W.W. Cooper, and M.J.L. Kirby. Chance-constrained programming: an extension of statistical method. In Optimizing methods in statistics (Proc. Sympos., Ohio State Univ., Columbus, Ohio, 1971), pages 391-402, New York, 1971. Academic Press.
  613. A. Charnes, W.W. Cooper, D. Klingman, and R.J. Niehaus. Explicit solutions in convex goal programming. Management Sci. 2 438-448 (1976)., 1975.
  614. A. Charnes, W.W. Cooper, and G.H. Symonds. Cost horizons and certainty equivalents: An approach to stochastic programming of heating oil. Management Science, 4:183-195, 1958.
  615. A. Charnes, Fred Glover, and D. Klingman. The lower bounded and partial upper bounded distribution model. Naval. Res. Logist. Quart. 18, 277-281, 1971.
  616. A. Charnes and M. Kirby. Optimal decision rules for the triangular E-model of chance-constrained programming. Cah. Cent. Etud. Rech. Oper. 11, 215-243, 1969.
  617. A. Charnes, M.J.L. Kirby, and W.M. Raike. An acceptance region theory for chance-constrained programming. J. Math. Anal. Appl. 32, 38-61, 1970.
  618. Abraham Charnes, Kingsley E. Haynes, Jared E. Hazleton, and Michael J. Ryan. An hierarchical goal programming approach to environmental-land use management. In Math. Anal. Decis. Probl. Ecol., Proc. NATO Conf., Istanbul 1973, Lect. Notes Biomath. 5, 2-13, 1975.
  619. Bernard Chazelle. Deterministic sampling and optimization. In System modelling and optimization (Compiègne, 1993), volume 197 of Lecture Notes in Control and Inform. Sci., pages 42-54. Springer, London, 1994.
  620. Baoqian Chen. The convergence of a random search algorithm for unconstrained optimization problems. Math. Numer. Sin. 6, 166-173, 1984.
  621. Han-Fu Chen. Optimization based on information containing uncertainties. Kybernetes, 30(9-10):1177-1182, 2001.
  622. Han-Fu Chen. Stochastic approximation and its applications, volume 64 of Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Dordrecht, 2002.
  623. Han-Fu Chen and Hai-Tao Fang. Nonconvex stochastic optimization for model reduction. J. Global Optim., 23(3-4):359-372, 2002. Nonconvex optimization in control.
  624. Hanfu Chen. Stochastic approximation algorithm randomly truncated at time-varying bounds. Annu. Rev. Autom. Program. 12, part 1, 380-383, 1985.
  625. Hanfu Chen. Stochastic approximation with state-dependent noise. Sci. China Ser. E, 43(5):531-541, 2000.
  626. Hanfu Chen and Lei Guo. Stochastic adaptive pole-zero assignment with convergence analysis. Syst. Control Lett. 7, 159-164, 1986.
  627. Hanfu Chen and Qian Wang. Continuous-time Kiefer-Wolfowitz algorithm with randomized differences. Systems Sci. Math. Sci., 11(4):327-341, 1998.
  628. H.F. Chen and P.E. Caines. The strong consistency of the stochastic gradient algorithm of adaptive control. IEEE Trans. Autom. Control AC-30, 189-192, 1985.
  629. H.F. Chen, T.E. Duncan, and B. Pasik-Duncan. A stochastic approximation algorithm with random differences. In Proceedings of the 13th IFAC World Congress, volume H, pages 493-496, 1996.
  630. Hong Chen, Ping Yang, David D. Yao, and Xiuli Chao. Optimal control of a simple assembly system. Oper. Res. Lett., 14(4):199-205, 1993.
  631. Michael Chen and Sanjay Mehrotra. Self-concordant tree and decomposition based interior point methods for stochastic convex optimization problem. Stochastic Programming E-Print Series, http://www.speps.org, 2007.
  632. Patrick S. Chen. On the minimum solution of the inventory system for deteriorating items with shortages and time-varying demand. J. Inform. Optim. Sci., 22(2):283-295, 2001.
  633. Shao Zhong Chen and Zuo Shu Liu. Random fixed-point theorems in abstract spaces. Acta Math. Sci., 1(2):133-144, 1981.
  634. Shenghui Chen and Qinghua Chen. A weighted network model based on the preferential selection of edges. Appl. Math. Sci. (Hikari), 1(21-24):1145-1156, 2007.
  635. Shih-Pin Chen. An alternating variable method with varying replications for simulation response optimization. Comput. Math. Appl., 48(5-6):769-778, 2004.
  636. Victoria C. P. Chen. Measuring the goodness of orthogonal array discretizations for stochastic programming and stochastic dynamic programming. SIAM J. Optim., 12(2):322-344 (electronic), 2001/02.
  637. X. Chen. Newton-type methods for stochastic programming. Math. Comput. Modelling, 31(10-12):89-98, 2000. Stochastic models in engineering, technology, and management (Gold Coast, 1996).
  638. Xiao Jun Chen, Li Qun Qi, and Robert S. Womersley. Newton's method for quadratic stochastic programs with recourse. J. Comput. Appl. Math., 60(1-2):29-46, 1995. Linear/nonlinear iterative methods and verification of solution (Matsuyama, 1993).
  639. Xiaojun Chen and Robert S. Womersley. A parallel inexact Newton method for stochastic programs with recourse. Ann. Oper. Res., 64:113-141, 1996. Stochastic programming, algorithms and models (Lillehammer, 1994).
  640. Z. L. Chen and W. B. Powell. Convergent cutting-plane and partial-sampling algorithm for multistage stochastic linear programs with recourse. J. Optim. Theory Appl., 102(3):497-524, 1999.
  641. Zeng Jing Chen. Stochastic programming problems in securities markets. Qufu Shifan Daxue Xuebao Ziran Kexue Ban, 21(5):172-177, 1995.
  642. Zeng Jing Chen. Stochastic programming problems in securities markets. Shandong Daxue Xuebao Ziran Kexue Ban, 31(1):42-47, 1996.
  643. Zhi-Long Chen, Shanling Li, and Devanath Tirupati. A scenario-based stochastic programming approach for technology and capacity planning. Comput. Oper. Res., 29(7):781-806, 2002.
  644. Zhi Ping Chen and Yong Gao. Stationary and Markov properties of optimal solution processes for stochastic programming problems with random processes. Pure Appl. Math., 12(1):88-92, 1996.
  645. Zhi Ping Chen and Yong Gao. Process properties and stability of optimal solution sets of stochastic programming problems with random processes. Acta Math. Appl. Sinica, 20(3):466-472, 1997.
  646. Zhi Ping Chen and Cheng Xian Xu. Generalized duality theory for general multistage programming problems with recourse. J. Math. Res. Exposition, 17(2):275-286, 1997.
  647. Zhiping Chen. On the convergence of sampling algorithms for solving dynamic stochastic programming. Systems Sci. Math. Sci., 13(4):397-406, 2000.
  648. Zhiping Chen and Chengxian Xu. A dual gradient method for solving a class of two-stage compensating problems. Math. Appl., 9(3):266-271, 1996.
  649. Zhiping Chen and Chengxian Xu. Global convergence of a general sampling algorithm for dynamic nonlinear stochastic programs. Numer. Funct. Anal. Optim., 23(5-6):495-514, 2002.
  650. T.C.E. Cheng. Capacity requirements planning by stochastic linear programming. Math. Modelling 7, 443-448, 1986.
  651. A.G. Chentsov. On the correct extension of some problems with stochastic constraints. Avtomat. i Telemekh., 7:68-79, 1995.
  652. Myun-Seok Cheon, Shabbir Ahmed, and Faiz Al-Khayyal. A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  653. Myun-Seok Cheon, Shabbir Ahmed, and Faiz Al-Khayyal. A branch-reduced-cut algorithm for the global optimization of probabilistically constrained linear programs. Math. Program., 108(2-3, Ser. B):617-634, 2006.
  654. Raymond K.-M. Cheung and Warren B. Powell. SHAPE-a stochastic hybrid approximation procedure for two-stage stochastic programs. Oper. Res., 48(1):73-79, 2000.
  655. Raymond K.-M. Cheung and Warren B. Powell. SHAPE-a stochastic hybrid approximation procedure for two-stage stochastic programs. Oper. Res., 48(1):73-79, 2000.
  656. Tran Quoc Chien. Semistochastic decomposition scheme in mathematical programming and game theory. Kybernetika (Prague), 27(6):535-541, 1991.
  657. A. Chikan and I. Dobos. A concept of uncertainty and risk. PU.M.A., Pure Math. Appl., Ser. C 2, No.1, 87-94, 1991.
  658. J.B. Chilton. Maximum principle for the optimal control of systems with continuous leads. J. Optim. Theory Appl., 69(2):343-350, 1991.
  659. D.C. Chin. A more efficient global optimization algorithm based on Styblinski and Tang. Neural Networks, 7:573-574, 1994.
  660. D.C. Chin. Efficient identification procedure for inversion processing. In Proceedings of the IEEE Conference on Decision and Control, pages 3129-3130, 1996.
  661. D.C. Chin. Comparative study of stochastic algorithms for system optimization based on gradient approximations. IEEE Transactions on Systems, Man, and Cybernetics B, 27:244-249, 1997.
  662. D.C. Chin. The simultaneous perturbation method for processing magnetospheric images. Optical Engineering, 38:606-611, 1999.
  663. D.C. Chin and R.H. Smith. A traffic simulation for mid-Manhattan with model-free adaptive signal control. In Proceedings of the Summer Computer Simulation Conference, pages 296-301, 1994.
  664. D.C. Chin and R. Srinivasan. Electrical conductivity object locator: location of small objects buried at shallow depths. In Proceedings of the Unexploded Ordnance (UXO) Conference, pages 50-57, 1997.
  665. Anukal Chiralaksanakul and David P. Morton. Assessing policy quality in multi-stage stochastic programming. Stochastic Programming E-Print Series, http://www.speps.org, 2004.
  666. Gyeong-Mi Cho. Stability analysis of two-stage stochastic programming problems. Bull. Korean Math. Soc., 31(2):243-252, 1994.
  667. Gyeong-Mi Cho. Stability of the multiple objective linear stochastic programming problems. Bull. Korean Math. Soc., 32(2):287-296, 1995.
  668. Gyeong-Mi Cho. Stability in two-stage multiobjective stochastic programming. Nonlinear Anal., 47(6):3641-3648, 2001. Proceedings of the Third World Congress of Nonlinear Analysts, Part 6 (Catania, 2000).
  669. Gyeong-Mi Cho. Log-barrier method for two-stage quadratic stochastic programming. Appl. Math. Comput., 164(1):45-69, 2005.
  670. Michal Chobot. A stochastic approach to goal programming. Ekonom.-Mat. Obzor, 9:305-319, 1973.
  671. Milan Chobot. Goal-interval programming, and a stochastic approach to decentralization problems. In Second National Conference on Mathematical Methods in Economics (Harmónia, 1972) (Czech), pages 69-93. Ekonom.-Mat. Lab. Ekonom. Ústavu Ceskoslov. Akad. Ved, Prague, 1973.
  672. Christine Choirat, Christian Hess, and Raffaello Seri. Approximation of stochastic programming problems. In Monte Carlo and quasi-Monte Carlo methods 2004, pages 45-59. Springer, Berlin, 2006.
  673. Tahir Choulli, Michael Taksar, and Xun Yu Zhou. Excess-of-loss reinsurance for a company with debt liability and constraints on risk reduction. Quant. Finance, 1(6):573-596, 2001.
  674. Tahir Choulli, Michael Taksar, and Xun Yu Zhou. Excess-of-loss reinsurance for a company with debt liability and constraints on risk reduction. Quant. Finance, 1(6):573-596, 2001.
  675. Chee-Seng Chow and John N. Tsitsiklis. The complexity of dynamic programming. J. Complexity 5, No.4, 466-488, 1989.
  676. Yunshyong Chow and June Hsieh. On occupation times of annealing processes. Bull. Inst. Math. Acad. Sinica, 20(1):19-26, 1992.
  677. Anthony H. Christer, Shunji Osaki, and Lyn C. Thomas, editors. Stochastic modelling in innovative manufacturing, volume 445 of Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, Berlin, 1997. Papers from the UK-Japanese Workshop held at Churchill College, University of Cambridge, Cambridge, July 21-22, 1995.
  678. D. Christiansen and S.W. Wallace. Option theory and modeling under uncertainty. In E. Matson, A. Tomasgard, E. Meistad and S. Dye (eds.), Essays in honour of Bjorn Nygreen on his 50th Birthday, Dept. of Man. Econ. and OR, Norwegian Univ. of Sc. and Technology, Trondheim, 147-168, 1996.
  679. H.Dalgas Christiansen. Monte Carlo optimization in K-space. - Global and path approach. In Proc. Stat. Comput. Sect., Annu. Meet. Am. Stat. Assoc., Cincinnati/Ohio 1982, 200-205, 1982.
  680. Piotr Chrzan. An application of sample distributions for seeking the öptimal" solution for probabilistic programming problems. Przegl. Stat. 28, 29-38, 1981.
  681. Piotr Chrzan. Application of the Chebyshev inequality for determining deterministic equivalents of probabilistic models. Przeglk ad Statyst., 28(3-4):247-254 (1982), 1981.
  682. S.N. Chuang, T.T. Soong, and K.H. Chen. Stochastic extensions to necessary conditions in the theory of the calculus of variations. J. Optimization Theory Appl., 23(1):53-64, 1977.
  683. Chia-Shin Chung and James Flynn. Optimal replacement policies for k-out-of-n systems. IEEE Trans. Reliab. R-38, No.4, 462-467, 1989.
  684. S.L. Chung, F.B. Hanson, and H.H. Xu. Parallel stochastic dynamic programming: finite element methods. Linear Algebra Appl., 172:197-218, 1992. Second NIU Conference on Linear Algebra, Numerical Linear Algebra and Applications (DeKalb, IL, 1991).
  685. Olga R. Chuyan and Aleksei G. Sukharev. On adaptive and nonadaptive stochastic and deterministic algorithms. J. Complexity, 6(1):119-127, 1990.
  686. T. Cipra. Gaussian processes in linear programs with random right-hand sides. Z. Angew. Math. Mech., 68(5):T438-T439, 1988.
  687. Tomás Cipra. Moment problem with given covariance structure in stochastic programming. Ekonom.-Mat. Obzor, 21(1):66-77, 1985.
  688. Tomás Cipra. Prediction in stochastic linear programming. Kybernetika (Prague), 23(3):214-226, 1987.
  689. Tomás Cipra. Autoregressive processes in optimization. J. Appl. Probab., 25(2):302-312, 1988.
  690. Tomás Cipra. Stochastic programming with random processes. Ann. Oper. Res., 30(1-4):95-105, 1991. Stochastic programming, Part I (Ann Arbor, MI, 1989).
  691. Tomás Cipra and Jitka Dupacová. Selected applications of stochastic programming and a survey of software. Ekonom.-Mat. Obzor, 22(3):241-262, 1986.
  692. A.M. Cirlin. Optimierung im Mittel und gleitende Regimes in Problemen der optimalen Regelung. Izv. Akad. Nauk SSSR, tehn. Kibernet. 1974, Nr. 2, 143-151, 1974.
  693. Steven P. Clark and Peter C. Kiessler. On the convexity of value functions for a certain class of stochastic dynamic programming problem. Stochastic Anal. Appl., 20(4):783-789, 2002.
  694. Hans Joachim Cleef. Loesungsverfahren fuer eine Klasse zweistufiger stochastischer Optimierungsprobleme. Mathematisch-Naturwissenschaftliche Fakultaet der Rheinischen Friedrich- Wilhelms-Universitaet zu Bonn. 80 S., 1980.
  695. H.J. Cleef. A solution procedure for the two-stage stochastic program with simple recourse. Z. Oper. Res. Ser. A-B, 25(1):A1-A13, 1981.
  696. H.J. Cleef and W. Gaul. A stochastic flow problem. J. Inf. Optimization Sci. 1, 229-270, 1980.
  697. H.J. Cleef and W. Gaul. Project scheduling via stochastic programming. Math. Operationsforsch. Statist. Ser. Optim., 13(3):449-468, 1982.
  698. Moise Cocan. Ueber die Bellmansche Funktionalgleichung fuer stochastische dynamische Prozesse. (On the Bellman functional equation for stochastic dynamic processes). Bul. Univ. Brasov, Ser. C 31, 13-18, 1989.
  699. Moise Cocan. The model of a stochastic dynamic programming problem in case of processes with an infinite number of periods. Bul. Univ. Bra sov Ser. C, 32:55-61, 1990.
  700. Ju.M. Codikov and A.S. Hohlov. Extrapolation fuer innere Penaltyfunktionen. Izv. Akad. Nauk SSSR, Tekh. Kibernet. 1977, No.2, 32-38, 1977.
  701. E. G. Coffman, Jr., George S. Lueker, Joel Spencer, and Peter M. Winkler. Packing random rectangles. Probab. Theory Related Fields, 120(4):585-599, 2001.
  702. Jr. Coffman, E.G., D.S. Johnson, P.W. Shor, and G.S. Lueker. Probabilistic analysis of packing and related partitioning problems. In Probability and algorithms, pages 87-107. Nat. Acad. Press, Washington, DC, 1992.
  703. G. Cohen. Information exchange between independent stochastic systems. Journal of Optimization Theory and Applications 32(2), 1980.
  704. G. Cohen and P. Bernhard. On the rationality of some decision rules in a stochastic environment. IEEE Transactions on Automatic Control, AC-24, Nr. 5, 1979.
  705. G. Cohen and J.-C. Culioli. Decomposition and coordination in stochastic optimization. 4th IFAC Symposium on Large Scale Systems Theory and Applications, Zurich, 1986.
  706. Guy Cohen and Jean-Christophe Culioli. Algorithmes de décomposition/coordination en optimisation stochastique. RAIRO Automat.-Prod. Inform. Ind., 20(3):253-272, 1986.
  707. Ch. Condevaux-Lanloy, E. Fragniere, and A.J. King. SISP, simplified interface for stochastic programming establishing a hard link between mathematical programming modeling languages and SMPS codes. Optimization Methods and Software, 17(3):423-443, 2002.
  708. Christian Condevaux-Lanloy, Emmanuel Fragnière, and Alan J. King. SISP: simplified interface for stochastic programming: establishing a hard link between mathematical programming modeling languages and SMPS codes. Optim. Methods Softw., 17(3):423-443, 2002. Stochastic programming.
  709. E. Contini. A stochastic approach to goal programming. Oper. Res. 16, 576-586, 1968.
  710. W.D. Cook, M.J.L. Kirby, and S.L. Mehndiratta. A structured nonlinear programming problem. Rev. Belg. Stat. Inf. Rech. Oper. 17, No.4, 43-55, 1977.
  711. R. Cooke and J.D. Pinter. Optimization in risk management. Civil Engineering Systems, 6:122-128, 1989.
  712. Leon Cooper. The stochastic transportation-location problem. Comput. Math. Appl., 4(3):265-275, 1978.
  713. William W. Cooper, H. Deng, Zhimin Huang, and Susan X. Li. Chance constrained programming approaches to congestion in stochastic data envelopment analysis. European J. Oper. Res., 155(2):487-501, 2004.
  714. W.W. Cooper, Zhimin Huang, and Susan X. Li. Satisficing DEA models under chance constraints. Ann. Oper. Res., 66:279-295, 1996. Extensions and new developments in data envelopment analysis.
  715. Don Coppersmith and Gregory B. Sorkin. Constructive bounds and exact expectations for the random assignment problem. Random Structures Algorithms, 15(2):113-144, 1999.
  716. A. Corana, M. Marchesi, C. Martini, and S. Ridella. Minimizing multimodal functions of continuous variables with the "simulated annealing" algorithm. ACM Trans. Math. Software 13, 262-280, 1987.
  717. Adrian Corban. The stochastic threedimensional transportation problem. Stud. Cercet. Mat. 24, 513-517, 1972.
  718. Adrian Corban. Linear tridimensional programming. Revue Roumaine Math. pur. appl. 20, 897-905, 1975.
  719. K. Cormican, D.P. Morton, and R.K. Wood. Stochastic network interdiction. Operations Research, 46:184-197, 1998.
  720. Andrea Corradini, Ugo Montanari, Francesca Rossi, Hartmut Ehrig, and Michael Loewe. Graph grammars and logic programming. In Graph grammars and their application to computer science, Proc. 4th Int. Workshop, Bremen/Ger. 1990, Lect. Notes Comput. Sci. 532, 221-237, 1991.
  721. Andre Costa. Ants, stochastic optimisation and reinforcement learning. Austral. Math. Soc. Gaz., 32(2):116-123, 2005.
  722. A.M. Couhault. Quelques methodes de resolution d'un probleme de programmation stochastique lineaire venant de la gestion des stocks. IRIA, Cahier Nr. 9, 77-100, 1972.
  723. A.B. Cox and Jr. Bryson, A.E. Identification by a combined smoothing nonlinear programming algorithm. Automatica-J. IFAC, 16(6):689-694, 1980.
  724. Dennis D. Cox and Susan John. SDO: a statistical method for global optimization. In Multidisciplinary design optimization (Hampton, VA, 1995), pages 315-329. SIAM, Philadelphia, PA, 1997.
  725. Louis Anthony Cox, Jr. and Djangir A. Babayev. Optimization under uncertainty via random sampling of scenarios. I. Appl. Comput. Math., 3(2):95-106, 2004.
  726. M. L. A. G. Cremers, W. K. Klein Haneveld, and M. H. van der Vlerk. A two-stage model for a day-ahead paratransit planning problem. In CTW2006-Cologne-Twente Workshop on Graphs and Combinatorial Optimization, volume 25 of Electron. Notes Discrete Math., page 35 (electronic). Elsevier, Amsterdam, 2006.
  727. Allan B. Cruse. Some combinatorial properties of centrosymmetric matrices. Linear Algebra and Appl., 16(1):65-77, 1977.
  728. Janos Csirik. Bin packing as a random walk: A note on Knoedel's paper. Oper. Res. Lett. 5, 161-163, 1986.
  729. M. Cugiani. Some stochastic strategies in optimization problems. In Variational inequalities and complementarity problems, theory and applications, Proc. int. School Math., Erice/Sicily 1978, 105-126, 1980.
  730. Di Cui, Xiang Bin Sun, and Wei Zhang. Stochastic programming with an improved Wolef-BFGS-SQP method. J. Shandong Univ. Sci. Technol. Nat. Sci., 24(2):94-96, 2005.
  731. J.-C. Culioli and G. Cohen. Decomposition/coordination algorithms in stochastic optimization. SIAM J. Control Optim., 28(6):1372-1403, 1990.
  732. J.-C. Culioli and G. Cohen. Optimisation stochastique sous contraintes en espérance. Comptes Rendus de l'Académie des Sciences, Paris, t.320, Série I, 735-758, 1995.
  733. A.A. Cunningham and D.M. Frances. A data collection strategy for estimation of cost coefficients of a linear programming model. Management Sci. 22, 1074-1080, 1976.
  734. V.I. Curkov. The two-stage stochastic programming problem of block type. Z. Vycisl. Mat. i Mat. Fiz., 18(2):360-369, 524, 1978.
  735. Jaksa Cvitani\'c and Ioannis Karatzas. Convex duality in constrained portfolio optimization. Ann. Appl. Probab., 2(4):767-818, 1992.
  736. Ja.Z. Cypkin, A.I. Kaplinskii, and A.S. Krasnenker. Methoden der lokalen Verbesserung in Problemen der stochastischen Optimierung. Izv. Akad. Nauk SSSR, tehn. Kibernet. 1973, Nr. 6, 3-11, 1973.
  737. N.D. Dagkesamanskii. A stochastic problem of optimization of multimode installations. In Questions of mathematical cybernetics and applied mathematics, No. 3 (Russian), pages 93-101. "Èlm", Baku, 1978.
  738. Roy W. Dahl, Karen Keating, Laurence Levy, Daryl J. Salamone, Barindra Nag, and Joan A. Sanborn. Weighted Hamiltonian augmentation method involving insertions. J. Guid. Control Dyn. 11, No.5, 412-414, 1988.
  739. L. Dai, C. H. Chen, and J. R. Birge. Convergence properties of two-stage stochastic programming. J. Optim. Theory Appl., 106(3):489-509, 2000.
  740. Frédéric Dambreville and Jean-Pierre Le Cadre. Detection of a Markovian target with optimization of the search efforts under generalized linear constraints. Naval Res. Logist., 49(2):117-142, 2002.
  741. A.R. Danilin. Regularization of a control problem under conditions of uncertainty. In Some questions of operator theory, Collect. sci. Works, Sverdlovsk 1987, 20-28, 1987.
  742. G. Dantzig and G. Infanger. Approaches to stochastic programming with application to electric power systems. In K. Frauendorfer, H. Glavitsch, and R. Bacher, editors, Optimization in Planning and Operation of Electric Power Systems, pages 125-138. Physica-Verlag, Heidelberg, 1993.
  743. G. B. Dantzig. Decomposition techniques for large-scale electric power systems planning under uncertainty. In R. Sharda, B. L. Golden, E. Wasil, O. Balci, and W. Steward, editors, Impacts of Recent Computer Advances on Operations Research, pages 3-20. North-Holland, 1989.
  744. G. B. Dantzig and G. Infanger. Intelligent control and optimization under uncertainty with application to hydro power. European Journal of Operational Research, 97(2):396-407, 1997.
  745. G.B. Dantzig. Linear programming under uncertainty. Management Science, 1:197-206, 1955.
  746. G.B. Dantzig, M.A.H. Dempster, and M. Kallio, editors. Large Scale Linear Programming, Vols. 1 and 2. IIASA, Laxenburg, 1981.
  747. George B. Dantzig. A generalized programming solution to a convex programming problem with a homogeneous objective. Research Report RR-73-21, IIASA - International Institute for Applied Systems Analysis, Laxenburg, Austria, 1973.
  748. George B. Dantzig. Need to do planning under uncertainty and the possibility of using parallel processors for this purpose. Ekonom.-Mat. Obzor, 23(2):121-135, 1987.
  749. George B. Dantzig and Peter W. Glynn. Parallel processors for planning under uncertainty. Ann. Oper. Res., 22(1-4):1-21, 1990. Supercomputers and large-scale optimization: algorithms, software, applications (Minneapolis, MN, 1988).
  750. George B. Dantzig and Gerd Infanger. Large-scale stochastic linear programs-importance sampling and Benders decomposition. In Computational and applied mathematics, I (Dublin, 1991), pages 111-120. North-Holland, Amsterdam, 1992.
  751. George B. Dantzig and Gerd Infanger. Multi-stage stochastic linear programs for portfolio optimization. Ann. Oper. Res., 45(1-4):59-76, 1993.
  752. B. S. Darkhovskii. On an approach to the stochastic recovery problem. Avtomat. i Telemekh., (9):43-52, 2000.
  753. M.S. Daskin. A maximum expected covering location model: formulation, properties and heuristic solution. Transportation Science, 17(1):48-70, 1983.
  754. Gianfranco D'Atri. Outline of a probabilistic framework for combinatorial optimization. In Numerical techniques for stochastic systems (Conf., Gargnano, 1979), pages 347-368. North-Holland, Amsterdam, 1980.
  755. Gianfranco D'Atri and Claude Puech. Probabilistic analysis of the subset-sum problem. Discrete Appl. Math. 4, 329-334, 1982.
  756. K.J. Daun, J.R. Howell, and D.P. Morton. Geometric optimization of radiative enclosures containing specular surfaces, through non-linear programming. In International Mechanical Engineering Congress and Exposition, 2002.
  757. K.J. Daun, J.R. Howell, and D.P. Morton. Geometric optimization of radiative enclosures containing specular surfaces. Journal of Heat Transfer, 125:845-851, 2003.
  758. K.J. Daun, J.R. Howell, and D.P. Morton. Smoothing monte carlo exchange factors through constrained maximum likelihood estimation. Journal of Heat Transfer, 127:1124-1128, 2005.
  759. H.T. David and Geung-Ho Kim. Pragmatic optimization of information functionals. In Optimizing methods in statistics, Proc. int. Conf., Bombay 1977, 167-181 , 1979.
  760. M. Davidson. Primal-dual constraint aggregation with application to stochastic programming. Ann. Oper Res., 99:41-58 (2001), 2000. Applied mathematical programming and modeling, IV (Limassol, 1998).
  761. M. R. Davidson and N. M. Novikova. The constraint aggregation method in a game-theoretic problem of stochastic programming. Vestnik Moskov. Univ. Ser. XV Vychisl. Mat. Kibernet., 48(2):26-29, 1998.
  762. M. R. Davidson, N. M. Novikova, and D. D. Solomakhin. A method for searching for a stochastic saddle point with constraints satisfied almost surely. Vestnik Moskov. Univ. Ser. XV Vychisl. Mat. Kibernet., (2):10-14, 48, 2000.
  763. M. R. Davidson and D. D. Solomakhin. A method for solving a stochastic programming problem with constraints satisfied almost surely. Vestnik Moskov. Univ. Ser. XV Vychisl. Mat. Kibernet., 50(2):33-36, 1999.
  764. M.H.A. Davis. Markov models and optimization, volume 49 of Monographs on Statistics and Applied Probability. Chapman & Hall, London, 1993.
  765. M.H.A. Davis, M.A.H. Dempster, and R.J. Elliott. On the value of information in controlled diffusion processes. In Stochastic analysis, pages 125-138. Academic Press, Boston, MA, 1991.
  766. G.V. Davydov and I.M. Davydova. Solubility of the system Ax=0, x ³ 0 with indefinite coefficients. Sov. Math. 34, No.9, 108-112 translation from Izv. Vyssh. Uchebn. Zaved., Mat. 1990, No.9(340), 85-88 (1990)., 1990.
  767. R.van Dawen and M. Schael. On the existence of stationary optimal policies in Markov decision models. Z. Angew. Math. Mech. 63, T403-T404, 1983.
  768. P.K. De, D. Acharya, and K.C. Sahu. A chance-constrained goal programming model for capital budgeting. J. Oper. Res. Soc. 33, 635-638, 1982.
  769. Prabuddha De, Jay B. Ghosh, and Charles E. Wells. On the minimization of the weighted number of tardy jobs with random processing times and deadline. Comput. Oper. Res. 18, No.5, 457-463, 1991.
  770. Prabuddha De, Jay B. Ghosh, and Charles E. Wells. On the solution of a stochastic bottleneck assignment problem and its variations. Nav. Res. Logist. 39, No.3, 389-397, 1992.
  771. V. de Angelis. Minimax solution for linear programming problems under conditions of uncertainty. Metron, 34(1-2):101-121 (1978), 1976.
  772. V. de Angelis. Linear programming with uncertain objective function: minimax solution for relative loss. Calcolo, 16(2):125-141, 1979.
  773. V. de Angelis. Stochastic linear programming in the objective function: minimax solution for relative loss. In Proceedings of the First World Conference on Mathematics at the Service of Man (Barcelona, 1977), Vol. I, pages 248-271. Univ. Politec. Barcelona, 1980.
  774. X. de Groote, M.-C. Noël, and Y. Smeers. Some test problems for stochastic nonlinear multistage programs. In Numerical techniques for stochastic optimization, volume 10 of Springer Ser. Comput. Math., pages 515-541. Springer, Berlin, 1988.
  775. W.J. De Lange and J.D. Pinter. Groundwater quality assessment and management: A stochastic modelling approach. Research Report 91.009, National Institute for Inland Water Management and Waste Water Treatment, Lelystad, 1991.
  776. F. De Vylder. Bound on integrals: elimination of the dual and reduction of the number of equality constraints. Insurance Math. Econom., 2(3):139-145, 1983.
  777. F. De Vylder. Maximization, under equality constraints, of a functional of a probability distribution. Insurance Math. Econom., 2(1):1-16, 1983.
  778. I. Deák. Computation of multiple normal probabilities. In Recent results in stochastic programming (Proc. Meeting, Oberwolfach, 1979), volume 179 of Lecture Notes in Econom. and Math. Systems, pages 107-120, Berlin, 1980. Springer.
  779. I. Deák. Three digit accurate multiple normal probabilities. Numer. Math., 35(4):369-380, 1980.
  780. I. Deák. Computing probabilities of rectangles in case of multinormal distribution. J. Statist. Comput. Simulation, 26(1-2):101-114, 1986.
  781. I. Deák. Multidimensional integration and stochastic programming. In Numerical techniques for stochastic optimization, volume 10 of Springer Ser. Comput. Math., pages 187-200. Springer, Berlin, 1988.
  782. István Deák. Monte Carlo methods for computing probabilities of sets in higher-dimensional spaces in case of normal distribution. Alkalmaz. Mat. Lapok, 4(1-2):35-94 (1979), 1978.
  783. István Deák. Regression estimators related to multinormal distributions: computer experiences in root finding. In Stochastic programming methods and technical applications (Neubiberg/Munich, 1996), pages 279-293. Springer, Berlin, 1998.
  784. István Deák. Computing two-stage stochastic programming problems by successive regression approximations. In Stochastic optimization techniques (Neubiberg/Munich, 2000), volume 513 of Lecture Notes in Econom. and Math. Systems, pages 91-102. Springer, Berlin, 2002.
  785. István Deák. Solving stochastic programming problems by successive regression approximations-numerical results. In Dynamic stochastic optimization (Laxenburg, 2002), volume 532 of Lecture Notes in Econom. and Math. Systems, pages 209-224. Springer, Berlin, 2004.
  786. István Deák. Two-stage stochastic problems with correlated normal variables: computational experiences. Ann. Oper. Res., 142:79-97, 2006.
  787. Brian C. Dean, Michel X. Goemans, and Jan Vondrák. Adaptivity and approximation for stochastic packing problems. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 395-404 (electronic), New York, 2005. ACM.
  788. Morris H. DeGroot. Optimization with an uncertain objective. Stochastics, 21(2):97-112, 1987.
  789. I. Dekany. Numerical solution of a stochastic control problem derived from Bensoussan-Lions. Inventory model. In Prog. Oper. Res., Eger 1974, Colloq. Math. Soc. Janos Bolyai 12, 231-242 , 1976.
  790. P. Del Moral and G. Salut. Particle interpretation of nonlinear filtering and optimization. Russian J. Math. Phys., 5(3):355-372 (1998), 1997.
  791. Pierre Del Moral. Maslov optimization theory: topological aspects. In Idempotency (Bristol, 1994), pages 354-382. Cambridge Univ. Press, Cambridge, 1998.
  792. Bernard Delyon and Anatoli Juditsky. Stochastic optimization with averaging of trajectories. Stochastics Stochastics Rep., 39(2-3):107-118, 1992.
  793. Ron S. Dembo. Scenario optimization. Ann. Oper. Res., 30(1-4):63-80, 1991. Stochastic programming, Part I (Ann Arbor, MI, 1989).
  794. Ron S. Dembo and Moshe Haviv. Truncated policy iteration methods. Oper. Res. Lett. 3, 243-246, 1984.
  795. R.S. Dembo and A. King. Tracking models and the optimal regret distribution in asset allocation. Applied Stochastic Models and Data Analysis 8:151-157, 1992.
  796. M. A. H. Dempster. Sequential importance sampling algorithms for dynamic stochastic programming. Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI), 312(Teor. Predst. Din. Sist. Komb. i Algoritm. Metody. 11):94-129, 312-313, 2004.
  797. M. A. H. Dempster, J. E. Scott, and G. W. P. Thompson. Stochastic modeling and optimization using STOCHASTICS. In Applications of stochastic programming, volume 5 of MPS/SIAM Ser. Optim., pages 137-157. SIAM, Philadelphia, PA, 2005.
  798. M.A.H. Dempster. On stochastic programming. I: Static linear programming under risk. J. math. Analysis Appl. 21, 304-343, 1968.
  799. M.A.H. Dempster. Introduction to stochastic programming. In Stochastic programming (Proc. Internat. Conf., Univ. Oxford, Oxford, 1974), pages 3-59. Academic Press, London, 1980.
  800. M.A.H. Dempster, editor. Stochastic programming, London, 1980. Academic Press Inc. [Harcourt Brace Jovanovich Publishers]. The Institute of Mathematics and its Applications Conference Series.
  801. M.A.H. Dempster. A stochastic approach to hierarchical planning and scheduling. In Deterministic and stochastic scheduling (Durham, 1981), volume 84 of NATO Adv. Study Inst. Ser. C: Math. Phys. Sci., pages 271-296, Dordrecht, 1982. Reidel.
  802. M.A.H. Dempster, editor. Proceedings of the IIASA Task Force Meeting in Stochastic Optimization. 1983. Stochastics 10, No. 3-4.
  803. M.A.H. Dempster. On stochastic programming. II. Dynamic problems under risk. Stochastics, 25(1):15-42, 1988.
  804. M.A.H. Dempster, M.L. Fisher, L. Jansen, B.J. Lageweg, J.K. Lenstra, and A.H.G. Rinnooy Kan. Analytical evaluation of hierarchical planning systems. Oper. Res. 29, 707-716, 1981.
  805. M.A.H. Dempster, M.L. Fisher, L. Jansen, B.J. Lageweg, J.K. Lenstra, and A.H.G. Rinnooy Kan. Analysis of heuristics for stochastic programming: results for hierarchical scheduling problems. Math. Oper. Res., 8(4):525-537, 1983.
  806. M.A.H. Dempster and A. Papagaki-Papoulias. Computational experience with an approximate method for the distribution problem. In Stochastic programming, Proc. int. Conf., Oxford 1974, 223-243, 1980.
  807. Eric V. Denardo, Uriel G. Rothblum, and Arthur J. Swersey. A transportation problem in which costs depend on the order of arrival. Manage. Sci. 34, No.6, 774-783, 1988.
  808. D. Dentcheva. Differentiable selections and Castaing representations of multifunctions. Mathematical Analysis and Applications, 223:371-396, 1998.
  809. D. Dentcheva. Regular Castaing representations with application to stochastic programming. SIAM Journal on Optimization, 10:732-749, 2000.
  810. D. Dentcheva, A. Prekopa, and A. Ruszczynski. On convex probabilistic programs with discrete distributions. Nonlinear Analysis: Theory, Methods & Applications, 47:1997-2009, 2001.
  811. D. Dentcheva, A. Prekopa, and A. Ruszczynski. Bounds for integer stochastic programs with probabilistic constraints. Discrete Applied Mathematics, to appear.
  812. D Dentcheva and W. Römisch. Optimal power generation under uncertainty via stochastic programming. In K. Marti and P. Kall, editors, Stochastic Programming Methods and Technical Applications, Lecture Notes in Economics and Mathematical Systems, volume 458, pages 22-56. Springer-Verlag, Berlin, 1998.
  813. D. Dentcheva and A. Ruszczy\'nski. Inverse stochastic dominance constraints and quantile utility theory. C. R. Acad. Bulgare Sci., 58(1):13-18, 2005.
  814. Darinka Dentcheva. Regular Castaing representations of multifunctions with applications to stochastic programming. SIAM J. Optim., 10(3):732-749 (electronic), 2000.
  815. Darinka Dentcheva. Approximations, expansions and univalued representations of multifunctions. Nonlinear Anal., 45(1, Ser. A: Theory Methods):85-108, 2001.
  816. Darinka Dentcheva, René Henrion, and Andrzej Ruszczy\'nski. Stability and sensitivity of optimization problems with first order stochastic dominance constraints. SIAM J. Optim., 18(1):322-337 (electronic), 2007.
  817. Darinka Dentcheva, Bogumila Lai, and Andrzej Ruszczy\'nski. Efficient point methods for probabilistic optimization problems. Stochastic Programming E-Print Series, http://www.speps.org, 2003.
  818. Darinka Dentcheva, Bogumila Lai, and Andrzej Ruszczy\'nski. Dual methods for probabilistic optimization problems. Math. Methods Oper. Res., 60(2):331-346, 2004.
  819. Darinka Dentcheva, András Prékopa, and Andrzej Ruszczy\'nski. Concavity and efficient points of discrete distributions in probabilistic programming. Math. Program., 89(1, Ser. A):55-77, 2000.
  820. Darinka Dentcheva, András Prékopa, and Andrzej Ruszczy\'nski. On convex probabilistic programming with discrete distributions. Nonlinear Anal., 47(3):1997-2009, 2001. Proceedings of the Third World Congress of Nonlinear Analysts, Part 3 (Catania, 2000).
  821. Darinka Dentcheva, András Prékopa, and Andrzej Ruszczy\'nski. Bounds for probabilistic integer programming problems. Discrete Appl. Math., 124(1-3):55-65, 2002. Workshop on Discrete Optimization (Piscataway, NJ, 1999).
  822. Darinka Dentcheva and Werner Römisch. Differential stability of two-stage stochastic programs. SIAM J. Optim., 11(1):87-112 (electronic), 2000.
  823. Darinka Dentcheva and Werner Römisch. Duality gaps in nonconvex stochastic optimization. Math. Program., 101(3, Ser. A):515-535, 2004.
  824. Darinka Dentcheva, Werner Römisch, and Rüdiger Schultz. Strong convexity and directional derivatives of marginal values in two-stage stochastic programming. In Stochastic programming (Neubiberg/München, 1993), volume 423 of Lecture Notes in Econom. and Math. Systems, pages 8-21. Springer, Berlin, 1995.
  825. Darinka Dentcheva and Andrzej Ruszczy\'nski. Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints. Stochastic Programming E-Print Series, http://www.speps.org, 2003.
  826. Darinka Dentcheva and Andrzej Ruszczy\'nski. Optimization with stochastic dominance constraints. Stochastic Programming E-Print Series, http://www.speps.org, 2003.
  827. Darinka Dentcheva and Andrzej Ruszczy\'nski. Portfolio optimization with stochastic dominance constraints. Stochastic Programming E-Print Series, http://www.speps.org, 2003.
  828. Darinka Dentcheva and Andrzej Ruszczy\'nski. Convexification of stochastic ordering. Stochastic Programming E-Print Series, http://www.speps.org, 2004.
  829. Darinka Dentcheva and Andrzej Ruszczy\'nski. Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints. Math. Program., 99(2, Ser. A):329-350, 2004.
  830. Darinka Dentcheva and Andrzej Ruszczy\'nski. Semi-infinite probabilistic optimization: first-order stochastic dominance constraints. Optimization, 53(5-6):583-601, 2004.
  831. Michel Denuit and Claude Lefèvre. Stochastic s-(increasing) convexity. In Generalized convexity and generalized monotonicity (Karlovassi, 1999), pages 167-182. Springer, Berlin, 2001.
  832. Michel Denuit, Claude Lefèvre, and Sergey Utev. Stochastic orderings of convex/concave-type on an arbitrary grid. Math. Oper. Res., 24(4):835-846, 1999.
  833. Concetta A. DePaolo and David J. Rader, Jr. A heuristic algorithm for a chance constrained stochastic program. European J. Oper. Res., 176(1):27-45, 2007.
  834. Cyrus Derman, Gerald J. Lieberman, and Sheldon M. Ross. A sequential stochastic assignment problem. Management Sci., Theory 18, 349-355, 1972.
  835. C.L. Dert. Asset Liability Management for Pension Funds, A Multistage Chance Constrained Programming Approach. PhD thesis, Erasmus University, Rotterdam, The Netherlands, 1995.
  836. Luc P. Devroye. An expanding automaton for use in stochastic optimization. J. Cybern. Inf. Sci. 82-94 (1978)., 1977.
  837. Luc P. Devroye. Progressive global random search of continuous functions. Math. Programming, 15(3):330-342, 1978.
  838. Luc P. Devroye. Inequalities for the completion times of stochastic PERT networks. Math. Oper. Res. 4, 441-447, 1979.
  839. I.P. Devyaterikov and A.I. Koshlan'. A method of solving constrained stochastic optimization problems. Autom. Remote Control 49, No.5, 628-632 translation from Avtom. Telemekh. 1988, No.5, 99-105 (1988)., 1988.
  840. I.P. Devyaterikov and A.I. Koshlan. Stochastic optimization methods with constraints. Autom. Remote Control 49, No.4, 397-412 translation from Avtom. Telemekh. 1988, No.4, 3-21 (1988)., 1988.
  841. A.S. Dexter, J.N.W. Yu, and W.T. Ziemba. Portfolio selection in a lognormal market when the investor has a power utility function: Computational results. In Stochastic programming, Proc. int. Conf., Oxford 1974, 507-523, 1980.
  842. Ang Zhao Di. A constrained iterative stochastic algorithm. Acta Automat. Sinica, 11(3):251-257, 1985.
  843. Nico Di Domenica, George Birbilis, Gautam Mitra, and Patrick Valente. Stochastic programming and scenario generation within a simualtion framework. Stochastic Programming E-Print Series, http://www.speps.org, 2004.
  844. A. Di Nola and S. Sessa. A Boolean model of deciding in fuzzy environment. RAIRO Automat., 14(4):363-374, 1980. With comments by A. Dussauchoy.
  845. Josep Díaz, Mathew D. Penrose, Jordi Petit, and María Serna. Approximating layout problems on random geometric graphs. J. Algorithms, 39(1):78-116, 2001.
  846. Boyan Dimitrov and Jr. Green, David. Stochastic optimization problems under incomplete information on distribution functions. Control Cybernet., 26(1):93-110, 1997.
  847. W. Dinkelbach. Entscheidungsmodelle. W. de Gruyter, Berlin, 1982. (in German).
  848. J. Dippon and J. Renz. Weighted means in stochastic approximation of minima. SIAM Journal of Control and Optimization, 35:1811-1827, 1997.
  849. Jürgen Dippon. Globally convergent stochastic optimization with optimal asymptotic distribution. J. Appl. Probab., 35(2):395-406, 1998.
  850. L.C.W. Dixon. On on-line variable metric methods. In Survey of mathematical programming, Proc. int. Symp., Vol. 3, Budapest 1976, 421-428, 1980.
  851. L.C.W. Dixon and L. James. On stochastic variable-metric methods. In Analysis and optimisation of stochastic systems (Proc. Internat. Conf., Univ. Oxford, Oxford, 1978), pages 243-256. Academic Press, London, 1980.
  852. D.T. Dochev and V.I. Zhukovski. An s1-optimal solution of a multicriterial problem with uncertainty. Godishnik Vissh. Uchebn. Zaved. Prilozhna Mat., 23(2):9-26 (1988), 1987.
  853. D.T. Dochev and V.I. Zhukovski. Sufficient conditions for p1-optimality with uncertainty. Godishnik Vissh. Uchebn. Zaved. Prilozhna Mat., 23(1):19-30 (1988), 1987.
  854. Stefcho P. Dokov and David P. Morton. Higher-order upper bounds on the expectation of a convex function. Stochastic Programming E-Print Series, http://www.speps.org, 2002.
  855. Steftcho P. Dokov and David P. Morton. Second-order lower bounds on the expectation of a convex function. Math. Oper. Res., 30(3):662-677, 2005.
  856. V.A. Dolodarenko. The statement of a complex problem of optimal control over a dynamical system with combinatorial plan. In Applied problems of the dynamics of controlled movement, Collect. sci. Works, Kiev 1981, 119-127, 1981.
  857. V.A. Dolodarenko and E.I. Fedan. Ueber eine Methode zur Loesung des Zuordnungsproblems mit nichtlinearer stochastischer Zielfunktion. Kibernetika, Kiev 1977, Nr. 2, 136-141, 1977.
  858. V.A. Dolodarenko and V.S. Sen'kin. On an optimization problem under given probability of aim reaching. In Probabilistic-statistical methods for investigations of complex systems, Work Collect., Kiev 1976, 40-45, 1976.
  859. V.O. Dolodarenko and E.I. Fedan. An allocation problem with non-linear stochastic objective function. Avtomatika, Kiev 1976, Nr. 3, 29-32, 1976.
  860. Christopher J. Donohue and John R. Birge. An upper bound on the expected value of a non-increasing convex function with convex marginal return functions. Oper. Res. Lett., 18(5):213-221, 1996.
  861. Christopher J. Donohue and John R. Birge. The abridged nested decomposition method for multistage stochastic linear programs with relatively complete recourse. Algorithmic Oper. Res., 1(1):20-30, 2006.
  862. C. C. Y. Dorea and L. C. Zhao. Convergence of a random algorithm for function optimization. Numer. Funct. Anal. Optim., 20(9-10):825-833, 1999.
  863. C.C.Y. Dorea. Stochastic algorithm for solving a set of inequalities. Numer. Funct. Anal. Optim., 10(9-10):937-945, 1989.
  864. C.C.Y. Dorea. Stopping rules for a random optimization method. SIAM J. Control Optimization 28, No.4, 841-850, 1990.
  865. C.C.Y. Dorea and C.R. Gonçalves. Alternative sampling strategy for a random optimization algorithm. J. Optim. Theory Appl., 78(2):401-407, 1993.
  866. Chang C. Y. Dorea and Cátia R. Gonçalves. Search schemes for random optimization algorithms that preserve the asymptotic distribution. J. Appl. Probab., 36(3):825-836, 1999.
  867. Chang Chung Yu Dorea. Stationary distribution of Markov chains in r\sp d with application to global random optimization. Bernoulli, 3(4):415-427, 1997.
  868. Chang C.Y. Dorea. Limiting distribution for random optimization methods. SIAM J. Control Optim., 24(1):76-82, 1986.
  869. Chang C.Y. Dorea. Effort associated with a class of random optimization methods. Math. Programming, 50(1 (Ser. A)):91-98, 1991.
  870. Jan van Doremalen. Mean value analysis in multichain queueing networks: An iterative approximation. In Operations research, Proc. 12th Annu. Meet., Mannheim 1983, 441-448 , 1984.
  871. A.A. Dorogovtsev. Stochastic analysis and a minimization problem. Ukraïn. Mat. Zh., 46(11):1568-1571, 1994.
  872. P. Doschkinov. A distribution stability result for a stochastic optimal control problem. Optimization 18, 419-431, 1987.
  873. Julian Douglass, Owen Wu, and William T. Ziemba. Stock ownership decisions in dc pension plans. Stochastic Programming E-Print Series, http://www.speps.org, 2003.
  874. Mihai Dragomirescu. An algorithm for the minimum-risk problem of stochastic programming. Operations Res. 20, 154-164, 1972.
  875. S.J. Drijver, W.K. Klein Haneveld, and M.H. van der Vlerk. Asset liability management modeling using multistage mixed-integer stochastic programming. Research Report 00E52, SOM, University of Groningen, 2000.
  876. S.J. Drijver, W.K. Klein Haneveld, and M.H. van der Vlerk. ALM model for pension funds: numerical results for a prototype model. Research Report 02A44, SOM, University of Groningen, http://som.rug.nl, 2002.
  877. S.J. Drijver, W.K. Klein Haneveld, and M.H. van der Vlerk. Asset Liability Management modeling using multi-stage mixed-integer Stochastic Programming. In B. Scherer, editor, Asset and Liability Management Tools: A Handbook for Best Practice, pages 309-324. Risk Books, London, 2003.
  878. Moshe Dror. Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution. Eur. J. Oper. Res. 64, No.3, 432-441, 1993.
  879. Moshe Dror, Gilbert Laporte, and Pierre Trudeau. Vehicle routing with stochastic demands: properties and solution frameworks. Transportation Sci., 23(3):166-176, 1989.
  880. Moshe Dror and Pierre Trudeau. Stochastic vehicle routing with modified savings algorithm. Eur. J. Oper. Res. 23, 228-235, 1986.
  881. Didier Dubois. Linear programming with fuzzy data. In Analysis of fuzzy information, Vol. 3: Appl. eng. sci., 241-263, 1987.
  882. Yu.A. Dubov. Necessary and sufficient conditions for Pareto-optimality in mean. Eng. Cybern. 17, No.6, 109-114 translation from Izv. Akad. Nauk SSSR, Tekh. Kibern. 1979, No.6, 137-141 (1979)., 1979.
  883. Alan I. Duchan. A clarification and a new proof of the certainty equivalence theorem. Internat. econom. Review 15, 216-224, 1974.
  884. Ewa Dudek-Dyduch and Tadeusz Dyduch. On optimization with random seeking. In Transactions of the Tenth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes, Vol. A (Prague, 1986), pages 293-298. Reidel, Dordrecht, 1988.
  885. Gunter Dueck and Tobias Scheuer. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. J. Comput. Phys. 90, No.1, 161-175, 1990.
  886. W. Duerr. Stochastische Programmierungsmodelle als Vektormaximumprobleme. In Proc. Oper. Res., DGU Ann. Meet. 1971, 189-199, 1972.
  887. J. H. Dulá, R. V. Helgason, and N. Venugopal. An algorithm for identifying the frame of a pointed finite conical hull. INFORMS J. Comput., 10(3):323-330, 1998.
  888. José H. Dulá. An upper bound on the expectation of simplicial functions of multivariate random variables. Math. Programming, 55(1, Ser. A):69-80, 1992.
  889. José H. Dulá. Bounds and approximations in stochastic linear programming. Investigación Oper., 14(2-3):127-147, 1993. Workshop on Stochastic Optimization: the State of the Art (Havana, 1992).
  890. José H. Dulá. Designing a majorization scheme for the recourse function in two-stage stochastic linear programming. Comput. Optim. Appl., 1(4):399-414, 1993.
  891. Jose H. Dula and Rajluxmi V. Murthy. A Tchebysheff-type bound on the expectation of sublinear polyhedral functions. Oper. Res. 40, No.5, 914-922, 1992.
  892. Vincentiu Dumitru and Florica Luban. On some optimization problems under uncertainty. Fuzzy Sets Syst. 18, 257-272, 1986.
  893. J. Dupacová. In Studies on mathematical programming (Papers, Third Conf. Math. Programming, Mátrafüred, 1975), Budapest.
  894. J. Dupacova. Stochastic programming models in banking. Tutorial Paper, IIASA Laxenburg, February 1991.
  895. J. Dupacová. Minimax approach to stochastic linear programming and the moment problem. Selected results. Z. Angew. Math. Mech., 58(7):T466-T467, 1978.
  896. J. Dupacová. Experience in stochastic programming models. In Survey of mathematical programming (Proc. Ninth Internat. Math. Programming Sympos., Budapest, 1976), Vol. 2, pages 99-105, Amsterdam, 1979. North-Holland.
  897. J. Dupacová. Stability studies in stochastic programs with recourse. A special case. Z. Angew. Math. Mech., 62(5):T369-T370, 1982.
  898. J. Dupacová. Stability in stochastic programming with recourse. Acta Univ. Carolin.-Math. Phys., 24(1):23-34, 1983.
  899. J. Dupacová. Stability in stochastic programming with recourse-estimated parameters. Math. Programming, 28(1):72-83, 1984.
  900. J. Dupacová. Stability in stochastic programming with recourse. Contaminated distributions. Math. Programming Stud., 27:133-144, 1986. Stochastic programming 84. I.
  901. J. Dupacová. Stochastic Programming. MS CSR, Prague, 1986. (in Czech).
  902. J. Dupacova. Stochastic optimization models in banking. EMO, 27:201-234, 1991. In Czech.
  903. J. Dupacova. Applications of stochastic programming in finance. In Atti del XVI convegno A.M.A.S.E.S., Treviso 1992, pages 13-30, 1992.
  904. J. Dupacova. Stochastic programming models in banking & portfolio optimization under uncertainty. In W. Runggaldier, editor, Stochastic Processes: Applications in Mathematical Economics - Finance, Applied Mathematics Monographs 5, pages 19-20. C.N.R., 1992.
  905. J. Dupacova. Bounds for stochastic programs in particular for recourse problems. Working paper WP-95-085, IIASA, Laxenburg, Austria, 1995.
  906. J. Dupacova. Scenario based stochastic programs: Resistance with respect to sample. Annals of Oper. Res., 64:21-38, 1996.
  907. J. Dupacova. Uncertainty about input data in portfolio management. In M. Bertocchi et al., editor, Modelling Techniques for Financial Markets and Bank Management, pages 17-33. Physica Verlag, 1996.
  908. J. Dupacova. Input analysis for a bond portfolio management model. ZAMM, 77:541-542, 1997.
  909. J. Dupacova. Moment bounds for stochastic programs in particular for recourse problems. In V. Benes and J. Stepán, editors, Distributions with Given Marginals and Moment Problems (Proc. of the 3rd International Conference, Praha 1996), pages 199-204. Kluwer Acad. Publ, 1997.
  910. J. Dupacova. Stochastic programming: Minimax approach. In C. A. Floudas & P. M. Pardalos, editor, Encyclopedia of Optimization, volume 5, pages 327-330. Kluwer, 2001.
  911. J. Dupacová. Stress testing via contamination. In Coping with uncertainty, volume 581 of Lecture Notes in Econom. and Math. Systems, pages 29-46. Springer, Berlin, 2006.
  912. J. Dupacova and M. Bertocchi. From data to model and back to data: A bond portfolio management problem. EJOR, 134:261-278, 2001.
  913. J. Dupacova, M. Bertocchi, and V. Moriggia. Sensitivity analysis on inputs for a bond portfolio management model. In P. Albrecht, editor, Aktuarielle Ansätze für Finanz-Risiken AFIR 1996, Proc. of the VIth AFIR Colloquium, Nuremberg, pages 783-793. VVW Karlsruhe, 1996. See also Technical Report 16, Univ. of Bergamo, 1996.
  914. J. Dupacova, M. Bertocchi, and V. Moriggia. Postoptimality for a bond portfolio management model. In C. Zopounidias, editor, New Operational Approaches in Financial Modelling (Proc. of the 19th meeting of EURO WGFM, Chania, Crete, 1996), pages 49-62, Heidelberg, 1997. Physica Verlag. See also Technical Report No. 13, Univ. of Bergamo 1997.
  915. J. Dupacova, M. Bertocchi, and V. Moriggia. Sensitivity analysis for a bond portfolio management model for the italian market. Cybernetics, 29:595-615, 2000.
  916. J. Dupacova, M. Bertocchi, and V. Moriggia. Sensitivity analysis of a bond portfolio management model for the italian market. Control & Dynamics, 29:595-615, 2000.
  917. J. Dupacova, M. Bertocchi, and V. Moriggia. Sensitivity of a bond portfolio's behavior with respect to random movements in yield curve: A simulation study. Ann. Oper. Res., 99:267-286, 2000.
  918. J. Dupacova, M. Bertocchi, and V. Moriggia. Postoptimality for scenario based financial models with an application to bond portfolio management. In W. Ziemba and J. Mulvey, editors, World Wide Asset and Liability Management. Cambridge Univ. Press, To appear.
  919. J. Dupacova, P. Charamza, and J. Mádl. On stochastic aspects of a metal cutting problem. In K. Marti and P. Kall, editors, Proc. of 2nd GAMM/IFIP Workshop `Stochastic Optimization: Numerical Techniques and Engineering Applications', LN in Economics and Math. Systems 423, pages 196-209. Springer, 1995.
  920. J. Dupacova, A. Gaivoronski, Z. Kos, and T. Szantai. Stochastic programming in water management: A case study and a comparison of solution techniques. EJOR, 52:28-44, 1991.
  921. J. Dupacová, J. Hurt, and J. Stepán. Stochastic Modeling in Economics and Finance, volume 75 of Applied Optimization. Kluver Acad. Publ., 2002.
  922. J. Dupacova, M. Bertocchi J. Abaffy, and V. Moriggia. Generating scenarios for bond portfolios. Bulletin of the Czech Econometric Society, 11:3-27, 2000.
  923. J. Dupacova, J. Mádl, and P.Charamza. A mathematical model for optimization of cutting conditions in machining. In U. Derigs, A. Bachem, and A. Drexl, editors, OR-proceedings 1994, pages 28-32. Springer, 1995.
  924. J. Dupacová and K. Sladký. Comparison of multistage stochastic programs with recourse and stochastic dynamic programs with discrete time. ZAMM Z. Angew. Math. Mech., 82(11-12):753-765, 2002. 4th GAMM-Workshop "Stochastic Models and Control Theory" (Lutherstadt Wittenberg, 2001).
  925. Jitka Dupacová. Minimax stochastic programs with nonconvex nonseparable penalty functions. In Progress in operations research, Vols. I, II (Proc. Sixth Hungarian Conf., Eger, 1974), pages 303-316. Colloq. Math. Soc. János Bolyai, Vol. 12, Amsterdam, 1976. North-Holland.
  926. Jitka Dupacová. The minimax problem of stochastic linear programming and the moment problem. Ekonom.-Mat. Obzor, 13(3):279-307, 1977.
  927. Jitka Dupacová. Minimax stochastic programs with nonseparable penalties. In Optimization techniques (Proc. Ninth IFIP Conf., Warsaw, 1979), Part 1, volume 22 of Lecture Notes in Control and Information Sci., pages 157-163, Berlin, 1980. Springer.
  928. Jitka Dupacová. Water resources system modelling using stochastic programming with recourse. In Recent results in stochastic programming (Proc. Meeting, Oberwolfach, 1979), volume 179 of Lecture Notes in Econom. and Math. Systems, pages 121-133, Berlin, 1980. Springer.
  929. Jitka Dupacová. Stability in stochastic programming-probabilistic constraints. In Stochastic optimization (Kiev, 1984), volume 81 of Lecture Notes in Control and Inform. Sci., pages 314-325. Springer, Berlin, 1986.
  930. Jitka Dupacová. The minimax approach to stochastic programming and an illustrative application. Stochastics, 20(1):73-88, 1987.
  931. Jitka Dupacová. On some connections between parametric and stochastic programming. In Parametric optimization and related topics (Plaue, 1985), volume 35 of Math. Res., pages 74-81. Akademie-Verlag, Berlin, 1987.
  932. Jitka Dupacová. Stochastic programming with incomplete information: a survey of results on postoptimization and sensitivity analysis. Optimization, 18(4):507-532, 1987.
  933. Jitka Dupacová. On nonnormal asymptotic behavior of optimal solutions of stochastic programming problems: the parametric case. In Proceedings of the Fourth Prague Symposium on Asymptotic Statistics (Prague, 1988), pages 205-214, Prague, 1989. Charles Univ.
  934. Jitka Dupacová. Stochastic programming-model building and selected applications. Investigación Oper., 10(3):119-134, 1989.
  935. Jitka Dupacová. Stability and sensitivity analysis for stochastic programming. Ann. Oper. Res., 27(1-4):115-142, 1990.
  936. Jitka Dupacová. On nonnormal asymptotic behavior of optimal solutions for stochastic programming problems and on related problems of mathematical statistics. Kybernetika (Prague), 27(1):38-52, 1991.
  937. Jitka Dupacová. On statistical sensitivity analysis in stochastic programming. Ann. Oper. Res., 30(1-4):199-214, 1991. Stochastic programming, Part I (Ann Arbor, MI, 1989).
  938. Jitka Dupacová. Stochastic optimization models in banking. Ekonom.-Mat. Obzor, 27(3):201-234, 1991.
  939. Jitka Dupacová. On interval estimates for optimal value of stochastic programs. In P. Kall, editor, System modelling and optimization (Zurich, 1991), volume 180 of Lecture Notes in Control and Inform. Sci., pages 556-563. Springer, Berlin, 1992.
  940. Jitka Dupacová. Applications of stochastic programming under incomplete information. J. Comput. Appl. Math., 56(1-2):113-125, 1994. Stochastic programming: stability, numerical methods and applications (Gosen, 1992).
  941. Jitka Dupacová. Multistage stochastic programs: the state-of-the-art and selected bibliography. Kybernetika (Prague), 31(2):151-174, 1995.
  942. Jitka Dupacová. Postoptimality for multistage stochastic linear programs. Ann. Oper. Res., 56:65-78, 1995. Stochastic programming (Udine, 1992).
  943. Jitka Dupacová. Stochastic programming: Approximation via scenarios. In Proceedings of 3rd Caribbean Conference on Approximation and Optimization. EMIS Master Server http://www.emis.de/proceedings/index.html, 1995.
  944. Jitka Dupacová. Scenario-based stochastic programs: resistance with respect to sample. Ann. Oper. Res., 64:21-38, 1996. Stochastic programming, algorithms and models (Lillehammer, 1994).
  945. Jitka Dupacová. Postoptimality analysis for scenario based stochastic programs: a survey. In J. Guddat et al., editor, Parametric optimization and related topics, IV (Enschede, 1995), volume 9 of Approx. Optim., pages 43-57, Frankfurt am Main, 1997. Lang.
  946. Jitka Dupacová. Stochastic programming: approximation via scenarios. In Proceedings of the 3rd International Conference on Approximation and Optimization in the Caribbean (Puebla, 1995), page 20 pp. (electronic). Benemérita Univ. Autón. Puebla, Puebla, 1997.
  947. Jitka Dupacová. Reflections on robust optimization. In Stochastic programming methods and technical applications (Neubiberg/Munich, 1996), pages 111-127. Springer, Berlin, 1998.
  948. Jitka Dupacová. Stochastic programming: Approximation via scenarios. Aportaciones Mathematicas, Ser. Communicationes, 24:77-94, 1998.
  949. Jitka Dupacová. Portfolio optimization via stochastic programming: methods of output analysis. Math. Methods Oper. Res., 50(2):245-270, 1999. Financial optimization.
  950. Jitka Dupacová. Stability properties of a bond portfolio management problem. Ann. Oper Res., 99:251-265 (2001), 2000. Applied mathematical programming and modeling, IV (Limassol, 1998).
  951. Jitka Dupacová. Output analysis for approximated stochastic programs. In Stochastic optimization: algorithms and applications (Gainesville, FL, 2000), volume 54 of Appl. Optim., pages 1-29. Kluwer Acad. Publ., Dordrecht, 2001.
  952. Jitka Dupacová. Applications of stochastic programming: achievements and questions. European J. Oper. Res., 140(2):281-290, 2002. O.R. for a united Europe (Budapest, 2000).
  953. Jitka Dupacová. Reflections on output analysis for multistage stochastic linear programs. In Dynamic stochastic optimization (Laxenburg, 2002), volume 532 of Lecture Notes in Econom. and Math. Systems, pages 3-20. Springer, Berlin, 2004.
  954. Jitka Dupacová. Uncertainties in stochastic programming models: The minimax approach. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  955. Jitka Dupacová. Contamination for multistage stochastic programs. Stochastic Programming E-Print Series, http://www.speps.org, 2006.
  956. Jitka Dupacová and Marida Bertocchi. Management of bond portfolios via stochastic programming-postoptimality and sensitivity analysis. In System modelling and optimization (Prague, 1995), pages 574-581. Chapman & Hall, London, 1996.
  957. Jitka Dupacová, Giorgio Consigli, and Stein W. Wallace. Scenarios for multistage stochastic programs. Ann. Oper Res., 100:25-53 (2001), 2000. Research in stochastic programming (Vancouver, BC, 1998).
  958. Jitka Dupacová, Nicole Gröwe-Kuska, and Werner Römisch. Scenario reduction in stochastic programming: An approach using probability metrics. Stochastic Programming E-Print Series, http://www.speps.org, to appear in Math. Progr., 2000.
  959. Jitka Dupacova and Zdenek Kos. Chance-constrained and simulation models of water resources systems. Ekon.-Mat. Obz. 15, 178-191, 1979.
  960. Jitka Dupacová and Jan Polivka. Asset-liability management for czech pension funds using stochastic programming. Stochastic Programming E-Print Series, http://www.speps.org, 2004.
  961. Jitka Dupacová and Jan Polivka. Stress testing for var an cvar. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  962. Jitka Dupacová and Pavel Popela. Melt control. Stochastic Programming E-Print Series, http://www.speps.org, 2004.
  963. Jitka Dupacová and Pavel Popela. Melt control: charge optimization via stochastic programming. In Applications of stochastic programming, volume 5 of MPS/SIAM Ser. Optim., pages 277-297. SIAM, Philadelphia, PA, 2005.
  964. Jitka Dupacová and Roger Wets. Asymptotic behavior of statistical estimators and of optimal solutions of stochastic optimization problems. Ann. Statist., 16(4):1517-1549, 1988.
  965. Paul Dupuis and Rahul Simha. On sampling controlled stochastic approximation. IEEE Trans. Autom. Control 36, No.8, 915-924, 1991.
  966. G. Duru. Planification de la production en avenir aleatoire. Publ. econometr., Lyon 4, 381-411, 1971.
  967. G. Duru. Programme stochastique généralisé à un étage. Publ. Économétriques, 5:17-36, 1972.
  968. Prajit K. Dutta. What do discounted optima converge to? A theory of discount rate asymptotics in economic models. J. Econom. Theory, 55(1):64-94, 1991.
  969. Prajit K. Dutta and Mukul Majumdar. Limit integration theorems for monotone functions and parametric continuity in zero sum stochastic games. Nonlinear World, 1(1):73-91, 1994.
  970. Shane Dye. Subtree decomposition for multistage stochastic programs. Stochastic Programming E-Print Series, http://www.speps.org, 2003.
  971. Shane Dye. Subtree decomposition for multistage stochastic programs. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  972. Shane Dye, Leen Stougie, and Asgeir Tomasgard. The stochastic single node service provision problem. Stochastic Programming E-Print Series, http://www.speps.org, 2002.
  973. M. Dyer and L. Stougie. Stochastic programming problems: Complexity and approximability. in preparation.
  974. Martin Dyer and Alan Frieze. Probabilistic analysis of the generalised assignment problem. Math. Programming, 55(2, Ser. A):169-181, 1992.
  975. Martin Dyer and Leen Stougie. Computational complexity of stochastic programming problems. Math. Program., 106(3, Ser. A):423-432, 2006.
  976. M.E. Dyer, A.M. Frieze, and C.J.H. McDiarmid. On linear programs with random costs. Math. Program. 35, 3-16, 1986.
  977. Richard L. Dykstra. Computational aspects of I-projections. J. Statist. Comput. Simulation, 21(3-4):265-274, 1985.
  978. Richard L. Dykstra. An iterative procedure for obtaining I-projections onto the intersection of convex sets. Ann. Probab., 13(3):975-984, 1985.
  979. E.B. Dynkin. Probabilistic concave dynamic programming. Mat. Sb. (N.S.), 87(129):490-503, 1972.
  980. E.B. Dynkin. Optimal programs and stimulating prices in the stochastic models of economic growth. In Math. Models Econ., Proc. Sympos. math. Meth. Econ. and Conf. von Neumann Models, Warszawa 1972, 207-218, 1974.
  981. E.B. Dynkin and A.A. Yushkevich. Controllable Markov processes and their applications. (Upravlyaemye markovskie protsessy i ikh prilozheniya). Moskva: "Nauka", 1975.
  982. R.G. Dyson. Minimax solutions to stochastic programs - an aid to planning under uncertainty. J. Oper. Res. Soc. 29, 691-696, 1978.
  983. Jr. Eberl, W. and O. Moeschlin. On measurability in stochastic programming. In Probability and statistical decision theory, Vol. A (Bad Tatzmannsdorf, 1983), pages 97-105, Dordrecht, 1985. Reidel.
  984. David Edelman. On the financial value of information. Ann. Oper Res., 100:123-132 (2001), 2000. Research in stochastic programming (Vancouver, BC, 1998).
  985. Chanaka Edirisinghe, Derek Atkins, and Paul Iyogun. Bounds on stochastic convex allocation problems. Appl. Stochastic Models Data Anal., 10(2):123-140, 1994.
  986. N. C. P. Edirisinghe. Bound-based approximations in multistage stochastic programming: nonanticipativity aggregation. Ann. Oper. Res., 85:103-127, 1999. Stochastic programming. State of the art, 1998 (Vancouver, BC).
  987. N. C. P. Edirisinghe, E. I. Patterson, and N. Saadouli. Capacity planning model for a multipurpose water reservoir with target-priority operation. Ann. Oper. Res., 100:273-303 (2001), 2000. Research in stochastic programming (Vancouver, BC, 1998).
  988. N.C.P. Edirisinghe and G.-M. You. Second-order scenario approximation and refinement in optimization under uncertainty. Ann. Oper. Res., 64:143-178, 1996. Stochastic programming, algorithms and models (Lillehammer, 1994).
  989. N.C.P. Edirisinghe and W.T. Ziemba. Tight bounds for stochastic convex programs. Oper. Res., 40(4):660-677, 1992.
  990. N.C.P. Edirisinghe and W.T. Ziemba. Bounding the expectation of a saddle function with application to stochastic programming. Math. Oper. Res., 19(2):314-340, 1994.
  991. N.C.P. Edirisinghe and W.T. Ziemba. Bounds for two-stage stochastic programs with fixed recourse. Math. Oper. Res., 19(2):292-313, 1994.
  992. N.C.P. Edirisinghe and W.T. Ziemba. Implementing bounds-based approximations in convex-concave two-stage stochastic programming. Math. Programming, 75(2, Ser. B):295-325, 1996. Approximation and computation in stochastic programming.
  993. Ivan Edissonov. The new ARSTI optimization method: adaptive random search with translating intervals. Amer. J. Math. Management Sci., 14(3-4):143-166, 1994.
  994. J. Edwards. A proposed standard input format for computer codes which solve stochastic programs with recourse. In Numerical techniques for stochastic optimization, volume 10 of Springer Ser. Comput. Math., pages 215-227. Springer, Berlin, 1988.
  995. V.M. Efimov. A stochastic model of long term planning. In Theory of optimal solutions (Proc. Sem., Kiev, 1969), No. 3 (Russian), pages 36-45, Kiev, 1969. Akad. Nauk Ukrain. SSR.
  996. V.M. Efimov. Untersuchung stochastischer Extremalprobleme mittels der Funktionalanalysis. Kibernetika, Kiev 1970, No.3, 63-68, 1970.
  997. Pavlos S. Efraimidis and Paul G. Spirakis. Combinatorial randomized rounding: boosting randomized rounding with combinatorial arguments. In Stochastic optimization: algorithms and applications (Gainesville, FL, 2000), pages 31-53. Kluwer Acad. Publ., Dordrecht, 2001.
  998. V. A. Efremov. A numerical algorithm for solving a bilinear problem of quantile optimization.
  999. Jan Ehrhoff, Sven Grothklags, and Ulf Lorenz. Disruption Management and Planning with Uncertainties in Aircraft Planning. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  1000. Andreas Eichhorn and Werner Römisch. Polyhedral risk measures in stochastic programming. Stochastic Programming E-Print Series, http://www.speps.org, 2004.
  1001. Andreas Eichhorn and Werner Römisch. Polyhedral risk measures in stochastic programming. SIAM J. Optim., 16(1):69-95 (electronic), 2005.
  1002. Andreas Eichhorn and Werner Römisch. Stochastic integer programming. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  1003. Andreas Eichhorn and Werner Römisch. Stability of multistage stochastic programs incorporating polyhedral risk measures. Stochastic Programming E-Print Series, http://www.speps.org, 2006.
  1004. Andreas Eichhorn and Werner Römisch. Stochastic integer programming: limit theorems and confidence intervals. Math. Oper. Res., 32(1):118-135, 2007.
  1005. Andreas Eichhorn, Werner Römisch, and Isabel Wegner. Polyhedral Risk Measures and Lagrangian Relaxation in Electricity Portfolio Optimization. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  1006. Mark J. Eisner, Robert S. Kaplan, and John V. Soden. Admissible decision rules for the E-model of chance-constrained programming. Management Sci., Theory 17, 337-353, 1971.
  1007. Mark J. Eisner and Paul Olsen. Duality for stochastic programming interpreted as L. P. in Lp space. SIAM J. appl. Math. 28, 779-792, 1975.
  1008. Mark J. Eisner and Paul Olsen. Duality in probabilistic programming. In Stochastic programming (Proc. Internat. Conf., Univ. Oxford, Oxford, 1974), pages 147-158, London, 1980. Academic Press.
  1009. Abou-Zaid H. El-Banna and Ebrahim A. Youness. On stability of stochastic multiobjective programming problems with random coefficients in the objective functions. Matematiche (Catania), 49(1):3-9 (1995), 1994.
  1010. M.C. El Bouamri. Minimisation en cascade des programmes convexes à temps discret et à contrainte convexe non-anticipative. Travaux Sém. Anal. Convexe, 12(2):exp. no. 14, 23, 1982.
  1011. M. El-Sayed Wahed. Neural network representation of stochastic quadratic programming problems when b\sb i's and c\sb j's follow goint distribution. J. Inst. Math. Comput. Sci. Comput. Sci. Ser., 15(2):263-276, 2004.
  1012. D.F. Elliott and D.D. Sworder. A variable metric technique for parameter optimization. Automatica-J. IFAC, 5:811-816, 1969.
  1013. R.S. Ellis and R.W. Rishel. An application of stochastic optimal control theory to the optimal rescheduling of airplanes. IEEE Trans. Automatic Control, AC-19:139-142, 1974.
  1014. Paul M. Ellner and Robert M. Stark. On the distribution of the optimal value for a class of stochastic geometric programs. Naval Res. Logist. Quart., 27(4):549-571, 1980.
  1015. E.A. Elsayed and Mohammed Ettouney. Perturbation analysis of linear programming problems with random parameters. Comput. Oper. Res. 21, No.2, 211-224, 1994.
  1016. K. H. Elster and R. Elster. Optimization of c-orthogonal posynomials. Acta Math. Vietnam., 22(1):71-105, 1997.
  1017. V.A. Emelicev and A.M. Kononenko. The number of plans for a multi-index selection problem. Dokl. Akad. Nauk BSSR, 18:677-680, 763, 1974.
  1018. A.K. Enaleev and D.A. Novikov. Optimal stimulation mechanisms in an active system with probabilistic uncertainty. I. Avtomat. i Telemekh., 9:117-126, 1995.
  1019. Sebastian Engell, Andreas Märkert, Guido Sand, Rüdiger Schultz, and Christian Schulz. Online scheduling of multiproduct batch plants under uncertainty. In Online optimization of large scale systems, pages 649-676. Springer, Berlin, 2001.
  1020. Heinz W. Engl. Existence of measurable optima in stochastic nonlinear programming and control. Appl. Math. Optimization 5, 271-281, 1979.
  1021. Katherine Bennett Ensor and Peter W. Glynn. Stochastic optimization via grid search. In Mathematics of stochastic manufacturing systems (Williamsburg, VA, 1996), volume 33 of Lectures in Appl. Math., pages 89-100, Providence, RI, 1997. Amer. Math. Soc.
  1022. Robert Entriken. Language constructs for modeling stochastic linear programs. Ann. Oper Res., 104:49-66 (2002), 2001. Modeling languages and systems.
  1023. Leah Epstein and Asaf Levin. Tracking mobile users. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  1024. Leah Epstein and Rob van Stee. Online scheduling of splittable tasks. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  1025. E. Erdogan and G. Iyengar. Ambiguous chance constrained problems and robust optimization. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  1026. E. Erdogan and G. Iyengar. Ambiguous chance constrained problems and robust optimization. Math. Program., 107(1-2, Ser. B):37-61, 2006.
  1027. E. Erdogan and G. Iyengar. On two-stage convex chance constrained problems. Stochastic Programming E-Print Series, http://www.speps.org, 2006.
  1028. I.I. Eremin and Vl.D. Mazurov. Nonstationary processes for mathematical programming problems under the conditions of poorly formalized constraints and incomplete defining information. In Optim. Techn., IFIP techn. Conf. Novosibirsk 1974, Lect. Notes Comput. Sci. 27, 37-41, 1975.
  1029. I.I. Erëmin and A.A. Vatolin. Duality in improper mathematical programming problems under uncertainty. In Stochastic optimization (Kiev, 1984), volume 81 of Lecture Notes in Control and Inform. Sci., pages 326-333. Springer, Berlin, 1986.
  1030. Horst Erfurth and Claus Bendzulla. Die numerische Loesung eines speziellen Systems 1. Ordnung mit verteilten Parametern. (Numerical solution of a special first-order system with distributed parameters). Wiss. Z. Tech. Hochschule Chemie Carl Schorlemmer Leuna-Merseburg 13, 364- 367, 1971.
  1031. S.M. Ermakov and A.A. Zhiglyavskij. On a random search of a global extremum. Teor. Veroyatn. Primen. 28, No.1, 129-134, 1983.
  1032. S.M. Ermakov and A.A. Zhiglyavskij. On random search for a global extremum. Theory Probab. Appl. 28, 136-141, 1984.
  1033. S.M. Ermakov, A.A. Zhiglyavskij, and V.N. Solntsev. On a random search scheme for the extremum of functions. In Monte Carlo methods in numerical mathematics and mathematical physics, Pap. VI. All-Union Conf., April 1979, Part 1, Novosibirsk 1979, 17-24 , 1979.
  1034. O.V. Ermolenko. The solution of two-stage stochastic problems with nonconvex functions. Kibernetika (Kiev), 3:100-102, 1976.
  1035. Ju. M. Ermol'ev. Conditions for optimality in stochastic programming problems. In Theory of optimal solutions (Proc. Sem., Kiev, 1969), No. 1 (Russian), pages 36-44, Kiev, 1969. Akad. Nauk Ukrain. SSR.
  1036. Ju. M. Ermol'ev. The method of generalized stochastic gradients and stochastic quasi-Fejér sequences. Kibernetika (Kiev), 2:73-83, 1969.
  1037. Ju. M. Ermol'ev. A certain general problem of stochastic programming. Kibernetika (Kiev), 3:47-50, 1971.
  1038. Ju. M. Ermol'ev. The convergence of random quasi-Féjer sequences. Kibernetika (Kiev), 4:70-71, 1971.
  1039. Ju. M. Ermol'ev. A method of generalized stochastic gradients, and its applications. In Proceedings of the Fourth All-Union Conference on Automatic Control-Engineering Cybernetics (Tbilisi, 1968), Vol. 1: Optimal and adaptive systems (Russian), pages 230-236, 310. Izdat. "Nauka", Moscow, 1972.
  1040. Ju. M. Ermol'ev. Stochastic models, and optimization methods. Kibernetika (Kiev), 4:109-119, 1975.
  1041. Ju. M. Ermol'ev and A.M. Gupal. An analogue of the linearization method in problems of the minimization of nondifferentiable functions. Kibernetika (Kiev), 1:65-68, 1978.
  1042. Ju. M. Ermol'ev and A.I. Jastremskii. Stokhasticheskie modeli i metody v èkonomicheskom planirovanii. "Nauka", Moscow, 1979. Èkonomiko-Matematicheskaya Biblioteka. [Mathematical Economics Library].
  1043. Ju. M. Ermol'ev and Ju. M. Kaniovskii. Asymptotic properties of some stochastic programming methods with constant step. Zh. Vychisl. Mat. i Mat. Fiz., 19(2):356-366, 556, 1979.
  1044. Ju. M. Ermol'ev and T.P. Mar'janovic. Optimization and simulation. Problemy Kibernet., 27:111-125, 294, 1973. A collection consisting mainly of papers presented at the Second All-Union Conference on Problems of Theoretical Cybernetics (Novosibirsk, 1971).
  1045. Ju. M. Ermol'ev and I.M. Mel'nik. Stochastic programming methods with a finite number of tests. Kibernetika (Kiev), 4:52-54, 1974.
  1046. Ju. M. Ermol'ev and F. Mirzoahmedov. Direct methods of stochastic programming in problems of inventory planning. Kibernetika (Kiev), 6:74-81, 1976.
  1047. Ju. M. Ermol'ev and E.A. Nurminskii. Extremal problems of statistics, and numerical methods for stochastic programming. In Certain questions on simulation and systems control (Russian), pages 31-52. Izdat. "Naukova Dumka", Kiev, 1973.
  1048. Ju. M. Ermol'ev and N.Z. Sor. A method of random search for a two step problem of stochastic programming and its generalization. Kibernetika (Kiev), 1:90-92, 1968.
  1049. Ju. M. Ermol'ev and A.D. Tuniev. Direct methods of solution of certain problems of stochastic programming. Kibernetika (Kiev), 4:100-102, 1968.
  1050. Ju. M. Ermol'ev and P.I. Vercenko. The linearization method in limit extremal problems. Kibernetika (Kiev), 2:65-69, 1976.
  1051. Ju.M. Ermol'ev. Ueber einige Probleme der stochastischen Programmierung. Kibernetika, Kiev 1970, No.1, 1-5, 1970.
  1052. Ju.M. Ermol'ev. Ueber ein allgemeines Problem der stochastischen Programmierung. Kibernetika, Kiev 1971, Nr. 3, 47-50, 1971.
  1053. Ju.M. Ermol'ev. Stochastische Modelle und Optimierungsmethoden. Kibernetika, Kiev 1975, Nr. 4, 109-119, 1975.
  1054. Ju.M. Ermol'ev and T.P. Mar'janovic. Optimierung und Modellierung. Probl. Kibernetiki 27, 111-125, 1973.
  1055. Ju.M. Ermol'ev and I.M. Mel'nik. Ueber Methoden der stochastischen Programmierung mit einer endlichen Zahl von Proben. Kibernetika, Kiev 1974, Nr. 4, 52-54, 1974.
  1056. Ju.M. Ermol'ev and F. Mirzoahmedov. Direkte Methoden der stochastischen Programmierung in Problemen der Vorratsplanung. Kibernetika, Kiev 1976, No.6, 74-81, 1976.
  1057. Ju.M. Ermol'ev and A.D. Tuniev. Random Fejer and quasi-Fejer sequences. Select. Translat. math. Statist. Probab. 13, 143-148, 1973.
  1058. Yu. M. Ermol'ev. The stochastic quasigradient methods and their application to the stochastic programming problems with nonsmooth functions. In Survey of mathematical programming (Proc. Ninth Internat. Math. Programming Sympos., Budapest, 1976), Vol. 2, pages 107-115, Amsterdam, 1979. North-Holland.
  1059. Yu. M. Ermol'ev and A.A. Gaivoronskii. Stochastic methods for solving minimax problems. Cybernetics, 19(4):550-559 (1984), 1983.
  1060. Yu. M. Ermol'ev and Ts. Kh. Nedeva. Questions of the stability of the solution of stochastic programming problems. In Methods of investigation of extremal problems, pages 29-34, 120, Kiev, 1981. Akad. Nauk Ukrain. SSR Inst. Kibernet.
  1061. Yu. M. Ermol¢ev and V. I. Norkin. On the nonstationary law of large numbers for dependent random variables and its application to stochastic optimization. Kibernet. Sistem. Anal., (4):94-106, 190, 1998.
  1062. Yu. M. Ermol¢ev and V. I. Norkin. The stochastic generalized gradient method for solving nonconvex nonsmooth problems of stochastic optimization. Kibernet. Sistem. Anal., (2):50-71, 187, 1998.
  1063. Yu.M. Ermol'ev. Methods of stochastic programming. (Metody stokhasticheskogo programmirovaniya). Optimizatsiya i Issledovanie Operatsij. Moskva: Izdatel'stvo "Nauka", Glavnaya Redaktsiya Fiziko-Matematicheskoj Literatury., 1976.
  1064. Yu.M. Ermol'ev and Yu.M. Kaniovskij. Asymptotische Eigenschaften gewisser Methoden der stochastischen Programmierung mit konstantem Schritt. Zh. Vychisl. Mat. Mat. Fiz. 19, 356-366, 1979.
  1065. Yu.M. Ermol'ev and I.N. Kovalenko, editors. Mathematical methods in operations research and reliability theory. (Matematicheskie methody issledovaniya operatsij i teorii nadezhnosti). Kiev: Institut Kibernetiki AN USSR., 1978.
  1066. Yu.M. Ermol'ev, I.I. Lyashko, V.S. Mikhalevich, and V.I. Tyuptya. Mathematical methods in the investigation of operations. Textbook for universities. (Matematicheskie metody issledovaniya operatsij. Uchebnoe posobie dlya vuzov.). Kiev: Izdatel'skoe Ob'edinenie "Vishcha Shkola"., 1979.
  1067. Yu.M. Ermol'ev and Ts.Kh. Nedeva. Stability questions of the solution for problems of stochastic programming. In Investigation methods for extremal problems, Collect. Artic., Kiev 1981, 29-34, 1981.
  1068. Yu.M. Ermol'ev and A.I. Yastremskij. Stochastic models and methods in economic planning. (Stokhasticheskie modeli i metody v ehkonomicheskom planirovanii). Ehkonomiko-Matematicheskaya Biblioteka. Moskva: "Nauka"., 1979.
  1069. Ermol'ev, Yu. M. Metody stokhasticheskogo programmirovaniya. Izdat. "Nauka", Moscow, 1976. Optimizatsiyaa i Issledovanie Operatsii. [Monographs in Optimization and Operations Research].
  1070. T.Yu. Ermol'eva. Asymptotic behavior of regression estimators of stochastic processes with prior inequality constraints. Cybernetics 25, No.4, 525-530 translation from Kibernetika 1989, No.4, 86-89 (1989)., 1989.
  1071. Y. M. Ermoliev, T. Y. Ermolieva, G. J. MacDonald, and V. I. Norkin. Insurability of catastrophic risks: the stochastic optimization model. Optimization, 47(3-4):251-265, 2000. Numerical methods for stochastic optimization and real-time control of robots (Neubiberg/Munich, 1998).
  1072. Y. M. Ermoliev, T. Y. Ermolieva, G. J. MacDonald, and V. I. Norkin. Stochastic optimization of insurance portfolios for managing exposure to catastrophic risks. Ann. Oper Res., 99:207-225 (2001), 2000. Applied mathematical programming and modeling, IV (Limassol, 1998).
  1073. Y.M. Ermoliev. Aspects of optimization and adaptation. In Stochastic phenomena and chaotic behaviour in complex systems (Flattnitz, 1983), volume 21 of Springer Ser. Synergetics, pages 13-16. Springer, Berlin, 1984.
  1074. Y.M. Ermoliev and G. Leonardi. Some proposals for stochastic facility location models. Math. Modelling, 3(5):407-420, 1982.
  1075. Y.M. Ermoliev, V.I. Norkin, and R.J-B. Wets. The minimization of semicontinuous functions: mollifier subgradients. SIAM Journal on Control and Optimization, 33(1):149-167, 1995.
  1076. Yu. Ermoliev. Random optimization and stochastic programming. In Colloq. Methods Optim. Novosibirsk USSR 1968, Lecture Notes Math. 112, 104-115, 1970.
  1077. Yu. Ermoliev. Stochastic quasigradient methods. In Numerical techniques for stochastic optimization, volume 10 of Springer Ser. Comput. Math., pages 141-185. Springer, Berlin, 1988.
  1078. Yu. Ermoliev, A. Gaivoronski, and C. Nedeva. Stochastic optimization problems with incomplete information on distribution functions. SIAM J. Control Optim., 23(5):697-716, 1985.
  1079. Yu. Ermoliev, S. Uryasev, and J. Wessels. On optimization of unreliable material flow systems. In Probabilistic constrained optimization, volume 49 of Nonconvex Optim. Appl., pages 45-66. Kluwer Acad. Publ., Dordrecht, 2000.
  1080. Yu. Ermoliev and R. Wets. Stochastic programming, an introduction. In Numerical techniques for stochastic optimization, volume 10 of Springer Ser. Comput. Math., pages 1-32. Springer, Berlin, 1988.
  1081. Yu. Ermoliev and R.J-B. Wets. Numerical Techniques for Stochastic Optimization. Springer-Verlag, Berlin etc., 1988.
  1082. Yu. M. Ermoliev. Methods of nondifferentiable and stochastic optimization and their applications. In Progress in nondifferentiable optimization, volume 8 of IIASA Collaborative Proc. Ser. CP-82, pages 5-27, Laxenburg, 1982. Internat. Inst. Appl. Systems Anal.
  1083. Yuri Ermoliev. Stochastic quasigradient methods and their application to system optimization. Stochastics, 9(1-2):1-36, 1983.
  1084. Yuri Ermoliev and Vladimir Norkin. On constrained discontinuous optimization. In Stochastic programming methods and technical applications (Neubiberg/Munich, 1996), pages 128-144. Springer, Berlin, 1998.
  1085. Yuri Ermoliev and Vladimir Norkin. Stochastic optimization of risk functions via parametric smoothing. In Dynamic stochastic optimization (Laxenburg, 2002), volume 532 of Lecture Notes in Econom. and Math. Systems, pages 225-247. Springer, Berlin, 2004.
  1086. Yuri M. Ermoliev and Vladimir I. Norkin. Normalized convergence in stochastic optimization. Ann. Oper. Res., 30(1-4):187-198, 1991. Stochastic programming, Part I (Ann Arbor, MI, 1989).
  1087. Yury M. Ermoliev and Alexei A. Gaivoronski. Stochastic quasigradient methods for optimization of discrete event systems. Ann. Oper. Res., 39(1-4):1-39 (1993), 1992.
  1088. Yu. M. Ermoljev and E.A. Nurminskiy. Stochastic quasigradient algorithms for minimax problems in stochastic programming. In Stochastic programming (Proc. Internat. Conf., Univ. Oxford, Oxford, 1974), pages 275-285. Academic Press, London, 1980.
  1089. A.N. Ermolov. Revelation of preferences in a Bayesian game-theoretic model of social choice. Dokl. Akad. Nauk, 333(3):293-296, 1993.
  1090. G. Escher. Sequentielle Zuordnungsprobleme. In Sechste Oberwolfach-Tagung über Operations Research (1973), Teil II, pages 1-13. Operations Research Verfahren, Band XIX, Hain, Miesenheim am Glan, 1974.
  1091. L. F. Escudero, C. Garcia, J. L. de la Fuente, and F. J. Prieto. Hydropower generation management under uncertainty via scenario analysis and parallel computation. IEEE Transactions on Power Systems, 11(2):683-689, 1996.
  1092. L. F. Escudero, A. Garín, M. Merino, and G. Pérez. A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes. Ann. Oper. Res., 152:395-420, 2007.
  1093. L. F. Escudero, I. Paradinas, and F. J. Prieto. Generation expansion planning under uncertainty in demand, economic environment, generation availability and book life. In Proceedings of the IEEE Stockholm Power Tech, pages 226-233, Stockholm, Sweden, 1995.
  1094. L. F. Escudero, F. J. Quintana, and J. Salmeron. CORO, a modeling and an algorithmic framework for oil supply, transformation and distribution optimization under uncertainty. European Journal of Operational Research, 114(3):638-656, 1999.
  1095. L. F. Escudero, J. Salmeron, I. Paradinas, and M. Sanchez. SEGEM: A simulation approach for electric generation management. IEEE Transactions on Power Systems, 13(3):738-748, 1998.
  1096. Laureano F. Escudero, Araceli Garín, María Merino, and Gloria Pérez. The value of the stochastic solution in multistage problems. TOP, 15(1):48-64, 2007.
  1097. Laureano F. Escudero, Pasumarti V. Kamesam, Alan J. King, and Roger J.-B. Wets. Production planning via scenario modelling. Ann. Oper. Res., 43(1-4):311-335, 1993. Applied mathematical programming and modelling (Uxbridge, 1991).
  1098. L.F. Escudero and P.V. Kamesam. On solving stochastic production planning problems via scenario modelling. Top, 3(1):69-95, 1995.
  1099. Augustine O. Esogbue and Amar J. Singh. A stochastic model for an optimal priority bed distribution problem in a hospital ward. Operations Res. 24, 884-898, 1976.
  1100. Juan Estalrich and Nathan Buras. Alternative specifications of state variables in stochastic-dynamic-programming models of reservoir operation. Appl. Math. Comput., 44(2, part II):143-155, 1991.
  1101. Alexander Ettinger and Peter L. Hammer. Pseudo-Boolean programming with random coefficients. Cahiers Centre Études Recherche Opér., 14:67-82, 1972.
  1102. R. Everitt and W.T. Ziemba. Two-period stochastic programs with simple recourse. Oper. Res., 27(3):485-502, 1979.
  1103. A. Evgrafov and M. Patriksson. On the existence of solutions to stochastic mathematical programs with equilibrium constraints. J. Optim. Theory Appl., 121(1):65-76, 2004.
  1104. I. V. Evstigneev and M. I. Taksar. Convex stochastic optimization for random fields on graphs: a method of constructing Lagrange multipliers. Math. Methods Oper. Res., 54(2):217-237, 2001.
  1105. Igor V. Evstigneev and Sjur D. Flåm. Convex stochastic duality and the "biting lemma". J. Convex Anal., 9(1):237-244, 2002.
  1106. Igor V. Evstigneev and Priscilla E. Greenwood. Stochastic extrema, splitting random elements and models of crack formation. In System modelling and optimization (Compiègne, 1993), volume 197 of Lecture Notes in Control and Inform. Sci., pages 315-319. Springer, London, 1994.
  1107. I.V. Evstigneev. Optimal stochastic programs and their stimulating prices. In Math. Models Econ., Proc. Sympos. math. Meth. Econ. and Conf. von Neumann Models, Warszawa 1972, 219-252, 1974.
  1108. I.V. Evstigneev. Lagrange multipliers for the problems of stochastic programming. In Warsaw Fall Semin. math. Econ. 1975, Lect. Notes Econ. math. Syst. 133, 34-48, 1976.
  1109. I.V. Evstigneev. Measurable selection and dynamic programming. Math. Oper. Res. 1, 267-272, 1976.
  1110. I.V. Evstigneev. Turnpike theorems in stochastic models of economic dynamics. Mat. Zametki (Math. Notes) (translated into English), v.19, n.2, 279-290, 1976.
  1111. I.V. Evstigneev. Homogeneous convex models in the theory of controlled random processes. Doklady AN SSSR (Soviet Math. Dokl.) (translated into English), v.253, n.3, 524-527, 1980.
  1112. I.V. Evstigneev. Measurable selection theorems and stochastic control models in general topological spaces. Mat. Sbornik (Math. USSR Sbornik) (translated into English), v.131, n.1, 27-39, 1986.
  1113. I.V. Evstigneev. Controlled random fields on a directed graph. Teor. Ver. i Primen. (Theory of Probab. and Appl.) (translated into English), v.33, n.3, 465-479, 1988.
  1114. I.V. Evstigneev. Stochastic extremal problems and the strong Markov property of random fields. Uspekhi Matem. Nauk (Russian Math. Surveys) (translated into English), vol. 43, nr. 2, 3-41, 1988.
  1115. I.V. Evstigneev. The shortest path around an island outside the shallows. Markov Processes and Related Fields, v.1, 407-418, 1995.
  1116. I.V. Evstigneev and V.I. Arkin. Stochastic models of control and economic dynamics. Academic Press, London, 1987.
  1117. I.V. Evstigneev and S.D. Flaam. The turnpike property and the central limit theorem in stochastic models of economic dynamics. In Yu.M. Kabanov, B.L. Rozovskii, and A.N. Shiryaev, editors, Statistics and Control of Stochastic Processes, pages 63-101. World Scientific, Singapore - New Jersey - London, 1997.
  1118. I.V. Evstigneev and P.E. Greenwood. Markov fields over countable partially ordered sets: Extrema and splitting. Memoirs of Amer. Math. Soc., v. 112 (537), 1994.
  1119. I.V. Evstigneev and M.I. Taksar. Stochastic equilibria on graphs, I. Journal of Math. Economics, v. 23, 401-433, 1994.
  1120. I.V. Evstigneev and M.I. Taksar. Stochastic equilibria on graphs, II. Journal of Math. Economics, v. 24, 383-406, 1995.
  1121. James B. Ewbank, Bob L. Foote, and Hillel J. Kumin. A method for the solution of the distribution problem of stochastic linear programming. SIAM J. Appl. Math., 26:225-238, 1974.
  1122. Eweda Eweda and Odile Macchi. Convergence of an adaptive linear estimation algorithm. IEEE Trans. Autom. Control AC-29, 119-127, 1984.
  1123. ¯I. ¯I. ¯Ezov and Hoang Sum. Maximization processes with discrete time. Teor. Verojatnost. i Mat. Statist., 9:82-89, 175, 1973.
  1124. B. A. Faber and J. R. Stedinger. Reservoir optimization using sampling sdp with ensemble streamflow prediction (esp) forecasts. Journal of Hydrology, 249(1-4):113-133, 2001.
  1125. Malte Michael Faber. Stochastisches Programmieren. Wuerzburg-Wien: Physica-Verlag., 1970.
  1126. C. Fabian and M. Stoica. Fuzzy integer programming. In Fuzzy sets and decision analysis, TIMS Stud. Manage. Sci. 20, 123-131 , 1984.
  1127. Csaba I. Fábián. Adapting an approximate level method to the two-stage stochastic programming problem. Stochastic Programming E-Print Series, http://www.speps.org, 2001.
  1128. Csaba I. Fabian. Decomposing cvar minimization in two-stage stochastic models. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  1129. Csaba I. Fábián, Richárd Némedi, and Zoltán Szöke. A stochastic programming model for optical fiber manufacturing. CEJOR Cent. Eur. J. Oper. Res., 9(4):343-359, 2001.
  1130. Csaba I. Fábián, András Prékopa, and Olga Ruf-Fiedler. On a dual method for a specially structured linear programming problem with application to stochastic programming. Optim. Methods Softw., 17(3):445-492, 2002. Stochastic programming.
  1131. Csaba I. Fabian and Anna Veszpremi. Algorithms for handling cvar-constraints in dynamic stochastic programming models with applications to finance. Stochastic Programming E-Print Series, http://www.speps.org, 2007.
  1132. V. Fabian. Simulated annealing simulated. Comput. Math. Appl., 33(1-2):81-94, 1997. Approximation theory and applications.
  1133. Vaclav Fabian. A local asymptotic minimax optimality of an adaptive Robbins-Monro stochastic approximation procedure. In Mathematical learning models - theory and algorithms, Proc. Conf., Bad Honnef/Ger. 1982, Lect. Notes Stat. 20, 43-49, 1983.
  1134. Ulrich Faigle and Alexander Schoenhuth. Note on Negative Probabilities and Observable Processes. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  1135. Ulrich Faigle and Rainer Schrader. On the convergence of stationary distributions in simulated annealing algorithms. Inf. Process. Lett. 27, No.4, 189-194, 1988.
  1136. Shu-Kai S. Fan and Erwie Zahara. Stochastic response surface optimization via an enhanced Nelder-Mead simplex search procedure. Eng. Optim., 38(1):15-36, 2006.
  1137. Yu Bin Fan. The Bayesian statistical method for estimating the OD trip matrix from link volumes. Tongji Daxue Xuebao Ziran Kexue Ban, 19(2):227-233, 1991.
  1138. Zhen Fan. Stochastic programming model with CVaR-recourse criterion for credit portfolio optimization. Comm. Appl. Math. Comput., 20(1):56-62, 2006.
  1139. G. Fandel and J. Wilhelm. Rational solution principles and information requirements as elements of a theory of multiple criteria decision making. With a comment by P. Hansen. In Multiple Criteria Decis. Making, Proc. Conf. Jouy-en-Josas 1975, Lect. Notes Econ. Math. Syst. 130, 215-231, 1976.
  1140. H. T. Fang and H. F. Chen. Almost surely convergent global optimization algorithm using noise-corrupted observations. J. Optim. Theory Appl., 104(2):343-376, 2000.
  1141. Kai-Tai Fang, Dietmar Maringer, Yu Tang, and Peter Winker. Lower bounds and stochastic optimization algorithms for uniform designs with three or four levels. Math. Comp., 75(254):859-878 (electronic), 2006.
  1142. Kai Tai Fang and Yuan Wang. A sequential algorithm for optimization and its applications to regression analysis. In Lecture notes in contemporary mathematics, 1989, pages 17-28. Science Press, Beijing, 1990.
  1143. S.C. Fang and J.R. Rajasekera. Quadratically constrained minimum cross-entropy analysis. Math. Programming, 44(1 (Ser. A)):85-96, 1989.
  1144. Weiwu Fang. On a global optimization problem in the study of information discrepancy. J. Global Optim., 11(4):387-408, 1997.
  1145. Dan D. Farcas. On decomposability of some random automata with rewards. Stud. Cercet. Mat. 34, 9-18, 1982.
  1146. Yahya Fathi. SQVAM: a variance minimizing algorithm. Oper. Res. Lett., 10(8):461-466, 1991.
  1147. Gino Favero. Shortfall risk minimization under model uncertainty in the binomial case: adaptive and robust approaches. Math. Methods Oper. Res., 53(3):493-503, 2001.
  1148. I.K. Fedorenko and V.I. Rymaruk. Some approaches to solving stochastic allocation problems. Issled. Operatsii i ASU, 26:3-6, 116, 1985.
  1149. V.V. Fedorov. Stochastic decomposition in extremal problems. Vestnik Moskov. Univ. Ser. XV Vychisl. Mat. Kibernet., 1:52-57, 73, 1980.
  1150. A.N. Fedotov. An algorithm for the solution of a class of problems of stochastic programming. In Dynamics of non-homogeneous systems, Mater. Semin., Moskva 1983, 130-140 , 1983.
  1151. A.V. Fedotov. An algorithm for the solution of M-problems of stochastic programming. In Methods of the investigation of complex systems, Proc. Conf., Moskva 1985, 30-35, 1985.
  1152. Sergei Fedotov and Sergei Mikhailov. Option pricing for incomplete markets via stochastic optimization: transaction costs, adaptive control and forecast. Int. J. Theor. Appl. Finance, 4(1):179-195, 2001.
  1153. A.A. Fedulov, Yu.G. Fedulov, and V.N. Tsygichko. Introduction to the theory of statistically non-reliable solutions. (Vvedenie v teoriyu statisticheski nenadezhnykh reshenij). Moskva: "Statistika"., 1979.
  1154. E.A. Feinberg. Parametric stochastic dynamic programming. In Statistics and control of stochastic processes. Vol. 2, Pap. Steklov Semin., Moscow/USSR 1985-86, Transl. Ser. Math. Eng., 103-120, 1989.
  1155. Eugene A. Feinberg and Adam Shwartz, editors. Handbook of Markov decision processes, volume 40 of International Series in Operations Research & Management Science. Kluwer Academic Publishers, Boston, MA, 2002. Methods and applications.
  1156. B. R. Feiring, T. Sastri, and L. S. M. Sim. A stochastic programming model for water resource planning. Mathematical and Computer Modelling, 27(3):1-7, 1998.
  1157. L.I. Fejgin. Ein Zuordnungsproblem bei unvollstaendiger Information ueber die Gestehungskosten von Operationen. Izv. Akad. Nauk SSSR, Tekh. Kibern. 1970, No.6, 33-40, 1970.
  1158. Sándor Fekete, Rolf Klein, and Andreas Nüchter. Searching with an Autonomous Robot. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  1159. Paul Feldman and Silvio Micali. An optimal probabilistic algorithm for synchronous Byzantine agreement. In Automata, languages and programming, Proc. 16th Int. Colloq., Stresa/Italy 1989, Lect. Notes Comput. Sci. 372, 341-378, 1989.
  1160. M. Fels, D.S. Lycon, D.J. Meeuwig, J.W. Meeuwig, and J.D. Pinter. An intelligent decision support system for assisting industrial wastewater management. Annals of Operations Research, 58:455-477, 1995.
  1161. En Min Feng, Guang Yan Shi, Gui Qing Gao, and Huan Wen Tan. Application of stochastic programming in the design and management of a special purpose wharf. Math. Practice Theory, 1:9-14, 1984.
  1162. Yingjun Feng and Xuefeng Wang. Fuzzy convex programming. Fuzzy Math. 7, No.3/4, 23-26, 1987.
  1163. Afonso G. Ferreira and Janez Zerovnik. Bounding the probability of success of stochastic methods for global optimization. Comput. Math. Appl., 25(10-11):1-8, 1993.
  1164. Michael C. Ferris and Andrzej Ruszczy\'nski. Robust path choice in networks with failures. Networks, 35(3):181-194, 2000.
  1165. Miroslav Fiedler. Doubly stochastic matrices and optimization. In Advances in mathematical optimization, Pap. Dedic. F. Nozicka Occas. 70. Birthday, Math. Res. 45, 44-51, 1988.
  1166. Olga Fiedler and Werner Römisch. Stability in multistage stochastic programming. Ann. Oper. Res., 56:79-93, 1995. Stochastic programming (Udine, 1992).
  1167. S. Filippi and S. Czakay. Ein modifiziertes Hooke-Jeeves-Verfahren und ein modifiziertes Choit- Schrack-Verfahren zur nichtlinearen Optimierung. Math. Operationsforsch. Stat., Ser. Optimization 13, 419-429, 1982.
  1168. Financial optimization. Physica-Verlag, Heidelberg, 1999. Math. Methods Oper. Res. 50 (1999), no. 2.
  1169. Ulrich Fincke and Horst W. Hamacher. On the expected value of stochastic linear programs and (dynamic) network flow problems. European J. Oper. Res., 29(3):307-316, 1987.
  1170. Charles H. Fine and Robert M. Freund. Optimal investment in product-flexible manufacturing capacity. Manage. Sci. 36, No.4, 449-466, 1990.
  1171. P. Fischer and E.R. Swart. Three-dimensional line stochastic matrices and extreme points. Linear Algebra Appl., 69:179-203, 1985.
  1172. I.H. Fisher. Derivation of optimal stocking policies for grazing in arid regions. I. Methodology. Appl. Math. Comput. 17, 1-35, 1985.
  1173. George S. Fishman and David S. Rubin. Bounding the variance in Monte Carlo experiments. Oper. Res. Lett., 11(4):243-248, 1992.
  1174. Sjur D. Flaam and Alberto Seeger. Solving cone-constrained convex programs by differential inclusions. Math. Program. 65A, No.1, 107-121, 1994.
  1175. S.D. Flåm. Nonanticipativity in stochastic programming. J. Optim. Theory Appl., 46(1):23-30, 1985.
  1176. S.D. Flam and J.D. Pinter. Selecting oil exploration strategies: Some stochastic programming formulations and solution methods. Research Report CMI 852611-1, Christian Michelsen Institute, Fantoft, Bergen, Norway, 1985.
  1177. S.D. Flåm and J. Zowe. Exact penalty functions in single-stage stochastic programming. Optimization, 21(5):723-734, 1990.
  1178. Sjur D. Flåm. Asymptotically stable solutions to stochastic optimization problems. In Stochastic programming (Gargnano, 1983), volume 76 of Lecture Notes in Control and Inform. Sci., pages 184-193. Springer, Berlin, 1986.
  1179. Sjur D. Flåm. Shadow prices in stochastic programming: their existence and significance. In Stochastic models and option values (Loen, 1989), volume 200 of Contrib. Econom. Anal., pages 227-240. North-Holland, Amsterdam, 1991.
  1180. Sjur D. Flam. Finite convergence in stochastic programming. In Stochastic optimization. Numerical methods and technical applications, Proc. GAMM/IFIP-Workshop, Neubiberg/Ger. 1990, Lect. Notes Econ. Math. Syst. 379, 1-14, 1992.
  1181. Sjur D. Flåm. Lagrange multipliers in stochastic programming. SIAM J. Control Optim., 30(1):1-10, 1992.
  1182. Sjur D. Flåm and Rüdiger Schultz. A new approach to stochastic linear programming. Numer. Funct. Anal. Optim., 14(5-6):545-554, 1993.
  1183. Sjur D. Flåm and Roger J.-B. Wets. Finite horizon approximates of infinite horizon stochastic programs. In Stochastic optimization (Kiev, 1984), volume 81 of Lecture Notes in Control and Inform. Sci., pages 339-350. Springer, Berlin, 1986.
  1184. Sjur Didrik Flåm. Corrigendum: "Lagrange multipliers in stochastic programming" [SIAM J. Control. Optim. 30 (1992), no. 1, 1-10; MR 93c:90051]. SIAM J. Control Optim., 33(2):667-671, 1995.
  1185. Sjur Didrik Flåm. Stochastic programming, cooperation, and risk exchange. Optim. Methods Softw., 17(3):493-504, 2002. Stochastic programming.
  1186. Sjur Didrik Flåm. Optimization under uncertainty using momentum. In Dynamic stochastic optimization (Laxenburg, 2002), volume 532 of Lecture Notes in Econom. and Math. Systems, pages 249-256. Springer, Berlin, 2004.
  1187. Lisa Fleischer, Jochen Könemann, Stefano Leonardi, and Guido Schäfer. Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. In STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pages 663-670, New York, 2006. ACM.
  1188. Stein-Erik Fleten, Kjetil Høyland, and Stein W. Wallace. The performance of stochastic dynamic and fixed mix portfolio models. European J. Oper. Res., 140(1):37-49, 2002.
  1189. Stein-Erik Fleten and Trine Krogh Kristoffersen. Short-term hydropower production planning by stochastic programming. Stochastic Programming E-Print Series, http://www.speps.org, 2006.
  1190. Stein-Erik Fleten and Trine Krogh Kristoffersen. Stochastic programming for optimizing bidding strategies of a nordic hydropower producer. Stochastic Programming E-Print Series, http://www.speps.org, 2006.
  1191. Stein-Erik Fleten and Snorre Lindset. Optimal hedging strategies for multi-period guarantees in the presence of transaction costs: A stochastic programming approach. Stochastic Programming E-Print Series, http://www.speps.org, 2006.
  1192. Stein-Erik Fleten and Erling Pettersen. Optimization of physical purchasing for a price-taking retailer in the norwegian electricity market. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  1193. Stein-Erik Fleten, Stein W. Wallace, and William T. Ziemba. Hedging electricity portfolios via stochastic programming. Stochastic Programming E-Print Series, http://www.speps.org, 1999.
  1194. Stein-Erik Fleten, Stein W. Wallace, and William T. Ziemba. Hedging electricity portfolios via stochastic programming. In Decision making under uncertainty, volume 128 of IMA Vol. Math. Appl., pages 71-93. Springer, New York, 2002.
  1195. C.J. Fodor and J.D. Pinter. Extreme order statistics applied for optimum estimation in 'hard' MP problems. In Transactions of the Tenth Prague Conference on Information Theory, Statistical Decision Functions, and Random Processes. (Prague, July, 1986), pages 321-328, Prague, 1988. Publishing House of the Czechoslovakian Academy of Sciences.
  1196. János C. Fodor and János Pintér. Extreme order statistics applied for optimum estimation in "hard" MP problems. In Transactions of the Tenth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes, Vol. A (Prague, 1986), pages 321-328. Reidel, Dordrecht, 1988.
  1197. Renato Fonso. On a stochastic transportation problem. In Proceedings of the First AMASES Meeting (Pisa, 1977) (Italian), pages 149-182, Turin, 1979. Giappichelli.
  1198. Renato Fonso. On the convergence of a feasible directions algorithm for optimization problems with linear constraints and strictly convex non-differentiable objective function. Riv. Mat. Sci. Econ. Soc. 5, 115-122, 1982.
  1199. B.L. Foote. A discussion of the properties of a basic simplex algorithm for generating the decision regions of Bereanu. In Stochastic programming (Proc. Internat. Conf., Univ. Oxford, Oxford, 1974), pages 207-222, London, 1980. Academic Press.
  1200. Jean-Pierre Forestier. Optimisation de la commande des systemes a representation semi- markovienne. In Mathematiques appliquees, 1er Colloq. AFCET-SMF, Palaiseau 1978, Tome I, 337-346, 1978.
  1201. O. B. Fosso, A. Gjelsvik, A. Haugstad, B. Mo, and I. Wangensteen. Generation scheduling in a deregulated system. The Norwegian case. IEEE Transactions on Power Systems, 14(1):75-80, 1999.
  1202. Robert Fourer and Leo Lopes. A management system for decompositions in stochastic programming. Ann. Oper. Res., 142:99-118, 2006.
  1203. Robert Fourer and Leo Lopes. StAMPL: A filtration-oriented modeling tool for stochastic programming. Optimization Online, http://www.optimization-online.org, 2006.
  1204. L. Fourgeaud and S. Fourgeaud. Critere de choix en avenir partiellement incertain. Rev. Franc. Inform. Rech. Oper. 2, No.14, 9-19, 1968.
  1205. E. Fragniere and A. Haurie. A stochastic programming model for energy/environment choices under uncertainty. International Journal of Environment and Pollution, 6(4-6):587-603, 1996. In Georghe, A. V. (ed), "Integrated Regional Health and Environmental Risk Assessment and Safety Management".
  1206. Emmanuel Fragnière and Jacek Gondzio. Stochastic programming from modeling languages. In Applications of stochastic programming, volume 5 of MPS/SIAM Ser. Optim., pages 95-113. SIAM, Philadelphia, PA, 2005.
  1207. Emmanuel Fragnière, Jacek Gondzio, and Jean-Philippe Vial. Building and solving large-scale stochastic programs on an affordable distributed computing system. Ann. Oper Res., 99:167-187 (2001), 2000. Applied mathematical programming and modeling, IV (Limassol, 1998).
  1208. P. M. Franca and H. P. L. Luna. Solving stochastic transportation-location problems by generalized Benders decomposition. Transportation Science, 16(2):113-126, 1982.
  1209. Linos F. Frantzeskakis and Warren B. Powell. A successive linear approximation procedure for stochastic, dynamic vehicle allocation problems. Transportation Sci., 24(1):40-57, 1990.
  1210. Linos F. Frantzeskakis and Warren B. Powell. Bounding procedures for multistage stochastic dynamic networks. Networks, 23(7):575-595, 1993.
  1211. Linos F. Frantzeskakis and Warren B. Powell. Restricted recourse strategies for bounding the expected network recourse function. Ann. Oper. Res., 64:261-287, 1996. Stochastic programming, algorithms and models (Lillehammer, 1994).
  1212. Astrid Franz and Karl Heinz Hoffmann. Optimal annealing schedules for a modified Tsallis statistics. J. Comput. Phys., 176(1):196-204, 2002.
  1213. K. Frauendorfer. Bounding the expectation of a function of a multivariate random variable-with application to stochastic programming. In XI symposium on operations research (Darmstadt, 1986), volume 57 of Methods Oper. Res., pages 13-23. Athenäum/Hain/Hanstein, Königstein/Ts., 1987.
  1214. K. Frauendorfer. Solving SLP recourse problems: the case of stochastic technology matrix, RHS & objective. In System modelling and optimization (Tokyo, 1987), volume 113 of Lecture Notes in Control and Inform. Sci., pages 90-100. Springer, Berlin, 1988.
  1215. K. Frauendorfer. Stochastic dynamic optimization: modelling and methodological aspects. In System modelling and optimization (Compiègne, 1993), volume 197 of Lecture Notes in Control and Inform. Sci., pages 332-341. Springer, London, 1994.
  1216. K. Frauendorfer and P. Kall. A solution method for SLP recourse problems with arbitrary multivariate distributions-the independent case. Problems Control Inform. Theory/Problemy Upravlen. Teor. Inform., 17(4):177-205, 1988.
  1217. K. Frauendorfer and Ch. Marohn. Refinement issues in stochastic multistage linear programming. In Stochastic programming methods and technical applications (Neubiberg/Munich, 1996), pages 305-328. Springer, Berlin, 1998.
  1218. Karl Frauendorfer. Solving SLP recourse problems with arbitrary multivariate distributions-the dependent case. Math. Oper. Res., 13(3):377-394, 1988.
  1219. Karl Frauendorfer. On the value of perfect information and approximate solutions in convex stochastic two-stage optimization. In System modelling and optimization (Zurich, 1991), volume 180 of Lecture Notes in Control and Inform. Sci., pages 564-573. Springer, Berlin, 1992.
  1220. Karl Frauendorfer. Stochastic two-stage programming, volume 392 of Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, Berlin, 1992. Habilitationsschrift, University of Zürich, Zürich, 1992.
  1221. Karl Frauendorfer. The approximation of separable stochastic programs. J. Comput. Appl. Math., 56(1-2):23-44, 1994. Stochastic programming: stability, numerical methods and applications (Gosen, 1992).
  1222. Karl Frauendorfer. Multistage stochastic programming: error analysis for the convex case. Z. Oper. Res., 39(1):93-122, 1994.
  1223. Karl Frauendorfer. Barycentric scenario trees in convex multistage stochastic programming. Math. Programming, 75(2, Ser. B):277-293, 1996. Approximation and computation in stochastic programming.
  1224. Karl Frauendorfer and Jens Güssow. Stochastic multistage programming in the operation and management of a power system. In Stochastic optimization techniques (Neubiberg/Munich, 2000), volume 513 of Lecture Notes in Econom. and Math. Systems, pages 199-222. Springer, Berlin, 2002.
  1225. Karl Frauendorfer and Gido Haarbrücker. Test problems in stochastic multistage programming. Optimization, 47(3-4):267-285, 2000. Numerical methods for stochastic optimization and real-time control of robots (Neubiberg/Munich, 1998).
  1226. Karl Frauendorfer and Michael Schürle. Term structure models in multistage stochastic programming: estimation and approximation. Ann. Oper Res., 100:189-209 (2001), 2000. Research in stochastic programming (Vancouver, BC, 1998).
  1227. James R. Freeland and Gerhard Schiefer. Using probabilistic information in solving resource allocation problems for a decentralized firm. Internat. J. Policy Anal. Inform. Systems, 5(4):325-340, 1981.
  1228. P. Freeman and A.E. Gear. A probabilistic objective function for R P D portfolio selection. Operat. Res. Quart. 22, 253-265, 1971.
  1229. Michael Freimer, Doug Thomas, and Jeff Linderoth. Reducing bias in stochastic linear programming with sampling methods. Optimization Online, http://www.optimization-online.org, 2005.
  1230. J.B.G. Frenk, A.H.G. Rinnooy Kan, and L. Stougie. A hierarchical scheduling problem with a well-solvable second stage. Annals of Operations Research, 1:43-58, 1984.
  1231. H. Frick. On the solution of the facility location problem when the dominance method fails. Z. Oper. Res., Ser. B 29, B101-B106, 1985.
  1232. Bozena Friedrich and Klaus Tammer. Untersuchungen zur Stabilität einiger Ersatzprobleme der stochastischen Optimierung in Bezug auf änderungen des zugrunde gelegten Zufallsvektors. Wiss. Z. Humboldt-Univ. Berlin Math.-Natur. Reihe, 30(5):373-376, 1981.
  1233. A.M. Frieze. An algorithm for finding Hamilton cycles in random directed graphs. J. Algorithms 9, No.2, 181-204, 1988.
  1234. Klaus Fritzsch. On the acceleration of adaptation processes by two-step principles. Kybernetika, Praha 13, 274-281, 1977.
  1235. D.D. Frolkin. A stochastic problem of planning storage and irrigation. Zh. Vychisl. Mat. i Mat. Fiz., 21(3):595-604, 810, 1981.
  1236. D.D. Frolkin. The solution of some stochastic two-stage problems. U.S.S.R. Comput. Math. Math. Phys. 24, No.3, 123-128 translation from Zh. Vychisl. Mat. Mat. Fiz. 24, No.6, 823-830 (1984)., 1984.
  1237. E. Frostig and I. Adiri. Stochastic flowshop no-wait scheduling. J. Appl. Probab. 22, 240-246, 1985.
  1238. Bor-Ruey Fu. Modeling and analysis of discrete tandem production lines using continuous flow models. Ph.D. Dissertation, Department of Industrial Engineering, University of Wisconsin-Madison, Madison, WI, 1996.
  1239. M.C. Fu. Convergence of a stochastic approximation algorithm for the GI/G/1 queue using infinitesimal perturbation analysis. J. Optimization Theory Appl. 65, No.1, 149-160, 1990.
  1240. M.C. Fu and S.D. Hill. Optimization of discrete event systems via simultaneous perturbation stochastic approximation. Transactions of the Institute of Industrial Engineers, 29:233-243, 1997.
  1241. Michael C. Fu. Optimization via simulation: a review. Ann. Oper. Res., 53:199-247, 1994. Simulation and modeling.
  1242. Toshiharu Fujita and Kazuyoshi Tsurusaki. Optimizing the expectation of negative multiplicative functions. S¯urikaisekikenky¯usho K¯oky¯uroku, 978:160-172, 1997. Optimization methods for mathematical systems with uncertainty (Japanese) (Kyoto, 1996).
  1243. Toshiharu Fujita and Kazuyoshi Tsurusaki. Stochastic optimization of multiplicative functions with negative value. J. Oper. Res. Soc. Japan, 41(3):351-373, 1998.
  1244. Hiroshi Fujiwara and Kazuo Iwama. Average-Case Competitive Analyses for Ski-Rental Problems. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  1245. Takeshi Fukao and Tetsuya Harada. Decomposition of objective function in stochastic combinatorial optimization. In System modelling and optimization (Leipzig, 1989), volume 143 of Lecture Notes in Control and Inform. Sci., pages 599-610. Springer, Berlin, 1990.
  1246. Kazuma Fukuda, Hitoshi Hagiwara, and Mario Nakamori. Analysis of probabilistic algorithms for the knapsack problem. S¯urikaisekikenky¯usho K¯oky¯uroku, 947:162-171, 1996. Optimization theory in mathematical models (Japanese) (Kyoto, 1995).
  1247. Masao Fukushima. A fixed point approach to certain convex programs with applications in stochastic programming. Math. Oper. Res. 8, 517-524, 1983.
  1248. Nagata Furukawa. Recurrence set-relations in stochastic multiobjective dynamic decision processes. Math. Operationsforsch. Stat., Ser. Optimization 13, 113-121, 1982.
  1249. R.I. Furunziev and A.Ja. Ismailov. Eine experimentelle Untersuchung von Algorithmen der stochastischen Optimierung dynamischer Systeme. Wiss. Z. Techn. Hochschule Ilmenau 25, No.1, 173-180, 1979.
  1250. A. Futschik and G. Pflug. Confidence sets for discrete stochastic optimization. Ann. Oper. Res., 56:95-108, 1995. Stochastic programming (Udine, 1992).
  1251. R. Gabasov and V.G. Medvedev. An algorithm for solving a two-stage linear stochastic programming problem with several random parameters. Dokl. Akad. Nauk BSSR, 32(1):13-16, 92, 1988.
  1252. J. M. Gablonsky and C. T. Kelley. A locally-biased form of the DIRECT algorithm. J. Global Optim., 21(1):27-37, 2001.
  1253. Manal Gabour, Simeon Reich, and Alexander J. Zaslavski. Generic convergence of algorithms for solving stochastic feasibility problems. In Inherently parallel algorithms in feasibility and optimization and their applications (Haifa, 2000), volume 8 of Stud. Comput. Math., pages 279-295. North-Holland, Amsterdam, 2001.
  1254. Norman Gaither. An experimental solution of the general stochastic programming problem. Simulation 30, 191-195, 1978.
  1255. V.G. Gaitsgori and A.A. Pervozvanskii. Approximate optimality of sliding planning. Automat. Remote Control, 38(10, part 2):1505-1511 (1978), 1977.
  1256. A. Gaivoronski. Linearization methods for optimization of functionals which depend on probability measures. Math. Programming Stud., 28:157-181, 1986. Stochastic programming 84. II.
  1257. A. Gaivoronski. Stochastic optimization techniques for finding optimal submeasures. In Stochastic optimization (Kiev, 1984), volume 81 of Lecture Notes in Control and Inform. Sci., pages 351-363. Springer, Berlin, 1986.
  1258. A. Gaivoronski. Numerical techniques for finding estimates which minimize the upper bound of the absolute deviation. In Statistical data analysis based on the L\sb 1-norm and related methods (Neuch
    sp atel, 1987)    , pages 247-262, Amsterdam, 1987. North-Holland.
  1259. A. Gaivoronski. Stochastic quasigradient methods and their implementation. In Numerical techniques for stochastic optimization, volume 10 of Springer Ser. Comput. Math., pages 313-351. Springer, Berlin, 1988.
  1260. A. Gaivoronski, E. Messina, and A. Sciomachen. A stochastic optimization approach for robot scheduling. Ann. Oper. Res., 56:109-133, 1995. Stochastic programming (Udine, 1992).
  1261. A.A. Gaivoronski and E. Messina. Stochastic optimization algorithms for regenerative DEDS. In System modelling and optimization (Compiègne, 1993), volume 197 of Lecture Notes in Control and Inform. Sci., pages 320-331. Springer, London, 1994.
  1262. A.A. Gaivoronski, E. Messina, and A. Sciomachen. A statistical generalized programming algorithm for stochastic optimization problems. Ann. Oper. Res., 58:297-321, 1995. Applied mathematical programming and modeling, II (APMOD 93) (Budapest, 1993).
  1263. Alexei A. Gaivoronski. A numerical method for solving stochastic programming problems with moment constraints on a distribution function. Ann. Oper. Res., 31(1-4):347-369, 1991. Stochastic programming, Part II (Ann Arbor, MI, 1989).
  1264. Alexei A. Gaivoronski. SQG: software for solving stochastic programming problems with stochastic quasi-gradient methods. In Applications of stochastic programming, volume 5 of MPS/SIAM Ser. Optim., pages 37-60. SIAM, Philadelphia, PA, 2005.
  1265. Alexei A. Gaivoronski. Stochastic optimization problems in telecommunications. In Applications of stochastic programming, volume 5 of MPS/SIAM Ser. Optim., pages 669-704. SIAM, Philadelphia, PA, 2005.
  1266. Alexei A. Gaivoronski and Petter E. de Lange. An asset liability management model for casualty insurers: complexity reduction vs. parameterized decision rules. Ann. Oper Res., 99:227-250 (2001), 2000. Applied mathematical programming and modeling, IV (Limassol, 1998).
  1267. Alexei A. Gaivoronski, Kjetil Høyland, and Petter E. de Lange. Statutory regulation of casualty insurance companies: an example from Norway with stochastic programming analysis. In Stochastic optimization: algorithms and applications (Gainesville, FL, 2000), volume 54 of Appl. Optim., pages 55-85. Kluwer Acad. Publ., Dordrecht, 2001.
  1268. Alexei A. Gaivoronski and Fabio Stella. Stochastic nonstationary optimization for finding universal portfolios. Ann. Oper Res., 100:165-188 (2001), 2000. Research in stochastic programming (Vancouver, BC, 1998).
  1269. A.A. Gaivoronskii. Some methods for the solution of a nonstationary stochastic programming problem with constraints. In Methods of operations research and of reliability theory in systems analysis (Russian), pages 70-79, Kiev, 1977. Akad. Nauk. Ukrain. SSR Inst. Kibernet.
  1270. A.A. Gaivoronskii. Identification approach to problems of stochastic programming with independent tests. In Mathematical methods in operations research and reliability theory (Russian), pages 87-91, Kiev, 1978. Akad. Nauk Ukrain. SSR Inst. Kibernet.
  1271. A.A. Gaivoronskii. A nonstationary stochastic programming problem with changing constraints. In Mathematical methods in operations research and reliability theory (Russian), pages 24-30. Akad. Nauk Ukrain. SSR Inst. Kibernet., Kiev, 1978.
  1272. A.A. Gaivoronskii. Nonstationary stochastic programming problems. Kibernetika (Kiev), 4:89-92, 1978.
  1273. A.A. Gaivoronskii. Approximation methods of solution of stochastic programming problems. Cybernetics, 18(2):241-249, 1982.
  1274. A.A. Gaivoronskii. Numerical methods for minimizing convex functionals from probability measures with applications to optimal monitoring. Kibernetika (Kiev), 4:43-51, 134, 1989.
  1275. A.A. Gaivoronskii. A numerical method for searching for optimal submeasures. Kibernetika (Kiev), 2:70-77, 136, 1990.
  1276. A.A. Gaivoronskii and Le Din' Fung. Solution of nonstationary and limit stochastic inequalities. Issled. Operatsii i ASU, 13:98-104, 135, 1979.
  1277. A.A. Gajvoronskij. Methods of search of optimal sets. Cybernetics 14, 731-735 translation from Kibernetika 1978, No.5, 83-86 (1978)., 1979.
  1278. A.A. Gajvoronskij. Numerical minimization methods for convex functionals dependent on probability measures with applications to optimal pollution monitoring. Cybernetics 25, No.4, 471-482 translation from Kibernetika 1989, No.4, 43-51 (1989)., 1989.
  1279. A.A. Gajvoronskij. A numerical method to find optimal submeasures. Cybernetics 26, No.2, 234-246 translation from Kibernetika 1990, No.2, 70-77 (1990)., 1990.
  1280. A.D. Gajvoronskij and Yu.M. Ermol'ev. Methods of finding optimal submeasures (characterization of solutions). Cybernetics 23, No.5, 684-694 translation from Kibernetika 1987, No.5, 94-101 (1987)., 1987.
  1281. Alexei A. Gajvoronskij. Optimization of stochastic discrete event dynamic systems: A survey of some recent results. In Simulation and optimization, Proc. Int. Workshop Comput. Intensive Methods Simulation Optimization, Laxenburg/Austria 1990, Lect. Notes Econ. Math. Syst. 374, 24-44, 1992.
  1282. Shmuel Gal and Charles A. Micchelli. Optimal sequential and nonsequential procedures for evaluating a functional. Applicable Anal., 10(2):105-120, 1980.
  1283. Tomas Gal, editor. Grundlagen des Operations Research. 3: Spieltheorie, Dynamische Optimierung, Lagerhaltung, Warteschlangentheorie, Simulation, Unscharfe Entscheidungen. Mit Beitr. von M. J. Beckmann, H. Gehring, K.-P. Kistner, Ch. Schneeweiss, G. Schwoediauer, H.-J. Zimmermann. Springer-Verlag, 1987.
  1284. Tomas Gal and Hartmut Wolf. Solving stochastic linear programs via goal programming. In Decision making with multiple objectives (Cleveland, Ohio, 1984), volume 242 of Lecture Notes in Econom. and Math. Systems, pages 126-143. Springer, Berlin, 1985.
  1285. Giulia Galbiati. On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints. J. Complexity 6, No.2, 149-165, 1990.
  1286. E. A. Galperin and N. M. Yanev. One-dimensional analogue of the global optimization. C. R. Acad. Bulgare Sci., 53(5):29-32, 2000.
  1287. Wolf Gamerith. Ueber gemischte unscharfe Ansaetze zum multi-criteria-Problem. Methods Oper. Res. 43, 63-71, 1981.
  1288. R.V. Gamkrelidze, editor. Progress in mathematics. Vol. 11: Probability theory, mathematical statistics, and theoretical cybernetics. Translated from Russian by J. S. Wood. New York-London: Plenum Press., 1971.
  1289. M.S. Gamze. A method for the parametrization of one-step problems of operative linear stochastic programming. Kibernetika (Kiev), 1:71-74, 79, 135, 1988.
  1290. Cheng Yun Gao. Efficient equilibria and the core in a stochastic market. Qufu Shifan Daxue Xuebao Ziran Kexue Ban, 21(5):119-122, 1995.
  1291. Cheng Yun Gao. Optimal selection for stochastic continuous location on closed convex sets. Qufu Shifan Daxue Xuebao Ziran Kexue Ban, 22(2):15-19, 1996.
  1292. Linchun Gao and András Prékopa. Lower and upper bounds for the probability that at least r and exactly r out of n events occur. Math. Inequal. Appl., 5(2):315-333, 2002.
  1293. Alfredo Garcia and Robert L. Smith. Solving nonstationary infinite horizon stochastic production planning problems. Oper. Res. Lett., 27(3):135-141, 2000.
  1294. I. Garcia and G.T. Herman. Global optimization by parallel constrained biased random search. In State of the art in global optimization (Princeton, NJ, 1995), volume 7 of Nonconvex Optim. Appl., pages 433-455. Kluwer Acad. Publ., Dordrecht, 1996.
  1295. J.-M. Garcia and A. Turgeon. Gestion optimale d'un ensemble hydro-electrique: Aspects long terme et court terme. RAIRO, Autom. Syst. Anal. Control 15, 243-262, 1981.
  1296. M. a Pilar García-Carrasco Aponte. Some cases of optimal allocation of observations. Trabajos Estadíst. Investigación Oper., 30(2):3-31, 1979.
  1297. D. T. Gardner. Flexibility in electric power planning: Coping with demand uncertainty. Energy, 21(2):1207-1218, 1996.
  1298. D. T. Gardner and J. S. Rogers. Planning electric power systems under demand uncertainty with different technology lead times. Management Science, 45:1289-1306, 1999.
  1299. L.E. Garey and R.D. Gupta. A note on continuous search algorithms. J. Appl. Probab., 24(1):277-280, 1987.
  1300. N.I. Garkusha. Investigation of the adaptive properties of production-transportation systems by means of stochastic models. Issled. Operatsii i ASU, 35:11-20, 1991.
  1301. Izaskun Garrido and Marc C. Steinbach. A multistage stochastic programming approach in real-time process control. In Online optimization of large scale systems, pages 479-498. Springer, Berlin, 2001.
  1302. Stanley J. Garstka. Stochastic programs with recourse: random recourse costs only. Management Sci., 19:747-750, 1972/73.
  1303. Stanley J. Garstka. Regularity conditions for a class of convex programs. Management Sci., Theory 20, 373-377, 1973.
  1304. Stanley J. Garstka. Distribution functions in stochastic programs with recourse: a parametric analysis. Math. Programming, 6:339-351, 1974.
  1305. Stanley J. Garstka. On duality in stochastic programming with recourse. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete, 29:21-24, 1974.
  1306. Stanley J. Garstka. The economic equivalence of several stochastic programming models. In Stochastic programming (Proc. Internat. Conf., Univ. Oxford, Oxford, 1974), pages 83-91, London, 1980. Academic Press.
  1307. Stanley J. Garstka. An economic interpretation of stochastic programs. Math. Programming, 18(1):62-67, 1980.
  1308. Stanley J. Garstka and David P. Rutenberg. Computation in discrete stochastic programs with recourse. Operations Res., 21:112-122, 1973. Mathematical programming and its applications.
  1309. Stanley J. Garstka and Roger J.-B. Wets. On decision rules in stochastic programming. Math. Programming, 7:117-143, 1974.
  1310. Bernd Gärtner and Emo Welzl. Linear programming-randomization and abstract frameworks. In STACS 96 (Grenoble, 1996), volume 1046 of Lecture Notes in Comput. Sci., pages 669-687, Berlin, 1996. Springer.
  1311. H. Gassmann. Conditional probability and conditional expectation of a random vector. In Numerical techniques for stochastic optimization, volume 10 of Springer Ser. Comput. Math., pages 237-254. Springer, Berlin, 1988.
  1312. H. Gassmann. MSLIP, a computer code for the multistage stochastic linear programming problem. Mathematical Programming, 47:407-423, 1990.
  1313. H. Gassmann and W.T. Ziemba. A tight upper bound for the expectation of a convex function of a multivariate random variable. Math. Programming Stud., 27:39-53, 1986. Stochastic programming 84. I.
  1314. H. I. Gassmann and András Prékopa. On stages and consistency checks in stochastic programming. Oper. Res. Lett., 33(2):171-175, 2005.
  1315. H. I. Gassmann and E. Schweitzer. A comprehensive input format for stochastic linear programs. Ann. Oper Res., 104:89-125 (2002), 2001. Modeling languages and systems.
  1316. H.I. Gassmann and A.M. Ireland. On the formulation of stochastic linear programs using algebraic modelling languages. Ann. Oper. Res., 64:83-112, 1996. Stochastic programming, algorithms and models (Lillehammer, 1994).
  1317. H.I. Gassmann and J.D. Pinter. Modelling tools for stochastic programs. Working Paper 97-1, School of Business Administration, Dalhousie University, Halifax, 1997.
  1318. Horand I. Gassmann. The SMPS format for stochastic linear programs. In Applications of stochastic programming, volume 5 of MPS/SIAM Ser. Optim., pages 9-19. SIAM, Philadelphia, PA, 2005.
  1319. Horand I. Gassmann and David M. Gay. An integrated modeling environment for stochastic programming. In Applications of stochastic programming, volume 5 of MPS/SIAM Ser. Optim., pages 159-175. SIAM, Philadelphia, PA, 2005.
  1320. Horand I. Gassmann, Sandra L. Schwartz, Stein W. Wallace, and William T. Ziemba. Introduction to stochastic programming applications. In Applications of stochastic programming, volume 5 of MPS/SIAM Ser. Optim., pages 179-184. SIAM, Philadelphia, PA, 2005.
  1321. Horand I. Gassmann and Stein W. Wallace. Solving linear programs with multiple right-hand sides: pricing and ordering schemes. Ann. Oper. Res., 64:237-259, 1996. Stochastic programming, algorithms and models (Lillehammer, 1994).
  1322. Horand I. Gassmann, Stein W. Wallace, and William T. Ziemba. Stochastic programming computer implementations. In Applications of stochastic programming, volume 5 of MPS/SIAM Ser. Optim., pages 3-8. SIAM, Philadelphia, PA, 2005.
  1323. W. Gaul. On stochastic analysis of project-networks. In Deterministic and stochastic scheduling, Proc. NATO Adv. Study Res. Inst., Durham/Engl. 1981, 297-309, 1982.
  1324. W. Gaul. Financial planning via stochastic programming: a stochastic flows-with-gains approach. In Risk and capital (Ulm, 1983), volume 227 of Lecture Notes in Econom. and Math. Systems, pages 181-197. Springer, Berlin, 1984.
  1325. Wolfgang Gaul. Bounds for the expected duration of a stochastic project planning model. J. Inform. Optim. Sci., 2(1):45-63, 1981.
  1326. Wolfgang Gaul. Stochastische Projektplanung und Marketingprobleme. Methods Oper. Res. 44, 539-552, 1981.
  1327. Wolfgang Gaul. Marketing-Logistik bei stochastischer Nachfrage. In Operations research, Proc. 11th Annu. Meet., Frankfurt a.M. 1982, 73-80 , 1983.
  1328. Carlo Gavarini. Applications de la programmation mathematique a l'analyse limite des structures. Revue Franc. Automat. Inform. Rech. operat. 7, V-3, 55-68, 1973.
  1329. T. Gavin. Etudes numeriques et applications de processus d'approximation stochastique. Ann. sci. Univ. Clermont 58, Math. 12, 94-109, 1976.
  1330. Andrzej Gawrych-Zukowski. Some problems of multi-objective programming with fuzzy constraints. Syst. Sci. 7, 75-86, 1981.
  1331. A.A. Gayvoronskiy and Yu. M. Yermol'yev. Problems of stochastic programming with subsequent estimation of the parameters. Engrg. Cybernetics, 17(4):22-31 (1980), 1979.
  1332. H.P. Geering and M. Mansour(ed.). Large scale systems; theory and applications 1986. Selected papers from the 4th IFAC/IFORS Symposium, Zuerich, Switzerland, August 26-29, 1986. Volume 2. IFAC Proceedings Series, 1987, No.11. International Federation of Automatic Control. Oxford etc.: Pergamon Press. XV, 396 p., ISBN 0-08- 034084-9, 1987.
  1333. S. Geetha and K.P.K. Nair. A stochastic bottleneck transportation problem. J. Oper. Res. Soc. 45, No.5, 583-588, 1994.
  1334. William V. Gehrlein and Peter C. Fishburn. Information overload in mechanical processes. Management Sci. 23, 391-398, 1976.
  1335. Robert Geist and Robert Reynolds. The most likely steady state for large numbers of stochastic traveling salesman. In Numerical solution of Markov chains, volume 8 of Probab. Pure Appl., pages 529-541. Dekker, New York, 1991.
  1336. Saul B. Gelfand and Sanjoy K. Mitter. Recursive stochastic algorithms for global optimization in r\sp d. SIAM J. Control Optim., 29(5):999-1018, 1991.
  1337. S.B. Gelfand and S.K. Mitter. Weak convergence of Markov chain sampling methods and annealing algorithms to diffusions. J. Optim. Theory Appl., 68(3):483-498, 1991.
  1338. Mitsuo Gen and Baoding Liu. Evolution algorithm for optimal capacity expansion. J. Oper. Res. Soc. Japan, 40(1):1-9, 1997.
  1339. Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, and Toby Walsh. Random constraint satisfaction: flaws and structure. Constraints, 6(4):345-372, 2001.
  1340. Yigal Gerchak and Mordechai Henig. An inventory model with component commonality. Oper. Res. Lett. 5, 157-160, 1986.
  1341. L. Gerencser. The application of a stochastic Broyden method in the self-tuning control of a heatpump. Z. Angew. Math. Mech. 63, No.5, T408-T410, 1983.
  1342. L. Gerencser. Convergence of a stochastic variable metric method with application in adaptive prediction. In System modelling and optimization, Proc. 11th IFIP Conf., Copenhagen 1983, Lect. Notes Control Inf. Sci. 59, 443-450, 1984.
  1343. L. Gerencsér. Strong consistency theorems related to stochastic quasi-Newton methods. In Stochastic optimization (Kiev, 1984), volume 81 of Lecture Notes in Control and Inform. Sci., pages 364-372. Springer, Berlin, 1986.
  1344. L. Gerencsér. Rate of convergence of moments of Spall's SPSA method. In Stochastic Differential and Difference Equations, Series on Progress in Systems and Control Theory, volume 23, pages 67-75. Birkhäuser, Boston, 1997.
  1345. L. Gerencsér. Convergence rate of moments in stochastic approximation with simultaneous perturbation gradient approximation and resetting. IEEE Transactions on Automatic Control, 44:894-905, 1999.
  1346. L. Gerencsér, S.D. Hill, and Z. Vágó. Optimization over discrete sets using SPSA. In Proceedings of the IEEE Conference on Decision and Control, pages 1791-1795, 1999.
  1347. L. Gerencsér and Z. Vágó. SPSA in noise-free optimization. In Proceedings of the American Control Conference, pages 3284-3288, 2000.
  1348. László Gerencsér and Zsuzsanna Vágó. Non-smooth optimization with randomization. In Optimization theory (Mátraháza, 1999), volume 59 of Appl. Optim., pages 111-117. Kluwer Acad. Publ., Dordrecht, 2001.
  1349. László Gerencsér, Zsuzsanna Vágó, and H. Hjalmarsson. Randomization methods in optimization and adaptive control. In Stochastic theory and control (Lawrence, KS, 2001), volume 280 of Lecture Notes in Control and Inform. Sci., pages 137-153. Springer, Berlin, 2002.
  1350. Allen Gersho. Adaptive filtering with binary reinforcement. IEEE Trans. Inf. Theory IT-30, 191-199, 1984.
  1351. Dieter Geuting and Klaus Hellwig. Einige Bemerkungen zum Zweistufigen Stochastischen Programmieren. In Operations Research Verfahren XXIV, Symp. Mannheim 1978, 57-59, 1977.
  1352. Horst-Dieter Geuting. Entscheidungen unter Ungewissheit. Loesungsansaetze der stochastischen Programmierung bei endlichem Zustandsraum., 1978.
  1353. Charles J. Geyer. On the asymptotics of constrained M-estimation. Ann. Statist., 22(4):1993-2010, 1994.
  1354. G.Gürkan. Simulation optimization of buffer allocations in production lines with unreliable machines. Annals of Operations Research, 93:177-216, 2000.
  1355. G.Gürkan, A.Y. Özge, and S.M. Robinson. Sample-path solutions for simulation optimization problems and stochastic variational inequalities. In D.L. Woodruff, editor, Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search: Interfaces in Computer Science and Operations Research, pages 169-188, Boston, 1998. Kluwer Academic Publishers.
  1356. G.Gürkan, A.Y. Özge, and S.M. Robinson. Solving stochastic optimization problems with stochastic constraints: An application in network design. In P.A. Farrington, H.B. Nembhard, D.T. Sturrock, and G.W. Evans, editors, Proceedings of the 1999 Winter Simulation Conference, pages 471-478, 1999.
  1357. Saied Ghannadan and Stein W. Wallace. Feasibility in uncapacitated networks: the effect of individual arcs and nodes. Ann. Oper. Res., 64:197-210, 1996. Stochastic programming, algorithms and models (Lillehammer, 1994).
  1358. G. Giappichelli, editor. Atti del Primo Convegno A.M.A.S.E.S., Pisa, November 4-5, 1977., 1979. Torino: VIII, 393 p. L 10.000.00.
  1359. Basilis Gidas. Simulations and global optimization. In Random media, IMA Vol. Math. Appl. 7, 129-145, 1987.
  1360. A.B. Gil', A.I. Kaplinskii, and V. M. Umyvakin. Information base of procedures for searching for optimal variants of an object that does not use differential characteristics of the quality exponent. In Optimization and modeling in automated systems (Russian), pages 4-10. Voronezh. Politekhn. Inst., Voronezh, 1988.
  1361. È. Kh. Gimadi. Justification of a priori estimates for the quality of the approximate solution of a standardization problem. Upravlyaemye Sistemy, 27:12-27, 88-89, 1987.
  1362. M.Ja. Ginzburg and M.I. Burtman. Ueber die operative Ressourcenverteilung auf grossen zweiteiligen Transportnetzen ohne Zyklen. Ekonom. i Mat. Metody 13, 302-310, 1977.
  1363. V.L. G¯irko. Limit theorems for the solutions of systems of linear random equations and the eigenvalues and determinants of random matrices. Dokl. Akad. Nauk SSSR, 212:1039-1042, 1973.
  1364. V.L. Girko and V.V. Smirnova. Asimptoticheskie metody resheniya nekotorykh zadach linei nogo stokhasticheskogo programmirovaniya i modelei tipa zatraty-vypusk, volume 83 of Preprint. Akad. Nauk Ukrain. SSR Inst. Kibernet., Kiev, 1983.
  1365. V.L. Girko and V.V. Smirnova. Method of integral representations for the solution of problems of linear stochastic programming. Kibernetika 1983, No.6, 122-124, 1983.
  1366. Vyacheslav L. Girko. Integral representation and resolvent methods for solving of linear stochastic programming problems of large dimensions. In System modelling and optimization (Zurich, 1991), volume 180 of Lecture Notes in Control and Inform. Sci., pages 574-579. Springer, Berlin, 1992.
  1367. M.B. Gitman, P.V. Trusov, and S.A. Fedoseev. On the stochastic optimization problems of plastic metal-working processes. J. Math. Sci. (New York), 84(3):1109-1112, 1997.
  1368. Michael B. Gitman, Peter V. Trusov, and Sergei A. Fedoseev. On the stochastic optimization problems of plastic metal working processes under stochastic initial conditions. Korean J. Comput. Appl. Math., 6(1):111-125, 1999.
  1369. J.C. Gittins. Resource allocation in speculative chemical research. J. appl. Probab. 11, 255-265, 1974.
  1370. K.D. Glazebrook. On non-preemptive strategies for stochastic scheduling problems in continuous time. Int. J. Syst. Sci. 12, 771-782, 1981.
  1371. K.D. Glazebrook. Decomposable jump decision processes. Stochastic Processes Appl. 13, 333-334, 1982.
  1372. K.D. Glazebrook. On a sufficient condition for superprocesses due to Whittle. J. Appl. Probab. 19, 99-110, 1982.
  1373. K.D. Glazebrook, R.J. Boys, and N.A. Fay. On the evaluation of strategies for branching bandit processes. Ann. Oper. Res. 30, 299-319, 1991.
  1374. Kevin D. Glazebrook. Semi-Markov models for single-machine stochastic scheduling problems. Int. J. Syst. Sci. 16, 573-587, 1985.
  1375. Alan Gleit. Statistical decision theory and linear programming. The non-constrained case., 1977.
  1376. Alan Gleit. Stochastic linear programming. Matematisk Institut, Aarhus Universitet, Aarhus, 1977. Lecture Notes Series, No. 49.
  1377. I.A. Glinkin. On the search for global extrema of functions which are representable in the form of an integral on a domain of variable configuration. Vopr. Kibern., Mosk. 122, 91-97, 1985.
  1378. I.A. Glinkin. Search for the global extremum of functions represented as an integral over a domain of variable configuration. Voprosy Kibernet. (Moscow), 122:91-97, 1985.
  1379. B.M. Glover, B.D. Craven, and S.D. Flam. A generalized Karush-Kuhn-Tucker optimality condition without constraint qualification using the approximate subdifferential. Numer. Funct. Anal. Optimization 14, No.3-4, 333-353, 1993.
  1380. V.M. Gluskov and G.B. Olejars. Einige Probleme der stochastischen Programmierung, die in Dialogsystemen der Planung unter den Verhaeltnissen unvollstaendiger Informationen entstehen. Kibernetika, Kiev 1977, No.3, 100-104, 1977.
  1381. O.V. Gluskova. Finite-difference methods for solving stochastic minimax problems. Dokl. Akad. Nauk Ukrain. SSR Ser. A, 10:78-81, 96, 1980.
  1382. V.A. Gnatjuk. An algorithm for the simultaneous solution of the direct and the dual problems of convex programming in a Banach space. Kibernetika (Kiev), 1:102-107, 1975.
  1383. Willy Gochet. A note on the E-model of chance-constrained programming with random b- vector. Management Sci., Theory 21, 844-845, 1975.
  1384. Willy F. Gochet and Manfred W. Padberg. The triangular E-model of chance-constrained programming with stochastic A-matrix. Management Sci., 20:1284-1291, 1973/74.
  1385. A.F. Godonoga. Some properties in problems of quadratic stochastic programming. Mat. Issled., 82:24-29, 152, 1985. Mat. Modeli Met. Optim.
  1386. A.F. Godonoga. Stochastic schemes for finding the minimax. Mat. Issled., 116:3-13, 96, 1990. Veroyatnost. i Prilozhen.
  1387. C.D. Godsil. Tools from linear algebra. In Handbook of combinatorics, Vol. 1, 2, pages 1705-1748. Elsevier, Amsterdam, 1995. With an appendix by L. Lovász.
  1388. Vikas Goel and Ignacio E. Grossmann. A class of stochastic programs with decision dependent uncertainty. Stochastic Programming E-Print Series, http://www.speps.org, 2004.
  1389. Vikas Goel and Ignacio E. Grossmann. A class of stochastic programs with decision dependent uncertainty. Math. Program., 108(2-3, Ser. B):355-394, 2006.
  1390. A.S. Gofmark. Stochastic programming problems with penalty estimates when the coefficients of the matrix A are random. Taskent. Inst. Narod. Hoz. Naucn. Zap., 34:68-76, 1970. Mat. v Prilozen.
  1391. A.S. Gofmark. Stochastic programming problems with probabilistic constraints when the coefficients of the matrix A are random. Taskent. Inst. Narod. Hoz. Naucn. Zap., 34:77-87, 1970. Mat. v Prilozen.
  1392. C.J. Goh and K.L. Teo. On constrained stochastic optimal parameter selection problems. Bull. Austral. Math. Soc., 41(3):393-405, 1990.
  1393. Ambrose Goicoechea and Lucien Duckstein. Nonnormal deterministic equivalents and a transformation in stochastic mathematical programming. Appl. Math. Comput., 21(1):51-72, 1987.
  1394. K. Gokbayrak and C. G. Cassandras. Online surrogate problem methodology for stochastic discrete resource allocation problems. J. Optim. Theory Appl., 108(2):349-376, 2001.
  1395. K. Gokbayrak and C. G. Cassandras. Generalized surrogate problem methodology for online stochastic discrete optimization. J. Optim. Theory Appl., 114(1):97-132, 2002.
  1396. Bruce L. Golden, Arjang A. Assad, and Stelios H. Zanakis. Statistics and optimization: the interface. Amer. J. Math. Management Sci., 4(1-2):1-5, 1984. Statistics and optimization : the interface.
  1397. Thomas Goll and Jan Kallsen. Optimal portfolios for logarithmic utility. Stochastic Process. Appl., 89(1):31-48, 2000.
  1398. R. Gollmer, M. P. Nowak, W. Römisch, and R. Schultz. Unit commitment in power generation-a basic model and some extensions. Annals of Operations Research, 96:167-189, 2000.
  1399. Ralf Gollmer, Uwe Gotzes, and Rüdiger Schultz. Second-order stochastic dominance constraints induced by mixed-integer linear recourse. Stochastic Programming E-Print Series, http://www.speps.org, 2007.
  1400. Ralf Gollmer, Frederike Neise, and Rüdiger Schultz. Stochastic programs with first-order dominance constraints induced by mixed-integer linear recourse. Stochastic Programming E-Print Series, http://www.speps.org, 2007.
  1401. Alexandr N. Golodnikov, Pavel S. Knopov, Panos M. Pardalos, and Stanislav P. Uryasev. Optimization in the space of distribution functions and applications in the Bayes analysis. In Probabilistic constrained optimization, volume 49 of Nonconvex Optim. Appl., pages 102-131. Kluwer Acad. Publ., Dordrecht, 2000.
  1402. A.N. Golodnikov. Search for the extremum of a linear functional in a class of distribution functions satisfying linear constraints of the inequality type. Akad. Nauk Ukrain. SSR Inst. Kibernet. Preprint, 13:7-14, 53, 1979. Stochastic optimization models.
  1403. A.N. Golodnikov. A method of solving certain stochastic problems with partially defined distribution function. Engrg. Cybernetics, 18(2):14-20 (1981), 1980.
  1404. A.N. Golodnikov, Yu.M. Ermol'ev, and Ts.Kh. Nedeva. Problems of stochastic programming with unknown distribution functions. Izv. Akad. Nauk SSSR, Tekh. Kibern. 1983, No.3, 180-188, 1983.
  1405. B. Golub, M. Holmer, R. McKendall, L. Pohlman, and S.A. Zenios. Stochastic programming models for money management. European Journal of Operations Research, 85:282-296, 1995.
  1406. Luiz F.A.M. Gomes. On modelling equilibrium traffic flow assignment with elastic demand as a stochastic nonlinear vector optimization problem. Found. Control Eng. 11, 157-166, 1986.
  1407. Amilcar S. Goncalves. On the convexity of sets of parameters in parametric linear programming. Univ. Lisboa, Revista Fac. Ci., II. Ser., A 14, 61-78, 1972.
  1408. J. Gondzio and A. Ruszczy\'nski. Sensitivity method for basis inverse representation in multistage stochastic linear programming problems. J. Optim. Theory Appl., 74(2):221-242, 1992.
  1409. Jacek Gondzio. Simplex modifications exploiting special features of dynamic and stochastic dynamic linear programming problems. Control Cybernet., 17(4):337-349 (1989), 1988.
  1410. Jacek Gondzio and Roy Kouwenberg. High performance computing for asset liability management. Report MS-99-004, Econometric Institute, Erasmus University Rotterdam, The Netherlands, 1999. Available at http://mail.tinbinst.nl/~kouwenbe/ms99004.ps.
  1411. Jacek Gondzio and Andrzej Ruszczy\'nski. A sensitivity method for solving multistage stochastic linear programming problems. In Aspiration based decision support systems, volume 331 of Lecture Notes in Econom. and Math. Systems, pages 68-79. Springer, Berlin, 1989.
  1412. Linguo Gong. Chance-constrained linear programming with location scale distributions. Nav. Res. Logist. 39, No.7, 997-1007, 1992.
  1413. Wei-Bo Gong, Yu-Chi Ho, and Wengang Zhai. Stochastic comparison algorithm for discrete optimization with estimation. SIAM J. Optim., 10(2):384-404 (electronic), 2000.
  1414. Graham C. Goodwin, David J. Hill, and Xie Xianya. Stochastic adaptive control for exponentially convergent time-varying systems. SIAM J. Control Optimization 24, 589-603, 1986.
  1415. V.M. Gorbachuk. Stability of solutions of stochastic extremal problems. In Mathematical methods for the analysis of complex stochastic systems (Russian), pages 71-76, vi. Akad. Nauk Ukrain. SSR Inst. Kibernet., Kiev, 1988.
  1416. Steven M. Gorelick. Large scale nonlinear deterministic and stochastic optimization: Formulations involving simulation of subsurface contamination. Math. Program., Ser. B 48, No.1, 19-39, 1990.
  1417. B. G. Gorenstin, N. M. Campodónico, J. P. Costa, and M. V. F. Pereira. Stochastic optimization of a hydrothermal system including network constraints. IEEE Transactions on Power Systems, 7(2):791-797, 1992.
  1418. B. G. Gorenstin, N. M. Campodónico, J. P. Costa, M. V. F. Pereira, and N. Deeb. Power-system expansion planning under uncertainty. IEEE Transactions on Power Systems, 8(1):129-136, 1993.
  1419. A. Gorka and M. Kostreva. Probabilistic version of the method of feasible directions. Appl. Math. Comput., 130(2-3):253-264, 2002.
  1420. S. Yu. Gorodetskii. Convergence and asymptotic estimates of behavior for a class of search methods. Dinamika Sistem, Dinam. Uprav.:140-163, 195, 1984.
  1421. S.Yu. Gorodetskij and Yu.I. Nejmark. On the search characteristics of the algorithm of global optimization with an adaptive stochastic model. Probl. Sluchajnogo Poiska 9, 83-105, 1981.
  1422. H.W. Gottinger. Stochastic decomposition of hierarchical systems. Angew. Inf. 18, 13-22, 1976.
  1423. Uwe Gotzes. Optimal investments in distributed generation units under uncertainty. In CTW2006-Cologne-Twente Workshop on Graphs and Combinatorial Optimization, volume 25 of Electron. Notes Discrete Math., page 65 (electronic). Elsevier, Amsterdam, 2006.
  1424. A. Gouda, D. Monhor, and T. Szántai. Stochastic programming based PERT modeling. In Coping with uncertainty, volume 581 of Lecture Notes in Econom. and Math. Systems, pages 241-255. Springer, Berlin, 2006.
  1425. A. Gouda and T. Szántai. A new, stochastic programming model of PERT. Alkalmaz. Mat. Lapok, 22(1):97-113, 2005.
  1426. John Goutsias and Jerry M. Mendel. Optimal simultaneous detection and estimation of filtered discrete semi- Markov chains. IEEE Trans. Inf. Theory IT-34, No.3, 551-568, 1988.
  1427. A.K. Govil and S. Kumar. Stochastic behaviour of a complex system under priority repair. Computing 6, 200-213, 1970.
  1428. Alicja Grabowska. Randomness of a restriction vector in linear programming. Przeglk ad Statyst., 18:345-352, 1971.
  1429. O.N. Granichin. Estimation of the minimum point of an unknown function observed against the background of dependent noise. Problemy Peredachi Informatsii, 28(2):16-20, 1992.
  1430. V.I. Gricenko and N.A. Nazarenko. Problem of on-line control of multiphase supply systems. Kibernetika, Kiev 1978, No.2, 100-103, 1978.
  1431. M.J. Grimble. Convergence of explicit LQG self-tuning controllers. IEE Proc., Part D 135, No.4, 309-322, 1988.
  1432. S.N. Grincenko and L.A. Rastrigin. On matrix random search. Avtomat. vycislit. Tehn., Riga 1977, No.1, 48-51, 1977.
  1433. Richard C. Grinold. A new approach to multistage stochastic linear programs. Math. Programming Stud., 6:19-29, 1976. Stochastic systems: modeling, identification and optimization, II (Proc. Sympos., Univ. Kentucky, Lexington, Ky., 1975).
  1434. Richard C. Grinold. Infinite horizon stochastic programs. SIAM J. Control Optim., 24(6):1246-1260, 1986.
  1435. P. J. F. Groenen, W. J. Heiser, and J. J. Meulman. Global optimization in least-squares multidimensional scaling by distance smoothing. J. Classification, 16(2):225-254, 1999.
  1436. Luuk Groenewegen and Jaap Wessels. Conditions for optimality in multistage stochastic programming problems. In Recent results in stochastic programming (Proc. Meeting, Oberwolfach, 1979), volume 179 of Lecture Notes in Econom. and Math. Systems, pages 41-57. Springer, Berlin, 1980.
  1437. Nicole Groewe and Werner Roemisch. A stochastic programming model for optimal power dispatch: Stability and numerical treatment. In Stochastic optimization. Numerical methods and technical applications, Proc. GAMM/IFIP-Workshop, Neubiberg/Ger. 1990, Lect. Notes Econ. Math. Syst. 379, 111-139, 1992.
  1438. M.A. Grove. A surrogate for linear programs with random requirements. Eur. J. Oper. Res. 34, No.3, 399-402, 1988.
  1439. Nicole Gröwe, Werner Römisch, and Rüdiger Schultz. A simple recourse model for power dispatch under uncertain demand. Ann. Oper. Res., 59:135-164, 1995. Models for planning under uncertainty.
  1440. N. Gröwe-Kuska, K. C. Kiwiel, M. P. Nowak, W. Römisch, and I. Wegner. Power management in a hydro-thermal system under uncertainty by Lagrangian relaxation. In C. Greengard and A. Ruszczy\'nski, editors, Decision Making under Uncertainty: Energy and Power, volume 128 of IMA volumes on Mathematics and its Applications, pages 39-70. Springer-Verlag, 2002.
  1441. N. Gröwe-Kuska, K.C. Kiwiel, M.P. Nowak, W. Römisch, and I. Wegner. Power management under uncertainty by lagrangian relaxation. In Proceedings of the 6th International Conference Probabilistic Methods Applied to Power Systems (PMAPS 2000), volume 2, INESC Porto, 2000.
  1442. Viviane Grunert da Fonseca, Carlos M. Fonseca, and Andreia O. Hall. Inferential performance assessment of stochastic optimisers and the attainment function. In Evolutionary multi-criterion optimization (Zurich, 2001), volume 1993 of Lecture Notes in Comput. Sci., pages 213-225. Springer, Berlin, 2001.
  1443. Fu Wen Gu. Density estimation of measurable optimal value functions and measurable solutions in stochastic programming. J. Chengdu Univ. Sci. Tech., 2:143-146, 1987.
  1444. Fu Wen Gu. Existence of optimal solutions for probabilistic constrained linear programming problems. J. Math. Res. Exposition, 15(2):293-296, 1995.
  1445. Fu Wen Gu. An approximation method for a class of constrained probabilistic programs and its convergence. Sichuan Daxue Xuebao, 34(4):399-405, 1997.
  1446. Fuwen Gu. Estimating the density function of optimal value function and measurable solution of stochastic programming. J. Chengdu Univ. Sci. Technol. 1987, No.2, 143-146, 1987.
  1447. Jun Gu. Randomized and deterministic local search for SAT and scheduling problems. In Randomization methods in algorithm design (Princeton, NJ, 1997), pages 61-108. Amer. Math. Soc., Providence, RI, 1999.
  1448. S. Guan and S.-C. Fang. Linear programming with stochastic elements: an on-line approach. Comput. Math. Appl., 33(9):61-82, 1997.
  1449. Sichong Guan and Shu-Cherng Fang. A global-filtering algorithm for linear programming problems with stochastic elements. Math. Methods Oper. Res., 48(3):287-316, 1998.
  1450. Yongpei Guan, Shabbir Ahmed, and George L. Nemhauser. A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. Stochastic Programming E-Print Series, http://www.speps.org, 2004.
  1451. Yongpei Guan, Shabbir Ahmed, and George L. Nemhauser. Cutting planes for multi-stage stochastic integer programs. Stochastic Programming E-Print Series, http://www.speps.org, 2006.
  1452. Yongpei Guan, Shabbir Ahmed, George L. Nemhauser, and Andrew J. Miller. A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. Math. Program., 105(1, Ser. A):55-84, 2006.
  1453. Yongpei Guan and Andrew Miller. Polynomial time algorithms for stochastic uncapacitated lot-sizing problems. Optimization Online, http://www.optimization-online.org, 2006.
  1454. J. Guddat, W. Roemisch, and R. Schultz. Some applications of mathematical programming techniques in optimal power dispatch. Computing 49, No.3, 193-200, 1992.
  1455. Juergen Guddat, Francisco Guerra Vasquez, Klaus Tammer, and Klaus Wendler. Multiobjective and stochastic optimization based on parametric optimization. Mathematical Research, 26. Berlin: Akademie-Verlag., 1985.
  1456. Herbert Guelicher. Nichtlineares Programmieren unter stochastischen Nebenbedingungen. Eine Untersuchung im Verkehrssektor., 1964.
  1457. Franco Guerriero and John Miltenburg. The stochastic U-line balancing problem. Naval Res. Logist., 50(1):31-57, 2003.
  1458. Roger Guesnerie. Sur l'usage de la notion de probabilités subjectives. Rev. Française Automat. Informat. Recherche Opérationnelle, 6(Ser. V-1):31-46, 1972.
  1459. Harvey S. Gunderson, James G. Morris, and Howard E. Thompson. Stochastic programming with recourse: A modification from an applications viewpoint. J. Oper. Res. Soc. 29, 769-778, 1978.
  1460. Xin Guo and Larry Shepp. Option pricing in a world with arbitrage. In Stochastic optimization: algorithms and applications (Gainesville, FL, 2000), volume 54 of Appl. Optim., pages 87-96. Kluwer Acad. Publ., Dordrecht, 2001.
  1461. A.M. Gupal. A certain stochastic programming problem with constraints of a probabilistic nature. Kibernetika (Kiev), 6:94-100, 1974.
  1462. A.M. Gupal. Eine Optimierungsmethode mit nichtstationaeren Restriktionen. Kibernetika, Kiev 1974, Nr. 3, 131-133, 1974.
  1463. A.M. Gupal. A method of optimization under nonstationary conditions. Kibernetika (Kiev), 3:131-133, 1974.
  1464. A.M. Gupal. Ueber ein Problem der stochastischen Programmierung mit Beschraenkungen von wahrscheinlichkeitstheoretischer Natur. Kibernetika, Kiev 1974, Nr. 6, 94-100, 1974.
  1465. A.M. Gupal. A method for the solution of stochastic programming problems. In Methods of operations research and reliability theory in systems analysis (Russian), pages 97-105, Kiev, 1976. Akad. Nauk Ukrain. SSR Inst. Kibernet.
  1466. A.M. Gupal. Direct method of solution of stochastic programming problems. Automat. Remote Control, 38(4, part 1):502-506, 1977.
  1467. A.M. Gupal. Algorithms for the random search of an extremum of non-differentiable functions. Probl. Sluchajnogo Poiska 6, 121-129, 1978.
  1468. A.M. Gupal. A method of solving stochastic problems with constraints of a probabilistic nature. Engrg. Cybernetics, 17(1):26-31 (1980), 1979.
  1469. A.M. Gupal. Stochastic Methods for Solving Nonsmooth Extremal Problems. Naukova Dumka, Kiev, 1979. (in Russian).
  1470. A.M. Gupal. Stochastic methods of minimization of nondifferentiable functions. Autom. Remote Control 40, 529-534 translation from Avtom. Telemekh. 1979, No.4, 61-66 (1979)., 1979.
  1471. A.M. Gupal and L.G. Bazenov. A stochastic analogue of the conjugate gradient method. Kibernetika (Kiev), 1:125-126, 1972.
  1472. A.M. Gupal and L.G. Bazenov. A stochastic linearization method. Kibernetika (Kiev), 3:116-117, 1972.
  1473. A.M. Gupal and V.B. Dubrovskii. Finite-difference Arrow-Hurwicz method with averaging. Kibernetika (Kiev), 4:iv, 120-122, 136, 1985.
  1474. A.M. Gupal and F. Mirzoahmedov. A way of regulating the step in stochastic programming methods. Kibernetika (Kiev), 1:133-134, 1978.
  1475. Anupam Gupta, Martin Pál, Ramamoorthi Ravi, and Amitabh Sinha. What about Wednesday? Approximation algorithms for multistage stochastic optimization. In Approximation, randomization and combinatorial optimization, volume 3624 of Lecture Notes in Comput. Sci., pages 86-98. Springer, Berlin, 2005.
  1476. Anupam Gupta, R. Ravi, and Amitabh Sinha. LP rounding approximation algorithms for stochastic network design. Math. Oper. Res., 32(2):345-364, 2007.
  1477. N.K. Gupta. Direct search computational methods for maximum likelihood parameter estimation. In Proc. 1978 IEEE Conf. on decision and control, incl. 17th Symp. on adaptive processes, San Diego/Calif. 1979, 921-922, 1979.
  1478. P.K. Gupta and Man Mohan. Linear programming and theory of games. 3rd extensively rev. ed. Tracts in Operations Research. New Delhi: Sultan Chand & Sons, Publishers., 1981.
  1479. P.K. Gupta and Rakesh Kumar Verma. Optimal resource allocation in a complex queueing system. Math. Operationsforsch. Stat., Ser. Optimization 11, 507-512, 1980.
  1480. Sandipan Gupta and M. Chakraborty. Stochastic fuzzy mathematical programming and decision. J. Fuzzy Math., 6(3):637-647, 1998.
  1481. S.N. Gupta and A.K. Jain. Optimization with the ratio of independent normal variates. Acta Cienc. Indica Math., 12(3):209-212, 1986.
  1482. S.N. Gupta, A.K. Jain, and Kanti Swarup. Stochastic linear fractional programming with the ratio of independent Cauchy variates. Naval Res. Logist., 34(2):293-305, 1987.
  1483. S.N. Gupta and Rajeev Kumar Jain. Stochastic fractional programming under chance constraints with random technology matrix. Acta Cienc. Indica Math., 12(3):191-198, 1986.
  1484. S.N. Gupta and Kanti Swarup. Note on stochastic programming for minimization of variance. New Zealand Oper. Res., 8(2):185-187, 1980.
  1485. S.N. Gupta, Kanti Swarup, and Banwarilal. Stochastic fractional programming under chance constraints with random technology matrix. Gujarat Statist. Rev., 8(1):23-34, 1981.
  1486. G. Gürkan. Performance Optimization in Simulation: Sample-Path Optimization of Buffer Allocations in Tandem Lines. Ph.D. Dissertation, Department of Industrial Engineering, University of Wisconsin-Madison, Madison, WI, 1996.
  1487. Gül Gürkan, A. Yonca Özge, and Stephen M. Robinson. Sample-path solution of stochastic variational inequalities. Math. Program., 84(2, Ser. A):313-333, 1999.
  1488. O.V. Guseva. On convergence of the random search method. Kibernetika, Kiev 1971, No.6, 143-145, 1971.
  1489. O.V. Guseva. Random minimization without computation of derivatives. Kibernetika (Kiev), 1:117-120, 1974.
  1490. Walter J. Gutjahr and Georg Ch. Pflug. Simulated annealing for noisy cost functions. J. Global Optim., 8(1):1-13, 1996.
  1491. Knut Haase. Lotsizing and scheduling for production planning. Lecture Notes in Economics and Mathematical Systems 408. Springer-Verlag, 1994.
  1492. K. Hagglof. The implementation of the stochastic branch and bound method for applications in river basin water quality management. IIASA Working Paper WP-96-89, Laxenburg, Austria, 1996.
  1493. A. Hahnewald-Busch and V. Nollau. An approximation procedure for stochastic dynamic programming in countable state space. Math. Operationsforsch. Stat., Ser. Optimization 9, 109-117, 1978.
  1494. Bruce Hajek. Optimization by simulated annealing: a necessary and sufficient condition for convergence. In Adaptive statistical procedures and related topics (Upton, N.Y., 1985), volume 8 of IMS Lecture Notes-Monograph Ser., pages 417-427. Inst. Math. Statist., Hayward, Calif., 1986.
  1495. Bruce Hajek. Cooling schedules for optimal annealing. Math. Oper. Res. 13, No.2, 311-329, 1988.
  1496. Sylvia Halasz. On a stochastic programming problem with random coefficients. In Prog. Oper. Res., Eger 1974, Colloq. Math. Soc. Janos Bolyai 12, 493-498 , 1976.
  1497. Keshava P. Halemane and Ignacio E. Grossmann. A remark on the paper: "Theoretical and computational aspects of the optimal design centering, tolerancing, and tuning problem"\ [IEEE Trans. Circuits and Systems 26 (1979), no. 9, 795-813; MR 80h:94045] by E. Polak and A. Sangiovanni-Vincentelli. IEEE Trans. Circuits and Systems, 28(2):163-164, 1981.
  1498. S. Hamadene and J.-P. Lepeltier. Zero-sum stochastic differential games and backward equations. Systems Control Lett., 24(4):259-263, 1995.
  1499. Saïd Hamadene and Jean-Pierre Lepeltier. Points d'équilibre dans les jeux stochastiques de somme non nulle. C.R. Acad. Sci. Paris Sér. I Math., 318(3):251-256, 1994.
  1500. Alexandru Hampu. Duality for multiobjective stochastic programming. Gen. Math., 9(1-2):15-22, 2001.
  1501. Alexandru Hampu. A stochastic programming model: the problem of minimum-risk with simple recourse. Int. J. Comput. Numer. Anal. Appl., 2(3):273-281, 2002.
  1502. Kum Sun Han and Ryong Sop Jang. A theoretical consideration of stochastic improper linear programming. Su-hak, 4:21-23, 1994.
  1503. Gary Handler. Termination policies for a two-state stochastic process. Naval Res. Logist. Quart. 19, 281-292, 1972.
  1504. Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão, Fabien Chauny, and Sylvain Perron. Probabilistic satisfiability with imprecise probabilities. Internat. J. Approx. Reason., 24(2-3):171-189, 2000. Reasoning with imprecise probabilities (Ghent, 1999).
  1505. Behram Hansotia. Some special cases of stochastic programs with recourse. Operations Res., 25(2):361-363, 1977.
  1506. Behram J. Hansotia. Stochastic linear programs with simple recourse: the equivalent deterministic convex program for the normal, exponential, and Erlang cases. Naval Res. Logist. Quart., 27(2):257-272, 1980.
  1507. J. Harband. The existence of monotonic solutions of a nonlinear car-following equation. J. Math. Anal. Appl., 57(2):257-272, 1977.
  1508. Jr. Harris, Frederick C. A stochastic optimization algorithm for Steiner minimal trees. In Proceedings of the Twenty-fifth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1994), volume 105, pages 54-64, 1994.
  1509. William E. Hart. Sequential stopping rules for random optimization methods with applications to multistart local search. SIAM J. Optim., 9(1):270-290 (electronic), 1999.
  1510. Peter R. Hartley. Value function approximation in the presence of uncertainty and inequality constraints. An application to the demand for credit cards. J. Econom. Dynam. Control, 20(1-3):63-92, 1996.
  1511. R. Hartley. Inequalities in completely convex stochastic programming. J. Math. Anal. Appl., 75(2):373-384, 1980.
  1512. Charles M. Harvey. Stochastic programming models for decreasing risk aversion. J. Oper. Res. Soc., 32(10):885-889, 1981.
  1513. Kurt Hässig. Stochastische lineare Programmierung und ihre Anwendungsmöglichkeiten in der Wirtschaft. Hochschule St. Gallen, St. Gallen, 1971. Dissertation der Hochschule St. Gallen für Wirtschafts- und Sozialwissenschaften zur Erlangung der Würde eines Doktors der Wirtschaftswissenschaften, Dissertation No. 399.
  1514. K. K. Haugen. A stochastic dynamic programming model for scheduling of offshore petroleum fields with resource uncertainty. European Journal of Operational Research, 88:88-100, 1993.
  1515. Kjetil K. Haugen, Arne Løkketangen, and David L. Woodruff. Progressive hedging as a meta-heuristic applied to stochastic lot-sizing. European J. Oper. Res., 132(1):116-122, 2001.
  1516. Kjetil K. Haugen and Stein W. Wallace. Stochastic programming: potential hazards when random variables reflect market interaction. Ann. Oper. Res., 142:119-127, 2006.
  1517. D. Haugland, A. Hallefjord, and H. Asheim. Models for petroleum field exploitation. European Journal of Operational Research, 37(1):58-72, 1988.
  1518. Dag Haugland and Stein W. Wallace. Solving many linear programs that differ only in the righthand side. European J. Oper. Res., 37(3):318-324, 1988.
  1519. H. Hauptmann. A statistic for judging solutions of the travelling salesman problem. In IX. Oberwolfach Conference on Operations Research (Oberwolfach, 1978), volume 36 of Operations Res. Verfahren, pages 61-71. Hain, Königstein/Ts., 1980.
  1520. A. Haurie, Y. Smeers, and G. Zaccour. Toward a contract portfolio management model for a gas producing firm. INFOR, 30(3):257-273, 1992.
  1521. A. Haurie, G. Zaccour, and Y. Smeers. Stochastic equilibrium programming for dynamic oligopolistic markets. J. Optim. Theory Appl., 66(2):243-253, 1990.
  1522. Alain Haurie and Pierre L'Ecuyer. Approximation and bounds in discrete event dynamic programming. IEEE Trans. Autom. Control AC-31, 227-235, 1986.
  1523. Alain Haurie and Francesco Moresino. Computation of S-adapted equilibria in piecewise deterministic games via stochastic programming methods. In Advances in dynamic games and applications (Maastricht, 1998), pages 225-252. Birkhäuser Boston, Boston, MA, 2001.
  1524. Kelly J. Hayhurst and Douglas R. Shier. A factoring approach for the stochastic shortest path problem. Oper. Res. Lett., 10(6):329-334, 1991.
  1525. Zhi Yong He and Chong Chao Huang. Genetic algorithm based on simulation for two-stage stochastic programming. J. Math. (Wuhan), 24(6):690-694, 2004.
  1526. Bernd Heidergott. A weak derivative approach to optimization of threshold parameters in a multicomponent maintenance system. J. Appl. Probab., 38(2):386-406, 2001.
  1527. T. Heikkinen and A. Prékopa. Optimal power control in a wireless network using a model with stochastic link coefficients. Naval Res. Logist., 52(2):178-192, 2005.
  1528. W.-R. Heilmann. Solving a dynamic program by linear programming - general state and action spaces. In Proc. Oper. Res. 7, Vortr. Jahrestag. DGOR, Kiel 1977, 31-38, 1978.
  1529. W.-R. Heilmann. Solving stochastic dynamic programming problems by linear programming-an annotated bibliography. Z. Operations Res. Ser. A-B, 22(1):A43-A53, 1978.
  1530. Wolf-Rüdiger Heilmann. Linear programming of dynamic programs with unbounded rewards. In Operations Research Verfahren, XXIV, pages 94-105, Meisenheim, 1977. Hain.
  1531. Wolf-Rüdiger Heilmann. Optimal selectors for stochastic linear programs. Appl. Math. Optim., 4(2):139-142, 1977/78.
  1532. Wolf-Rüdiger Heilmann. Generalized linear programming of finite-stage dynamic programs. In Second Symposium on Operations Research (Rheinisch-Westfälische Tech. Hochsch. Aachen, Aachen, 1977), Teil 1, Operations Res. Verfahren, XXVIII, pages 153-167. Hain, Königstein/Ts., 1978.
  1533. Wolf-Rüdiger Heilmann. A note on sequential minimax rules for stochastic linear programs. In Recent results in stochastic programming (Proc. Meeting, Oberwolfach, 1979), volume 179 of Lecture Notes in Econom. and Math. Systems, pages 59-65. Springer, Berlin, 1980.
  1534. Wolf-Rüdiger Heilmann. A note on chance-constrained programming. J. Oper. Res. Soc., 34(6):533-537, 1983.
  1535. Wolf-Ruediger Heilmann. Stochastische dynamische Optimierung als Spezialfall linearer Optimierung in halbgeordneten Vektorraeumen. Manuscr. Math. 23, 57-66, 1977.
  1536. Wolf-Ruediger Heilmann. A linear programming approach to general non-stationary dynamic programming problems. Math. Operationsforsch. Stat., Ser. Optimization 10, 325-333, 1979.
  1537. Wolf-Ruediger Heilmann. Solving multistage stochastic linear programming problems by non- stationary dynamic programming. Oper. Res. Verfahren 33, 173-184, 1979.
  1538. Wolf-Ruediger Heilmann. Approximations and error bounds for multistage stochastic linear programs. Part 2: Approximation by a "larger" model. Methods Oper. Res. 37, 349-356, 1980.
  1539. Wolf-Ruediger Heilmann. A mathematical programming approach to Strassen's theorem on distributions with given marginals. Math. Operationsforsch. Stat., Ser. Optimization 12, 593-596, 1981.
  1540. Stanislaw Heilpern. Selected problems in the theory of fuzzy sets. Mat. Stos. (3), 16:27-38 (1981), 1980.
  1541. Thomas Heinze. An algorithm for multistage stochastic integer programs. In CTW2006-Cologne-Twente Workshop on Graphs and Combinatorial Optimization, volume 25 of Electron. Notes Discrete Math., page 69 (electronic). Elsevier, Amsterdam, 2006.
  1542. Thomas Heinze and Rüdiger Schultz. A branch-and-bound method for multistage stochastic integer programs with risk objectives. Stochastic Programming E-Print Series, http://www.speps.org, 2007.
  1543. H. Heitsch, W. Römisch, and C. Strugarek. Stability of multistage stochastic programs. SIAM J. Optim., 17(2):511-525 (electronic), 2006.
  1544. Holger Heitsch and Werner Römisch. Scenario tree modelling for multistage stochastic programs. Stochastic Programming E-Print Series, http://www.speps.org, 2006.
  1545. Holger Heitsch, Werner Römisch, and Cyrille Strugarek. Stability of multistage stochastic programs. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  1546. Michael Heitzer and Manfred Staat. Limit and shakedown analysis with uncertain data. In Stochastic optimization techniques (Neubiberg/Munich, 2000), volume 513 of Lecture Notes in Econom. and Math. Systems, pages 253-267. Springer, Berlin, 2002.
  1547. Thorkell Helgason and Stein W. Wallace. Approximate scenario solutions in the progressive hedging algorithm. A numerical study with an application to fisheries management. Ann. Oper. Res., 31(1-4):425-444, 1991. Stochastic programming, Part II (Ann Arbor, MI, 1989).
  1548. G. Hellwig, P. Kall, and P. Abel, editors. Statistical Methods for Decission Processes. Daimler Benz AG, Stuttgart-Möhringen, 1994.
  1549. K. Hellwig and J. Huelsmann. Ueber ein Modell der Investitionsprogrammplanung unter Unsicherheit. In Oper. Res. Verf. 18, VI. Oberwolfach-Tag. Oper. Res. 1973, 141-146, 1974.
  1550. Raymond Hemmecke and Rüdiger Schultz. Decomposition methods for two-stage stochastic integer programs. In Online optimization of large scale systems, pages 601-622. Springer, Berlin, 2001.
  1551. Raymond Hemmecke and Rüdiger Schultz. Decomposition of test sets in stochastic integer programming. Stochastic Programming E-Print Series, http://www.speps.org, 2001.
  1552. A.L. Hempenius. A note on the relationship between the feasible regions of several types of chance constraints. Statistica Neerlandica, 27:185-186, 1973.
  1553. P. Hénaff. Hedging exotic derivatives through stochastic optimization. J. Econom. Dynam. Control, 22(8-9):1453-1466, 1998. Algorithms and economic dynamics (Geneva, 1996).
  1554. Alena Henclova. Notes on free lunch in the limit and pricing by conjugate duality theory. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  1555. Eligius M. T. Hendrix and Olivier Klepper. On uniform covering, adaptive random search and raspberries. J. Global Optim., 18(2):143-163, 2000.
  1556. Eligius M. T. Hendrix, P. M. Ortigosa, and I. García. On success rates for controlled random search. J. Global Optim., 21(3):239-263, 2001. International Workshop on Global Optimization, Part 3 (Florence, 1999).
  1557. R. Henrion. On the connectedness of probabilistic constraint sets. J. Optim. Theory Appl., 112(3):657-663, 2002.
  1558. René Henrion. Characterization of stability for cone increasing constraint mappings. Set-Valued Anal., 5(4):323-349, 1997.
  1559. René Henrion. A note on the connectedness of chance constraints. Stochastic Programming E-Print Series, http://www.speps.org, 2000.
  1560. René Henrion. Qualitative stability of convex programs with probabilistic constraints. In Optimization (Namur, 1998), pages 164-180. Springer, Berlin, 2000.
  1561. René Henrion. Structure and stability of probabilistic storage level constraints. Stochastic Programming E-Print Series, http://www.speps.org, 2000.
  1562. René Henrion. Structure and stability of programs with probabilistic storage level constraints. In Stochastic optimization techniques (Neubiberg/Munich, 2000), volume 513 of Lecture Notes in Econom. and Math. Systems, pages 3-20. Springer, Berlin, 2002.
  1563. René Henrion. Perturbation analysis of chance-constrained programs under variation of all constraint data. In Dynamic stochastic optimization (Laxenburg, 2002), volume 532 of Lecture Notes in Econom. and Math. Systems, pages 257-274. Springer, Berlin, 2004.
  1564. René Henrion. Structural properties of linear probabilistic constraints. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  1565. René Henrion. Some remarks on value-at-risk optimization. Stochastic Programming E-Print Series, http://www.speps.org, 2006.
  1566. René Henrion, Christian Küchler, and Werner Römisch. Scenario reduction in stochastic programming with respect to discrepancy distances. Stochastic Programming E-Print Series, http://www.speps.org, 2006.
  1567. René Henrion, Pu Li, Andris Möller, Moritz Wendt, and Günter Wozny. Optimal control of a continuous distillation process under probabilistic constraints. In Online optimization of large scale systems, pages 499-517. Springer, Berlin, 2001.
  1568. René Henrion, Li Pu, Andris Möller, Marc C. Steinbach, Moritz Wendt, and Günter Wozny. Stochastic optimization for operating chemical processes under uncertainty. In Online optimization of large scale systems, pages 457-478. Springer, Berlin, 2001.
  1569. René Henrion and Werner Römisch. Metric regularity and quantitative stability in stochastic programs with probabilistic constraints. Math. Program., 84(1, Ser. A):55-88, 1999.
  1570. René Henrion and Werner Römisch. Stability of solutions to chance constrained stochastic programs. In Parametric optimization and related topics, V (Tokyo, 1997), pages 95-114. Lang, Frankfurt am Main, 2000.
  1571. René Henrion and Werner Römisch. Hölder and Lipschitz stability of solution sets in programs with probabilistic constraints. Stochastic Programming E-Print Series, http://www.speps.org, 2003.
  1572. René Henrion and Werner Römisch. Lipschitz and differentiability properties of quasi-concave and singular normal distribution functions. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  1573. René Henrion and Cyrille Strugarek. Convexity of chance constraints with independent random variables. Stochastic Programming E-Print Series, http://www.speps.org, 2006.
  1574. René Henrion and Tamas Szantai. Properties and Calculation of Singular Normal Distributions. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  1575. Antonio Heras and Ana G. Aguado. Stochastic goal programming. CEJOR Cent. Eur. J. Oper. Res., 7(3):139-158, 1999.
  1576. Ulrich Herkenrath and Radu Theodorescu. On a stochastic approximation procedure applied to the bandit problem. Elektron. Informationsverarb. Kybernet., 15(5-6):301-307, 1979.
  1577. Ted Herman. Probabilistic self-stabilization. Inf. Process. Lett. 35, No.2, 63-67, 1990.
  1578. Onesimo Hernandez-Lerma. Approximation and adaptive policies in discounted dynamic programming. Bol. Soc. Mat. Mex., II. Ser. 30, 25-35, 1985.
  1579. Onésimo Hernández-Lerma. Stochastic optimal control and infinite linear programming. In Second Symposium on Probability Theory and Stochastic Processes. First Mexican-Chilean Meeting on Stochastic Analysis (Spanish) (Guanajuato, 1992), volume 7 of Aportaciones Mat. Notas Investigación, pages 109-120. Soc. Mat. Mexicana, México City, 1992.
  1580. Morgan Herndon, Cary Perttunen, and Bruce Stuckman. Global optimization of a random walk function. Informatica, 3(2):198-224, 283, 291, 1992.
  1581. Christian Hess. Convergence of conditional expectations for unbounded random sets, integrands, and integral functionals. Math. Oper. Res., 16(3):627-649, 1991.
  1582. G.A. Heuer. On completely mixed strategies in bimatrix games. J. London math. Soc., II. Ser. 11, 17-20, 1975.
  1583. Daniel P. Heyman and Matthew J. Sobel. Stochastic models in operations research., volume II: Stochastic optimization. of McGraw-Hill series in quantitative methods for management. New York etc.: McGraw-Hill book company., 1984.
  1584. Norio Hibiki. Multi-period stochastic programming models using simulated paths for strategic asset allocation. J. Oper. Res. Soc. Japan, 44(2):169-193, 2001.
  1585. J.L. Higle and S. Sen. Epigraphical nesting: a unifying theory for the convergence of algorithms. Journal of Optimization Theory and Applications 84:339-360, 1995.
  1586. J.L. Higle and S. Sen. Stochastic decomposition: A statistical method for large scale stochastic linear programming. Kluwer Academic Publishers, Dordrecht, 1996.
  1587. Julia L. Higle, James C. Bean, and Robert L. Smith. Deterministic equivalence in stochastic infinite horizon problems. Math. Oper. Res., 15(3):396-407, 1990.
  1588. Julia L. Higle, Wing W. Lowe, and Ronald Odio. Conditional stochastic decomposition: An algorithmic interface for optimization and simulation. Oper. Res. 42, No.2, 311-322, 1994.
  1589. Julia L. Higle and Suvrajeet Sen. Statistical verification of optimality conditions for stochastic programs with recourse. Ann. Oper. Res., 30(1-4):215-240, 1991. Stochastic programming, Part I (Ann Arbor, MI, 1989).
  1590. Julia L. Higle and Suvrajeet Sen. Stochastic decomposition: an algorithm for two-stage linear programs with recourse. Math. Oper. Res., 16(3):650-669, 1991.
  1591. Julia L. Higle and Suvrajeet Sen. On the convergence of algorithms with implications for stochastic and nondifferentiable optimization. Math. Oper. Res., 17(1):112-131, 1992.
  1592. Julia L. Higle and Suvrajeet Sen. Finite master programs in regularized stochastic decomposition. Math. Programming, 67(2, Ser. A):143-168, 1994.
  1593. Julia L. Higle and Suvrajeet Sen. Statistical approximations for recourse constrained stochastic programs. Ann. Oper. Res., 56:157-175, 1995. Stochastic programming (Udine, 1992).
  1594. Julia L. Higle and Suvrajeet Sen. Duality and statistical tests of optimality for two stage stochastic programs. Math. Programming (Ser. B), 75(2):257-275, 1996. Approximation and computation in stochastic programming.
  1595. Julia L. Higle and Suvrajeet Sen. Stochastic decomposition, volume 8 of Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Dordrecht, 1996. A statistical method for large scale stochastic linear programming.
  1596. Julia L. Higle and Suvrajeet Sen. Statistical approximations for stochastic linear programming problems. Ann. Oper. Res., 85:173-192, 1999. Stochastic programming. State of the art, 1998 (Vancouver, BC).
  1597. Julia L. Higle and Suvrajeet Sen. Algorithmic implications of duality in stochastic programs. In System modelling and optimization (Cambridge, 1999), pages 179-188. Kluwer Acad. Publ., Boston, MA, 2000.
  1598. Julia L. Higle and Suvrajeet Sen. Multistage stochastic convex programs: duality and its implications. Ann. Oper. Res., 142:129-146, 2006.
  1599. Julia L. Higle and Lei Zhao. Adaptive and nonadaptive samples in solving stochastic linear programs. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  1600. Regina Hildenbrandt. Kostengünstige Behandlung stochastischer Schwankungen der Bedarfsgrößen beim Transportproblem durch ein nichtlineares diskretes Optimierungsproblem. Optimization, 20(3):335-353, 1989.
  1601. Raymond R. Hill and Charles H. Reilly. Multivariate composite distributions for coefficients in synthetic optimization problems. European J. Oper. Res., 121(1):64-77, 2000.
  1602. S.D. Hill and M.C. Fu. Transfer optimization via simultaneous perturbation stochastic approximation. In C. Alexopoulos, K. Kang, W.R. Lilegdon, and D. Goldsman, editors, Proceedings of the Winter Simulation Conference, pages 242-249, 1995.
  1603. Stacy D. Hill. Reduced gradient computation in prediction error identification. IEEE Trans. Autom. Control AC-30, 776-778, 1985.
  1604. Randall S. Hiller and Jonathan Eckstein. Stochastic dedication: Designing fixed income portfolios using massively parallel Benders decomposition. Manage. Sci. 39, No.11, 1422-1438, 1993.
  1605. Petri Hilli, Matti Koivu, Teemu Pennanen, and Antero Ranne. A stochastic programming model for asset liability management of a finnish pension company. Stochastic Programming E-Print Series, http://www.speps.org, 2003.
  1606. A.L. Hillman and P.L. Swan. Club participation under uncertainty. Econom. Lett., 4(4):307-312, 1979/80.
  1607. K. Hinderer. Neuere Resultate in der stochastischen dynamischen Optimierung. Z. Angew. Math. Mech., 55(4):T16-T26, 1975.
  1608. K. Hinderer and M. Stieglitz. A dynamic multi-item two-activity problem. OR Spektrum 15, No.2, 83-94, 1993.
  1609. Karl Hinderer. Instationaere dynamische Optimierung bei schwachen Voraussetzungen ueber die Gewinnfunktionen. Abh. Math. Sem. Univ. Hamburg 36, 208-223, 1971.
  1610. Karl Hinderer and Michael Stieglitz. Increasing and Lipschitz continuous minimizers in one-dimensional linear-convex systems without constraints: the continuous and the discrete case. Math. Methods Oper. Res., 44(2):189-204, 1996.
  1611. K.F. Hinderer. On the structure of solutions of stochastic dynamic programs. In Proceedings of the seventh conference on probability theory (Bra sov, 1982), pages 173-182, Utrecht, 1985. VNU Sci. Press.
  1612. Ayman Hindy, Chi-fu Huang, and Steven H. Zhu. Numerical analysis of a free-boundary singular control problem in financial economics. J. Econom. Dynam. Control, 21(2-3):297-327, 1997.
  1613. Ja. Hion. Ueber die Ganzzahligkeit der Ecken eines konvexen Polyeders. Ucenye Zapiski Tartu. gosudarst. Univ. 305, Trudy Mat. Meh. 12, 259-268, 1972.
  1614. J. Hirche. Basishäufigkeit bei linearen Restriktionen. Math. Operationsforsch. Statist. Ser. Optim., 10(1):27-37, 1979.
  1615. J.-B. Hiriart-Urruty. Conditions nécessaires d'optimalité pour un programme stochastique avec recours. SIAM J. Control Optimization, 16(2):317-329, 1978.
  1616. J.-B. Hiriart-Urruty. Extension of Lipschitz integrands and minimization of nonconvex integral functionals. Applications to the optimal recourse problem in discrete time. Probab. Math. Statist., 3(1):19-36 (1983), 1982.
  1617. J.B. Hiriart-Urruty. Algorithms of penalization type and of dual type for the solution of stochastic optimization problems with stochastic constraints. In Recent Dev. Stat., Proc. Eur. Meet. Stat. Grenoble 1976, 183-219, 1977.
  1618. Jean-Baptiste Hiriart-Urruty. étude de quelques propriepergeometric integral. Trudy Sem. Kraev. Zadacam, 10:90-94, 1973.
  1619. Jean-Baptiste Hiriart-Urruty. Etude de quelques proprietes de la fonctionnelle moyenne et de l'inf- convolution continue en analyse convexe stochastique. C. r. Acad. Sci., Paris, Ser. A 280, 129-132, 1975.
  1620. Jean-Baptiste Hiriart-Urruty. About properties of the mean value functional and of the continuous infimal convolution in stochastic convex analysis. In Optim. Tech., Part 2, Proc. 7th IFIP Conf., Nice 1975, Lect. Notes Comput. Sci 41, 763-789, 1976.
  1621. Jean-Baptiste Hiriart-Urruty. Algorithmes stochastiques de type pénalisation et de type dual pour les problèmes avec observations bruitées sur l'objectif et sur les contraintes. C.R. Acad. Sci. Paris Sér. A-B, 282(16):Aiii, A907-A910, 1976.
  1622. Jean-Baptiste Hiriart-Urruty. Conditions nécessaires d'optimalité pour un programme stochastique avec recours. C.R. Acad. Sci. Paris Ser. A-B, 283(13):Aii, A943-A946, 1976.
  1623. Jean-Baptiste Hiriart-Urruty. Contributions à la programmation mathématique: cas déterministe et stochastique. Université de Clermont-Ferrand II, Clermont, 1977. Thèse présentée à l'Université de Clermont-Ferrand II pour obtenir le grade de Docteur ès Sciences Mathématiques, Série E, No. 247.
  1624. M. Hlynka and J.N. Sheahan. The secretary problem for a random walk. Stochastic Process. Appl., 28(2):317-325, 1988.
  1625. Y.-C. Ho and D. L. Pepyne. Simple explanation of the no free lunch theorem of optimization. Kibernet. Sistem. Anal., (2):164-172, 191, 2002.
  1626. Y.C. Ho and T.S. Chang. Another look at the nonclassical information structure problem. IEEE Trans. Autom. Control AC-25, 537-540, 1980.
  1627. Yu-Chi Ho and Shu Li. Extensions of infinitesimal perturbation analysis. IEEE Trans. Autom. Control AC-33, No.5, 427-438, 1988.
  1628. B. F. Hobbs and Y. D. Ji. Stochastic programming-based bounding of expected production costs for multiarea electric power systems. Operations Research, 47(6):836-848, 1999.
  1629. R. Hochreiter, G. Ch. Pflug, and D. Wozabal. Multi-stage stochastic electricity portfolio optimization in liberalized energy markets. In System modeling and optimization, volume 199 of IFIP Int. Fed. Inf. Process., pages 219-226. Springer, New York, 2006.
  1630. Ronald Hochreiter. Scenario Optimization for Multi-Stage Stochastic Programming Problems. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  1631. A. Hoffman, J. Lee, and J. Williams. New upper bounds for maximum-entropy sampling. In mODa 6-advances in model-oriented design and analysis (Puchberg/Schneeberg, 2001), Contrib. Statist., pages 143-153. Physica, Heidelberg, 2001.
  1632. Matthias Hoffmann. Verallgemeinerung eines stochastischen Quasigradientenverfahrens und seine Anwendung auf die Optimierung eines Bediensystems mit unbekannten parametern. Math. Operationsforsch. Statist. Ser. Optim., 14(1):91-109, 1983.
  1633. Balder von Hohenbalken and Gerhard Tintner. Mathematische Programmierung und ihre Anwendung auf die Wirtschaft. Z. Nationaloekonomie 34, 1-44, 1974.
  1634. John H. Holland. Genetic algorithms and the optimal allocation of trials. SIAM J. Computing 2, 88-105, 1973.
  1635. Kaj Holmberg. Efficient decomposition and linearization methods for the stochastic transportation problem. Comput. Optim. Appl., 4(4):293-316, 1995.
  1636. Kaj Holmberg and Kurt O. Joernsten. Cross decomposition applied to the stochastic transportation problem. Eur. J. Oper. Res. 17, 361-368, 1984.
  1637. K. Holmqvist, A. Migdalas, and P.M. Pardalos. Greedy randomized adaptive search for a location problem with economies of scale. In Developments in global optimization (Szeged, 1995), volume 18 of Nonconvex Optim. Appl., pages 301-313. Kluwer Acad. Publ., Dordrecht, 1997.
  1638. Tito Homem-de-Mello. On the convergence of simulated annealing for discrete stochastic optimization. Stochastic Programming E-Print Series, http://www.speps.org, 2000.
  1639. Tito Homem-de Mello. Estimation of derivatives of nonsmooth performance measures in regenerative systems. Math. Oper. Res., 26(4):741-768, 2001.
  1640. Tito Homem-de Mello. Monte Carlo methods for discrete stochastic optimization. In Stochastic optimization: algorithms and applications (Gainesville, FL, 2000), pages 97-119. Kluwer Acad. Publ., Dordrecht, 2001.
  1641. Tito Homem-de Mello. On rates of convergence for stochastic optimization problems under non-i.i.d. sampling. Stochastic Programming E-Print Series, http://www.speps.org, 2006.
  1642. W. Honeit. Zum mathematischen Begriff des mehrstufigen Optimalsteuerungsproblems. Wiss. Z., Tech. Hochsch. Leipz. 6, 167-182, 1982.
  1643. Han Hoogeveen and Marjan Van den Akker. Getting rid of stochasticity: applicable sometimes. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  1644. E. Höpfinger. Dynamic programming of stochastic activity networks with cycles. In Optimization techniques (Proc. Ninth IFIP Conf., Warsaw, 1979), Part 2, volume 23 of Lecture Notes in Control and Information Sci., pages 309-315, Berlin, 1980. Springer.
  1645. H.S. Hopkins. Experimental measurement of a 4-D phase space map of a heavy ion beam. Ph.D. thesis, Dept. of Nuclear Engineering, University of California, Berkeley, December 1997.
  1646. A. Hordijk and L.C.M. Kallenberg. Linear programming and Markov decision processes. In Oper. Res. Verf. 28, 2nd Symp. Oper. Res., Teil 1, Aachen 1977, 400-406 , 1978.
  1647. Arie Hordijk. On the convergence of the average expected return in dynamic programming. J. math. Analysis Appl. 46, 542-544, 1974.
  1648. V.Joseph Hotz and Robert A. Miller. Conditional choice probabilities and the estimation of dynamic models. Rev. Econ. Stud. 60, No.3, 497-529, 1993.
  1649. J. V. Howard. Rendezvous search on the interval and the circle. Oper. Res., 47(4):550-558, 1999.
  1650. H.R. Howson and N.G.F. Sancho. A new algorithm for the solution of multi-state dynamic programming problems. Math. Programming, 8:104-116, 1975.
  1651. Kjetil Høyland, Michal Kaut, and Stein W. Wallace. A heuristic for moment-matching scenario generation. Computational Optimization and Applications, 24(2-3):169-185, 2003.
  1652. Wei Shen Hsia. Bounds for the solution of a stochastic program with recourse. Bull. Inst. Math. Acad. Sinica, 4(2):307-311, 1976.
  1653. Wei Shen Hsia. On a stochastic program with simple recourse. J. Math. Anal. Appl., 58(3):705-712, 1977.
  1654. Wei Shen Hsia. Probability density function of a stochastic linear programming problem. Naval Res. Logist. Quart., 24(3):417-424, 1977.
  1655. Wei Shen Hsia. On a quadratic stochastic program with simple recourse. Bull. Inst. Math. Acad. Sinica, 7(1):87-97, 1979.
  1656. Jin Yan Hu and Shao Lin Ji. A backward stochastic differential equation method for a stochastic optimization problem. Shandong Daxue Xuebao Ziran Kexue Ban, 36(3):282-286, 2001.
  1657. C.C. Huang, I. Vertinsky, and W.T. Ziemba. Sharp bounds on the value of perfect information. Operations Res., 25(1):128-139, 1977.
  1658. C.C. Huang, D.A. Wehrung, and W.T. Ziemba. A homogeneous distribution problem with applications to finance. Management Sci. 23, 297-304, 1976.
  1659. 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 Res., 25(2):315-325, 1977.
  1660. Haijun Huang, Shouyang Wang, and Michael G. H. Bell. A bi-level formulation and quasi-Newton algorithm for stochastic equilibrium network design problem with elastic demand. J. Syst. Sci. Complex., 14(1):40-53, 2001.
  1661. Kai Huang and Shabbir Ahmed. The value of multi-stage stochastic programming in capacity planning under uncertainty. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  1662. Nan-Jing Huang. A new class of random completely generalized strongly nonlinear quasi-complementarity problems for random fuzzy mappings. Korean J. Comput. Appl. Math., 5(2):315-329, 1998.
  1663. Siming Huang. Average number of iterations of some polynomial interior-point-algorithms for linear programming. Sci. China Ser. A, 43(8):829-835, 2000.
  1664. G. Hübner. Sequential similarity transformation for solving finite-stage sub-Markov decision problems. In Third Symposium on Operations Research (Univ. Mannheim, Mannheim, 1978), Section 3, volume 33 of Operations Res. Verfahren, pages 197-207. Hain, Königstein/Ts., 1979.
  1665. Gerhard Hübner. On the fixed points of the optimal reward operator in stochastic dynamic programming with discount factor greater than one. Z. Angew. Math. Mech., 57(8):477-480, 1977.
  1666. J. Huelsmann. Spieltheoretische Ansaetze im stochastischen linearen Optimieren. In Oper. Res.-Verfahren 10, 236-243, 1970.
  1667. J. Huelsmann. Optimale Entscheidungen im zweistufigen stochastischen Programmieren als Loesung linearer Programme. In Operations Res.-Verf. 14, 316-321, 1972.
  1668. J. Hülsmann. Zweistufiges stochastisches Programmieren bei Unsicherheit über die Verteilung von (A, b, c). In Vierte Oberwolfach-Tagung über Operations Research (1971), Teil 2, pages 236-245. Operations Research-Verfahren, XIII, Meisenheim am Glan, 1972. Hain.
  1669. Suwarna Hulsurkar, M.P. Biswal, and S.B. Sinha. Fuzzy programming approach to multi-objective stochastic linear programming problems. Fuzzy Sets and Systems, 88(2):173-181, 1997.
  1670. David G. Humphrey and James R. Wilson. A revised simplex search procedure for stochastic simulation response surface optimization. INFORMS J. Comput., 12(4):272-283, 2000.
  1671. Yong Liang Huo, San Yang Liu, and Li Yu. Hausdorff convergence of e-approximate optimal solution sets in stochastic programming. Math. Appl. (Wuhan), 19(4):852-856, 2006.
  1672. Mohammad Lotfy Hussein and Mohamed Abd El-Hady Kassem. Interactive stability of multiobjective nonlinear programming problems with stochastic parameters. J. Fuzzy Math., 4(3):503-512, 1996.
  1673. Thong Nguyen Huu and Hao Tran Van. A stochastic algorithm for engineering optimization problems. Optimization Online, http://www.optimization-online.org, 2007.
  1674. Chii-Ruey Hwang and Shuenn Jyi Sheu. Singular perturbed Markov chains and exact behaviors of simulated annealing processes. J. Theoret. Probab., 5(2):223-249, 1992.
  1675. Masaaki Ida. Optimality on possibilistic linear programming with normal possibility distribution coefficient. Japanese J. Fuzzy Theory Systems, 7(3):349-360 (1996), 1995.
  1676. M.G. Ierapetritou and E.N. Pistikopoulos. Global optimization for stochastic planning, scheduling and design problems. In Global optimization in engineering design, volume 9 of Nonconvex Optim. Appl., pages 231-287. Kluwer Acad. Publ., Dordrecht, 1996.
  1677. G. Igelmund and F.J. Radermacher. Preselective strategies for the optimization of stochastic project networks under resource constraints. Networks, 13(1):1-28, 1983.
  1678. Koji Iida, Ryusuke Hohzaki, and Takesi Kaiho. Optimal investigating search maximizing the detection probability. J. Oper. Res. Soc. Japan, 40(3):294-309, 1997.
  1679. Tetsuo Iida. A non-stationary periodic review production-inventory model with uncertain production capacity and uncertain demand. European J. Oper. Res., 140(3):670-683, 2002.
  1680. Dan V. Iliescu and Viorel Gh. Voda. Some notes on Pareto distribution. Rev. Roumaine Math. Pures Appl., 24(4):597-609, 1979.
  1681. E.V. Iljin, A.V. Medvedev, and N.F. Novikov. On nonparametric algorithms of optimization. In Modelling and optimization of complex systems (Proc. IFIP-TC 7 Working Conf., Novosibirsk, 1978), volume 18 of Lecture Notes in Control and Information Sci., pages 198-206, Berlin, 1979. Springer.
  1682. B. Illing. Spieltheoretische Problemstellungen in der stochastischen linearen Optimierung. In XV. Int. Wiss. Kolloquium Tech. Hochsch. Ilmenau 1970, Abt. A, 9-13 , 1970.
  1683. B. Illing. Zur Anwendung spieltheoretischer Methoden in der stochastischen linearen Optimierung. Wiss. Z. Tech. Hochsch. Ilmenau 16, No.2/3, 11-16, 1970.
  1684. G. Infanger. Planning under Uncertainty: Solving Large-Scale Stochastic Linear Programs. Boyd and Fraser, Danvers, 1994.
  1685. G. Infanger and D.P. Morton. Cut sharing for multistage stochastic linear programs with interstage dependency. Mathematical Programming, 75(2):241-256, 1996.
  1686. Gerd Infanger. Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs. Ann. Oper. Res., 39(1-4):69-95 (1993), 1992.
  1687. Gerd Infanger. Stochastic programming for funding mortgage pools. Quant. Finance, 7(2):189-216, 2007.
  1688. R. Infante Macías. Note on stochastic linear programming: evolution and present status. I. Trabajos Estadíst., 23(1-2):9-49, 1971.
  1689. M. Inuiguchi. Stochastic programming problems versus fuzzy mathematical programming problems. Japanese J. Fuzzy Theory Systems, 4(1):97-109, 1992.
  1690. Masahiro Inuiguchi and Masatoshi Sakawa. A possibilistic linear program is equivalent to a stochastic linear program in a special case. Fuzzy Sets and Systems, 76(3):309-317, 1995.
  1691. A.D. Ioffe and D.B. Judin. Some non-linear problems o f stochastic programming. U.S.S.R. Comput. Math. Math. Phys. 1 No.1, 207-225 (1972)., 1970.
  1692. Hisao Ishibuchi and Hideo Tanaka. Interval 0-1 programming problem and product-mix analysis. J. Oper. Res. Soc. Japan 32, No.3, 352-370, 1989.
  1693. H. Ishii and T. Matsutomi. Confidence regional method of stochastic spanning tree problem. Math. Comput. Modelling, 22(10-12):77-82, 1995. Stochastic models in engineering, technology and management (Gold Coast, 1994).
  1694. Hiroaki Ishii and Toshio Nishida. Stochastic linear knapsack problem. Tech. Rep. Osaka Univ., 32(1630-1651):25-30, 1982.
  1695. Hiroaki Ishii and Toshio Nishida. Stochastic bottleneck spanning tree problem. Networks 13, 443-449, 1983.
  1696. Hiroaki Ishii and Toshio Nishida. Stochastic linear knapsack problem: probability maximization model. Math. Japon., 29(2):273-281, 1984.
  1697. Hiroaki Ishii and Toshio Nishida. The stochastic linear continuous type knapsack problem: a generalized P model. European J. Oper. Res., 19(1):118-124, 1985.
  1698. Hiroaki Ishii, Toshio Nishida, and Yasunori Nanbu. A generalized chance constraint programming problem. J. Operations Res. Soc. Japan, 21(1):124-168, 1978.
  1699. Hiroaki Ishii and Sh¯ogo Shiode. Chance constrained bottleneck spanning tree problem. Ann. Oper. Res., 56:177-187, 1995. Stochastic programming (Udine, 1992).
  1700. Hiroaki Ishii, Sh¯ogo Shiode, and Toshio Nishida. Chance constrained spanning tree problem. J. Oper. Res. Soc. Japan, 24(2):147-158, 1981.
  1701. Hiroaki Ishii, Sh¯ogo Shiode, Toshio Nishida, and Yoshikazu Namasuya. Stochastic spanning tree problem. Discrete Appl. Math., 3(4):263-273, 1981.
  1702. Hiroaki Ishii, Syogo Shiode, Toshio Nishida, and Katsurou Iguchi. An algorithm for a partially chance-constrained E-model. J. Oper. Res. Soc. Japan, 22(3):233-256, 1979.
  1703. Maged George Iskander. On solving stochastic fuzzy goal programming problem using a suggested interactive approach. J. Fuzzy Math., 9(2):437-446, 2001.
  1704. Maged George Iskander. A fuzzy weighted additive approach for stochastic fuzzy goal programming. Appl. Math. Comput., 154(2):543-553, 2004.
  1705. Maged George Iskander. Exponential membership function in stochastic fuzzy goal programming. Appl. Math. Comput., 173(2):782-791, 2006.
  1706. Hiroyuki Itami. Expected objective value of a stochastic linear program and the degree of uncertainty of parameters. Management Sci., 21(3):291-301, 1974/75.
  1707. M.N. Itbaev. Duality in problems of inexact and generalized linear programming. Izv. Akad. Nauk Kazakh. SSR Ser. Fiz.-Mat., 5:35-38, 1985.
  1708. Alfredo N. Iusem. On dual convergence and the rate of primal convergence of Bregman's convex programming method. SIAM J. Optim., 1(3):401-423, 1991.
  1709. N.A. Ivanchuk. Analysis of the efficiency of some controlled search procedures. Problems Inform. Transmission, 19(1):25-33, 1983.
  1710. Viktor Ivanovich Ivanenko. Information problems in control theory. Prace Nauk. Inst. Cybernet. Tech. Politech. Wroclaw. Ser. Konfer., 74(31):24-32, 1986.
  1711. V.M. Ivanin. An estimate of the mathematical expectation of the number of elements of the Pareto set. Kibernetika (Kiev), 3:145-146, 1975.
  1712. S.L. Ivanov. A method of search for a limit saddle point. Zh. Vychisl. Mat. i Mat. Fiz., 26(6):939-941, 960, 1986.
  1713. P.A. Ivashchenko. Adaptation in Economics. "Vishcha Shkola", Kharkov, 1986. (in Russian).
  1714. E.A. Ivushkina. Mathematical programming with randomness and fuzziness. In Fuzzy systems: modeling of structure and optimization (Russian), pages 76-82, Kalinin, 1987. Kalinin. Gos. Univ.
  1715. Seiichi Iwamoto. Linear programming on recursive additive dynamic programming. J. Operations Res. Soc. Japan 18, 125-151, 1975.
  1716. Seiichi Iwamoto. Conditional decision processes with recursive function. J. Math. Anal. Appl., 230(1):193-210, 1999.
  1717. Seiichi Iwamoto. Recurrence formulas and decision tree tables in stochastic optimization. S¯urikaisekikenky¯usho K¯oky¯uroku, (1132):15-23, 2000. Mathematical decision theory under uncertainty and ambiguity (Japanese) (Kyoto, 1999).
  1718. Seiichi Iwamoto. Fuzzy dynamic programming in the stochastic environment. In Dynamical aspects in fuzzy decision making, volume 73 of Stud. Fuzziness Soft Comput., pages 27-51. Physica, Heidelberg, 2001.
  1719. Seiichi Iwamoto. Recursive method in stochastic optimization under compound criteria. In Advances in mathematical economics, Vol. 3, pages 63-82. Springer, Tokyo, 2001.
  1720. Kakuzo Iwamura and Baoding Liu. A genetic algorithm for chance constrained programming. J. Inform. Optim. Sci., 17(2):409-422, 1996.
  1721. Yoh Iwasa. Pessimistic plant: Optimal growth schedule in stochastic environments. Theor. Popul. Biol. 40, No.2, 246-268, 1991.
  1722. V.S. Izhutkin. Reduced gradient method for stochastic optimization problem with nonlinear constraints. Mosc. Univ. Comput. Math. Cybern. 1989, No.2, 102-104 translation from Vestn. Mosk. Univ., Ser. XV 1989, No.2, 79-81 (1989)., 1989.
  1723. Tommi Jaakkola, Michael I. Jordan, and Satinder P. Singh. On the convergence of stochastic iterative dynamic programming algorithms. Neural Comput. 6, No.6, 1185-1201, 1994.
  1724. Jihad Jaam. Ramsey numbers by stochastic algorithms with new heuristics. In Combinatorics and computer science (Brest, 1995), volume 1120 of Lecture Notes in Comput. Sci., pages 163-181, Berlin, 1996. Springer.
  1725. D. Jacobs, C.-T. Kuo, J.-T. Lim, and S.M. Meerkov. Improvability of serial production lines: theory and applications. In Recent advances in control and optimization of manufacturing systems, volume 214 of Lecture Notes in Control and Inform. Sci., pages 121-143. Springer, London, 1996.
  1726. J. Jacobs, G. Freeman, J. Grygier, D. Morton, G. Schultz, K. Staschus, and J. Stedinger. Socrates: A system for scheduling hydroelectric generation under uncertainty. Annals of Operations Research, 59:99-133, 1995.
  1727. O.L.R. Jacobs, M.H.A. Davis, M.A.H. Dempster, C.J. Harris, and P.C. Parks, editors. Analysis and Optimization of Stochastic Systems. Academic Press, London, 1980.
  1728. Sheldon H. Jacobson and Lee W. Schruben. Techniques for simulation response optimization. Oper. Res. Lett., 8(1):1-9, 1989.
  1729. R. Jagannathan. Chance-constrained programming with joint constraints. Operations Res., 22(2):358-372, 1974.
  1730. R. Jagannathan. Minimax procedure for a class of linear programs under uncertainty. Operations Res., 25(1):173-177, 1977.
  1731. R. Jagannathan. A minimax procedure for a class of stochastic programs. In Quantitative planning and control, Essays in Honor of W. W. Cooper, 23-35 , 1979.
  1732. R. Jagannathan. Use of sample information in stochastic recourse and chance-constrained programming models. Management Sci., 31(1):96-108, 1985.
  1733. R. Jagannathan. A stochastic geometric programming problem with multiplicative recourse. Oper. Res. Lett., 9(2):99-104, 1990.
  1734. R. Jagannathan and M.R. Rao. A class of nonlinear chance-constrained programming models with joint constraints. Operations Res. 21, 360-364, 1973.
  1735. Raj Jagannathan. Linear programming with stochastic processes as parameters as applied to production planning. Ann. Oper. Res., 30(1-4):107-114, 1991. Stochastic programming, Part I (Ann Arbor, MI, 1989).
  1736. Patrick Jaillet. Stochastic routing problems. In Stochastics in combinatorial optimization, Adv. Sch. CISM, Udine/Italy 1986, 197-213, 1987.
  1737. Patrick Jaillet. Analysis of probabilistic combinatorial optimization problems in Euclidean spaces. Math. Oper. Res., 18(1):51-70, 1993.
  1738. Patrick Jaillet and Amedeo R. Odoni. The probabilistic vehicle routing problem. In Vehicle routing: Methods and studies, Stud. Manage. Sci. Syst. 16, 293-318 , 1988.
  1739. Anjani Jain and John W. Mamer. Approximations for the random minimal spanning tree with application to network provisioning. Oper. Res. 36, No.4, 575-584, 1988.
  1740. Andrzej Jakubowski. Stochastic model of resource allocation to R & D activities under cost value uncertainty. In Optim. Techn., Proc. IFIP Conf., Wuerzburg 1977, Part 2, Lect. Notes Control Inf. Sci. 7, 411-421, 1978.
  1741. Udom Janjarassuk and Jeff Linderoth. Reformulation and sampling to solve a stochastic network interdiction problem. Optimization Online, http://www.optimization-online.org, 2006.
  1742. O. Janssens de Bisthoven, P. Schuchewytsch, and Y. Smeers. Power generation planning with uncertain demand. In Numerical techniques for stochastic optimization, Springer Ser. Comput. Math. 10, 465-480, 1988.
  1743. C. Jansson and S.M. Rump. Rigorous solution of linear programming problems with uncertain data. Z. Oper. Res. 35, No.2, 87-111, 1991.
  1744. Elzbieta Jasinska and Leszek Jerzy Jasinski. The network models of multi-activity projects as stochastic programming problems. Przegl. Stat. 28, 215-223, 1981.
  1745. Leszek Jerzy Jasi\'nski. Game theory method in stochastic programming. Przeglk ad Statyst., 23(1):107-117, 1976.
  1746. Leszek Jerzy Jasi\'nski. A priori information in stochastic programming. Przeglk ad Statyst., 26(1-2):35-47 (1980), 1979.
  1747. Leszek Jerzy Jasinski. The linear stochastic distribution problem. The Charnes-Cooper approach. Przegl. Stat. 37, No.4, 327-338, 1990.
  1748. Leszek Jerzy Jasinski. Stochastic distribution problem. The Dantzig-Madansky approach. Przegl. Stat. 38, No.1, 71-83, 1991.
  1749. Leszek Jerzy Jasi\'nski and Andrzej Tabeau. Stochastic programming problems with a known probability of fulfilling a set of constraints. Przeglk ad Statyst., 28(1-2):107-116 (1982), 1981.
  1750. A.I. Jastremskii. Ueber das einfachste stochastische Interbranchenmodell der Optimierung. Kibernetika, Kiev 1973, Nr. 5, 139-140, 1973.
  1751. A.I. Jastremskii. Duality in two-phase stochastic programming and a stochastic linear production model. Kibernetika (Kiev), 2:141-145, 1975.
  1752. A.I. Jastremskii. Wachstumstempi und Effektivitaetsnorm im optimalen Plan eines dynamischen stochastischen Produktionsmodells. Kibernetika, Kiev 1976, Nr. 3, 110-114, 1976.
  1753. A.I. Jastremskii and È. Vol'kenstain. Randomness of demand and stochastic models of industrial production. Issled. Operatsii i ASU, 13:112-116, 136, 1979.
  1754. A.V. Jazenin. Man-machine procedures in decision-making problems with fuzzy goals. In Mathematical methods of optimization and structuring of systems (Russian), pages 88-92, 184. Kaliningrad. Gos. Univ., Kaliningrad, 1979.
  1755. A.V. Jazenin and G.P. Diskant. A linear decision-making problem with fuzzy goals. In Mathematical methods of optimization and structuring of systems (Russian), pages 77-87, 183. Kaliningrad. Gos. Univ., Kaliningrad, 1979.
  1756. T.R. Jefferson and C.H. Scott. Geometric programming with probabilistic decision variables. J. Austral. Math. Soc. Ser. B, 22(2):229-236, 1980/81.
  1757. Larry Jenkins and Murray Anderson. A multivariate statistical approach to reducing the number of variables in data envelopment analysis. European J. Oper. Res., 147(1):51-61, 2003.
  1758. Peter Jennergren. A note on a Dantzig-Wolfe decomposition-like method for solving a particular resource-allocation problem under uncertainty. Math. Operationsforsch. Statistik 4, 127-132, 1973.
  1759. Max E. Jerrell and Wendy A. Campione. Global optimization of econometric functions. J. Global Optim., 20(3-4):273-295, 2001. Special issue: Applications to economics.
  1760. Elizabeth R. Jessup, Dafeng Yang, and Stavros A. Zenios. Parallel factorization of structured matrices arising in stochastic programming. SIAM J. Optim., 4(4):833-846, 1994.
  1761. Jully Jeunet and Nicolas Jonard. Single-point stochastic search algorithms for the multi-level lot-sizing problem. Comput. Oper. Res., 32(4):985-1006, 2005.
  1762. Nand K. Jha. Stochastic mathematical modelling and manufacturing cost estimation in uncertain industrial environment. Int. J. Prod. Res. 30, No.12, 2755-2771, 1992.
  1763. X.D. Ji and B.D. Familoni. A diagonal recurrent neural network-based hybrid direct adaptive SPSA control system. IEEE Transactions on Automatic Control, 44:1469-1473, 1999.
  1764. Xiaoyu Ji. Models and algorithm for stochastic shortest path problem. Appl. Math. Comput., 170(1):503-514, 2005.
  1765. H. Jiang and L. Qi. Globally and superlinearly convergent trust-region algorithm for convex sc\sp 1-minimization problems and its application to stochastic programs. J. Optim. Theory Appl., 90(3):649-669, 1996.
  1766. Henrik Joensson, Kurt Joernsten, and Edward A. Silver. Application of the scenario aggregation approach to a two-stage, stochastic, common component, inventory problem with a budget constraint. Eur. J. Oper. Res. 68, No.2, 196-211, 1993.
  1767. Tor A. Johansen, René van de Molengraft, and Henk Nijmeijer, editors. Switched, piecewise and polytopic linear systems. Taylor & Francis Ltd., Abingdon, 2002. Internat. J. Control 75 (2002), no. 16-17.
  1768. Andrew E.W. Jones and G.W. Forbes. An adaptive simulated annealing algorithm for global optimization over continuous variables. J. Global Optim., 6(1):1-37, 1995.
  1769. Stephen K. Jones, Ralph K. Cavin III, and William M. Reed. Analysis of error-gradient adaptive linear estimators for a class of stationary dependent processes. IEEE Trans. Inf. Theory IT-28, 318-329, 1982.
  1770. T. W. Jonsbråten. Oil field optimization under price uncertainty. Journal of the Operational Research Society, 49(8):811-818, 1998.
  1771. Tore W. Jonsbråten, Roger J.-B. Wets, and David L. Woodruff. *a class of stochastic programs with decision dependent random elements. Ann. Oper. Res., 82:83-106, 1998. Modelling: in memory of Åsa Hallefjord.
  1772. J.S. Jordan. Information and shadow prices for the constrained concave team problem. J. math. Economics 2, 371-393, 1975.
  1773. Tibor Jordan and Alessandro Panconesi, editors. Probabilistic methods in combinatorial optimization. John Wiley & Sons Inc., New York, 2002. Random Structures Algorithms 20 (2002), no. 3.
  1774. S. Jorjani, C.H. Scott, and D.L. Woodruff. Selection of an optimal subset of sizes. International Journal of Production Research, 37:3697-3710, 1999.
  1775. Rajani R. Joshi. A new heuristic algorithm for probabilistic optimization. Comput. Oper. Res., 24(7):687-697, 1997.
  1776. R.R. Joshi and D.K. Satyanarayana. A nested layered network model for parallel solutions of discrete SPPs. Comput. Math. Appl., 33(5):111-123, 1997.
  1777. Sumit Joshi. Recursive utility, martingales, and the asymptotic behaviour of optimal processes. J. Econom. Dynam. Control, 21(2-3):505-523, 1997.
  1778. S.F. Jozwiak. Probability-based optimization of truss structures. Comput. Struct. 32, No.1, 87-91, 1989.
  1779. Stanislaw F. Jozwiak. Minimum weight design of structures with random parameters. Comput. Struct. 23, 481-485, 1986.
  1780. È. Jubi. Finding the optimal randomized solution in M- and P-models of stochastic programming. Eesti NSV Tead. Akad. Toimetised Füüs.-Mat., 26(1):64-71, 1977.
  1781. È. Jubi. A statistical study and method for the solution of stochastic programming problems. Eesti NSV Tead. Akad. Toimetised Füüs.-Mat., 26(4):369-375, 1977.
  1782. James V. Jucker and Robert C. Carlson. The simple plant-location problem under uncertainty. Operations Res. 2 1045-1055 (1977)., 1976.
  1783. Joaquim J. Júdice, Hanif D. Sherali, and Isabel M. Ribeiro. The eigenvalue complementarity problem. Comput. Optim. Appl., 37(2):139-156, 2007.
  1784. A.D. Judin. Dualitaet in der mehretappenweisen stochastischen Programmierung. Izv. Akad. Nauk SSSR, tehn. Kibernet. 1973, Nr. 6, 24-31, 1973.
  1785. A.D. Judin. Koordinatenweiser Abstieg in Problemen der unendlichdimensionalen konvexen Programmierung. Izv. Akad. Nauk SSSR, tehn. Kibernet. 1974, Nr. 1, 34-42, 1974.
  1786. D.B. Judin. Methods of constructing decision rules for multistage problems of stochastic programming. Sov. Math., Dokl. 14, 824-828 translation from Dokl. Akad. Nauk SSSR 210, 779-782 (1973)., 1973.
  1787. D.B. Judin. Multistage problems of stochastic programming. Sov. Math., Dokl. 14, 787-790 translation from Dokl. Akad. Nauk SSSR 210, 545-548 (1973)., 1973.
  1788. D.B. Judin. Mathematische Methoden der Steuerung bei unvollstaendiger Information. Aufgaben und Methoden der stochastischen Programmierung. (Matematiceskie metody upravlenija v uslovijah nepolnoi informacii. Zadaci i metody stohasticeskogo programmirovanija.). Moskau: 'Sovetskoe Radio', 1974.
  1789. D.B. Judin and T.D. Beresnewa. Statische und dynamische Modelle der stochastischen Optimierung. In Math.-oekon. Meth. Modelle, 105-152, 1977.
  1790. D.B. Judin and È. V. Coi. A priori decision rules in multistage stochastic programming problems. Èkonom. i Mat. Metody, 9:947-961, 1973.
  1791. D.B. Judin and É. V. Coi. A qualitative study of certain classes of stochastic problems. Kibernetika (Kiev), 2:73-77, 1975.
  1792. D.B. Judin and E.V. Coi. Ganzzahlige stochastische Programmierung. Izv. Akad. Nauk SSSR, tehn. Kibernet. 1974, Nr. 1, 3-11, 1974.
  1793. D.B. Judin and E.V. Coi. Qualitative Untersuchung einiger Klassen stochastischer Probleme. Kibernetika, Kiev 1975, Nr. 2, 73-77, 1975.
  1794. Ghassan Kabbara. New utilization of fuzzy optimization method. In Fuzzy information and decision processes, 239-246, 1982.
  1795. D.G. Kabe. On some coverage probability maximization problems. Commun. Stat., Simulation Comput. B9, 73-79, 1980.
  1796. Janusz Kacprzyk and Piotr Staniewski. A new approach to the control of stochastic systems in a fuzzy environment. Arch. Automat. Telemech., 25(4):433-444 (1981), 1980.
  1797. D.P. Kakabadze, G.M. Kubintsev, and V.A. Taran. Control of the random step distribution function in a discrete adaptive system. Automat. Remote Control, 41(2):217-224, 1980.
  1798. V.A. Kaladze and Ya.S. Rubinshtejn. Convergence of the random search method in the neighborhood of the extremum. Avtomat. vycislit. Tehn., Riga 1972, No.3, 67, 1972.
  1799. V.A. Kaladze and Ya.S. Rubinshtejn. Polar modification of random search. Avtomat. vycislit. Tehn., Riga 1972, No.2, 58, 1972.
  1800. Osmo Kaleva. A note on fixed points for fuzzy mappings. Fuzzy Sets and Systems, 15(1):99-100, 1985.
  1801. È. V. Kalinina, Ja. I. Hurgin, and A.G. Sapiro. Stable distributions in problems of stochastic programming. In Mathematical methods of solution of economic problems, No. 8 (Russian), pages 134-138, Moscow, 1979. "Nauka".
  1802. P. Kall. Some remarks on the distribution problem of stochastic linear programming. In Operations Res.-Verf. 16, 189-196, 1973.
  1803. P. Kall. Stochastische Optimierung-einige neuere Ergebnisse. In Fortschritte in der mathematischen Optimierung (Tagung, Humboldt Univ., Berlin, 1978), volume 15 of Seminarberichte, pages 52-64. Humboldt Univ. Berlin, 1978.
  1804. P. Kall. Solving complete fixed recourse problems by successive discretization. In Recent results in stochastic programming, Proc., Oberwolfach 1979, Lect. Notes Econ. Math. Syst. 179, 135-138, 1980.
  1805. P. Kall. Stochastic programming. European J. Oper. Res., 10(2):125-130, 1982.
  1806. P. Kall. Stochastic programs with recourse: an upper bound and the related moment problem. Z. Oper. Res. Ser. A-B, 31(3):A119-A141, 1987.
  1807. P. Kall. Stochastic programming with recourse: upper bounds and moment problems-a review. In Advances in mathematical optimization, volume 45 of Math. Res., pages 86-103, Berlin, 1988. Akademie-Verlag.
  1808. P. Kall. An upper bound for SLP using first and total second moments. Ann. Oper. Res., 30(1-4):267-276, 1991. Stochastic programming, Part I (Ann Arbor, MI, 1989).
  1809. P. Kall. A survey of approximation methods in stochastic programming. In Optimization: models, methods, solutions (Russian) (Irkutsk, 1989), pages 125-133. "Nauka" Sibirsk. Otdel., Novosibirsk, 1992.
  1810. P. Kall. Solution methods in stochastic programming. In System modelling and optimization (Compiègne, 1993), volume 197 of Lecture Notes in Control and Inform. Sci., pages 3-22. Springer, London, 1994.
  1811. P. Kall. Bounds for and approximations to stochastic linear programs with recourse-tutorial. In Stochastic programming methods and technical applications (Neubiberg/Munich, 1996), pages 1-21. Springer, Berlin, 1998.
  1812. P. Kall and J. Mayer. A model management system for stochastic linear programming. In System modelling and optimization (Zurich, 1991), volume 180 of Lecture Notes in Control and Inform. Sci., pages 580-587. Springer, Berlin, 1992.
  1813. P. Kall and J. Mayer. SLP-IOR: A model management system for stochastic linear programming - system design. In A.J.M. Beulens and H.-J. Sebastian, editors, Optimization-Based Computer-Aided Modelling and Design, pages 139-157. Springer-Verlag, Berlin etc., 1992.
  1814. P. Kall and J. Mayer. SLP-IOR: on the design of a workbench for testing SLP codes. Investigación Oper., 14(2-3):148-161, 1993. Workshop on Stochastic Optimization: the State of the Art (Havana, 1992).
  1815. P. Kall and J. Mayer. Computer support for modeling in stochastic linear programming. In Stochastic programming (Neubiberg/München, 1993), volume 423 of Lecture Notes in Econom. and Math. Systems, pages 54-70. Springer, Berlin, 1995.
  1816. P. Kall and J. Mayer. On testing SLP codes with SLP-IOR. Manuscript, Inst. Oper. Res., University of Zurich, 1996. Accepted for Proceedings Mátraháza 1996.
  1817. P. Kall and J. Mayer. On solving stochastic linear programming problems. In Stochastic programming methods and technical applications (Neubiberg/Munich, 1996), pages 329-344. Springer, Berlin, 1998.
  1818. P. Kall and J. Mayer. On the role of bounds in stochastic linear programming. Optimization, 47(3-4):287-301, 2000. Numerical methods for stochastic optimization and real-time control of robots (Neubiberg/Munich, 1998).
  1819. P. Kall and W. Oettli. Measurability theorems for stochastic extremals. SIAM J. Control, 13(5):994-998, 1975.
  1820. P. Kall and W. Oettli. Measurability theorems for stochastic extremals (extended abstract). In Siebente Oberwolfach-Tagung über Operations Research (1974), Operations Research Verfahren, Band XXI, pages 139-140, Meisenheim am Glan, 1975. Hain.
  1821. P. Kall and Werner Oettli. Measurability theorems for stochastic extremals. In Stochastic programming (Proc. Internat. Conf., Univ. Oxford, Oxford, 1974), pages 93-95, London, 1980. Academic Press.
  1822. P. Kall, A. Ruszczy\'nski, and K. Frauendorfer. Approximation techniques in stochastic programming. In Numerical techniques for stochastic optimization, volume 10 of Springer Ser. Comput. Math., pages 33-64. Springer, Berlin, 1988.
  1823. P. Kall and D. Stoyan. Solving stochastic programming problems with recourse including error bounds. Math. Operationsforsch. Statist. Ser. Optim., 13(3):431-447, 1982.
  1824. P. Kall and S.W. Wallace. Stochastic Programming. Wiley, Chichester etc., 1994.
  1825. Peter Kall. Approximations to stochastic programs with complete fixed recourse. Numer. Math., 22:333-339, 1974.
  1826. Peter Kall. Stochastic linear programming. Springer-Verlag, Berlin, 1976. Ökonometrie und Unternehmensforschung, No. XXI.
  1827. Peter Kall. Computational methods for solving two-stage stochastic linear programming problems. Z. Angew. Math. Phys., 30(2):261-271, 1979.
  1828. Peter Kall. Towards computing the expected value of perfect information. In Mathematische Systeme in der Oekonomie, R. Henn z. 60. Geb., 277-287 , 1983.
  1829. Peter Kall. On approximations and stability in stochastic programming. In Parametric optimization and related topics (Plaue, 1985), volume 35 of Math. Res., pages 387-407, Berlin, 1987. Akademie-Verlag.
  1830. Peter Kall and János Mayer. SLP-IOR: an interactive model management system for stochastic linear programs. Math. Programming, 75(2, Ser. B):221-240, 1996. Approximation and computation in stochastic programming.
  1831. Peter Kall and János Mayer. Modeling support for multistage recourse problems. In Dynamic stochastic optimization (Laxenburg, 2002), volume 532 of Lecture Notes in Econom. and Math. Systems, pages 21-41. Springer, Berlin, 2004.
  1832. Peter Kall and János Mayer. Building and solving stochastic linear programming models with SLP-IOR. In Applications of stochastic programming, volume 5 of MPS/SIAM Ser. Optim., pages 79-93. SIAM, Philadelphia, PA, 2005.
  1833. Peter Kall and Janos Mayer. Stochastic Linear Programming: Models, Theory, and Computation, volume 80 of International Series in Operations Research & Management Science. Springer, 2005.
  1834. Peter Kall and János Mayer. Some insights into the solution algorithms for SLP problems. Ann. Oper. Res., 142:147-164, 2006.
  1835. Peter Kall and András Prékopa, editors. Recent results in stochastic programming, volume 179 of Lecture Notes in Economics and Mathematical Systems, Berlin, 1980. Springer-Verlag.
  1836. J.G. Kallberg, R.W. White, and W.T. Ziemba. Short term financial planning under uncertainty. Manage. Sci. 28, 670-682, 1982.
  1837. J.G. Kallberg and W.T. Ziemba. An extended Frank-Wolfe algorithm with application to portfolio selection problems. In Recent results in stochastic programming, Proc., Oberwolfach 1979, Lect. Notes Econ. Math. Syst. 179, 139-162, 1980.
  1838. J.G. Kallberg and W.T. Ziemba. Generalized concave functions in stochastic programming and portfolio theory. In Generalized concavity in optimization and economics, Proc. NATO Adv. Study Inst., Vancouver/Can. 1980, 719-767, 1981.
  1839. L. Kallenberg. Special solution methods for replacement problems. In Operations Research Proceedings, 2000 (Dresden), pages 87-90, Berlin, 2001. Springer.
  1840. L.C.M. Kallenberg. Z. Oper. Res., (1).
  1841. L.C.M. Kallenberg. Linear programming to compute a bias-optimal policy. In Operations research proceedings 1981 (Göttingen), pages 433-440. Springer, Berlin, 1982.
  1842. L.C.M. Kallenberg. Survey of linear programming for standard and nonstandard Markovian control problems. II. Applications. Z. Oper. Res., 40(2):127-143, 1994.
  1843. Markku Kallio and William T. Ziemba. Arbitrage pricing simplified. Stochastic Programming E-Print Series, http://www.speps.org, 2003.
  1844. Sofia Kalpazidou. Optimal transforms by two predictable processes. Bull. Math. Soc. Sci. Math. Repub. Soc. Roum., Nouv. Ser. 30(78), 313-319, 1986.
  1845. Basil A. Kalymon. An optimization algorithm for a linear model of a simulation system. Management Sci., Theory 21, 516-530, 1975.
  1846. M.M. Kamilov and Sh. Kh. Fazylov. Optimization in pattern recognition problems. In Random search and pattern recognition (Russian), pages 11-17, 118. "Fan", Tashkent, 1985.
  1847. V.A. Kaminskas and V.A. Pukas. On a numerical method for solving a two-stage nonlinear stochastic problem. In Issled. Algoritm. Ocen. Paramet. din. Sist. Process., Mater. Semin. Inst. Fiz. Mat. AN Litov. SSR, Stat. Probl. Upr. 16, 120-127, 1976.
  1848. V.A. Kaminskii. Correlation constraints in stochastic optimization problems. Kibernetika (Kiev), 4:122-124, 136, 1986.
  1849. V.N. Kaminskij. Optimization of closed stochastic networks with exponential servicing. Eng. Cybern. 18, No.6, 57-64 translation from Izv. Akad. Nauk SSSR, Tekh. Kibern. 1980, No.6, 68-76 (1980)., 1980.
  1850. T. Kämpke. Tight bounds for capacities. Comput. Math. Appl., 27(8):67-86, 1994.
  1851. Yu. S. Kan. Optimization of control by the quantile criterion. Avtomat. i Telemekh., (5):77-88, 2001.
  1852. Yu. S. Kan and A. I. Kibzun. Sensitivity analysis of worst-case distribution for probability optimization problems. In Probabilistic constrained optimization, volume 49 of Nonconvex Optim. Appl., pages 132-147. Kluwer Acad. Publ., Dordrecht, 2000.
  1853. Yu. S. Kan and A.I. Kibzun. Convexity properties of probability and quantile functions in optimization problems. Avtomat. i Telemekh., 3:82-102, 1996.
  1854. Yu. S. Kan and A. A. Mistryukov. On the equivalence in stochastic programming with probability and quantile objectives. In Stochastic programming methods and technical applications (Neubiberg/Munich, 1996), pages 145-153. Springer, Berlin, 1998.
  1855. Yu. S. Kan and A. V. Rusyaev. The quantile minimization problem with a bilinear loss function. Avtomat. i Telemekh., 7:67-75, 1998.
  1856. Yu. S. Kan and N. V. Tuzov. Quantile minimization of the normal distribution of a bilinear loss function.
  1857. Yuri Kan. Application of the quantile optimization to bond portfolio selection. In Stochastic optimization techniques (Neubiberg/Munich, 2000), volume 513 of Lecture Notes in Econom. and Math. Systems, pages 285-308. Springer, Berlin, 2002.
  1858. O. N. Kaneva. A two-stage nonlinear stochastic programming problem with a deterministic compensation matrix. In Mathematical structures and modeling. No. 14 (Russian), pages 25-33. Omsk. Gos. Univ., Omsk, 2004.
  1859. I. Ju. Kaniovskaja. Convergence of random processes generated by a procedure of the stochastic approximation type. In Methods of solution of problems of nonsmooth optimization and stochastic programming (Russian), pages 18-25, 35. Akad. Nauk Ukrain. SSR Inst. Kibernet., Kiev, 1979.
  1860. I. Yu. Kaniovskaya. Asymptotic properties of Fabian's algorithm with nonsmooth regression functions. Issled. Operatsii i ASU, 23:29-35, 139, 1984.
  1861. Yu.M. Kaniovski, P.S. Knopov, and Z.V. Nekrylova. Limit Theorems for Stochastic Programming Processes. Naukova dumka, Kiev, 1980. (in Russian).
  1862. Yuri M. Kaniovski, Alan J. King, and Roger J.-B. Wets. Probabilistic bounds (via large deviations) for the solutions of stochastic programming problems. Ann. Oper. Res., 56:189-208, 1995. Stochastic programming (Udine, 1992).
  1863. Ju. M. Kaniovskii. The asymptotic normality of a stochastic minimization method. In Methods of operations research and of reliability theory in systems analysis (Russian), pages 63-69, Kiev, 1977. Akad. Nauk. Ukrain. SSR Inst. Kibernet.
  1864. Ju. M. Kaniovskii. A way of controlling the calculation accuracy in the statistical gradient method. Kibernetika (Kiev), 5:87-89, 1978.
  1865. Ju. M. Kaniovskii. Asymptotic properties of a stochastic method of minimization. In Operations research (models, systems, solutions), No. 7 (Russian), pages 24-36, 1, Moscow, 1979. Akad. Nauk SSSR Vychisl. Tsentr.
  1866. Ju. M. Kaniovskii, P.S. Knopov, and Z.V. Nekrylova. The stochastic programming method in Hilbert space. Kibernetika (Kiev), 6:71-79, 1978.
  1867. Ju. M. Kaniovskii, P.S. Knopov, and Z.V. Nekrylova. Predel' nye teoremy dlya protsessov stokhasticheskogo programmirovaniya. "Naukova Dumka", Kiev, 1980.
  1868. Yu. M. Kaniovskii. Estimating the error in direct methods of stochastic programming. Cybernetics, 16(5):768-775 (1981), 1980.
  1869. Yu. M. Kaniovskii. Estimation of errors in construction of confidence intervals in some stochastic programming methods. Cybernetics, 17(1):121-125, 1981.
  1870. Yu. M. Kaniovskii. A limit theorem for processes of stochastic optimization and estimation with constant step. Dokl. Akad. Nauk SSSR, 261(1):18-20, 1981.
  1871. Yu. M. Kaniovskii. Asymptotic properties of a stochastic analogue of the gradient method of optimization in a Hilbert space. Issled. Operatsii i ASU, 20:55-69, 1982.
  1872. Yu. M. Kaniovskii. Comparison of the rates of convergence of two-step and one-step methods of stochastic programming. Dokl. Akad. Nauk Ukrain. SSR Ser. A, 7:70-73, 1982.
  1873. Yu. M. Kaniovskii. A stochastic analogue of the conjugate gradient method with a fixed step. Issled. Operatsii i ASU, 21:3-8, 1983.
  1874. Yu. M. Kaniovskii. Fabian's algorithm in the theory of self-adjusting systems. Avtomat. i Telemekh., 11:66-69, 1984.
  1875. Yu. M. Kaniovskii. Stochastic optimization algorithms with slowly decreasing step multiplier. Kibernetika (Kiev), 4:iii, 102-106, 135, 1984.
  1876. Yu. M. Kaniovskii and P.S. Knopov. Asymptotic properties of some stochastic approximation methods. Cybernetics, 15(5):727-734 (1980), 1979.
  1877. Yu. M. Kaniovskii and G.G. Murauskas. Asymptotic properties of the stochastic method of Lagrange multipliers. In Theory of optimal decisions, pages 78-84, 114, Kiev, 1982. Akad. Nauk Ukrain. SSR Inst. Kibernet.
  1878. Yu.M. Kaniovskij. Limit theorems for random processes, and stochastic Markov recurrent procedures. Cybernetics 15, 917-927 translation from Kibernetika 1979, No.6, 127-130 (1979)., 1980.
  1879. Yu.M. Kaniovskij. On a certain method of random search. Zh. Vychisl. Mat. Mat. Fiz. 21, 499-503, 1981.
  1880. Yu.M. Kaniovskij. Comparison of the convergence rates of the two-step and one-step methods of stochastic programming. Dokl. Akad. Nauk Ukr. SSR, Ser. A 1982, No.7, 70-73, 1982.
  1881. Yu.M. Kaniovskij. Stochastical analogue of the method of conjugated gradients with constant increment. Issled. Oper. ASU 21, 3-8, 1983.
  1882. Yu.M. Kaniovskij. The limit theorem for optimization and estimation algorithms with a variable step. Dokl. Akad. Nauk Ukr. SSR, Ser. A 1985, No.1, 59-61, 1985.
  1883. Yu.M. Kaniovskij, P.S. Knopov, and Z.V. Nekrylova. Stochastic programming in Hilbert space. Cybernetics 14, 878-888 translation from Kibernetika, No.6, 71-79 (1978)., 1979.
  1884. Yu.M. Kaniovskij, P.S. Knopov, and Z.V. Nekrylova. Limit theorems for processes of stochastic programming. (Predel'nye teoremy dlya protsessov stokhasticheskogo programmirovaniya). Akademiya Nauk Ukrainskoj SSR, Ordena Lenina Institut Kibernetiki. Kiev: "Naukova Dumka"., 1980.
  1885. V. Kanková. Estimates in stochastic programming-chance constrained case. Problems Control Inform. Theory/Problemy Upravlen. Teor. Inform., 18(4):251-260, 1989.
  1886. V. Kanková. A note on multistage stochastic programming with individual probability constraints. In Operations Research Proceedings, 2000 (Dresden), pages 91-96, Berlin, 2001. Springer.
  1887. V. Kanková. A remark on the analysis of multistage stochastic programs: Markov dependence. ZAMM Z. Angew. Math. Mech., 82(11-12):781-793, 2002. 4th GAMM-Workshop "Stochastic Models and Control Theory" (Lutherstadt Wittenberg, 2001).
  1888. Vlasta Kanková. An approximative solution of a stochastic optimization problem. In Transactions of the Eighth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes (Prague, 1978), Vol. A, pages 349-353. Reidel, Dordrecht, 1978.
  1889. Vlasta Kanková. Differentiability of the optimal function in a two-stage stochastic nonlinear programming problem. Ekonom.-Mat. Obzor, 14(3):322-330, 1978.
  1890. Vlasta Kanková. Optimum solution of a stochastic optimization problem with unknown parameters. In Transactions of the Seventh Prague Conference on Information Theory, Statistical Decision Functions and the Eighth European Meeting of Statisticians (Tech. Univ. Prague, Prague, 1974), Vol. B, pages 239-244, Prague, 1978. Academia.
  1891. Vlasta Kanková. Stability in the stochastic programming. Kybernetika (Prague), 14(5):339-349, 1978.
  1892. Vlasta Kanková. Approximate solution of problems of two-stage stochastic nonlinear programming. Ekonom.-Mat. Obzor, 16(1):64-76, 1980.
  1893. Vlasta Kanková. Optimization problem with parameter and its application to the problems of two-stage stochastic nonlinear programming. Kybernetika (Prague), 16(5):411-425, 1980.
  1894. Vlasta Kanková. Sequences of stochastic programming problems with incomplete information. In Transactions of the ninth Prague conference on information theory, statistical decision functions, random processes, Vol. A (Prague, 1982), pages 327-332. Reidel, Dordrecht, 1983.
  1895. Vlasta Kanková. Uncertainty in stochastic programming. In Stochastic optimization (Kiev, 1984), volume 81 of Lecture Notes in Control and Inform. Sci., pages 393-401. Springer, Berlin, 1986.
  1896. Vlasta Kanková. Empirical estimates in stochastic programming. In Transactions of the Tenth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes, Vol. B (Prague, 1986), pages 21-28. Reidel, Dordrecht, 1988.
  1897. Vlasta Kanková. A note on the differentiability in two-stage stochastic nonlinear programming problems. Kybernetika (Prague), 24(3):207-215, 1988.
  1898. Vlasta Kanková. Necessary and sufficient optimality conditions for two-stage stochastic programming problems. Kybernetika (Prague), 25(5):375-385, 1989.
  1899. Vlasta Kanková. A note on the minimax approach to the stochastic programming problems. Ekonom.-Mat. Obzor, 26(1):64-70, 1990.
  1900. Vlasta Kanková. On the convergence rate of empirical estimates in chance constrained stochastic programming. Kybernetika (Prague), 26(6):449-461, 1990.
  1901. Vlasta Kankova. A note on the stability in stochastic programming problems. In Information theory, statistical decision functions, random processes, Trans. 11th Prague Conf., Prague/Czech. 1990, Vol. B, 51-59, 1992.
  1902. Vlasta Kanková. Stability in stochastic programming-the case of unknown location parameter. Kybernetika (Prague), 29(1):80-101, 1993.
  1903. Vlasta Kanková. A note on estimates in stochastic programming. J. Comput. Appl. Math., 56(1-2):97-112, 1994. Stochastic programming: stability, numerical methods and applications (Gosen, 1992).
  1904. Vlasta Kanková. A note on the relationship betweeen distribution function estimation and estimations in stochastic programming. In Trans. of the Twelfth Prague Conference, pages 122-125, 1994.
  1905. Vlasta Kanková. On stability in two-stage stochastic nonlinear programming. In Asymptotic statistics (Prague, 1993), Contrib. Statist., pages 329-340. Physica, Heidelberg, 1994.
  1906. Vlasta Kanková. On the stability in stochastic programming-generalized simple recourse problems. Informatica, 5(1-2):55-78, 1994.
  1907. Vlasta Kanková. A note on contamination in stochastic programming - special cases, 1996. Kvantitatívne metódy v ekonomike (viackriteriálna optimizácia VIII). Slov. spol. pre operacný výzkum Bratislava.
  1908. Vlasta Kanková. A note on interval estimates in stochastic optimization. Bulletin of the Czech Econometric Society, 5:63-79, 1996.
  1909. Vlasta Kanková. A note on objective functions in multistage stochastic nonlinear programming problems. In System modelling and optimization (Prague, 1995), pages 582-589. Chapman & Hall, London, 1996.
  1910. Vlasta Kanková. Convexity, Lipschitz property and differentiability in two-stage stochastic nonlinear programming problems. In Proceedings of the 3rd International Conference on Approximation and Optimization in the Caribbean (Puebla, 1995), page 17 pp. (electronic). Benemérita Univ. Autón. Puebla, Puebla, 1997.
  1911. Vlasta Kanková. On an e-solution of minimax problem in stochastic programming. In J. Stepán V. Benes, editor, Proceedings of the 3rd International Conference on Distributions with Given Marginals and Moment Problems, pages 211-216, Dordrecht-Boston-London, 1997. Kluwer Academic. Publisher.
  1912. Vlasta Kanková. On estimates in time dependent stochastic optimization. Zeitschrift für Angewandte Mathematik und Mechanik, 77:587-588, 1997.
  1913. Vlasta Kanková. On the stability in stochastic programming: the case of individual probability constraints. Kybernetika (Prague), 33(5):525-546, 1997.
  1914. Vlasta Kanková. A note on empirical estimates and probability multifunctions in stochastic programming. In M. Husková, P. Lachout, and J.A. Vísek, editors, Proceedings of the Conference Prague Stochastics '98, pages 279-284, Prague, 1998. Union of Czech Mathematicians and Physicists.
  1915. Vlasta Kanková. A note on multifunctions in stochastic programming. In Stochastic programming methods and technical applications (Neubiberg/Munich, 1996), pages 154-168. Springer, Berlin, 1998.
  1916. Vlasta Kanková. Remarks on contamination in stochastic programming. Central European Journal for Operations Research and Economics, 6(3-4):215-224, 1998.
  1917. Vlasta Kanková. A note on analysis of economic activities with random elements. In M. Plevný and V. Friedlich, editors, Proceedings of the Mathematical Methods in Economics 1998, pages 53-58, Cheb (Czech Republic), 1999. Vydavatelství Západoceské university.
  1918. Vlasta Kanková. A note on multistage stochastic programming. In Proceedings of the 11th Joint Czech-German- Slovak Conference "Mathematical Methods in Economy and Industry", pages 45-52, Liberec (Czech Republic), 1999. Technická univerzita Liberec, Vysokoskolský podnik.
  1919. Vlasta Kanková. Multistage stochastic programming; stability, approximation and markov dependence. Operations Research Proceedings 1999, pages 136-141, 2000.
  1920. Vlasta Kanková. Multistage stochastic programming; stability, approximation and Markov dependence. In Operations Research Proceedings 1999 (Magdeburg), pages 136-141, Berlin, 2000. Springer.
  1921. Vlasta Kanková. A remark on multiobjective stochastic optimization problems: stability and empirical estimates. In Operations Research Proceedings 2003, pages 379-386, Berlin, 2004. Springer.
  1922. Vlasta Kanková and Petr Lachout. Convergence rate of empirical estimates in stochastic programming. Informatica, 3(4):497-523, 595, 603, 1992.
  1923. Vlasta Kanková and Karel Sladky. Risk-sensitive optimality criteria in multistage stochastic optimization. In D. Bauerová, J. Hanclová, L. Hrbác, J. Mockor, and J. Ramík, editors, Proc. of the Mathematical Methods in Economics. Matematické metody v ekonomii, Ostrava, pages 95-101. VSB, 1997.
  1924. Vlasta Kanková and Martin Smíd. On approximation in multistage stochastic programs: Markov dependence. Kybernetika (Prague), 40(5):625-638, 2004.
  1925. R. Kannan. Stochastic approximation and nonlinear operator equations. In Approximate solution of random equations, pages 87-105, New York, 1979. North-Holland.
  1926. Ravi Kannan, John Mount, and Sridhar Tayur. A randomized algorithm to optimize over certain convex sets. Math. Oper. Res., 20(3):529-549, 1995.
  1927. A. Kanudia and R. Loulou. Robust responses to climate change via stochastic MARKAL: The case of Quebec. European Journal of Operational Research, 106(1):15-30, 1998.
  1928. A. Kanudia and R. Loulou. Advanced bottom-up modelling for national and regional energy planning in response to climate change. International Journal of Environment and Pollution, 12(2-3):191-216, 1999.
  1929. A. Kanudia and P. R. Shukla. Modelling of uncertainties and price elastic demands in energy-environment planning for India. Omega-International Journal of Management Science, 26(3):409-423, 1998.
  1930. Chiang Kao and Shih-Pin Chen. A stochastic quasi-Newton method for simulation response optimization. European J. Oper. Res., 173(1):30-46, 2006.
  1931. Edward P.C. Kao. A preference order dynamic program for stochastic assembly line balancing. Management Sci. 22, 1097-1104, 1976.
  1932. Edward P.C. Kao and Maurice Queyranne. Aggregation in a two-stage stochastic program for manpower planning in the service sector. In Delivery of urban services, TIMS Stud. Manage. Sci. 22, 205-225, 1986.
  1933. E.P.C. Kao and M. Queyranne. Budgeting cost of nursing in a hospital. Management Science, 31(5):608-621, 1985.
  1934. Robert S. Kaplan and John V. Soden. On the objective function for the sequential P-model of chance-constrained programming. Operations Res. 19, 105-114, 1971.
  1935. A.I. Kaplinskii and A.S. Krasnenker. The multitest approach to the formation of multilevel algorithms for stochastic optimization. Avtomat. i Vycisl. Tehn. (Riga), 4:14-21, 1975.
  1936. A.I. Kaplinskii, A.S. Krasnenker, and A.V. Nazin. Training by the decrease principle in a vector optimization problem. Avtom. Vychisl. Tekh. 1978, No.4, 43-47, 1978.
  1937. A.I. Kaplinskii, A.S. Krasnenker, and Ya. Z. Tsypkin. Randomization and smoothing in adaptation problems and algorithms. Automat. Remote Control, 35(6, part 1):913-921, 1974.
  1938. A.I. Kaplinskii, A.S. Poznjak, and A.I. Propoi. Optimality conditions for certain stochastic programming problems. Autom. Remote Control 1971, 1210-1218 translation from Avtom. Telemekh. 1971, No.8, 51-60 (1971)., 1972.
  1939. A.I. Kaplinskii, A.S. Poznjak, and A.I. Propoi. Some methods for the solution of stochastic programming problems. Autom. Remote Control 32, 1609-1616 translation from Avtom. Telemekh. 1971, No.10, 87-94 (1971)., 1972.
  1940. A.I. Kaplinskii and A.I. Propoi. Nonlocal optimization methods that use potential theory. Avtomat. i Telemekh., 7:55-65, 1993.
  1941. A.I. Kaplinskii and A.I. Propoi. Second-order refinement conditions in nonlocal optimization methods that use potential theory. Avtomat. i Telemekh., 8:104-117, 1994.
  1942. A.I. Kaplinskij. Stochastic conditions for optimality. In Issled. Operacii. Modeli, Sist. Resen. 2. 1970, 119-124, 1971.
  1943. A.I. Kaplinskij, A.S. Krasnenker, and A.V. Nazin. Training of convolution principle in vector optimization problems. Autom. Control Comput. Sci. 12, No.4, 41-45, 1978.
  1944. A.I. Kaplinskij, A.E. Limarev, and G.D. Chernyshova. A construction of randomized optimization algorithms. Probl. Sluchajnogo Poiska 8, 63-91, 1980.
  1945. A.I. Kaplinskij and A.M. Pesin. A method of construction of randomized algorithms. Autom. Remote Control 43, No.12, 1551-1559 translation from Avtom. Telemekh. 1982, No.12, 65-75 (1982)., 1983.
  1946. A.I. Kaplinskij and A.I. Propoj. Stochastic approach to nonlinear programming problems. Automat. Remote Control 1970, 448-459 (970); translation from Avtomat. Telemekh. 1970, No.3, 122-133, 1970.
  1947. V.A. Kardash. Stochastic, objectively-conditioned estimates of industrial factors. Optimizatsiya 34(51), 101-121, 1984.
  1948. Uday S. Karmarkar. Convex/stochastic programming and multilocation inventory problems. Naval Res. Logist. Quart., 26(1):1-19, 1979.
  1949. H.F. Karreman. Duality in stochastic programming applied to the design and operation of reservoirs. In Recent results in stochastic programming (Proc. Meeting, Oberwolfach, 1979), volume 179 of Lecture Notes in Econom. and Math. Systems, pages 163-178. Springer, Berlin, 1980.
  1950. G.V. Karumidze and V.G. Thinvaleli. Solution of a certain class of stochastic programming problems. Sakharth. SSR Mecn. Akad. Moambe, 67:565-568, 1972.
  1951. A.N. Kashper and G.C. Varvaloucas. Trunk implementation plan for hierarchical networks. AT&T Bell Labs. Tech. J., 63(1):57-88, 1984.
  1952. E.I. Kasitskaya. Approximation of the solution of a stochastic programming problem with noise that is a homogeneous random field. In Mathematical decision-making methods under conditions of uncertainty (Russian), pages 23-27. Akad. Nauk Ukrain. SSR Inst. Kibernet., Kiev, 1990.
  1953. E.I. Kasitskaya and P.S. Knopov. Asymptotic behaviour of empirical estimators in stochastic programming problems. Sov. Math., Dokl. 42, No.3, 751-753 translation from Dokl. Akad. Nauk SSSR 315, No.2, 279-281 (1990)., 1991.
  1954. E.I. Kasitskaya and P.S. Knopov. Convergence of empirical estimates in stochastic optimization problems. Kibernetika (Kiev), 2:104-107, 112, 135, 1991.
  1955. Aldona Katkauskait\.e. Minimization algorithm in the presence of random noise. Informatica, 1(1):59-70, 186, 197, 1990.
  1956. Aldona Katkauskait\.e. Minimization of functions that are observable with noise. Teor. Optimal. Reshenii, 14:78-92, 1990.
  1957. Aldona Katkauskat\.e. An estimate of the parameters of a statistical model of global optimization. Teor. Optimal. Reshenii, 13:59-67, 1988.
  1958. V. Ja. Katkovnik. The method of averaging operators in iteration algorithms for the solution of stochastic extremal problems. Kibernetika (Kiev), 4:123-131, 1972.
  1959. V. Ja. Katkovnik. Iteration algorithms for random search in stochastic extremal problems. In Problems of random search, 2 (Russian), pages 31-42, 219. Izdat. "Zinatne", Riga, 1973.
  1960. V. Ja. Katkovnik and L.V. Ovcarova. Parametric statistical estimates in relay algorithms for random search. Avtomat. i Vycisl. Tehn. (Riga), 1:69-71, 1974.
  1961. V.Ja. Katkovnik and L.V. Ovcarova. Konvergenz und Konvergenzgeschwindigkeit der Methode der parametrischen statistischen Gradienten. Kibernetika, Kiev 1974, Nr. 2, 115-118, 1974.
  1962. V.Ja. Katkovnik and L.V. Ovcarova. Parametrical statistical evaluations in relay algorithms of random search. Avtomat. vycislit. Tehn., Riga 1974, Nr. 1, 69-71, 1974.
  1963. V.Ja. Katkovnik and L.V. Ovcarova. Parametrische statistische Abschaetzungen in mehrstufigen Algorithmen der zufaelligen Suche. Kibernetika, Kiev 1974, Nr. 3, 94-100, 1974.
  1964. V.Ya. Katkovnik. Numerical Methods for Solving Deterministic and Stochastic Minimax Problems. Naukova dumka, Kiev, 1979. (in Russian).
  1965. V.Ya. Katkovnik and V.E. Khejsin. Dynamic stochastic approximation of nonstationary solution of constrained extremum problem. Autom. Remote Control 41, 794-801 translation from Avtom. Telemekh. 1980, No.6, 70-79 (1980)., 1980.
  1966. V.Ya. Katkovnik, O.Yu. Kul'chitskij, and V.E. Khejsin. Approximation of solutions of strongly nonstationary stochastic extremal problems in continuous time. I: Principles of design of algorithms. Autom. Remote Control 43, 1424-1431 translation from Avtom. Telemekh. 1982, No.11, 73-80 (1982)., 1983.
  1967. Naoki Katoh. An e-approximation scheme for minimum variance problems. J. Oper. Res. Soc. Japan, 33(1):46-65, 1990.
  1968. I. Ya. Kats and G.A. Timofeeva. A bicriterial problem of stochastic optimization. Avtomat. i Telemekh., 3:116-123, 1997.
  1969. Eliakim Katz. A note on a comparative statics theorem for choice under risk. J. Econ. Theory 25, 318-321, 1981.
  1970. A. Kaufmann and R. Cruon. Strategies k-optimales dans les programmes dynamiques stochastiques finies. In Proc. 4th Int. Conf. Oper. Res., Boston 1966, 185-200, 1969.
  1971. Hemanshu Kaul and Sheldon H. Jacobson. New global optima results for the Kauffman NK model: handling dependency. Math. Program., 108(2-3, Ser. B):475-494, 2006.
  1972. Michal Kaut and Stein W. Wallace. Evaluation of scenario-generation methods for stochastic programming. Stochastic Programming E-Print Series, http://www.speps.org, 2003.
  1973. Michal Kaut and Stein W. Wallace. Shape-based scenario generation using copulas. Stochastic Programming E-Print Series, http://www.speps.org, 2006.
  1974. Michal Kaut and Stein W. Wallace. Evaluation of scenario generation methods for stochastic programming. Pac. J. Optim., 3(2):257-271, 2007.
  1975. Ivan Kavkler and Alenka Kavkler. Stochastic linear optimization model (SLOM) using factor analysis. In Proceedings of the 10th International Conference on Operational Research-KOI 2004, pages 111-119. Univ. Osijek Dep. Math., Osijek, 2005.
  1976. V.V. Kazakevic and I.A. Mocalov. Sequential algorithm for accelerated search for the extremum in inertial optimization objects. Dokl. Akad. Nauk SSSR, 226(1):77-80 (1 plate), 1976.
  1977. V.V. Kazakevich, I.A. Mochalov, and L.B. Prigozhin. Optimization of measurements in accelerated algorithms of extremal control. Autom. Remote Control 47, 1217-1226 translation from Avtom. Telemekh. 1986, No.9, 60-69 (1986)., 1986.
  1978. A. Kekhajov. A minimum required number of statistical tests for one class of simulation models. Avtom. Izchislitelna Tekh. 15, No.2, 47-53, 1981.
  1979. P. Kelle. Chance constrained inventory model for an asphalt mixing problem. In Recent results in stochastic programming (Proc. Meeting, Oberwolfach, 1979), volume 179 of Lecture Notes in Econom. and Math. Systems, pages 179-189, Berlin, 1980. Springer.
  1980. Peter Kelle. Stochastic programming models for safety stock allocation. In Stochastic optimization, Proc. Int. Conf., Kiev/USSR 1984, Lect. Notes Control Inf. Sci. 81, 402-411, 1986.
  1981. C.M. Keller, A.V. Cabot, and B.G. Flury. Two algorithms for global optimization. Math. Comput. Modelling, 21(12):47-59, 1995.
  1982. D.G. Kelly and J.W. Tolle. Expected number of vertices of a random convex polyhedron. SIAM J. Algebraic Discrete Methods, 2(4):441-451, 1981.
  1983. J. Kelman, J. R. Stedinger, L. A. Cooper, E. Hsu, and S-U. Yuan. Sampling stochastic dynamic programming applied to reservoir operations. Water Resources Research, 26:447-454, 1990.
  1984. R. Kelman, L. A. N. Barroso, and M. V. F. Pereira. Market power assessment and mitigation in hydrothermal systems. IEEE Transactions on Power Systems, 16(3):354-359, 2001.
  1985. Milton L. Kelmanson and Priscila Goldenberg. A convergent "small steps" feasible directions stochastic approximation algorithm. In Third Symposium on Operations Research (Univ. Mannheim, Mannheim, 1978), Section 3, volume 33 of Operations Res. Verfahren, pages 247-259. Hain, Königstein/Ts., 1979.
  1986. D.P. Kennedy. Stimulating prices in a stochastic model of resource allocation. Math. Oper. Res. 8, 151-157, 1983.
  1987. D.P. Kennedy. Optimal sequential assignment. Math. Oper. Res., 11(4):619-626, 1986.
  1988. A.S. Kenyon and D.P. Morton. Stochastic vehicle routing with random travel times. Transportation Science, 37:69-82, 2003.
  1989. Astrid S. Kenyon and David P. Morton. A survey on stochastic location and routing problems. CEJOR Cent. Eur. J. Oper. Res., 9(4):277-328, 2001.
  1990. C. M. Kenyon, S. Savage, and B. Ball. Equivalence of linear deviation about the mean and mean absolute deviation about the mean objective functions. Oper. Res. Lett., 24(4):181-185, 1999.
  1991. G. Keri. On the two-stage programming under uncertainty. Stud. Sci. Math. Hungar. 5, 37-40, 1970.
  1992. B. P. Kharlamov. Semi-Markov processes for finding a maximum. Avtomat. i Telemekh., (9):97-111, 2000.
  1993. Lov Kumar Kher and Soroosh Sorooshian. A predictive demand model for systems planning, using noisy realization theory. Automatica 24, No.5, 671-676, 1988.
  1994. I.L. Khranovich. Simulation of optimal development for water-supply systems. II: A flow approach. Autom. Remote Control 45, 1346-1353 translation from Avtom. Telemekh. 1984, No.10, 121-130 (1984)., 1984.
  1995. V.N. Khrapko. Full-step relaxation algorithms for stochastic programming. In Dynamic systems, No. 2, pages 97-102. "Vishcha Shkola", Kiev, 1983.
  1996. V.M. Kibardin. Decomposition into functions in the minimization problem. Automat. Remote Control, 40(9, part 1):1311-1323 (1980), 1979.
  1997. A. I. Kibzun and E. A. Kuznetsov. Convex properties of the quantile function in stochastic programming problems. Avtomat. i Telemekh., (2):33-42, 2004.
  1998. A. I. Kibzun and I. V. Nikulin. Discrete approximation of a linear two-stage stochastic programming problem with a quantile criterion. Avtomat. i Telemekh., (8):127-137, 2001.
  1999. A. I. Kibzun and G. L. Tretyakov. On the smoothness of the criterial function in the quantile optimization problem. Avtomat. i Telemekh., 9:69-80, 1997.
  2000. A.I. Kibzun and Y.S. Kan. Stochastic Programming Problems with Probability and Quantile Functions. Wiley, Chichester, 1996.
  2001. A.I. Kibzun and V.Yu. Kurbakovskij. Guaranteeing approach to solving quantile optimization problems. Ann. Oper. Res. 30, 81-93, 1991.
  2002. A.I. Kibzun, A.A. Lebedev, and V.V. Malyshev. Reduction of an optimization problem with probabilistic constraints to an equivalent minimax problem. Soviet J. Comput. Systems Sci., 23(1):39-47, 1985.
  2003. A.I. Kibzun and V.V. Malyshev. Generalized minimax approach to solving optimization problems with chance constraints. Engrg. Cybernetics, 22(1):105-114 (1985), 1984.
  2004. A.I. Kibzun and V.V. Malyshev. Optimal control of a discrete-time stochastic system. Sov. J. Comput. Syst. Sci. 24, No.2, 69-77 translation from Izv. Akad. Nauk SSSR, Tekh. Kibern. 1985, No.6, 113-120 (1985)., 1986.
  2005. A.I. Kibzun and V.V. Malyshev. Probabilistic optimization problems. Sov. J. Comput. Syst. Sci. 28, No.4, 52-60 translation from Izv. Akad. Nauk SSSR, Tekh. Kibern. 1989, No.6, 46-55 (1989)., 1990.
  2006. A.I. Kibzun and A.V. Naumov. Two-stage problems of quantile linear programming. Avtomat. i Telemekh., 1:83-93, 1995.
  2007. Andrey Kibzun and Riho Lepp. Discrete approximation in quantile problem of portfolio selection. In Stochastic optimization: algorithms and applications (Gainesville, FL, 2000), volume 54 of Appl. Optim., pages 121-135. Kluwer Acad. Publ., Dordrecht, 2001.
  2008. Masaaki Kijima and Masamitsu Ohnishi. Stochastic orders and their applications in financial optimization. Math. Methods Oper. Res., 50(2):351-372, 1999. Financial optimization.
  2009. Masaaki Kijima and Akihisa Tamura. On the greedy algorithm for stochastic optimization problems. In Stochastic modelling in innovative manufacturing (Cambridge, 1995), volume 445 of Lecture Notes in Econom. and Math. Systems, pages 19-29. Springer, Berlin, 1997.
  2010. Hyong Sop Kim. A computational procedure of the stochastic programming problem. Cho-son In-min Kong-hwa-kuk Kwa-hak-won T'ong-bo, 4:39-43, 1982.
  2011. Joocheol Kim. Estimation of optimality gap using stratified sampling. Appl. Math. Comput., 171(2):710-720, 2005.
  2012. Tae-ho Kim and Soon Dal Park. A decomposition method for two stage stochastic programming with block diagonal structure. J. Korean Oper. Res. Manage. Sci. Soc. 10, No.1, 9-13, 1985.
  2013. Yong Kim. Convergence of a generalized gradient descent algorithm for limit extremal problems. Su-hak, 3:22-24, 1995.
  2014. A.J. King. An implementation of the Lagrangian finite-generation method. In Numerical techniques for stochastic optimization, volume 10 of Springer Ser. Comput. Math., pages 295-311. Springer, Berlin, 1988.
  2015. A.J. King. Stochastic programming problems: examples from the literature. In Numerical techniques for stochastic optimization, volume 10 of Springer Ser. Comput. Math., pages 543-567. Springer, Berlin, 1988.
  2016. A.J. King, editor. Approximation and computation in stochastic programming. North-Holland Publishing Co., Amsterdam, 1996. Math. Programming 75 (1996), no. 2, Ser. B, see also Erratum in Math. Programming 80 (1998), no. 1, Ser. A.
  2017. A.J. King, R.T. Rockafellar, L. Somlyody, and R.J.-B. Wets. Lake eutrophication management: The Lake Balaton project. In Numerical techniques for stochastic optimization, Springer Ser. Comput. Math. 10, 435-444, 1988.
  2018. A.J. King and R.J.-B. Wets. Erratum: "Epi-consistency of convex stochastic programs". Stochastics Stochastics Rep., 37(4):259-260, 1991.
  2019. Alan King and Lisa Korf. Martingale pricing measures in incomplete markets via stochastic programming duality in the dual of L¥. Stochastic Programming E-Print Series, http://www.speps.org, 2001.
  2020. Alan J. King. Asymmetric risk measures and tracking models for portfolio optimization under uncertainty. Ann. Oper. Res. 45, No.1-4, 165-177, 1993.
  2021. Alan J. King. Duality and martingales: a stochastic programming perspective on contingent claims. Math. Program., 91(3, Ser. B):543-562, 2002. ISMP 2000, Part 1 (Atlanta, GA).
  2022. Alan J. King, Matti Koivu, and Teemu Pennanen. Calibrated option bounds. Stochastic Programming E-Print Series, http://www.speps.org, 2003.
  2023. Alan J. King and R. Tyrrell Rockafellar. Asymptotic theory for solutions in statistical estimation and stochastic programming. Math. Oper. Res., 18(1):148-162, 1993.
  2024. Alan J. King, László Somlyódy, and Roger J.-B. Wets. Stochastic optimization for lake eutrophication management. In Applications of stochastic programming, volume 5 of MPS/SIAM Ser. Optim., pages 347-378. SIAM, Philadelphia, PA, 2005.
  2025. Alan J. King, Samer Takriti, and Shabbir Ahmed. Issues in risk modeling for multi-stage systems. Ibm research report rc 20993, IBM Research Division, T.J. Watson Research Center, Yorktown Heights, New York, 1997.
  2026. Alan J. King and Roger J.-B. Wets. Epi-consistency of convex stochastic programs. Stochastics Stochastics Rep., 34(1-2):83-92, 1991.
  2027. Alan J. King, Stephen E. Wright, Gyana R. Parija, and Robert Entriken. The IBM stochastic programming system. In Applications of stochastic programming, volume 5 of MPS/SIAM Ser. Optim., pages 21-36. SIAM, Philadelphia, PA, 2005.
  2028. M.J.L. Kirby. The current state of chance-constrained programming. In Proceedings of the Princeton Symposium on Mathematical Programming (Princeton, 1967), pages 93-111, Princeton, N.J., 1970. Princeton Univ. Press.
  2029. Scott Kirkpatrick. Optimization by simulated annealing: quantitative studies. J. Statist. Phys., 34(5-6):975-986, 1984.
  2030. V.P. Kirlitsa. On a stochastic programming problem with linear decision rules. Vestn. Beloruss. Gos. Univ. Im. V. I. Lenina, Ser. I 1983, No.1, 35-37, 1983.
  2031. V.P. Kirlitsa. A problem of linear stochastic programming with two-sided constraints. Vestnik Beloruss. Gos. Univ. Ser. I, 1:33-36, 79, 1985.
  2032. V.P. Kirlitsa and A. Casado. On a problem of stochastic linear programming with nondeterministic constraint matrix. Investigación Oper., 27:3-8, 1979.
  2033. V.P. Kirlitsa and Rosa Vázquez. On a problem of stochastic linear programming with two-sided constraints. Investigación Oper., 27:9-16, 1979.
  2034. V.P. Kirlitza and Alfonso Casado Collado. On a problem of stochastic linear programming. Investigación Oper., 1(1):27-33, 1980.
  2035. V.P. Kirlitza and Alfonso Casado Collado. On the problem of linear stochastic programming with the uniform distribution. Investigación Oper., 3(2):41-50, 1982.
  2036. N.I. Kiselev. Linear programming in extremal problems of statistics. In Statistics. Probability. Economics, volume 49 of Uchen. Zap. Statist., pages 31-39. "Nauka", Moscow, 1985.
  2037. V.G. Kiselev. Approximation of probability constraints in some production planning problems. U.S.S.R. Comput. Math. Math. Phys. 23, No.1, 56-63 translation from Zh. Vychisl. Mat. Mat. Fiz. 23, No.1, 83-94 (1983)., 1983.
  2038. E. M. Kiseleva and K. A. Kuznetsov. On the solution of the continuous stochastic problem of optimal partitioning with reconstruction of the objective function. Problemy Upravlen. Inform., 151(6):81-88, 1998.
  2039. E.M. Kiseleva and N.Z. Shor. The solution of the continuous optimal decomposition problem with incomplete initial data. Comput. Math. Math. Phys. 31, No.6, 13-20 translation from Zh. Vychisl. Mat. Mat. Fiz. 31, No.6, 799-809 (1991)., 1991.
  2040. K.C. Kiwiel, C.H. Rosa, and A. Ruszczy\'nski. Decomposition via alternating linearization. Working paper WP-95-051, IIASA, Laxenburg, 1995.
  2041. Krzysztof C. Kiwiel. Proximal minimization methods with generalized Bregman functions. SIAM J. Control Optim., 35(4):1142-1168, 1997.
  2042. Krzysztof C. Kiwiel, Charles H. Rosa, and Andrzej Ruszczy\'nski. Proximal decomposition via alternating linearization. SIAM J. Optim., 9(3):668-689, 1999.
  2043. G. Kjellstroem and L. Taxen. Gaussian adaptation, an evolution-based efficient global optimizer. In Computational and applied mathematics, I. Algorithms and theory, Sel. Rev. Pap. IMACS 13th World Congr., Dublin/Irel. 1991, 267-276, 1992.
  2044. Gregor Kjellström and Lars Taxén. Stochastic optimization in system design. IEEE Trans. Circuits and Systems, 28(7):702-715, 1981.
  2045. Hans-Siegfried Klausmann. Stochastische Entscheidungsbäume. Verlag Anton Hain, Meisenheim am Glan, 1976. Ein Beitrag zur Lösung von sequentiellen Entscheidungsproblemen bei Risiko, Mit einem Vorwort von M. Meyer, Beiträge zur Datenverarbeitung und Unternehmensforschung, Band 18.
  2046. G. Klein, H. Moskowitz, and A. Ravindran. Interactive multiobjective optimization under uncertainty. Management Sci., 36(1):58-75, 1990.
  2047. Willem K. Klein Haneveld. Duality in stochastic linear and dynamic programming, volume 274 of Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, Berlin, 1986.
  2048. Willem K. Klein Haneveld. Robustness against dependence in PERT: An application of duality and distributions with known marginals. Math. Program. Study 27, 153-182, 1986.
  2049. Willem K. Klein Haneveld, Leen Stougie, and Maarten H. van der Vlerk. On the convex hull of the simple integer recourse objective function. Ann. Oper. Res., 56:209-224, 1995. Stochastic programming (Udine, 1992).
  2050. Willem K. Klein Haneveld, Leen Stougie, and Maarten H. van der Vlerk. An algorithm for the construction of convex hulls in simple integer recourse programming. Ann. Oper. Res., 64:67-81, 1996. Stochastic programming, algorithms and models (Lillehammer, 1994).
  2051. Willem K. Klein Haneveld, Leen Stougie, and Maarten H. van der Vlerk. Simple integer recourse models. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  2052. Willem K. Klein Haneveld, Leen Stougie, and Maarten H. van der Vlerk. Simple integer recourse models: convexity and convex approximations. Math. Program., 108(2-3, Ser. B):435-473, 2006.
  2053. Willem K. Klein Haneveld and Maarten H. van der Vlerk. On the expected value function of a simple integer recourse problem with random technology matrix. J. Comput. Appl. Math., 56(1-2):45-53, 1994. Stochastic programming: stability, numerical methods and applications (Gosen, 1992).
  2054. Willem K. Klein Haneveld and Maarten H. van der Vlerk. Stochastic integer programming: general models and algorithms. Ann. Oper. Res., 85:39-57, 1999. Stochastic programming. State of the art, 1998 (Vancouver, BC).
  2055. Willem K. Klein Haneveld and Maarten H. van der Vlerk. Optimizing electricity distribution using two-stage integer recourse models. In Stochastic optimization: algorithms and applications (Gainesville, FL, 2000), volume 54 of Appl. Optim., pages 137-154. Kluwer Acad. Publ., Dordrecht, 2001.
  2056. Willem K. Klein Haneveld and Maarten H. van der Vlerk. Integrated chance constraints: reduced forms and an algorithm. Comput. Manag. Sci., 3(4):245-269, 2006.
  2057. W.K. Klein Haneveld. Some linear programs in probabilities and their duals. In Convexity and duality in optimization (Groningen, 1984), volume 256 of Lecture Notes in Econom. and Math. Systems, pages 95-141, Berlin, 1985. Springer.
  2058. W.K. Klein Haneveld. On integrated chance constraints. In Stochastic programming (Gargnano, 1983), volume 76 of Lecture Notes in Control and Inform. Sci., pages 194-209. Springer, Berlin, 1986.
  2059. W.K. Klein Haneveld, L. Stougie, and M.H. van der Vlerk. Stochastic integer programming with simple recourse. Research Memorandum 455, Institute of Economic Research, University of Groningen, 1991.
  2060. W.K. Klein Haneveld, L. Stougie, and M.H. van der Vlerk. On the convex hull of the composition of a separable and a linear function. Discussion Paper 9570, CORE, Louvain-la-Neuve, Belgium, 1995.
  2061. W.K. Klein Haneveld, L. Stougie, and M.H. van der Vlerk. Convex approximations for simple integer recourse models by perturbing the underlying distribution. Research Report 97A19, SOM, University of Groningen, 1997.
  2062. W.K. Klein Haneveld, L. Stougie, and M.H. van der Vlerk. Convex simple integer recourse models. Research Report 97A10, SOM, University of Groningen, 1997.
  2063. W.K. Klein Haneveld, M.H. Streutker, and M.H. van der Vlerk. An ALM model for pension funds using integrated chance constraints. Research Report 05A03, SOM, University of Groningen, 2005. Revision of 03A21.
  2064. W.K. Klein Haneveld, M.H. Streutker, and M.H. van der Vlerk. Modeling ALM for dutch pension funds. In J. Safrankova and J. Pavlu, editors, WDS'06 Proceedings of Contributed Papers: Part I - Mathematics and Computer Sciences, pages 100-105, Prague, 2006. Matfyzpress.
  2065. W.K. Klein Haneveld and M.H. van der Vlerk. Optimizing electricity distribution using two-stage integer recourse models. In S. Uryasev and P.M. Pardalos, editors, Stochastic Optimization: Algorithms and Applications, pages 137-154. Kluwer Academic Publishers, 2001.
  2066. W.K. Klein Haneveld and M.H. van der Vlerk. Stochastic Programming (Lecture Notes). Available on request, e-mail m.h.van.der.vlerk@rug.nl, 2007.
  2067. N. L. Kleinman. Stochastic approximation algorithms: theory and applications. Ph.D. thesis, Dept. of Mathematical Sciences, The Johns Hopkins University, 1996.
  2068. N.L. Kleinman, S.D. Hill, and V.A. Ilenda. SPSA/SIMMOD optimization of air traffic delay cost. In Proceedings of the American Control Conference, pages 1121-1125, 1997.
  2069. N.L. Kleinman, J.C. Spall, and D.Q. Naiman. Simulation-based optimization with stochastic approximation using common random numbers. Management Science, 45:1570-1578, 1999.
  2070. Anton J. Kleywegt and Jason D. Papastavrou. The dynamic and stochastic knapsack problem. Oper. Res., 46(1):17-35, 1998.
  2071. Anton J. Kleywegt and Jason D. Papastavrou. The dynamic and stochastic knapsack problem with random sized items. Oper. Res., 49(1):26-41, 2001.
  2072. Anton J. Kleywegt, Alexander Shapiro, and Tito Homem-de Mello. The sample average approximation method for stochastic discrete optimization. SIAM J. Optim., 12(2):479-502 (electronic), 2001/02.
  2073. Allen Klinger and O.L. Mangasarian. Logarithmic convexity and geometric programming. J. math. Analysis Appl. 24, 388-408, 1968.
  2074. Rolf Kloetzler. Dualitaet und Fehlerabschaetzungen bei stochastischer diskreter dynamischer Optimierung. Seminarber., Humboldt-Univ. Berlin, Sekt. Math. 39, 114-124, 1981.
  2075. Leszek Klukowski. Some probabilistic properties of the nearest adjoining order method and its extensions. Ann. Oper. Res., 51:241-261, 1994. Support for decision and negotiation processes (Warsaw, 1992).
  2076. Leonhard Knauff. Ein Programm zur Parameterschätzung in nichtlinearen Modellen. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe, 34(1):149-152, 1985.
  2077. Charles S. Knode and Lloyd A. Swanson. A stochastic model for bidding. J. Oper. Res. Soc. 29, 951-957, 1978.
  2078. P. S. Knopov and E. I. Kasitskaya. On large deviations of empirical estimates in stochastic programming problems. Kibernet. Sistem. Anal., 40(4):52-60, 189, 2004.
  2079. P. S. Knopov and E. I. Kasitskaya. On the convergence of empirical estimates in stochastic programming problems in discrete-time processes. Kibernet. Sistem. Anal., 41(1):175-178, 191, 2005.
  2080. Pavel S. Knopov and Evgeniya J. Kasitskaya. Empirical estimates in stochastic optimization and identification, volume 71 of Applied Optimization. Kluwer Academic Publishers, Dordrecht, 2002.
  2081. P.S. Knopov. Remarks on the minimization of nondifferentiable functions. Kibernetika (Kiev), 2:44-45, 1975.
  2082. P.S. Knopov. Weak convergence of measures generated by iterative procedures in Hilbert space. Dokl. Akad. Nauk SSSR, 256(1):29-32, 1981.
  2083. P.S. Knopov. An approach to solving problems of stochastic optimization. Kibernetika (Kiev), 4:126-127, 136, 1988.
  2084. P.S. Knopov and E.J. Kasitskaya. Properties of empirical estimates in stochastic optimization and identification problems. Ann. Oper. Res., 56:225-239, 1995. Stochastic programming (Udine, 1992).
  2085. M. Knott. Randomized decisions in chance-constrained programming. J. Oper. Res. Soc. 36, 959-961, 1985.
  2086. M.I. Koch, D.C. Chin, and R.H. Smith. Network-wide approach to optimal signal light timing for integrated transit vehicle and traffic operations. In Proceedings of the 7th National Conference on Light Rail Transit, volume 2, pages 126-131. National Academy of Sciences Press, 1997.
  2087. A.I. Kochubinskii. Recognition of pulse packets under conditions of incomplete information. Dokl. Akad. Nauk Ukrain. SSR Ser. A, 12:56-58, 86, 1988.
  2088. U. Kockelkorn. Ein linearen Mehrentscheidungsmodell. Metrika 26, 169-182, 1979.
  2089. Gerald Koenke. Lineare und stochastische Optimierung mit dem PC. (Linear and stochastic optima with the PC). Mikro-Computer-Praxis. Stuttgart: B. G. Teubner. 157 S., 1987.
  2090. Konstantin Kogan, Eugene Khmelnitsky, and Toshihide Ibaraki. Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships. J. Global Optim., 31(1):17-43, 2005.
  2091. Matti Koivu. Variance reduction in sample approximations of stochastic programs. Stochastic Programming E-Print Series, http://www.speps.org, 2004.
  2092. Matti Koivu. Variance reduction in sample approximations of stochastic programs. Math. Program., 103(3, Ser. A):463-485, 2005.
  2093. M.A. Kokorev. Construction of a stochastic algorithm, optimal for one step, for the approximation of a Lipschitz function. Zh. Vychisl. Mat. i Mat. Fiz., 30(5):652-662, 798, 1990.
  2094. V.V. Kolbin. Stochastische Programmierung. In Itogi Nauki, Ser. Mat., Teor. Verojatn., mat. Statist., teor. Kibernet. 1968, 5-68, 1970.
  2095. V.V. Kolbin. Stochastic programming. In Progress Math. 11, 1-75, 1971.
  2096. V.V. Kolbin. Stochastic programming. Theory and Decision Library. Vol. 14. Dordrecht - Boston: D. Reidel Publishing Company, 1977. Translated from Russian by Igor P. Grigoryev.
  2097. Waldemar Kolodziejczyk. On equivalence of two optimization methods for fuzzy discrete programming problems. Eur. J. Oper. Res. 36, No.1, 85-91, 1988.
  2098. Michael Kolonko. Uniform bounds for a dynamic programming model under adaptive control using exponentially bounded error probabilities. In Mathematical learning models-theory and algorithms (Bad Honnef, 1982), volume 20 of Lecture Notes in Statist., pages 108-114. Springer, New York, 1983.
  2099. E. Komaromi. A dual approach to stochastic linear programming problems constrained by logarithmic concave joint probability distribution function. Alkalmazott Mat. Lapok 9, 85-92, 1983.
  2100. É. Komáromi. A dual method for probabilistic constrained problems. Math. Programming Stud., 28:94-112, 1986. Stochastic programming 84. II.
  2101. É. Komáromi. On properties of the probabilistic constrained linear programming problem and its dual. J. Optim. Theory Appl., 55(3):377-390, 1987.
  2102. É. Komáromi. Probabilistic constraints in primal and dual linear programs: duality results. J. Optim. Theory Appl., 75(3):587-602, 1992.
  2103. Éva Komáromi. Actual approach to stochastic linear programming problems constrained by logarithmic concave joint probability distribution function. Alkalmaz. Mat. Lapok, 9(1-2):85-92, 1983.
  2104. Éva Komáromi. Duality in probabilistic constrained linear programming. In System modelling and optimization (Budapest, 1985), volume 84 of Lecture Notes in Control and Inform. Sci., pages 423-429. Springer, Berlin, 1986.
  2105. Éva Komáromi. On the convergence of a dual algorithm for the solution of the probabilistic constrained linear programming problem. Alkalmaz. Mat. Lapok, 14(1-2):85-98, 1989.
  2106. S.V. Komolov, S.P. Makeev, G.P. Serov, and I.F. Shakhnov. Optimal control of a finite automaton with fuzzy constraints and a fuzzy target. Cybernetics, 15(6):805-810 (1980), 1979.
  2107. Nan Kong, Andrew Schaefer, and Shabbir Ahmed. Totally unimodular stochastic programs. Optimization Online, http://www.optimization-online.org, 2006.
  2108. Nan Kong and Andrew J. Schaefer. A factor 1/2 approximation algorithm for a class of two-stage stochastic mixed-integer programs. Stochastic Programming E-Print Series, http://www.speps.org, 2004.
  2109. Nan Kong and Andrew J. Schaefer. A factor 1/2 approximation algorithm for two-stage stochastic matching problems. European J. Oper. Res., 172(3):740-746, 2006.
  2110. Nan Kong, Andrew J. Schaefer, and Brady Hunsaker. Two-stage integer programs with stochastic right-hand sides. Stochastic Programming E-Print Series, http://www.speps.org, 2004.
  2111. Ger Koole. Stochastic scheduling with event-based dynamic programming. Math. Methods Oper. Res., 51(2):249-261, 2000.
  2112. Charles Kooperberg and Charles J. Stone. Stochastic optimization methods for fitting polyclass and feed-forward neural network models. J. Comput. Graph. Statist., 8(2):169-189, 1999.
  2113. Jozef Kopec and Bogdan Krawiec. Application of model "P" in a plant production optimization problem. Przegl. Stat. 29, 551-558, 1982.
  2114. Lisa A. Korf. A finite-dimensional approach to infinite-dimensional constraints in stochastic programming duality. In Stochastic optimization: algorithms and applications (Gainesville, FL, 2000), pages 155-167. Kluwer Acad. Publ., Dordrecht, 2001.
  2115. Lisa A. Korf. Stochastic programming duality: L¥ multipliers with an application to mathematical finance. Stochastic Programming E-Print Series, http://www.speps.org, 2001.
  2116. Lisa A. Korf. Stochastic programming duality: L\sp ¥ multipliers for unbounded constraints with an application to mathematical finance. Math. Program., 99(2, Ser. A):241-259, 2004.
  2117. Lisa A. Korf and Roger J.-B. Wets. An ergodic theorem for stochastic programming problems. In Optimization (Namur, 1998), pages 203-217. Springer, Berlin, 2000.
  2118. Lisa A. Korf and Roger J.-B. Wets. Random lsc functions: An ergodic theorem. Stochastic Programming E-Print Series, http://www.speps.org, 2000.
  2119. Lisa A. Korf and Roger J.-B. Wets. Random lsc functions: Scalarization. Stochastic Programming E-Print Series, http://www.speps.org, 2000.
  2120. Lisa A. Korf and Roger J.-B. Wets. Random-lsc functions: an ergodic theorem. Math. Oper. Res., 26(2):421-445, 2001.
  2121. A.S. Korkhin. Some properties of estimates for regression parameters with a priori inequality constraints. Kibernetika (Kiev), 6:iv, 106-114, 1985.
  2122. J.S.H. Kornbluth. Duality, indifference and sensitivity analysis in multiple objective linear programming. Operat. Res. Quart. 25, 599-614, 1974.
  2123. J. Koronacki. On the convergence of minimization algorithms in problems described by stochastic equations. In 18. internat. wiss. Kolloqu., Ilmenau 1, 51-53, 1973.
  2124. Ja. Koronacki. The convergence of random search algorithms. Avtomat. i Vycisl. Tehn. (Riga), 4:43-49, 92, 1976.
  2125. Jacek Koronacki. A stochastic approximation counterpart of the feasible direction method. Statist. Probab. Lett., 5(6):415-419, 1987.
  2126. A.P. Korostelev. Multistep procedures of stochastic optimization. Autom. Remote Control 42, No.5, 621-628 translation from Avtom. Telemekh. 1981, No.5, 82-90 (1981)., 1981.
  2127. A.P. Korostelev and E.A. Kitaev. Comparison of asymptotic behaviour of stochastic approximation and random search procedures. Avtom. Vychisl. Tekh. 1977, No.6, 37-38, 1977.
  2128. K.O. Kortanek. Semi-infinite programming duality for order restricted statistical inference models. Z. Oper. Res., 37(3):285-301, 1993.
  2129. J. Korycki. On a distributed implementation of a decomposition method for multistage linear stochastic programs. Optimization, 38(2):173-200, 1996.
  2130. Bernd Kost. Structural design via evolution strategies. In Stochastic programming (Neubiberg/München, 1993), volume 423 of Lecture Notes in Econom. and Math. Systems, pages 71-92. Springer, Berlin, 1995.
  2131. L.P. Kostina. A method for solving the optimal resource allocation problem on stochastic networks with a complex space-time structure. Vestnik S.-Peterburg. Univ. Mat. Mekh. Astronom., 3:36-43, 116-117, 1992.
  2132. Vassilis S. Kouikoglou and Yannis A. Phillis. Minimax design of two-state k-out-of-n systems. Appl. Stochastic Models Data Anal., 9(3):245-250, 1993.
  2133. R. Kouwenberg. Scenario generation and stochastic programming models for asset liability management. European Journal of Operational Research, 134(2):279-292, 2001.
  2134. I.N. Kovalenko. Probabilistic Calculation and Optimization. Naukova dumka, Kiev, 1989. (in Russian).
  2135. I.N. Kovalenko, N.Yu. Kuznetsov, and A.N. Nakonechnyj. Optimization of the characteristics of the reliability of systems on the basis of using qualitative estimates of continuity and methods of accelerate modeling. In Zolotarev, V. M. (ed.) et al., Stability problems of stochastic models. Seminar proceedings, Sukhumi (USSR), October 1987. Moskva: Vsesoyuznyj Nauchno-Issledovatel'skij Institut Sistemnykh Issledovanij, Probl. Ustojch. Stokhasticheskikh Modelej, Tr. Semin. 79-84, 1988.
  2136. I.N. Kovalenko and A.N. Nakonechnyj. Approximate calculation and optimization of reliability. (Priblizhennyj raschet i optimizatsiya nadezhnosti). Naukova Dumka, Kiev, 1989.
  2137. M.M. Kovalev and V.A. Pir'yanovich. Locally stochastic algorithms of discrete optimization (experiments and computational experience). Cybernetics, 18(1):127-132, 1982.
  2138. S.V. Kovalev and V.V. Mazalov. A risk function in global optimization problem. In Probabilistic methods in discrete mathematics (Petrozavodsk, 1992), volume 1 of Progr. Pure Appl. Discrete Math., pages 266-270. VSP, Utrecht, 1993.
  2139. S.V. Kovalev and V.V. Mazalov. The risk function in the problem of the design of an experiment. In Modeling of natural systems and optimal control problems (Russian) (Chita), pages 83-92. VO "Nauka", Novosibirsk, 1993.
  2140. P. Kovanic and R.A. Barack. Robust survival model as an optimization problem. In System modelling and optimization (Compiègne, 1993), volume 197 of Lecture Notes in Control and Inform. Sci., pages 375-382. Springer, London, 1994.
  2141. Andrzej Koziarski. Application of the stochastic subgradient method for long-term planning of the state of a dynamic plant operating in the presence of random disturbances. Arch. Automat. Telemech., 25(4):507-517 (1981), 1980.
  2142. O. Krafft. Dual optimization problems in stochastics. Jahresber. Deutsch. Math.-Verein., 83(3):97-105, 1981.
  2143. W.F Krajewski. The sequential problem under uncertainty. The development of water systems. Comput. Math. Appl, 8:313-318, 1982.
  2144. A.S. Krasnenker. The method of local improvements in the vector-optimization problem. Autom. Remote Control 36, 419-422 translation from Avtom. Telemekh. 1975, No.3, 75-79 (1975)., 1975.
  2145. A.A. Krasovskii. Continuous algorithms and the stochastic dynamics of searching for an extremum. Avtomat. i Telemekh., 4:55-65, 1991. See also Erratum, ibid. 10:189, 1991.
  2146. A.N. Krasovskij. Control under minimax of an integral functional. Sov. Math., Dokl. 44, No.2, 525-528 translation from Dokl. Akad. Nauk SSSR 320, No.4, 785-788 (1991)., 1992.
  2147. N.N. Krasovskij. A minimax control problem. Differ. Equations 18, 1511-1517 translation from Differ. Uravn. 18, No.12, 2126-2132 (1982)., 1983.
  2148. N.N. Krasovskij. Control with deficit of information. Sov. Math., Dokl. 31, 108-112 translation from Dokl. Akad. Nauk SSSR 280, 536-540 (1985)., 1985.
  2149. N.N. Krasovskij and V.E. Tret'yakov. A stochastic program synthesis of a guaranteeing control. Probl. Control Inf. Theory 12, 79-95 (Russian. English translation enclosed), 1983.
  2150. L.V. Kravtsova, Ya. D. Plotkin, and L.G. Smyshlyaeva. On the theory of optimization with respect to a probability criterion and its use in calculating the output percentage of nondefective semiconductor devices. In Partial differential equations (Russian), pages 70-79. "Obrazovanie", St. Petersburg, 1992.
  2151. Jacek B. Krawczyk. On variance constrained programming. Asia-Pacific J. Oper. Res., 7(2):190-208, 1990.
  2152. L.I. Krechetov. Necessary conditions of optimality with constraints which are valid "almost everywhere" with respect to a controlled measure. In Studies in stochastic optimization and mathematical economics, Moskva, 89- 130, 1986.
  2153. Christian Kredler. An SQP-method for linearly constrained maximum likelihood problems. In Applied mathematics and parallel computing, pages 157-174. Physica, Heidelberg, 1996.
  2154. J. Kreimer. Generalized estimates for performance sensitivities of stochastic systems. Math. Comput. Modelling 10, No.12, 911-922, 1988.
  2155. J. Kreimer and R.Y. Rubinstein. Smoothed functionals and constrained stochastic approximation. SIAM J. Numer. Anal., 25(2):470-487, 1988.
  2156. Moshe Kress. The chance constrained critical path with location-scale distributions. Eur. J. Oper. Res. 18, 359-363, 1984.
  2157. Ortwin Kreutzberger. Bemerkungen zur Quotienten- und Produktoptimierung mit Anwendung beim Risikoproblem der stochastischen Optimierung. Wiss. Z. Martin-Luther Univ. Halle-Wittenberg, Math.-naturw. R. 27, No.3, 75-79, 1978.
  2158. Ortwin Kreutzberger and Lothar Kuegler. Bestimmung von Stabilitaetsbereichen in der stochastischen linearen Optimierung mit Hilfe parametrischer Optimierung und Regressionsrechnung. Wiss. Z., Martin-Luther-Univ. Halle-Wittenberg, Math.-Naturwiss. Reihe 26, No.5, 71-79, 1977.
  2159. A. Krishnamoorthy and P. V. Ushakumari. k-out-of-n G system with repair: the D-policy. Comput. Oper. Res., 28(10):973-981, 2001.
  2160. Trine Krogh Kristoffersen. Deviation measures in linear two-stage stochastic programming. Math. Methods Oper. Res., 62(2):255-274, 2005.
  2161. Nikolai Krivulin. An analysis of gradient estimates in stochastic network optimization problems. In Model-oriented data analysis (Petrodvorets, 1992), Contrib. Statist., pages 227-240. Physica, Heidelberg, 1993.
  2162. Nikolai Krivulin. Unbiased estimates for gradients of stochastic network performance measures. Acta Appl. Math., 33(1):21-43, 1993. Stochastic optimization.
  2163. P. Krokhmal, S. Uryasev, and G. Zrazhevsky. Numerical comparison of conditional value-at-risk and conditional drawdown-at-risk approaches: application to hedge funds. In Applications of stochastic programming, volume 5 of MPS/SIAM Ser. Optim., pages 609-631. SIAM, Philadelphia, PA, 2005.
  2164. Pavlo Krokhmal, Robert Murphey, Panos Pardalos, and Stanislav Uryasev. Use of conditional value-at-risk in stochastic programs with poorly defined distributions. In Recent developments in cooperative control and optimization, volume 3 of Coop. Syst., pages 225-241. Kluwer Acad. Publ., Boston, MA, 2004.
  2165. Pavlo A. Krokhmal and Robert Murphey. Modeling and implementation of risk-averse preferences in stochastic programs using risk measures. In Robust optimization-directed design, volume 81 of Nonconvex Optim. Appl., pages 95-116. Springer, New York, 2006.
  2166. Piotr Krysta and Roberto Solis-Oba. Approximation algorithms for bounded facility location problems. J. Comb. Optim., 5(2):233-247, 2001.
  2167. Mikio Kubo and Hiroshi Kasugai. Randomized decision strategy for the hierarchical optimization problems. J. Oper. Res. Soc. Japan 33, No.4, 335-353, 1990.
  2168. Christian Küchler and Stefan Vigerske. Decomposition of multistage stochastic programs with recombining scenraio trees. Stochastic Programming E-Print Series, http://www.speps.org, 2007.
  2169. A. Kucia and A. Nowak. On e-optimal continuous selectors and their application in discounted dynamic programming. J. Optimization Theory Appl. 54, 289-302, 1987.
  2170. V. ¯I. Kud¯in and G. ¯I. Kud¯in. Application of the small parameter method to the investigation of weakly nonlinear systems. II. V¯isn. Kiïv. Un¯iv. Ser. F¯iz.-Mat. Nauki, (3):252-256, 2000.
  2171. Daniel Kuhn. Aggregation and discretization in multistage stochastic programming. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  2172. Daniel Kuhn. Generalized bounds for convex multistage stochastic programs, volume 548 of Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, Berlin, 2005.
  2173. Daniel Kuhn. Convergent bounds for stochastic programs with expected value constraints. Stochastic Programming E-Print Series, http://www.speps.org, 2006.
  2174. O.Yu. Kul'chitskij. Non-Markov algorithms for statistical optimization with continuous time. I. Autom. Remote Control 39, 680-691 translation from Avtom. Telemekh. 1978, No.5, 73-86 (1978)., 1978.
  2175. O.Yu. Kul'chitskij. Non-Markovian algorithms for statistical optimization with continuous time. II. Autom. Remote Control 39, 823-832 translation from Avtom. Telemekh. 1978, No.6, 56-66 (1978)., 1978.
  2176. O.Yu. Kul'chitskij. Sufficient conditions for convergence of stochastic approximation algorithms for random processes with continuous time. Cybernetics 15, 901-917 translation from Kibernetika 1979, No.6, 114-126 (1979)., 1980.
  2177. O.Yu. Kul'chitskij. Accelerated convergence effect in stochastic programming algorithms with correlated noise. Autom. Remote Control 47, 375-379 translation from Avtom. Telemekh. 1986, No.3, 94-99 (1986)., 1986.
  2178. Rudolf Kulhavý. Recursive nonlinear estimation, volume 216 of Lecture Notes in Control and Information Sciences. Springer-Verlag London Ltd., London, 1996. A geometric approach.
  2179. V.G. Kulkarni and J.S. Provan. An improved implementation of conditional Monte Carlo estimation of path lengths in stochastic networks. Oper. Res. 33, 1389-1393, 1985.
  2180. Vidyadhar G. Kulkarni. Modeling and Analysis of Stochastic Systems. Texts in Statistical Science Series. Chapman and Hall Ltd., London, 1995.
  2181. S. Kumar. Chance-constrained programming problem with chance-constrained relative lower bounded variables. Trabajos Estadíst. Investigación Oper., 30(2):73-77, 1979.
  2182. P. L. Kunsch and J. Teghem. Nuclear-fuel cycle optimization using multiobjective stochastic linear programming. European Journal of Operational Research, 31(2):240-249, 1987.
  2183. P.L. Kunsch. Application of "STRANGE" to energy studies. In Stochastic versus fuzzy approaches to multiobjective mathematical programming under uncertainty, volume 6 of Theory Decis. Lib. Ser. D System Theory Knowledge Engrg. Probl. Solving, pages 117-130. Kluwer Acad. Publ., Dordrecht, 1990.
  2184. Alexandra Künzi-Bay and János Mayer. Computational aspects of minimizing conditional value-at-risk. Comput. Manag. Sci., 3(1):3-27, 2006.
  2185. V. Yu. Kurbakovskii. A numerical method for solving an inverse probability problem. In Analysis and design of dynamical systems under conditions of uncertainty (Russian), pages 11-18. Moskov. Aviatsion. Inst., Moscow, 1990.
  2186. Yasuaki Kurokawa and Kenjiro Nakamura. Forest management planning under uncertainty. J. Operations Res. Soc. Japan 20, 259-272, 1977.
  2187. Harold J. Kushner. Necessary conditions for discrete parameter stochastic optimization problems. In Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability (Univ. California, Berkeley, Calif., 1970/1971), Vol. III: Probability theory, pages 667-685, Berkeley, Calif., 1972. Univ. California Press.
  2188. Harold J. Kushner. Stochastic approximation algorithms for constrained optimization problems. Ann. Statist., 2:713-723, 1974.
  2189. Harold J. Kushner. Rates of convergence for sequential Monte Carlo optimization methods. SIAM J. Control Optim., 16(1):150-168, 1978.
  2190. Harold J. Kushner. Approximation methods for the minimum average cost per unit time problem with a diffusion model. In Approximate solution of random equations, pages 107-126, New York, 1979. North-Holland.
  2191. Harold J. Kushner and Milton L. Kelmanson. Stochastic approximation algorithms of the multiplier type for the sequential Monte Carlo optimization of stochastic systems. SIAM J. Control Optimization, 14(5):827-842, 1976.
  2192. Harold J. Kushner and Jichuan Yang. A Monte Carlo method for sensitivity analysis and parametric optimization of nonlinear stochastic systems: the ergodic case. SIAM J. Control Optim., 30(2):440-464, 1992.
  2193. H.J. Kushner and D.S. Clark. A stochastic approximation projection algorithm for constrained Monte- Carlo optimization. In A link between science and applications of automatic control, Proc. 7th trienn. World Congr., Helsinki 1978, Vol. 4, 2425-2433, 1979.
  2194. V.S. Kuzin. Analytical solution of the probabilities of an optimization problem when there are rigid constraints. Soviet J. Comput. Systems Sci., 30(4):125-130, 1992.
  2195. V.A. Labkovskii. Control under an independent change of the nonobservable parameter. Kibernetika (Kiev), 2:51-57, 133, 1987.
  2196. Petr Lachout. On multifunction transforms of probability measures. Ann. Oper. Res., 56:241-249, 1995. Stochastic programming (Udine, 1992).
  2197. R.R. Laferriere and S.M. Robinson. Scenario analysis in u.s. army decision making. Phalanx, 33(1):10ff, 2000.
  2198. Jean-Jacques Laffont. First-order certainty equivalence with instrument-dependent randomness. Review economic Studies 42, 605-614, 1975.
  2199. J.C. Lagarias and F. Aminzadeh. Multi-stage planning and the extended linear-quadratic-Gaussian control problem. Math. Oper. Res. 8, 42-61, 1983.
  2200. B.J. Lageweg, J.K. Lenstra, A.H.G. Rinnooy Kan, and L. Stougie. Stochastic integer programming by dynamic programming. Stat. Neerl. 39, 97-113, 1985.
  2201. B.J. Lageweg, J.K. Lenstra, A.H.G. Rinnooy Kan, and L. Stougie. Stochastic integer programming by dynamic programming. In Numerical techniques for stochastic optimization, volume 10 of Springer Ser. Comput. Math., pages 403-412. Springer, Berlin, 1988.
  2202. Constantino M. Lagoa, Xiang Li, and Mario Sznaier. Probabilistically constrained linear programs and risk-adjusted controller design. SIAM J. Optim., 15(3):938-951 (electronic), 2005.
  2203. Hang-Chin Lai and Kensuke Tanaka. On continuous-time discounted stochastic dynamic programming. Appl. Math. Optim., 23(2):155-169, 1991.
  2204. T.L. Lai. Stochastic approximation and sequential search for optimum. In Proceedings of the Berkeley conference in honor of Jerzy Neyman and Jack Kiefer, Vol. II (Berkeley, Calif., 1983), Wadsworth Statist./Probab. Ser., pages 557-577, Belmont, Calif., 1985. Wadsworth.
  2205. Kim Fung Lam and Jane W. Moy. A simple weighting scheme for classification in two-group discriminant problems. Comput. Oper. Res., 30(1):155-164, 2003.
  2206. K. Lampe. Numerischer Vergleich des dualen und primalen Vektoroptimierungsproblemms mit dem stochastischen Suchverfahren von Timmel. Wiss. Z. Tech. Hochsch. Ilmenau 31, No.2, 93-100, 1985.
  2207. M.N. Lane and S.C. Littlechild. A stochastic programming approach to weather-dependent pricing for water resources. In Stochastic programming, Proc. int. Conf., Oxford 1974, 357-368, 1980.
  2208. G. Laporte, F.V. Louveaux, and L. van Hamme. Exact solution of a stochastic location problem by an integer L-shaped algorithm. Transportation Science, 28(2):95-103, 1994.
  2209. Gilbert Laporte and Francois Louveaux. Formulations and bounds for the stochastic capacitated vehicle routing problem with uncertain supplies. In Economic decision-making: games, econometrics and optimisation, Contrib. in Honour of J. H. Dreze, 443-455, 1990.
  2210. Gilbert Laporte, Francois Louveaux, and Helene Mercure. The vehicle routing problem with stochastic travel times. Transp. Sci. 26, No.3, 161-170, 1992.
  2211. Gilbert Laporte and François V. Louveaux. The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett., 13(3):133-142, 1993.
  2212. Gilbert Laporte, François V. Louveaux, and Hélène Mercure. A priori optimization of the probabilistic traveling salesman problem. Oper. Res., 42(3):543-549, 1994.
  2213. Yu. P. Laptin. Construction of heuristic search strategies in the branch-and-bound method in solving the multidimensional knapsack problem. In Methods of investigation of extremal problems, pages 109-115, 124, Kiev, 1981. Akad. Nauk Ukrain. SSR Inst. Kibernet.
  2214. Robert E. Larson and John L. Casti. Principles of dynamic programming. Part II: Advanced theory and applications. Control and Systems Theory, Vol. 7. New York and Basel: Marcel Dekker, Inc., 1982.
  2215. J.B. Lasserre. Exact formula for sensitivity analysis of Markov chains. J. Optim. Theory Appl., 71(2):407-413, 1991.
  2216. J.B. Lasserre, C. Bes, and F. Roubellat. The stochastic discrete dynamic lot size problem: an open-loop solution. Operations Research, 33(3):684-689, 1985.
  2217. Jean B. Lasserre. Duality and randomization in nonlinear programming. ANZIAM J., 42((E)):E27-E68, 2000/01.
  2218. Zoltan Laszlo. Ueber wahrscheinlichkeitsbeschraenkte Lagerhaltungsmodelle. Magyar Tud. Akad. mat. fiz. Tud. Oszt. Koezl. 21 77-117 (1973)., 1972.
  2219. Karen K. Lau and Robert S. Womersley. Multistage quadratic stochastic programming. J. Comput. Appl. Math., 129(1-2):105-138, 2001. Nonlinear programming and variational inequalities (Kowloon, 1998).
  2220. T. W. Edward Lau and Y. C. Ho. Universal alignment probabilities and subset selection for ordinal optimization. J. Optim. Theory Appl., 93(3):455-489, 1997.
  2221. Purushottam W. Laud, L. Mark Berliner, and Prem K. Goel. A stochastic probing algorithm for global optimization. J. Global Optim., 2(2):209-224, 1992.
  2222. Jean-Louis Lauriere. Elements de programmation dynamique. Preface de Robert Faure. Recherche Operationnelle Appliquee, 3. Collection "Programmation". Paris: Gauthier-Villars., 1979.
  2223. Irving H. LaValle. On information-augmented chance-constrained programs. Oper. Res. Lett., 4(5):225-230, 1986.
  2224. Irving H. Lavalle. On the "Bayesability" of chance-constrained programming problems. Oper. Res. Lett., 4(6):281-283, 1986.
  2225. Irving H. Lavalle. On the Bayesability of chance-constrained programs: a clarification. Oper. Res. Lett., 5(5):261, 1986.
  2226. Irving H. Lavalle. Response to: "Use of sample information in stochastic recourse and chance-constrained programming models" [Management Sci. 31 (1985), no. 1, 96-108; MR 87e:90074] by R. Jagannathan: on the "Bayesability" of CCPs. Management Sci., 33(10):1224-1231, 1987. With a reply by Jagannathan.
  2227. ¯E. P. Lavrinenko. A certain stochastic programming problem. In Cybernetics and computer technology, No. 8: Complex control systems (Russian), pages 68-71, Kiev, 1971. "Naukova Dumka".
  2228. ¯E. P. Lavrinenko. Pareto-optimal solutions in problems of vector stochastic optimization. In Questions in the study of multicriteria optimization problems, volume 22 of Preprint 81, pages 40-51, 55. Akad. Nauk Ukrain. SSR Inst. Kibernet., Kiev, 1981.
  2229. E.P. Lavrinenko. Ueber ein Problem der Programmsteuerung im hierarchischen Zweiniveausystem unter Unbestimmtheitsverhaeltnissen. In Kibernetika vycislit. Tehn. 19, slozn. Sist. Upravl., 9-13, 1973.
  2230. J.P. Lawrence III and Kenneth Steiglitz. Randomized pattern search. IEEE Trans. Comput. C- 21, 382-385, 1972.
  2231. Andrew J. Lazarus. Certain expected values in the random assignment problem. Oper. Res. Lett., 14(4):207-214, 1993.
  2232. Jean-Sébastien Le Brizaut. Une méthode d'optimisation stochastique pour évaluer des minima à e près. Bull. Sci. Math., 126(8):693-703, 2002.
  2233. Larry J. LeBlanc. Optimization models for distribution planning. In Risk and capital (Ulm, 1983), volume 227 of Lecture Notes in Econom. and Math. Systems, pages 203-223. Springer, Berlin, 1984.
  2234. J.P. Leclercq. La programmation linéaire stochastique: une approche multicritère. I. Formulation. Cahiers Centre Études Rech. Opér., 23(1):31-41, 1981.
  2235. J.P. Leclercq. La programmation linéaire stochastique: une approche multicritère. II. Un algorithme interactif adapté aux distributions multinormales. Cahiers Centre Études Rech. Opér., 23(2):121-132, 1981.
  2236. J.P. Leclercq. Stochastic programming: an interactive multicriteria approach. European J. Oper. Res., 10(1):33-41, 1982.
  2237. Pierre L'Ecuyer and Alain Haurie. Preventive replacement for multicomponent systems: An opportunistic discrete-time dynamic programming model. IEEE Trans. Reliab. R-32, 117-118, 1983.
  2238. Pierre L'Ecuyer and Gaétan Perron. On the convergence rates of IPA and FDC derivative estimators. Oper. Res., 42(4):643-656, 1994.
  2239. Sang M. Lee and David L. Olson. A gradient algorithm for chance constrained nonlinear goal programming. Eur. J. Oper. Res. 22, 359-369, 1985.
  2240. Peter P. Lehleiter. Optimale Steuerung der Bedienung exponentieller Wartesysteme mit vorgegebener Kundenzahl. (Optimal service control for exponential queueing systems with predetermined number of customers)., 1984.
  2241. Guiyuan Lei. Adaptive quasi-Monte Carlo method for multiple-extrema optimization. Control Theory Appl., 19(3):431-434, 2002.
  2242. Zhongxue Lei and Xianyu Li. Several convexity statements in chance constrained programming. J. Jiangxi Norm. Univ., Nat. Sci. Ed. 13, No.2, 13-19, 1989.
  2243. Timo Leipälä. On the solutions of stochastic traveling salesman problems. European J. Oper. Res., 2(4):291-297, 1978.
  2244. Bernard Lemaire. About the convergence of the proximal method. In Advances in optimization (Lambrecht, 1991), volume 382 of Lecture Notes in Econom. and Math. Systems, pages 39-51. Springer, Berlin, 1992.
  2245. B.J. Lence and A. Ruszczynski. Managing water quality under uncertainty: Application of a new stochastic branch and bound method. IIASA Working Paper WP-96-066, Laxenburg, Austria, 1996.
  2246. J.K. Lenstra. Corrigendum: "Stochastic integer programming by dynamic programming" [Statist. Neerlandica 39 (1985), no. 2, 97-113; MR 86j:90154] by B. J. Lageweg, Lenstra, A. H. G. Rinnooy Kan and L. Stougie. Statist. Neerlandica, 40(2):129, 1986.
  2247. J.K. Lenstra, A.H.G. Rinnooy Kan, and L. Stougie. A framework for the probabilistic analysis of hierarchical planning systems. In Stochastics and optimization, Sel. Pap. ISSO Meet., Gorguano/Italy 1982, Ann. Oper. Res. 1, 23-42, 1984.
  2248. Cornelius T. Leondes and Ranjit K. Nandi. Capacity expansion in convex cost networks with uncertain demand. Operations Res., 23(6):1172-1178, 1975.
  2249. S.L. Leonov. A stochastic algorithm for the minimization of an additive function. Avtomat. i Telemekh., 10:63-70, 1985.
  2250. Cristina M.A. Leopoldino, Mário V.F. Pereira, Leontina M.V. Pinto, and Celso C. Ribeiro. A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning. Ann. Oper. Res., 50:367-385, 1994. Applications of combinatorial optimization.
  2251. R. Lepp. A projective stochastic approximation method for finding an admissible point in stochastic programming. Eesti NSV Tead. Akad. Toimetised Füüs.-Mat., 26(2):128-134, 1977.
  2252. R. Lepp. Deterministic equivalents of stochastic programming problems with elliptically symmetric distributions. Eesti NSV Tead. Akad. Toimetised Füüs.-Mat., 28(2):158-160, 180, 1979.
  2253. R. Lepp. Maximization of a probability function on simple sets. Eesti NSV Tead. Akad. Toimetised Füüs.-Mat., 28(4):303-309, 1979.
  2254. R. Lepp. Minimization of a smooth function under probabilistic constraints. Eesti NSV Tead. Akad. Toimetised Füüs.-Mat., 29(2):140-144, 229, 1980.
  2255. R. Lepp. Stochastic approximation type algorithm for the maximization of the probability function. Izv. Akad. Nauk Ehst. SSR, Fiz., Mat. 32, 150-156, 1983.
  2256. R. Lepp. Conditions for discrete stability of the general stochastic programming problem with decision functions. Eesti NSV Tead. Akad. Toimetised Füüs.-Mat., 35(1):20-27, 122, 1986.
  2257. R. Lepp. Discrete stability of stochastic programming problems with recourse. In System modelling and optimization, Proc. 12th IFIP Conf., Budapest/Hung. 1985, Lect. Notes Control Inf. Sci. 84, 529-534, 1986.
  2258. R. Lepp. On the approximation of stochastic convex programming problems. In Stochastic optimization (Kiev, 1984), volume 81 of Lecture Notes in Control and Inform. Sci., pages 427-434. Springer, Berlin, 1986.
  2259. R. Lepp. Discrete approximation of linear two-stage stochastic programming problem. Numer. Funct. Anal. Optim., 9(1-2):19-33, 1987.
  2260. R. Lepp and V. Ol'man. An inequality for integrals with spherically symmetric functions and its application to optimization. Eesti NSV Tead. Akad. Toimetised Füüs.-Mat., 29(2):133-139, 229, 1980.
  2261. R. Lepp and E. Raik. Randomized solutions in stochastic programming problems. Eesti NSV Tead. Akad. Toimetised Füüs.-Mat., 21:379-386, 1972.
  2262. R. È. Lepp. Approximation of a problem of operative stochastic programming. Issled. Operatsii i ASU, 26:20-26, 117, 1985.
  2263. R. È. Lepp. Approximation of the probability functional. In Analysis of stochastic systems by methods in operations research and reliability theory (Russian), pages 17-21, ii, Kiev, 1987. Akad. Nauk Ukrain. SSR Inst. Kibernet.
  2264. R. È. Lepp. Approximation of a problem of stochastic programming with complete recursion. Dokl. Akad. Nauk SSSR, 305(6):1307-1310, 1989.
  2265. R.E. Lepp. Investigations of Estonian scientists on stochastic programming. Izv. Akad. Nauk SSSR, Tekh. Kibern. 1982, No.6, 57-64, 1982.
  2266. R.E. Lepp. Investigations of Estonian scientists on stochastic programming. Engrg. Cybernetics, 20(6):11 (1983), 1982.
  2267. R.È. Lepp. Discrete approximation and stability of a stochastic programming problem with complete recursion. Zh. Vychisl. Mat. i Mat. Fiz., 27(7):993-1004, 1117, 1987.
  2268. R.E. Lepp. Approximation of decision rules in stochastic programming. J. Comput. Systems Sci. Internat., 31(2):46-49, 1993.
  2269. Riho Lepp. Approximate solution of stochastic programming problems with recourse. Kybernetika (Prague), 23(6):476-482, 1987.
  2270. Riho Lepp. Approximations to stochastic programs with complete recourse. SIAM J. Control Optim., 28(2):382-394, 1990.
  2271. Riho Lepp. Discrete approximation of extremum problems with operator constraints. In System modelling and optimization (Leipzig, 1989), volume 143 of Lecture Notes in Control and Inform. Sci., pages 170-176. Springer, Berlin, 1990.
  2272. Riho Lepp. Projection and discretization methods in stochastic programming. J. Comput. Appl. Math., 56(1-2):55-64, 1994. Stochastic programming: stability, numerical methods and applications (Gosen, 1992).
  2273. Riho Lepp. Approximation of extremum problems with probability cost functionals. In Stochastic programming methods and technical applications (Neubiberg/Munich, 1996), pages 169-185. Springer, Berlin, 1998.
  2274. Riho Lepp. Approximation of the quantile minimization problem with decision rules. Optim. Methods Softw., 17(3):505-522, 2002. Stochastic programming.
  2275. Riho Lepp. Discrete approximation of extremum problems with chance constraints. In Stochastic optimization techniques (Neubiberg/Munich, 2000), volume 513 of Lecture Notes in Econom. and Math. Systems, pages 21-33. Springer, Berlin, 2002.
  2276. L.L. Leshchenko. On a stochastic transportation problem. Issled. Oper. ASU 23, 43-50, 1984.
  2277. Reuven R. Levary. An experimental sequential solution procedure to stochastic linear programming problems with 0-1 variables. Internat. J. Systems Sci., 15(10):1073-1085, 1984.
  2278. V.L. Levin. Extremal problems with probability measures, functionally closed preorders and strong stochastic dominance. In Stochastic optimization, Proc. Int. Conf., Kiev/USSR 1984, Lect. Notes Control Inf. Sci. 81, 435-447, 1986.
  2279. Art Lew. Nondeterministic dynamic programming on a parallel coprocessing system. Appl. Math. Comput., 120(1-3):139-147, 2001. The Bellman continuum (Santa Fe, NM, 1999).
  2280. D. Li, X. L. Sun, M. P. Biswal, and F. Gao. Convexification, concavification and monotonization in global optimization. Ann. Oper. Res., 105:213-226 (2002), 2001. Geometric programming.
  2281. Donghui Li. Two methods for undiscounted Markov decision programming. Hunan Ann. Math. 7, No.2, 97-103, 1987.
  2282. Duan Li. Multiple objectives and nonseparability in stochastic dynamic programming. Internat. J. Systems Sci., 21(5):933-950, 1990.
  2283. Duan Li and Yacov Y. Haimes. The uncertainty sensitivity index method (USIM) and its extension. Nav. Res. Logist. 35, No.6, 655-672, 1988.
  2284. Hua Li and Xing Si Li. Solutions of minimum cross-entropy optimization problems with cross-entropy constraints. J. Lanzhou Univ. Technol., 32(1):148-151, 2006.
  2285. Wu-Ji Li and J. MacGregor Smith. Stochastic quadratic assignment problems. In Quadratic assignment and related problems (New Brunswick, NJ, 1993), volume 16 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 221-236. Amer. Math. Soc., Providence, RI, 1994.
  2286. Xiao Li Li and Gong Yan Lei. Some comments about stochastic optimization algorithms. Math. Numer. Sinica, 18(4):435-441, 1996.
  2287. Xiao Li Li and Jian Hui Ren. Stability of optimal values and optimal solution sets of stochastic programming. J. Shaanxi Normal Univ. Nat. Sci. Ed., 32(4):27-30, 2004.
  2288. Xiao Liu Li and Jin De Wang. Approximate feasible direction method for stochastic programming problems with recourse. Linear inequality deterministic constraints. Optimization, 21(3):401-407, 1990.
  2289. X.S. Li and A.B. Templeman. An informational entropy approach to optimization. In Approximation, optimization and computing, pages 263-266. North-Holland, Amsterdam, 1990.
  2290. Y. Li and D. Wang. A semi-infinite programming model for earliness/tardiness production planning with simulated annealing. Math. Comput. Modelling, 26(7):35-42, 1997.
  2291. Y. P. Li, G. H. Huang, S. L. Nie, X. H. Nie, and I. Maqsood. An interval-parameter two-stage stochastic integer programming model for environmental systems planning under uncertainty. Eng. Optim., 38(4):461-483, 2006.
  2292. Marek Libura. Integer programming problems with inexact objective function. Control Cybern. 9, 189-202, 1980.
  2293. Bennet P. Lientz. Stochastic allocation of spare components. In Optimizing Meth. Statist., Proc. Sympos. Ohio State Univ. 1971, 403-412 , 1971.
  2294. V.E. Lihtenstein. Diskretheit und Zufaelligkeit in oekonomisch-mathematischen Problemen. (Diskretnost' i slucainost' v ekonomiko-matematiceskih zadacah.). Moskau: Verlag 'Nauka'., 1973.
  2295. Gui-Hua Lin and Masao Fukushima. A class of stochastic mathematical programs with complementarity constraints: reformulations and algorithms. J. Ind. Manag. Optim., 1(1):99-122, 2005.
  2296. Gui-Hua Lin and Masao Fukushima. Regularization method for stochastic mathematical programs with complementarity constraints. ESAIM Control Optim. Calc. Var., 11(2):252-265 (electronic), 2005.
  2297. Gui-Hua Lin and Masao Fukushima. New reformulations for stochastic nonlinear complementarity problems. Optim. Methods Softw., 21(4):551-564, 2006.
  2298. Jianhua Lin and S.K.M. Wong. Approximation of discrete probability distributions based on a new divergence measure. Congr. Numer., 61:75-80, 1988. Seventeenth Manitoba Conference on Numerical Mathematics and Computing (Winnipeg, MB, 1987).
  2299. S. Y. Lin and Y. C. Ho. Universal alignment probability revisited. J. Optim. Theory Appl., 113(2):399-407, 2002.
  2300. Xiaocang Lin and Loo Hay Lee. A new approach to discrete stochastic optimization problems. European J. Oper. Res., 172(3):761-782, 2006.
  2301. Zhenghua Lin and Weisheng Yu. The twice continuously differentiable property of two-stage stochastic linear programming problems with fixed recourse. Soochow J. Math., 23(2):157-164, 1997.
  2302. Jeff Linderoth, Alexander Shapiro, and Stephen Wright. The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res., 142:215-241, 2006.
  2303. Jeff Linderoth and Stephen Wright. Decomposition algorithms for stochastic programming on a computational grid. Stochastic Programming E-Print Series, http://www.speps.org, 2001.
  2304. Jeff Linderoth and Stephen Wright. Decomposition algorithms for stochastic programming on a computational grid. Optimization Online, http://www.optimization-online.org, 2001.
  2305. Jeff Linderoth and Stephen J. Wright. Computational grids for stochastic programming. In Applications of stochastic programming, volume 5 of MPS/SIAM Ser. Optim., pages 61-77. SIAM, Philadelphia, PA, 2005.
  2306. Chen Ling, Xiaojun Chen, Masao Fukushima, and Liqun Qi. A smoothing implicit programming approach for solving a class of stochastic generalized semi-infinite programming problems. Pac. J. Optim., 1(1):127-145, 2005.
  2307. B.P. Lingaraj. Certainty equivalent of a chance constraint if the random variable is uniformly distributed. Comm. Statist., 3(10):949-951, 1974.
  2308. B.P. Lingaraj and Harvey Wolfe. Certainty equivalent of a chance constraint if the random variable follows a gamma distribution. Sankhy¯a Ser. B, 36(2):204-208, 1974.
  2309. K. Linowsky and A. B. Philpott. On the convergence of sampling-based decomposition algorithms for multistage stochastic programs. J. Optim. Theory Appl., 125(2):349-366, 2005.
  2310. Svante Linusson and Johan Wästlund. A proof of Parisi's conjecture on the random assignment problem. Probab. Theory Related Fields, 128(3):419-440, 2004.
  2311. Joseph Lipscomb and David Zalkind. Deterministic models for production of services with stochastic technology. Econometrica, 48(5):1169-1186, 1980.
  2312. Baoding Liu. Dependent-chance goal programming and its genetic algorithm based approach. Math. Comput. Modelling, 24(7):43-52, 1996.
  2313. Baoding Liu. Dependent-chance programming: a class of stochastic optimization. Comput. Math. Appl., 34(12):89-104, 1997.
  2314. Chih-Ming Liu and Jerry L. Sanders. Stochastic design optimization of asynchronous flexible assembly systems. Ann. Oper. Res. 15, 131-154, 1988.
  2315. Chuan Cai Liu. Convergence rate of moments for stochastic perturbation gradient approximation. J. Fuzhou Univ. Nat. Sci. Ed., 30(1):28-32, 2002.
  2316. M.L. Liu and N.V. Sahinidis. Optimization in process planning under uncertainty. Industrial & Engineering Chemistry Research, 35(11):4154-4165, 1996.
  2317. P.T. Liu and J.G. Sutinen. Pareto optimal leasing and investment policies for a publicly owned exhaustible resource. In New trends in dynamic system theory and economics, Proc. Semin., Udine/Italy 1977, 137-149, 1979.
  2318. W. Liu and Y. H. Dai. Minimization algorithms based on supervisor and searcher cooperation. J. Optim. Theory Appl., 111(2):359-379, 2001.
  2319. X. W. Liu and M. Fukushima. Parallelizable preprocessing method for multistage stochastic programming problems. J. Optim. Theory Appl., 131(3):327-346, 2006.
  2320. Xian Liu. Several filled functions with mitigators. Appl. Math. Comput., 133(2-3):375-387, 2002.
  2321. Xian Liu. The role of stochastic programming in communication network design. Comput. Oper. Res., 32(9):2329-2349, 2005.
  2322. Xinwei Liu and Jie Sun. A new decomposition technique in solving multistage stochastic linear programs by infeasible interior point methods. J. Global Optim., 28(2):197-215, 2004.
  2323. Yian-Kui Liu and Baoding Liu. Random fuzzy programming with chance measures defined by fuzzy integrals. Math. Comput. Modelling, 36(4-5):509-524, 2002.
  2324. John R. Liukkonen and Arnold Levine. On convergence of iterated random maps. SIAM J. Control Optim., 32(6):1752-1762, 1994.
  2325. Liwan Liyanage and J. George Shanthikumar. Allocation through stochastic Schur convexity and stochastic transposition increasingness. In Stochastic inequalities (Seattle, WA, 1991), volume 22 of IMS Lecture Notes Monograph Ser., pages 253-273. Inst. Math. Statist., Hayward, CA, 1992.
  2326. S.I. Ljasko and F. Mirzoahmedov. Method of feasible directions in the minimization of almost differentiable functions with unknown parameters. Akad. Nauk Ukrain. SSR Inst. Kibernet. Preprint, 13:14-20, 53, 1979. Stochastic optimization models.
  2327. L. Ljung. Some basic ideas in recursive identification. In Analysis and optimisation of stochastic systems, Proc. int. Conf., Oxford 1978, 408-418, 1980.
  2328. Lennart Ljung. Recursive identification. In Stochastic systems: the mathematics of filtering and identification and applications, Proc. NATO Adv. Study Inst., Les Arcs/Savoie/ France 1980, 247-281, 1981.
  2329. C. Lobry. Une propriete de l'ensemble des etats accessibles d'un systeme guidable. C. R. Acad. Sci., Paris, Ser. A 272, 153-156, 1971.
  2330. M. Locatelli. Bayesian algorithms for one-dimensional global optimization. J. Global Optim., 10(1):57-76, 1997.
  2331. M. Locatelli and F. Schoen. Simple linkage: analysis of a threshold-accepting global optimization method. J. Global Optim., 9(1):95-111, 1996.
  2332. Marco Locatelli and Fabio Schoen. An adaptive stochastic global optimization algorithm for one-dimensional functions. Ann. Oper. Res., 58:263-278, 1995. Applied mathematical programming and modeling, II (APMOD 93) (Budapest, 1993).
  2333. Marco Locatelli and Fabio Schoen. Theoretical and experimental analysis of random linkage algorithms for global optimization. In System modelling and optimization (Prague, 1995), pages 473-480. Chapman & Hall, London, 1996.
  2334. Marco Locatelli and Fabio Schoen. Random Linkage: a family of acceptance/rejection algorithms for global optimisation. Math. Program., 85(2, Ser. A):379-396, 1999.
  2335. A.G. Lockett and A.P. Muhlemann. A stochastic programming model for aggregate production planning. Eur. J. Oper. Res. 2, 350-356, 1978.
  2336. A.G. Lockett, A.P. Muhlemann, and L.A. Wolsey. A stochastic programming model for project selection. In Stochastic programming (Proc. Internat. Conf., Univ. Oxford, Oxford, 1974), pages 427-448. Academic Press, London, 1980.
  2337. A. Løkketangen and D.L. Woodruff. Progressive hedging and tabu search applied to mixed integer (0,1) multi-stage stochastic programming. Journal of Heuristics, 2:111-128, 1996.
  2338. K. Lommatzsch (ed.). Programmpakete der Operationsforschung. Seminarber., Humboldt-Univ. Berlin, Sekt. Math. 22, 160 P., 1979.
  2339. Domingo López-Rodríguez, Enrique Mérida-Casermeiro, and J. M. Ortiz-de Lazcano-Lobato. Stochastic multivalued network for optimization: application to the graph maxcut problem. WSEAS Trans. Math., 6(3):500-505, 2007.
  2340. Victor Loskutov. Models, algorithms and software of stochastic optimization. In Computational aspects of model choice (Prague, 1991), Contrib. Statist., pages 177-186. Physica, Heidelberg, 1993.
  2341. D. P. Loucks. Computer models for reservoir regulation. Journal of the Sanitary Engineering Division, Proceedings of the American Society of Civil Engineers, 94(SA4):657-669, August 1968.
  2342. Daniel P. Loucks. Discrete chance constrained models for river basin planning. In Stochastic programming, Proc. int. Conf., Oxford 1974, 329-340, 1980.
  2343. F. Louveaux. Optimal scheduling of income tax prepayments under stochastic incomes. Eur. J. Oper. Res. 9, 26-32, 1982.
  2344. Francois Louveaux and Jacques-Francois Thisse. Production and location on a network under demand uncertainty. Oper. Res. Lett. 4, 145-149, 1985.
  2345. Francois V. Louveaux. Piecewise convex programs. Math. Programming 15, 53-62, 1978.
  2346. François V. Louveaux. A solution method for multistage stochastic programs with recourse with application to an energy investment problem. Oper. Res., 28(4):889-902, 1980.
  2347. François V. Louveaux. Multistage stochastic programs with block-separable recourse. Math. Programming Stud., 28:48-62, 1986. Stochastic programming 84. II.
  2348. François V. Louveaux and D. Peeters. A dual-based procedure for stochastic facility location. Oper. Res., 40(3):564-573, 1992.
  2349. François V. Louveaux and Maarten H. van der Vlerk. Stochastic programming with simple integer recourse. Math. Programming, 61(3, Ser. A):301-325, 1993.
  2350. F.V. Louveaux. Discrete stochastic location models. Annals of Operations Research, 6(4):23-34, 1986.
  2351. F.V. Louveaux. Stochastic programs with simple integer recourse. Manuscript, Facultés Universitaires Notre-Dame de la Paix, Namur, 1991.
  2352. 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 Ser. Comput. Math. 10, 445-453, 1988.
  2353. William S. Lovejoy. Policy bounds for Markov decision processes. Oper. Res. 34, 630-637, 1986.
  2354. David Lowell Lovelady. Iterative maximization subject to stochastic constraints. J. Math. Anal. Appl. 64, 142-145, 1978.
  2355. Dinh The' Lu'c. Duality in programming under probabilistic constraints with a random technology matrix. Probl. Control Inf. Theory 12, 429-437, 1983.
  2356. R. Lucchetti and R.J-B. Wets. Convergence of minima of integral functionals with applications to optimal control and stochastic optimization. Statistics and Decisions, 11, 1993.
  2357. James Luedtke and Shabbir Ahmed. A sample approximation approach for optimization with probabilistic constraints. Optimization Online, http://www.optimization-online.org, 2007.
  2358. James Luedtke, Shabbir Ahmed, and George Nemhauser. An integer programming approach for linear programs with probabilistic constraints. Optimization Online, http://www.optimization-online.org, 2007.
  2359. M.K. Luhandjula. Flou et aleatoire en programmation lineaire. BUSEFAL 11, 33-38, 1982.
  2360. M.K. Luhandjula. Programmation lineaire avec des donnees possibilistes. BUSEFAL 15, 134-143, 1983.
  2361. M.K. Luhandjula. Satisfying solutions for a possibilistic linear program. Inf. Sci. 40, 247-265, 1986.
  2362. M.K. Luhandjula. Linear programming with a possibilistic objective function. Eur. J. Oper. Res. 31, 110-117, 1987.
  2363. M.K. Luhandjula. Multiple objective programming problems with possibilistic coefficients. Fuzzy Sets Syst. 21, 135-145, 1987.
  2364. M.K. Luhandjula and M.M. Gupta. On fuzzy stochastic optimization. Fuzzy Sets and Systems, 81(1):47-55, 1996. Fuzzy optimization.
  2365. Monga Kalonda Luhandjula. Linear programming under randomness and fuzziness. Fuzzy Sets Syst. 10, 45-55, 1983.
  2366. S. Lukasik. Optimale Steuerung in hierarchischen mehrkriteriellen Systemen unter den Bedingungen unvollständiger Information. In Polyoptimization-theoretic foundations and applications (Sem., Bad Stuer, 1976) (German), volume 2 of ZKI-Inform. 78, pages 87-103. Akad. Wiss. DDR, Berlin, 1978.
  2367. Guglielmo Lulli and Suvrajeet Sen. A branch-and-price algorithm for multi-stage stochastic integer programming with application to stochastic batch-sizing problems. Stochastic Programming E-Print Series, http://www.speps.org, 2002.
  2368. Guglielmo Lulli and Suvrajeet Sen. A heuristic procedure for stochastic integer programs with complete recourse. European J. Oper. Res., 171(3):879-890, 2006.
  2369. R.R. Luman. Quantitative decision support for upgrading complex systems of systems. Ph.D. thesis, School of Engineering and Applied Science, George Washington University, 1997.
  2370. R.R. Luman. Upgrading complex systems of systems: a CAIV methodology for warfare area requirements analysis. Military Operations Research, 52:53-75, 2000.
  2371. Morten W. Lund. Valuing flexibility in offshore petroleum projects. Ann. Oper. Res., 99:325-349 (2001), 2000. Applied mathematical programming and modeling, IV (Limassol, 1998).
  2372. M. Lundy and A. Mees. Convergence of an annealing algorithm. Math. Programming, 34(1):111-124, 1986.
  2373. Chengjie Luo, Clement Yu, Jorge Lobo, Gaoming Wang, and Tracy Pham. Computation of best bounds of probabilities from uncertain data. Comput. Intelligence, 12(4):541-566, 1996.
  2374. Jian Wen Luo and Shi Jie Lu. Convergence of approximate solutions in stochastic programming. J. Zhejiang Univ. Sci. Ed., 27(5):493-497, 2000.
  2375. Jian Wen Luo and Shi Jie Lu. Stability analysis for probabilistic constrained programs. Appl. Math. J. Chinese Univ. Ser. A, 16(1):119-124, 2001.
  2376. Jian Wen Luo and Jin De Wang. Weak differentiability in stochastic programming. Gaoxiao Yingyong Shuxue Xuebao Ser. A, 12(1):53-62, 1997.
  2377. Irvin J. Lustig, John M. Mulvey, and Tamra J. Carpenter. Formulating two-stage stochastic programs for interior point methods. Oper. Res., 39(5):757-770, 1991.
  2378. S.I. Lyashko and F. Mirzoakhmedov. Some methods of joint identification and optimization. Dokl. Akad. Nauk Tadzh. SSR 24, 721-727, 1981.
  2379. S.I. Lyashko and F. Mirzoakhmedov. Some methods of simultaneous identification and optimization. Dokl. Akad. Nauk Tadzhik. SSR, 24(12):721-724, 1981.
  2380. Norman R. Lyons. Resource planning for randomly arriving stochastic jobs. Management Sci., Appl. 21, 931-936, 1975.
  2381. G. I. Lyubchenko and A. N. Nakonechnyi. Optimization methods for compound Poisson risk processes. Kibernet. Sistem. Anal., (2):87-96, 188, 1998.
  2382. A. Maatman, C. Schweigman, A. Ruijs, and M.H. van der Vlerk. Modeling farmers' response to uncertain rainfall in burkina faso: a stochastic programming approach. Operations Research, 50(3):399-414, 2002.
  2383. Odile Macchi and Eweda Eweda. Second-order convergence analysis of stochastic adaptive linear filtering. IEEE Trans. Autom. Control AC-28, 76-85, 1983.
  2384. M. E. P. Maceira and J. M. Damázio. Use of the PAR(p) model in the stochastic dual dynamic programming optimization scheme used in the operation planning of the Brazilian hydropower system. Probab. Engrg. Inform. Sci., 20(1):143-156, 2006.
  2385. R.Infante Macias. Bemerkung ueber lineare stochastische Programmierung: Entwicklung und aktueller Stand. I. Trabajos Estadist. Investig. operat. 23, No.1/2, 9-49, 1972.
  2386. L.C. MacLean. Lagrange multipliers in chance constrained programming. Methods Oper. Res. 41, 165-167, 1981.
  2387. Leonard MacLean, Rafael Sanegre, Yonggan Zhao, and William T. Ziemba. Capital growth with security. Stochastic Programming E-Print Series, http://www.speps.org, 2002.
  2388. Leonard C. MacLean and William T. Ziemba. Growth versus security tradeoffs in dynamic investment analysis. Ann. Oper. Res., 85:193-225, 1999. Stochastic programming. State of the art, 1998 (Vancouver, BC).
  2389. Leonard C. MacLean, William T. Ziemba, and Yuming Li. Time to wealth goals in capital accumulation. Stochastic Programming E-Print Series, http://www.speps.org, 2000.
  2390. Marilyn J. Maddox and John R. Birge. Using second moment information in stochastic scheduling. In Recent advances in control and optimization of manufacturing systems, volume 214 of Lecture Notes in Control and Inform. Sci., pages 99-120. Springer, London, 1996.
  2391. G. Mádi-Nagy. A method to find the best bounds in a multivariate discrete moment problem if the basis structure is given. Studia Sci. Math. Hungar., 42(2):207-226, 2005.
  2392. Y. Maeda. Time difference simultaneous perturbation method. Electronics Letters, 32:1016-1018, 1996.
  2393. Y. Maeda and R.J.P. De Figueiredo. Learning rules for neuro-controller via simultaneous perturbation. IEEE Transactions on Neural Networks, 8:1119-1130, 1997.
  2394. Y. Maeda, H. Hirano, and Y. Kanata. A learning rule of neural networks via simultaneous perturbation and its hardware implementation. Neural Networks, 8:251-259, 1995.
  2395. Y. Maeda, A. Nakazawa, and K. Yakichi. Hardware implementation of a pulse density neural network using simultaneous perturbation learning rule. Analog Intergrated Circuits and Signal Processing, 18:153-162, 1999.
  2396. P.M. Maekilae. A self-tuning regulator based on optimal output feedback theory. Automatica 20, 671-679, 1984.
  2397. F. Maffioli, M.G. Speranza, and C. Vercellis. Randomized algorithms: An annotated bibliography. In Stochastics and optimization, Sel. Pap. ISSO Meet., Gorguano/Italy 1982, Ann. Oper. Res. 1, 331-345, 1984.
  2398. P. Maillard. Contribution à l'étude des problèmes de transport. Publ. Économétriques, 10(1):19-41, 87, 1977.
  2399. A.A.K. Majumdar. On a generalized secretary problem with three stops under a linear travel cost. Indian J. Math., 33(2):189-202, 1991.
  2400. A.A.K. Majumdar. A best-choice problem with three stops and random termination. Sankhy¯a Ser. B, 57(1):76-84, 1995.
  2401. Mukul Majumdar. A note on learning and optimal decisions with a partially observable state space. In Essays in the economics of renewable resources, Contrib. econ. Anal. 143, 141-153, 1982.
  2402. Mukul Majumdar and Tapan Mitra. Robust ergodic chaos in discounted dynamic optimization models. Econom. Theory, 4(5):677-688, 1994.
  2403. Mukul Majumdar and Itzhak Zilcha. Optimal growth in a stochastic environment: Some sensitivity and turnpike results. J. Econ. Theory 43, 116-133, 1987.
  2404. W.K. Mak, D.P. Morton, and R.K. Wood. Monte carlo bounding techniques for determining solution quality in stochastic programs. Operations Research Letters, 24:47-56, 1999.
  2405. Algirdas Makauskas. On a possibility to use gradients in statistical models of global optimization of objective functions. Informatica, 2(2):248-254, 316, 324, 1991.
  2406. Yu.I. Maksimov. Stochastic simultion in planning. (Stokhasticheskoe modelirovanie v planirovanii). Akademiya Nauk SSSR, Sibirskoe Otdelenie. Institut Ehkonomiki i Organizatsii Promyshlennogo Proizvodstva. Novosibirsk: Izdatel'stvo "Nauka", Sibirskoe Otdelenie., 1981.
  2407. Scott A. Malcolm and Stavros A. Zenios. Robust optimization for power systems capacity expansion under uncertainty. J. Oper. Res. Soc. 45, No.9, 1040-1049, 1994.
  2408. Wilfredo L. Maldonado and B. F. Svaiter. Hölder continuity of the policy function approximation in the value function approximation. J. Math. Econom., 43(5):629-639, 2007.
  2409. Lilia Maliar and Serguei Maliar. Solving nonlinear dynamic stochastic models: an algorithm computing value function by simulations. Econom. Lett., 87(1):135-140, 2005.
  2410. W. Maly and S.W. Director. Dimension reduction procedure for the simplicial approximation approach to design centering. Proc. IEE-G, 127(6):255-259, 1980.
  2411. V.V. Malyshev, A.I. Kibzun, and D. È. Chernov. Two approaches to the solution of probabilistic optimization problems. Soviet J. Automat. Inform. Sci., 20(3):20-25 (1988), 1987.
  2412. John W. Mamer and Kenneth E. Schilling. On the growth of random knapsacks. Discrete Appl. Math. 28, No.3, 223-230, 1990.
  2413. A. S. Manne and T. R. Olsen. Greenhouse gas abatement-toward Pareto-optimal decisions under uncertainty. Annals of Operations Research, 68:267-279, 1996.
  2414. Alexander Mänz and Silvia Vogel. On stability of multistage stochastic decision problems. In Recent advances in optimization, volume 563 of Lecture Notes in Econom. and Math. Systems, pages 103-118. Springer, Berlin, 2006.
  2415. Imran Maqsood, Guo H. Huang, and Julian Scott Yeomans. An interval-parameter fuzzy two-stage stochastic program for water resources management under uncertainty. European J. Oper. Res., 167(1):208-225, 2005.
  2416. A. Marchetti Spaccamela, A.H.G. Rinnooy Kan, and L. Stougie. Hierarchical vehicle routing problems. Networks 14, 571-586, 1984.
  2417. A. Marchetti-Spaccamela and C. Vercellis. Stochastic on-line knapsack problems. Math. Programming, 68(1, Ser. A):73-104, 1995.
  2418. T.A. Marinchenko. Application of stochastic quasigradient methods for dynamical systems. In Analysis of stochastic systems by methods in operations research and reliability theory (Russian), pages 32-34, iii. Akad. Nauk Ukrain. SSR Inst. Kibernet., Kiev, 1987.
  2419. Andreas Märkert and Rüdiger Schultz. On deviation measures in stochastic integer programming. Stochastic Programming E-Print Series, http://www.speps.org, 2004.
  2420. Andreas Märkert and Rüdiger Schultz. On deviation measures in stochastic integer programming. Oper. Res. Lett., 33(5):441-449, 2005.
  2421. Giovanni Marro and Remo Rossi. Condizioni di convessità nella programmazione dinamica. Atti, Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. (8), 54:604-614 (1974), 1973.
  2422. A. Martel and W. Price. Stochastic programming applied to human resource planning. J. Oper. Res. Soc. 32, 187-196, 1981.
  2423. Alain Martel. Programme stochastique pour les plans hommes-machines a moyen terme. Revue Franc. Automat. Inform. Rech. operat. 8, V-1, 5-18, 1974.
  2424. Alain Martel. A probabilistic assortment problem. INFOR, Can. J. Operat. Res. Inform. Processing 15, 196-203, 1977.
  2425. Alain Martel and Ahmad Al-Nuaimi. Tactical manpower planning via programming under uncertainty. Operat. Res. Quart. 24, 571-585, 1973.
  2426. Alain Martel and Jean Ouellet. Stochastic allocation of a resource among partially interchangeable activities. Eur. J. Oper. Res. 74, No.3, 528-539, 1994.
  2427. K. Marti. Stochastische Programme in normierten Raeumen. (Stochastic programming in normed spaces). In Operations Research-Verfahren 1 130-132 (1971)., 1970.
  2428. K. Marti. Konvexitaetsaussagen zum linearen stochastischen Optimierungsproblem. Z. Wahrscheinlichkeitstheorie Verw. Geb. 18, 159-166, 1971.
  2429. K. Marti. Entscheidungsprobleme mit linearem Aktionen- und Ergebnisraum. Z. Angew. Math. Mech., 53:T226-T228, 1973. Vorträge der Wissenschaftlichen Jahrestagung der Gesellschaft für Angewandte Mathematik und Mechanik (Ljubljana, 1972).
  2430. K. Marti. Ueber ein Verfahren zur Loesung einer Klasse linearer Entscheidungsprobleme. Z. angew. Math. Mech. 54, Sonderheft, T 247 - T 248, 1974.
  2431. K. Marti. Lösung stochastischer linearer Programme mit "complete recourse" mittels stochastischer Penalty-Methoden. Z. Angew. Math. Mech., 58(7):T491-T494, 1978.
  2432. K. Marti. Diskretisierung stochastischer Programme unter Berücksichtigung der Problemstruktur. Z. Angew. Math. Mech., 59(3):T105-T108, 1979. Vorträge der Wissenschaftlichen Jahrestagung der Gesellschaft für Angewandte Mathematik und Mechanik, Teil I (Brussels, 1978).
  2433. K. Marti. On approximative solutions of stochastic programming problems by means of stochastic dominance and stochastic penalty methods. In Survey of mathematical programming (Proc. Ninth Internat. Math. Programming Sympos., Budapest, 1976), Vol. 2, pages 117-127, Amsterdam, 1979. North-Holland.
  2434. K. Marti. On accelerations of the convergence in random search methods. Methods Oper. Res. 37, 391-406, 1980.
  2435. K. Marti. On controlled random search procedures. In Control applications of nonlinear programming and optimization, Coll. Pap., 2nd IFAC Workshop, Oberpfaffenhofen/Ger. 1980, 214-223, 1980.
  2436. K. Marti. Random search in optimization problems as a stochastic decision process (adaptive random search). Methods Oper. Res. 36, 223-234, 1980.
  2437. K. Marti. Stochastic dominance and the construction of descent directions in stochastic programs having a discrete distribution., 1980.
  2438. K. Marti. Stochastische Dominanz und Konstruktion von Abstiegsrichtungen in stochastischen Programmen bei Verteilungs-Symmetrien., 1980.
  2439. K. Marti. On stochastic dominance and the construction of directions of decrease in stochastic programs having a discrete distribution. Methods Oper. Res. 41, 175-178, 1981.
  2440. K. Marti. Ueber die Berechnung von Abstiegsrichtungen in Stochastischen Linearen Programmen bei Verteilungsinvarianz. Z. Angew. Math. Mech. 61, T341 - T343, 1981.
  2441. K. Marti. Minimizing noisy objective functions by random search methods. Z. Angew. Math. Mech. 62, T377 - T380, 1982.
  2442. K. Marti. On the construction of descent directions in stochastic programs having a discrete distribution. Z. Angew. Math. Mech., 64(5):336-338, 1984.
  2443. K. Marti. Computation of descent directions in stochastic optimization problems with invariant distributions. Z. Angew. Math. Mech., 65(8):355-378, 1985.
  2444. K. Marti. Construction of descent directions in stochastic programs having a discrete distribution. II. Z. Angew. Math. Mech., 67(5):T408-T410, 1987.
  2445. K. Marti. Descent stochastic quasigradient methods. In Numerical techniques for stochastic optimization, volume 10 of Springer Ser. Comput. Math., pages 393-401. Springer, Berlin, 1988.
  2446. K. Marti. Optimal semi-stochastic approximation procedures. II. Z. Angew. Math. Mech., 69(4):T67-T69, 1989.
  2447. K. Marti. Optimal semistochastic approximation. In Computing and computers for control systems (Paris, 1988), volume 4 of IMACS Ann. Comput. Appl. Math., pages 409-415, Basel, 1989. Baltzer.
  2448. K. Marti. Computation of efficient solutions of stochastic optimization problems with applications to regression and scenario analysis. In Stochastic versus fuzzy approaches to multiobjective mathematical programming under uncertainty, volume 6 of Theory Decis. Lib. Ser. D System Theory Knowledge Engrg. Probl. Solving, pages 163-188. Kluwer Acad. Publ., Dordrecht, 1990.
  2449. K. Marti. Stochastic optimization methods in structural mechanics. Z. Angew. Math. Mech., 70(6):T742-T745, 1990. Bericht über die Wissenschaftliche Jahrestagung der GAMM (Karlsruhe, 1989).
  2450. K. Marti. Stochastic programming: numerical solution techniques by semi-stochastic approximation methods. In Stochastic versus fuzzy approaches to multiobjective mathematical programming under uncertainty, volume 6 of Theory Decis. Lib. Ser. D System Theory Knowledge Engrg. Probl. Solving, pages 23-43. Kluwer Acad. Publ., Dordrecht, 1990.
  2451. K. Marti. Computation of efficient solutions of discretely distributed stochastic optimization problems. Z. Oper. Res., 36(3):259-294, 1992.
  2452. K. Marti. Semi-stochastic approximation by the response surface methodology (RSM). Optimization, 25(2-3):209-230, 1992.
  2453. K. Marti. Stochastic optimization in structural design. Z. Angew. Math. Mech., 72(6):T452-T464, 1992. Bericht über die Wissenschaftliche Jahrestagung der GAMM (Kraków, 1991).
  2454. K. Marti, editor. Stochastic Optimization. Numerical Methods and Technical Applications. Springer, Berlin, 1992. LN in Economics and Math. Systems 379.
  2455. K. Marti. Satisficing techniques in stochastic linear programming. Optimization, 31(4):359-384, 1994.
  2456. K. Marti. Differentiation formulas for probability functions: the transformation method. Math. Programming, 75(2, Ser. B):201-220, 1996. Approximation and computation in stochastic programming.
  2457. K. Marti. Path planning for robots under stochastic uncertainty. Optimization, 45(1-4):163-195, 1999. Dedicated to the memory of Professor Karl-Heinz Elster.
  2458. K. Marti. Stochastic programming methods in adaptive optimal trajectory planning for robots. ZAMM Z. Angew. Math. Mech., 82(11-12):795-809, 2002. 4th GAMM-Workshop "Stochastic Models and Control Theory" (Lutherstadt Wittenberg, 2001).
  2459. K. Marti and E. Fuchs. On the convergence rate of semistochastic approximation procedures. Z. Angew. Math. Mech., 65(5):315-317, 1985.
  2460. K. Marti and E. Fuchs. Computation of descent directions and efficient points in stochastic optimization problems without using derivatives. Math. Programming Stud., 28:132-156, 1986. Stochastic programming 84. II.
  2461. K. Marti and E. Fuchs. Rates of convergence of semistochastic approximation procedures for solving stochastic optimization problems. Optimization, 17(2):243-265, 1986.
  2462. K. Marti and E. Plöchinger. Optimal semi-stochastic approximation procedures. Z. Angew. Math. Mech., 68(5):T441-T443, 1988.
  2463. K. Marti and E. Plöchinger. Optimal step sizes in semi-stochastic approximation procedures. I. Optimization, 21(1):123-153, 1990.
  2464. K. Marti and E. Plöchinger. Optimal step sizes in semistochastic approximation procedures. II. Optimization, 21(2):281-312, 1990.
  2465. K. Marti and R.-J. Riepl. Optimale Portefeuilles mit stabil verteilten Renditen. Z. Angew. Math. Mech., 57(5):T337-T339, 1977.
  2466. K. Marti and G. L. Tret¢yakov. An algorithm for the approximate solution of the maximization problem for a probability function on the basis of a star-shaped approximation.
  2467. Kurt Marti. Konvexitätsaussagen zum linearen stochastischen Optimierungsproblem. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete, 18:159-166, 1971.
  2468. Kurt Marti. Entscheidungsprobleme mit linearem Aktionen- und Ergebnisraum. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete, 23:133-147, 1972.
  2469. Kurt Marti. Approximationen der Entscheidungsprobleme mit linearer Ergebnisfunktion und positiv homogener, subadditiver Verlustfunktion. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete, 31:203-233, 1974/75.
  2470. Kurt Marti. Approximations to gradients in stochastic programming. Bull. Inst. Internat. Statist., 46(4):137-140 (1976), 1975.
  2471. Kurt Marti. Convex approximation of stochastic optimization problems. In Operations Research Verfahren, Band XX, pages 66-76, Meisenheim am Glan, 1975. Hain.
  2472. Kurt Marti. Approximations to stochastic optimization problems. In Optimization and operations research (Proc. Conf., Oberwolfach, 1975), pages 201-213. Lecture Notes in Econom. Math. Systems, Vol. 117, Berlin, 1976. Springer.
  2473. Kurt Marti. Stochastische Dominanz und stochastische lineare Programme. In VIII. Oberwolfach-Tagung über Operations Research (1976), Operations Res. Verfahren, XXIII, pages 141-160. Hain, Königstein/Ts., 1977.
  2474. Kurt Marti. On stochastic dominance relations in stochastic programming. In Transactions of the Eighth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes (Prague, 1978), Vol. B, pages 35-44. Reidel, Dordrecht, 1978.
  2475. Kurt Marti. Stabilitaet approximativer Loesungen stochastischer Programme bei Variationen der Parameterverteilung P. In Oper. Res. Verf. 29, 2nd Symp. Oper. Res., Teil 2, Aachen 1977, 657-671 , 1978.
  2476. Kurt Marti. Stochastic linear programs with random data having stable distributions. In Optimization techniques (Proc. 8th IFIP Conf., Würzburg, 1977), Part 2, pages 76-86. Lecture Notes in Control and Information Sci., Vol. 7, Berlin, 1978. Springer.
  2477. Kurt Marti. Approximationen stochastischer Optimierungsprobleme, volume 43 of Mathematical Systems in Economics. Verlag Anton Hain, Königstein/Ts., 1979.
  2478. Kurt Marti. On solutions of stochastic programming problems by descent procedures with stochastic and deterministic directions. In Third Symposium on Operations Research (Univ. Mannheim, Mannheim, 1978), Section 3, volume 33 of Operations Res. Verfahren, pages 281-293. Hain, Königstein/Ts., 1979.
  2479. Kurt Marti. Approximations to stochastic optimization problems. In Stochastic programming (Proc. Internat. Conf., Univ. Oxford, Oxford, 1974), pages 159-166, London, 1980. Academic Press.
  2480. Kurt Marti. On accelerations of the convergence in random search methods. Mitteilung aus dem forschungsschwerpunkt simulation und optimierung deterministischer und stochastischer dynamischer systeme, Hochschule der Bundeswehr Muenchen, Neubibierg, 1980.
  2481. Kurt Marti. Solving stochastic linear programs by semistochastic approximation algorithms. In Recent results in stochastic programming (Proc. Meeting, Oberwolfach, 1979), volume 179 of Lecture Notes in Econom. and Math. Systems, pages 191-213. Springer, Berlin, 1980.
  2482. Kurt Marti. On accelerations of stochastic gradient methods by using more exact gradient estimations. In X symposium on operations research, Part I, Sections 1-5 (Munich, 1985), volume 53 of Methods Oper. Res., pages 327-336. Athenäum/Hain/Hanstein, Königstein/Ts., 1986.
  2483. Kurt Marti. Optimally controlled semi-stochastic approximation procedures. In Ökonomie und Mathematik, pages 216-230, Berlin, 1987. Springer.
  2484. Kurt Marti. Descent directions and efficient solutions in discretely distributed stochastic programs, volume 299 of Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, Berlin, 1988.
  2485. Kurt Marti. Stochastic optimization methods in engineering. In System modelling and optimization (Prague, 1995), pages 75-87. Chapman & Hall, London, 1996.
  2486. Kurt Marti, editor. Structural reliability and stochastic structural optimization. Physica-Verlag, Heidelberg, 1997. Math. Methods Oper. Res. 46 (1997), no. 3.
  2487. Kurt Marti. Adaptive optimal stochastic trajectory planning and control (AOSTPC) for robots. Stochastic Programming E-Print Series, http://www.speps.org, 2000.
  2488. Kurt Marti, editor. Numerical methods for stochastic optimization and real-time control of robots. Gordon and Breach Science Publishers, Yverdon, 2000. Selected papers from Section 14 on Stochastic Optimization of the 1998 Munich Stochastics Days and the DFG-Workshop on Real-time Control of Robots held in Neubiberg/Munich, March 22-27, 1998, Optimization 47 (2000), no. 3-4.
  2489. Kurt Marti. Stochastic optimization methods in robust adaptive control of robots. In Online optimization of large scale systems, pages 545-577. Springer, Berlin, 2001.
  2490. Kurt Marti. Robust optimal design: a stochastic optimization problem. In Stochastic optimization techniques (Neubiberg/Munich, 2000), volume 513 of Lecture Notes in Econom. and Math. Systems, pages 35-55. Springer, Berlin, 2002.
  2491. Kurt Marti, editor. Stochastic optimization techniques, volume 513 of Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, Berlin, 2002. Numerical methods and technical applications, Including papers from the 4th GAMM/IFIP Workshop held at the Federal Armed Forces University Munich, Neubiberg/Munich, June 27-29, 2000.
  2492. Kurt Marti. Stochastic Optimization Methods. Springer, 2005.
  2493. Kurt Marti and Peter Kall, editors. Stochastic programming, volume 423 of Lecture Notes in Economics and Mathematical Systems, Berlin, 1995. Springer-Verlag. Numerical techniques and engineering applications.
  2494. Kurt Marti and Peter Kall, editors. Stochastic programming methods and technical applications, Berlin, 1998. Springer-Verlag.
  2495. Olivier Martin, Steve W. Otto, and Edward W. Felten. Large-step Markov chains for the TSP incorporating local search heuristics. Oper. Res. Lett., 11(4):219-224, 1992.
  2496. F. Martinelli. Stochastic comparison algorithm for discrete optimization with estimation of time-varying objective functions. J. Optim. Theory Appl., 103(1):137-159, 1999.
  2497. Yukihiro Maruyama. Positively bitone sequential decision process. In Nonlinear analysis and convex analysis, pages 341-353. Yokohama Publ., Yokohama, 2007.
  2498. J.L. Maryak. Some guidelines for using iterate averaging in stochastic approximation. In Proceedings of the IEEE Conference on Decision and Control, pages 2287-2290, 1997.
  2499. J.L. Maryak and D.C Chin. Stochastic approximation for global random optimization. In Proceedings of the American Control Conference, pages 3294-3298, 2000.
  2500. J.L. Maryak, R.H. Smith, and R.L. Winslow. Modeling cardiac ion channel conductivity: model fitting via simulation. In Proceedings of the Winter Simulation Conference, eds. D.J. Medeiros and E.F. Watson, pages 1587-1590, 1998.
  2501. S.F. Masri, G.A. Bekey, T.K. Caughey, and E. Van de Velde. Adaptive stochastic optimization using multiprocessors. Appl. Math. Comput., 72(2-3):225-257, 1995.
  2502. P. Massé. Les Réserves et la Régulation de l'Avenir dans la vie Économique. Hermann, Paris, 1946. vol I and II.
  2503. Rudolf Mathar and Antanas Zilinskas. On global optimization in two-dimensional scaling. Acta Appl. Math., 33(1):109-118, 1993. Stochastic optimization.
  2504. V.John Mathews and Sung Ho Cho. Improved convergence analysis of stochastic gradient adaptive filters using the sign algorithm. IEEE Trans. Acoust. Speech Signal Process. ASSP-35, 450-454, 1987.
  2505. Jirí Matousek. Lower bounds for a subexponential optimization algorithm. Random Structures Algorithms, 5(4):591-607, 1994.
  2506. T.H. Mattheiss and Brian K. Schmidt. Computational results on an algorithm for finding all vertices of a polytope. Math. Programming, 18(3):308-329, 1980.
  2507. Josef Matyas. Das zufaellige Optimierungsverfahren und seine Konvergenz. (A random optimization method and her convergence). In 5th internat. Analogue Comput. Meet. Lausanne 1967, Proc., 540-544 , 1968.
  2508. Jerrold H. May and Robert L. Smith. Random polytopes: their definition, generation and aggregate properties. Math. Programming, 24(1):39-54, 1982.
  2509. J. Mayer. On the STABIL stochastic programming model. Alkalmazott Mat. Lapok 2, 171-187, 1976.
  2510. J. Mayer. A nonlinear programming method for the solution of a stochastic programming model of A. Prékopa. In Survey of mathematical programming (Proc. Ninth Internat. Math. Programming Sympos., Budapest, 1976), Vol. 2, pages 129-139. North-Holland, Amsterdam, 1979.
  2511. J. Mayer. A nonlinear programming method for the solution of a stochastic programming model of A. Prékopa. Tanulmányok-MTA Számitástech. Automat. Kutató Int. Budapest, 167:31-48, 1985. Studies in applied stochastic programming, I.
  2512. J. Mayer. Probabilistic constrained optimization-a brief summary on theory and algorithms. Investigación Oper., 14(2-3):162-174, 1993. Workshop on Stochastic Optimization: the State of the Art (Havana, 1992).
  2513. J. Mayer. On the numerical solution of stochastic optimization problems. In System modeling and optimization, volume 199 of IFIP Int. Fed. Inf. Process., pages 193-206. Springer, New York, 2006.
  2514. Janos Mayer. Computational techniques for probabilistic constrained optimization problems. In Stochastic optimization. Numerical methods and technical applications, Proc. GAMM/IFIP-Workshop, Neubiberg/Ger. 1990, Lect. Notes Econ. Math. Syst. 379, 141-164, 1992.
  2515. János Mayer. Stochastic linear programming algorithms. Gordon and Breach Science Publishers, Amsterdam, 1998. A comparison based on a model management system.
  2516. János Mayer. On the numerical solution of jointly chance constrained problems. In Probabilistic constrained optimization, volume 49 of Nonconvex Optim. Appl., pages 220-235. Kluwer Acad. Publ., Dordrecht, 2000.
  2517. Vladimir Mazalov and Eduard Kochetov. Mate choice and optimal stopping problem. In Probability theory and mathematical statistics (Tokyo, 1995), pages 317-326. World Sci. Publishing, River Edge, NJ, 1996.
  2518. Vl.D. Mazurov. The method of admissible corrections. In Improper optimization problems, Collect. Artic., Sverdlovsk 1982, 11-22 , 1982.
  2519. Patrick H. McAllister. Adaptive approaches to stochastic programming. Ann. Oper. Res., 30(1-4):45-62, 1991. Stochastic programming, Part I (Ann Arbor, MI, 1989).
  2520. Edward A. McBean. Stochastic optimization in acid rain management with variable meteorology. In Stochastic optimization. Numerical methods and technical applications, Proc. GAMM/IFIP-Workshop, Neubiberg/Ger. 1990, Lect. Notes Econ. Math. Syst. 379, 165-172, 1992.
  2521. Richard P. McLean. Approximation theory for stochastic variational and Ky Fan inequalities in finite dimensions. Ann. Oper. Res., 44(1-4):43-61, 1993. Advances in equilibrium modeling, analysis and computation.
  2522. V.G. Medvedev. An algorithm for solving a two-stage problem of linear stochastic programming. Vestnik Beloruss. Gos. Univ. Ser. I Fiz. Mat. Mekh., 1:64-66, 79, 1987.
  2523. M.V. Meerov and M.D. Vainstok. Optimization of multiply-connected objects represented by a system of regression equations as a stochastic-programming problem. Autom. Remote Control 34, 1744-1748 translation from Avtom. Telemekh. 1973, No.11, 36-41 (1973)., 1973.
  2524. Nicole Megow, Marc Uetz, and Tjark Vredeveld. Models and Algorithms for Stochastic Online Scheduling. In S. Albers, R.H. Möhring, G.Ch. Pflug, and R. Schultz, editors, Dagstuhl Seminar 05031: Algorithms for Optimization with Incomplete Information, http://www.dagstuhl.de/05031, 2005.
  2525. Sanjay Mehortra and Gokhan Ozevin. On the implementation of interior point decomposition algorithms for two-stage stochastic conic. Optimization Online, http://www.optimization-online.org, 2005.
  2526. Abraham Mehrez, Buddy L. Myers, and Moutaz J. Khouja. Quality and inventory issues within the newsboy problem. Comput. Oper. Res. 18, No.5, 397-410, 1991.
  2527. Abraham Mehrez and Moshe Sniedovich. An analysis of a dynamic project cost problem. J. Oper. Res. Soc. 43, No.6, 591-604, 1992.
  2528. Sanjay Mehrotra. Volumetric center method for stochastic convex programs using sampling. Stochastic Programming E-Print Series, http://www.speps.org, 2000.
  2529. Sanjay Mehrotra and M. Gokhan Ozevin. Decomposition-based interior point methods for two-stage stochastic convex quadratic programs with recourse. Stochastic Programming E-Print Series, http://www.speps.org, 2004.
  2530. Sanjay Mehrotra and M. Gökhan Özevin. Two-stage stochastic semidefinite programming and decomposition based interior point methods. Stochastic Programming E-Print Series, http://www.speps.org, 2005.
  2531. Aranyak Mehta, Scott Shenker, and Vijay V. Vazirani. Posted price profit maximization for multicast by approximating fixed points. J. Algorithms, 58(2):150-164, 2006.
  2532. V.I. Melesko. Ameliorated adaptation algorithms in problems with uncertainty based upon pseudoinverse operators theory. Izv. Akad. Nauk SSSR, Tekh. Kibernet. 1978, No.2, 39-52, 1978.
  2533. Jose Luis Menaldi. Stochastic dynamic programming. Cuad. Inst. Mat. "Beppo Levi" 16, 101 p., 1988.
  2534. Roy Mendelssohn. Pareto optimal policies for harvesting with multiple objectives. Math. Biosci. 51, 213-224, 1980.
  2535. Marta Susana Mendiondo and Richard H. Stockbridge. Approximation of infinite-dimensional linear programming problems which arise in stochastic control. SIAM J. Control Optim., 36(4):1448-1472 (electronic), 1998.
  2536. Fan-wen Meng and Hui-fu Xu. Exponential convergence of sample average approximation methods for a class of stochastic mathematical programs with complementarity constraints. J. Comput. Math., 24(6):733-748, 2006.
  2537. Fanwen Meng and Huifu Xu. A regularized sample average approximation method for stochastic mathematical programs with nonsmooth equality constraints. SIAM J. Optim., 17(3):891-919 (electronic), 2006.
  2538. William Menke. Geophysical data analysis: discrete inverse theory. Rev. ed. International Geophysics Series 45. Academic Press, San Diego, CA etc., 1989.
  2539. Carl-Heinz Meyer and Holger Knublauch. Parallel iterative proportional fitting. In Operations Research Proceedings 1999 (Magdeburg), pages 142-147, Berlin, 2000. Springer.
  2540. Sean P. Meyn. Stability, performance evaluation, and optimization. In Handbook of Markov decision processes, volume 40 of Internat. Ser. Oper. Res. Management Sci., pages 305-346. Kluwer Acad. Publ., Boston, MA, 2002.
  2541. Ph. Michel. Programmes mathématiques mixtes. Application au principe du maximum en temps discret dans le cas déterministe et dans le cas stochastique. RAIRO Rech. Opér., 14(1):1-19, 1980.
  2542. Maciej Michniewicz. An application of the Kalman filter for optimization in the presence of noise. Arch. Automat. Telemech., 25(2):167-177, 1980.
  2543. Maciej Michniewicz. On the application of static optimization methods to the technological system control in the presence of noise. Podstawy Sterowania 15, 315-334, 1985.
  2544. M.V. Mihalevic. A stochastic search algorithm for the most preferred element of a compact set. Issled. Operatsii i ASU, 15:71-76, 135, 1980.
  2545. M.V. Mihalevic and L.B. Koslai. Some questions of stability theory of the stochastic economical models. In Stability problems for stochastic models, Proc. 6th int. Semin., Moscow 1982, Lect. Notes Math. 982, 123-135, 1983.
  2546. G. Mihoc and I. Nadejde. Mathematical Programming: Parametric, Nonlinear and Stochastic. Edutura Stiintifica, Bucurest, 1966. (in Rumanian).
  2547. G.A. Mikhailov. Minimax theory of Monte Carlo weight methods. Zh. Vychisl. Mat. i Mat. Fiz., 24(9):1294-1302, 1984.
  2548. M.V. Mikhalevich. Generalized stochastic method of centers. Cybernetics, 16(2):292-296, 1980.
  2549. M.V. Mikhalevich. Stability of stochastic programming methods to stochastic quasigradient computing errors. Cybernetics 16, 434-438 translation from Kibernetika 1980, No.3, 117-119 (1980)., 1981.
  2550. M.V. Mikhalevich. Estimates for the convergence rate of stochastic methods of search for the most preferable element. Dokl. Akad. Nauk Ukr. SSR, Ser. A 1984, No.5, 74-76, 1984.
  2551. M.V. Mikhalevich. Analysis of the error tolerance of stochastic methods to find the most preferred element. Cybernetics 21, 324-333 translation from Kibernetika 1985, No.3, 41-48 (1985)., 1985.
  2552. M.V. Mikhalevich. Estimates for the rate of convergence of stochastic procedures using averaged descent directions. Kibernetika (Kiev), 2:91-100, 135, 1989.
  2553. M.V. Mikhalevich and L.B. Koshlaj. Estimates of stability conditions for stochastic programming methods and search methods for the most preferred element. In Problems of stability of stochastic models, Proc. Semin., Moskva 1981, 81- 91, 1981.
  2554. M.V. Mikhalevich and L.B. Koshlaj. Estimates and conditions for stability of stochastic programming methods and methods of search for the most preferable element. J. Sov. Math. 34, 1516-1524, 1986.
  2555. V.S. Mikhalevich, A.M. Gupal, and I.V. Bolgarin. Numerical methods for solving nonstationary and limit extremal problems without calculating the gradients. Kibernetika (Kiev), 5:ii, 56-57, 65, 134, 1984.
  2556. V.S. Mikhalevich, A.M. Gupal, and V.I. Norkin. Methods of non-convex optimization. (Metody nevypukloj optimizatskii). Ehkonomiko-Matematicheskaya Biblioteka. Moskva: Nauka, 1987.
  2557. V.S. Mikhalevich, I.V. Sergienko, and N.Z. Shor. Investigation of optimization methods and their applications. Cybernetics 17, 522-548 translation from Kibernetika 1981, No.4, 89-113 (1981)., 1982.
  2558. P. Milde. Zu einer Problemstellung der stochastischen linearen Optimierung Stochastische Zielfunktion. In 18. internat. wiss. Kolloqu., Ilmenau 1, 55-57, 1973.
  2559. Peter Milde. Zu einigen Problemstellungen der stochastischen linearen Optimierung. (On some problems of stochastic linear programming). Wiss. Z. Hochschule Architektur Bauwesen Weimar 18, 73-75, 1971.
  2560. Peter Milde. Stochastische lineare Optimierung. I. Wiss. Z. Hochschule Architektur Bauwesen Weimar 20, 531-535, 1973.
  2561. Yu.N. Minayev and N.M. Chumakov. Algorithms for solving optimization problems under the influence of noises. Sov. Autom. Control 12, No.3, 56-61, 1979.
  2562. Hisashi Mine, Katsuhisa Ohno, and Masao Fukushima. Decompostion of nonlinear chance-constrained programming problems by dynamic programming. J. Math. Anal. Appl., 56(1):221-222, 1976.
  2563. Julio MirasAmor. Transporte mit zufaelliger Nachfrage. Trabajos Estadist. Investig. operat. 24, Nr. 1/2, 185-197, 1973.
  2564. B.M. Mirkin and V.A. Sisljakova. Optimization and analysis of the sensitivity of continuous stochastic systems with discrete control. In Optimization and adaptive control in large-scale systems (Russian), pages 18-27, 105-106. "Ilim", Frunze, 1980.
  2565. Leonard J. Mirman. One sector economic growth and uncertainty: A survey. In Stochastic programming, Proc. int. Conf., Oxford 1974, 537-567, 1980.
  2566. Leonard J. Mirman and Daniel F. Spulber. Fishery regulation with harvest uncertainty. Int. Econ. Rev. 26, 731-746, 1985.
  2567. A. A. Mironov, A. A. Sokolov, and V. I. Tsurkov. On the probabilistic properties of random transportation matrices consisting of zeros and ones. Izv. Akad. Nauk Teor. Sist. Upr., (6):102-113, 2001.
  2568. F. Mirozakhmedov and M.V. Mikhalevich. Applied Aspects of Stochastic Programming. Maorif, Dushanbe, 1989. (in Russian).
  2569. F. Mirzoahmedov and V.L. Petrenko. A dynamic problem of inventory planning with random demand. In Methods in operations research and reliability theory in systems of analysis (Russian), pages 89-94, 103, Kiev, 1979. Akad. Nauk Ukrain. SSR Inst. Kibernet.
  2570. F. Mirzoahmedov and T.G. Timosenko. An approach to the solution of the problem of control of the operation of a single reservoir. Akad. Nauk Ukrain. SSR Inst. Kibernet. Preprint, 13:45-51, 55, 1979. Stochastic optimization models.
  2571. A.I. Mirzoakhmedov and A.I. Yastremskij. Numerical solution methods and methods of economic and mathematical analysis of stochastic resource planning problems. Methods of qualitative analysis. Issled. Oper. ASU 20, 3-9, 1982.
  2572. F. Mirzoakhmedov. A three-stage problem of stochastic programming and the method of its solution. Dokl. Akad. Nauk Tadzhik. SSR, 23(12):694-697, 1980.
  2573. F. Mirzoakhmedov. Methods of decomposition constructed on the basis of numerical algorithms of stochastic programming. Dokl. Akad. Nauk Tadzhik. SSR, 27(9):495-499, 1984.
  2574. F. Mirzoakhmedov. Some numerical methods for solving two-stage problems of stochastic programming. Kibernetika (Kiev), 6:124-125, 1984.
  2575. F. Mirzoakhmedov. An optimization problem in queueing theory and a numerical solution method. Cybernetics 26, No.3, 405-409 translation from Kibernetika 1990, No.3, 73-75 (1990)., 1990.
  2576. F. Mirzoakhmedov. Mathematical models and methods for production control taking random factors into account. (Matematicheskie modeli i metody upravleniya proizvodstvom s uchetom sluchajnykh faktorov). Naukova Dumka, Kiev, 1991.
  2577. F. Mirzoakhmedov and A. Gafforov. Stochastic penalty method for the solution of problems with probabilistic constraints. Dokl. Akad. Nauk Tadzhik. SSR, 26(12):761-763, 1983.
  2578. F. Mirzoakhmedov and I.N. Kurcheryavaya. Projection algorithm on a multidimensional simplex. Issled. Oper. ASU 23, 59-64, 1984.
  2579. F. Mirzoakhmedov and M.V. Mikhalevich. Modeling of optimal cultivated land distribution by means of a multistage stochastic programming problem. Èkonom. i Mat. Metody, 18(5):918-922, 1982.
  2580. F. Mirzoakhmedov and M.V. Mikhalevich. The stochastic quasigradient projection method. Cybernetics 19, 566-575 translation from Kibernetika 1983, No.4, 103-109 (1983)., 1983.
  2581. F. Mirzoakhmedov, V.V. Mova, and L.V. Sirenko. Numerical methods of stochastic programming in the optimization of mass service systems. Dokl. Akad. Nauk Tadzh. SSR 23, 625-628, 1980.
  2582. F. Mirzoakhmedov and V.L. Petrenko. Stochastic programming problems associated with adaptive production planning. Cybernetics, 17(1):107-116, 1981.
  2583. F. Mirzoakhmedov and S.P. Uryas'ev. Adaptive step regulation for a stochastic optimization algorithm. Zh. Vychisl. Mat. i Mat. Fiz., 23(6):1314-1325, 1983.
  2584. F. Mirzoakhmedov and A.I. Yastremskii. Numerical methods of solution and methods of mathematical-economic analysis of stochastic problems of inventory planning. Methods of qualitative analysis. Issled. Operatsii i ASU, 20:3-9, 1982.
  2585. F. Mirzoakhmedov and A.I. Yastremskii. Numerical methods of solution and methods of mathematical-economic analysis of stochastic problems of inventory planning. Numerical methods of solution. Issled. Operatsii i ASU, 19:3-9, 1982.
  2586. F.M. Mirzoakhmedov and V.B. Barinov. On a queueing problem. Dokl. Akad. Nauk Tadzh. SSR 33, No.9, 590-592, 1990.
  2587. D. Mitra. Analytical results on the use of reduced models in the control of linear dynamical systems. Proc. Inst. Elec. Engrs., 116:1439-1444, 1969.
  2588. Gautam Mitra, Harvey J. Greenberg, Freerk A. Lootsma, Marcel J. Rijckaert, and Hans J. Zimmermann, editors. Mathematical models for decision support. (Proceedings of the NATO Advanced Study Institute held in Val d'Isere, France, July 26-August 6, 1987). NATO Scientific Affairs Division, Brussels (Belgium). NATO ASI Series, F, 48. Berlin etc.: Springer-Verlag, 1988.
  2589. Yu. I. Mitrofanov and N. V. Yudaeva. Methods for determining optimal routing parameters in queueing networks. Avtomat. i Telemekh., (8):109-117, 2001.
  2590. Sanjoy K. Mitter and Pal Toldalagi. Variable metric methods and filtering theory. In Recent developments in variable structure systems, economics and biology (Proc. US-Italy Sem., Taormina, 1977), volume 162 of Lecture Notes in Econom. and Math. Systems, pages 214-221. Springer, Berlin, 1978.
  2591. Masakiyo Miyazawa. The characterization of the stationary distribution of the supplemented self-clocking jump process. Math. Oper. Res., 16(3):547-565, 1991.
  2592. Norihiro Mizuno. Generalized mathematical programming for optimal replacement in a semi- Markov shock model. Oper. Res. 34, 790-795, 1986.
  2593. Regina Hunter Mladineo. Stochastic minimization of Lipschitz functions. In Recent advances in global optimization (Princeton, NJ, 1991), Princeton Ser. Comput. Sci., pages 369-383. Princeton Univ. Press, Princeton, NJ, 1992.
  2594. Mohammed Mnif and Huyên Pham. Stochastic optimization under constraints. Stochastic Process. Appl., 93(1):149-180, 2001.
  2595. Audrius Mockus, Jonas Mockus, and Linas Mockus. Bayesian approach adapting stochastic and heuristic methods of global and discrete optimization. Informatica, 5(1-2):123-166, 1994.
  2596. I. Mockus. Bayesian methods of search for an extremum. In Advances in game theory (Proc. Second All-Union Conf., Vilnius, 1971) (Russian), pages 181-186. Izdat. "Mintis", Vilnius, 1973.
  2597. Ionas Mockus. Sufficient conditions for the convergence of one-dimensional Bayesian methods to the global minimum of continuous functions. Teor. Optimal. Reshenii-Trudy Sem. Protsessy Optimal. Upravleniya VI Sektsiya, 6:9-17, 151, 1980.
  2598. J. Mockus. On Bayesian methods for seeking the extremal point. In Stochastic programming, Proc. int. Conf., Oxford 1974, 287-299, 1980.
  2599. J. Mockus, W. Eddy, A. Mockus, L. Mockus, and G. Reklaitis. Bayesian Heuristic Approach to Discrete and Global Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1997.
  2600. J.B. Mockus. On Bayesian methods in nondifferential and stochastic programming. In Stochastic optimization, Proc. Int. Conf., Kiev/USSR 1984, Lect. Notes Control Inf. Sci. 81, 475-486, 1986.
  2601. J.B. Mockus and L.J. Mockus. Bayesian approach to global optimization and application to multiobjective and constrained problems. J. Optim. Theory Appl., 70(1):157-172, 1991.
  2602. Jonas Mockus. On Bayesian methods for seeking the extremum and their application. In Inf. Process. 77, Proc. IFIP Congr., Toronto 1977, 195-200, 1977.
  2603. Jonas Mockus. Bayesian approach to global optimization, volume 37 of Mathematics and its Applications (Soviet Series). Kluwer Academic Publishers Group, Dordrecht, 1989. Theory and applications, With a 5.25-inch IBM PC floppy disk.
  2604. Jonas Mockus. Application of Bayesian approach to numerical methods of global and stochastic optimization. J. Global Optim., 4(4):347-365, 1994.
  2605. Jonas Mockus. Average complexity and the Bayesian heuristic approach to discrete optimization. Informatica, 6(2):193-224, 1995.
  2606. Jonas Mockus. A set of examples of global and discrete optimization. Kluwer Academic Publishers, Dordrecht, 2000. Applications of Bayesian heuristic approach.
  2607. Jonas Mockus, William Eddy, Audris Mockus, Linas Mockus, and Gintaras Reklaitis. Bayesian heuristic approach to discrete and global optimization, volume 17 of Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Dordrecht, 1997. With 2 IBM-PC floppy-disks (3.5 inch; HD), Algorithms, visualization, software, and applications.
  2608. Jonas Mockus and Henrikas Kuryla. "Learning" Bayesian heuristics in flow-shop problem. Informatica, 6(3):289-298, 1995.
  2609. Jonas Mockus, Audris Mockus, and Linas Mockus. Bayesian approach for randomization of heuristic algorithms of discrete programming. In Randomization methods in algorithm design (Princeton, NJ, 1997), pages 161-177. Amer. Math. Soc., Providence, RI, 1999.
  2610. Jonas Mockus and Elvyra Senkien\.e. Optimization of a "mixtur