×

Stochastic programming with incomplete information: A survey of results on postoptimization and sensitivity analysis. (English) Zbl 0637.90070

The possibility of successful applications of stochastic programming decision models has been limited by the assumed complete knowledge of the distribution F of the random parameters as well as by the limited scope of the existing numerical procedures. We shall give a survey of selected methods which can be used to deal with the incomplete knowledge of the distribution F, namely to study robustness of the optimal solution and the optimal value of the objective function relative to small changes of the underlying distribution and to get error bounds in approximation schemes.

MSC:

90C15 Stochastic programming
90C31 Sensitivity, stability, parametric optimization
62F12 Asymptotic properties of parametric estimators
91A40 Other game-theoretic models
Full Text: DOI

References:

[1] DOI: 10.1007/BF01580247 · Zbl 0284.90074 · doi:10.1007/BF01580247
[2] Beneš V., Vor-tragsreihe ”Mathematische Optimierung - Theorie und An-wendungen” pp 11– (1985)
[3] DOI: 10.2307/3212616 · Zbl 0246.60011 · doi:10.2307/3212616
[4] Birge, J. and Wets, R.J.B. 1983.Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse, 83–111. Laxenburg, Austria: IIASA.
[5] Cipra T., Časpěst, mat 203 pp 17– (1978)
[6] Cipra T., Ekonomicko-matematicky obzor 21 pp 66– (1985)
[7] Dupačov[acaron] J., Coll. Math. Soc. J.Bólyai 12 pp 303– (1976)
[8] Dupačov[acaron] J., Ekonomicko-matematický obzor 13 pp 279– (1977)
[9] Dupačov[acaron] J., ZAMM 58 pp 466– (1978)
[10] Dupačov[acaron], J. Experience in stochastic programming models. Survey of Math. Programming. Proc. IXth. Int. Math. Progr. Symp. 1976, Budapest. Edited by: Prékopa, A. pp.99–105. Budapest: Akadémiai Kiaidó.
[11] Dupačov[acaron] J., Math. Methods of Oper, Research 1. Studies on Math. Programming Mátrafüred pp 38– (1980)
[12] Dupačov[acaron], J. Minimax stochastic p[rbar]ograms with nonseparable penalties. Optimization techniques. (Proc ,IXth IFIP Conference. 1979, Warszawa. Edited by: Iracki, K., Matanowski, K. and Walukiewicz, S. Vol. 22, pp.157–163. Berlin: Springer. Part I.Lecture notes in control and information sciences
[13] Dupačov[acaron], J. 1983.Stability in stochastic programming with recourse, Vol. 24, 23–34. Acta Univ Carol., Math, et Phys.
[14] DOI: 10.1007/BF02612713 · Zbl 0526.90069 · doi:10.1007/BF02612713
[15] Dupačov[acaron], J. On asymptotic normality of inequality constrained optimal decisions. Asymptotic Statistics 2,Proc. 3-rd Prague Symposium on Asymptotic Statistics. Edited by: Mandl, P. and Hušková, M. pp.249–257. Amsterdam: Elsevier.
[16] Dupačov[acaron], J. Stability in stochastic programming–probabilistic constraints. Stochastic Optimization. Proceedings of the International Conference. 1984, Kiev. Edited by: Arkin, V.I., Shiraev, A. and Wets, R. Vol. 81, pp.314–325. Berlin: Springer-Verlag. Lecture Notes in Control and Information Sciences
[17] Dupačov[acaron], J. On some connections between parametric and stochastic programming. Proc. of Int. Conference ”Parametric optimization and related topics”. Berlin: Academic Verlag. to appear
[18] Dupačov[acaron] J., IIASA (1986)
[19] Dupačov[acaron] J., Matematical Programming Study 27 pp 133– (1986) · Zbl 0594.90068 · doi:10.1007/BFb0121117
[20] Dupačov[acaron] J., Stochastics 20 pp 73– (1987) · Zbl 0616.90046 · doi:10.1080/17442508708833436
[21] Dupačov[acaron] J., IIASA pp WP-86-41– (1986)
[22] DOI: 10.1137/0323044 · Zbl 0578.93069 · doi:10.1137/0323044
[23] DOI: 10.1007/BF01580677 · Zbl 0357.90064 · doi:10.1007/BF01580677
[24] Gaivoronski A., Math. Progr. Study 28 pp 157– (1986) · Zbl 0596.90071 · doi:10.1007/BFb0121130
[25] DOI: 10.1007/BF02253895 · Zbl 0498.65032 · doi:10.1007/BF02253895
[26] DOI: 10.2307/2285666 · Zbl 0305.62031 · doi:10.2307/2285666
[27] DOI: 10.1287/opre.25.1.173 · Zbl 0371.90105 · doi:10.1287/opre.25.1.173
[28] Jittorntrum K., Mathematical Programming Study 21 pp 127– (1984) · Zbl 0571.90080 · doi:10.1007/BFb0121215
[29] DOI: 10.1007/BF01601939 · Zbl 0411.90056 · doi:10.1007/BF01601939
[30] Kall P., Math. Operationsforsch. Statist., Ser. Optimization 13 pp 43– (1982)
[31] Kaňková, V. Optimum solution of a stochastic optimization problem with unknown parameters. Trans, of 7th Prague Conf. 1974, Prague. pp.239–244. Prague: Academia.
[32] DOI: 10.1214/aoms/1177698508 · Zbl 0162.49501 · doi:10.1214/aoms/1177698508
[33] Kemperman, J.H.B. On a class of moment problems. Proc, of the Vlth Berkeley Symposium on.Math. Stat and Probability. pp.101–126. II. Univ. of California Press. · Zbl 0286.94017
[34] Klein Haneveld W.K., Mathematical Programming Study 27 pp 153– (1986) · Zbl 0592.90048 · doi:10.1007/BFb0121119
[35] DOI: 10.1287/mnsc.6.2.197 · Zbl 0995.90601 · doi:10.1287/mnsc.6.2.197
[36] DOI: 10.1287/opre.28.3.777 · Zbl 0451.90088 · doi:10.1287/opre.28.3.777
[37] DOI: 10.1002/9780470316436 · Zbl 0256.62002 · doi:10.1002/9780470316436
[38] Richter H., Bl. Dtsch. Ges. Versicherungsmath 3 pp 147– (1957)
[39] DOI: 10.1007/BF01585500 · Zbl 0294.90078 · doi:10.1007/BF01585500
[40] DOI: 10.1287/moor.5.1.43 · Zbl 0437.90094 · doi:10.1287/moor.5.1.43
[41] Rockafellar R.T., Mathematical Programming Study 21 pp 213– (1984) · Zbl 0546.90088 · doi:10.1007/BFb0121219
[42] Schneeweiss H., Entscheidungskriterien bei Risiko (1967) · doi:10.1007/978-3-642-86589-3
[43] DOI: 10.1002/9780470316481 · Zbl 0538.62002 · doi:10.1002/9780470316481
[44] Theodorescu R., Atti Acad. Naz. Lincei, Ser 8 pp 689– (1969)
[45] Wets R.J.B., A statistical approach to the solution of stochastic programs with (convex) simple recourse (1979)
[46] Wets R.J.B., Mathematical Programming–The state of the art pp 566– (1982)
[47] Čas. Pěst, mat 91 pp 423– (1966)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.