Methods of finding optimal submeasures (characterization of solutions) (original) (raw)

Access this article

Log in via an institution

Subscribe and save

• Starting from 10 chapters or articles per month
• Access and download chapters and articles from more than 300k books and 2,500 journals
• Cancel anytime View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature Cited

1. Yu. M. Ermol'ev, “On some problems of stochastic programming,” Kibernetika, No. 1, 1–5 (1970).
   Google Scholar
2. A. N. Golodnikov, Methods of Finding Optimal Distribution Functions in Extremal Problems of Stochastic Programming [in Russian], Abstract of thesis, Kiev (1979).
3. Yu. Ermoliev, A. Gaivoronski, and C. Nedeva, “Stochastic optimization problems with incomplete information on distribution functions,” SIAM J. Control Optim.,23, No. 4, 696–716 (1985).
   Google Scholar
4. A. Gaivoronski, “Optimization of functionals which depend on distribution functions: nonlinear functionals and linear constraints,” Working paper IIASA 83-114, Laxenburg (1983).
5. Yu. Ermoliev and A. Gaivoronski, “Duality relations and numerical methods for optimization problems on the space of probability measures with constraints on probability densities,” Working paper IIASA 84-64, Laxenburg (1984).
6. G. Dantzig, Linear Programming, Its Applications and Generalizations [Russian translation], Progress, Moscow (1966).
   Google Scholar
7. A. Gaivoronski and V. Fedorov, “Design of experiments under constraints,” Working paper IIASA 84-8, Laxenburg (1984).
8. A. I. Kaplinskii and A. I. Propoi, “On a stochastic approach to nonlinear programming problems,” Avtomat. Telemekh., No. 3, 122–133 (1970).
   Google Scholar
9. Klein-Haneveld, “Abstract LP duality and bounds on variables,” Working paper Univ. of Groningen 84-13-OR, Groningen (1984).
10. Yu. Ermoliev and C. Nedeva, “Stochastic optimization problems with partially known distribution functions,” Working paper IIASA 82-60, Laxenburg (1982).
11. M. G. Krein and A. A. Nudel'man, The Problem of Markov Moments and Extremal Problems [in Russian], Nauka, Moscow (1973).
    Google Scholar
12. S. Karlin and V. Stadden, Chebyshev Systems and Their Application in Analysis and Statistics [Russian translation], Nauka, Moscow (1976).
    Google Scholar
13. J. H. B. Kemperman, “On a class of moment problems,” Proc. 6th Berkeley Symp. on Math. Stat. and Prob., part 2 (1972), pp. 101–126.
    Google Scholar
14. I. Dupacova, “Minimax stochastic programs with nonseparable penalties,” Proc. 9th IFIP Conf. (Warsaw, 1979), part 1, Springer, Berlin (1980), pp. 122–136.
    Google Scholar
15. I. Birger and R. Wets, “Designing approximation schemes for stochastic optimization problems,” Working paper IIASA 83-111, Laxenburg (1983).
16. A. N. Golodnikov and L. S. Stoikova, “A numerical method of estimating some functionals characterizing reliability,” Kibernetika, No. 2, 73–77 (1978).
    Google Scholar
17. A. A. Gaivoronskii and Yu. M. Ermol'ev, “A stochastic method for minimax problems,” Kibernetika, No. 4, 92–97 (1983).
    Google Scholar
18. H. P. Wynn, “Optimum designs for finite population sampling,” in: S. S. Gupta and D. S. Moore, eds., Statistical Decision Theory and Related Topics, Academic Press, New York (1977).
    Google Scholar
19. P. Whittle, “Some general points in the theory of optimal experimental design,” J. R. Stat. Soc., ser. B,36, 123–150 (1973).
    Google Scholar
20. J. Kiefer and J. Wolfowitz, “Optimum designs in regression problems,” Ann. Math. Stat.,30, No. 1, 271–294 (1959).
    Google Scholar
21. V. V. Fedorov, The Theory of Optimal Experiment (Planning of Regression Experiments) [in Russian], Nauka, Moscow (1971).
    Google Scholar
22. P. Kall, K. Krauendorfer, and A. Rushinski, “Approximation techniques in stochastic programming,” Working paper Univ. of Zurich, Inst. of Oper. Res., Zurich (1984).
    Google Scholar
23. N. Dunford and J. T. Schwartz, Linear Operators: Part 1, General Theory, Wiley-Interscience (1958).
24. R. T. Rockafellar, Monotone Processes of Convex and Concave Type, Am. Math. Soc., Providence (1967).
25. R. T. Morris, “Optimal constrained selection of a measurable set,” Math. Anal. Appl.,70, No. 2, 546–562 (1979).
    Google Scholar
26. Yu. M. Ermol'ev, Stochastic Programming Methods [in Russian], Nauka, Moscow (1976).
    Google Scholar
27. A. A. Gaivoronskii, “The nonstationary stochastic programming problem with variable constraints,” in: Mathematical Methods of Operations Research and Reliability Theory [in Russian], IK AN UkrSSR, Kiev (1978), pp. 24–30.
    Google Scholar

Download references