0348335 20240903170622.120101101235959.9 000280425000015 11 s. cav_un_epca*02971630023-5954463 (2010)513-523Ústav teorie informace a automatizace AV ČR, v. v. i. Stochastic optimization problem sensitivity approximative solution cav_un_auth*0101151 Lachout Petr Stochastická informatika Department of Stochastic Informatics SI SI UTIA-B Ústav teorie informace a automatizace AV ČR, v. v. i. http://library.utia.cas.cz/separaty/2010/SI/lachout-approximative solutions of stochastic optimization problem.pdf GA201/08/0539 GA ČR cav_un_auth*0239648 CEZ:AV0Z10750506 The aim of this paper is to present some ideas how to relax the notion of the optimal solution of the stochastic optimization problem. In the deterministic case, $/varepsilon $-minimal solutions and level-minimal solutions are considered as desired relaxations. We call them approximative solutions and we introduce some possibilities how to combine them with randomness. Relations among random versions of approximative solutions and their consistency are presented in this paper. No measurability is assumed, therefore, treatment convenient for nonmeasurable objects is employed. 2011 BA 4 O 4o 20231122134205.4 http://hdl.handle.net/11104/0188892 COMPUTERSCIENCECYBERNETICS 0.562 0.219 8.1 0.00125 0.22 463 73 21 0.323 20.57 0.48 Q2 27.15 23.684 Q3 Q2 2010 Soubory v repozitáři: 0348335.pdf 000280425000015 WOS cav_un_epca*0297163 Kybernetika 0023-5954 Roč. 46 č. 3 2010 513 523 Ústav teorie informace a automatizace AV ČR, v. v. i.