Kim Allan Andersen, University of Aarhus
(SPEPS)
North-Holland Publ. Co. (Amsterdam)
To export the complete metadata set as Endote or Bibtex format please click to the appropriate link.
| edoc-Server der Humboldt-Universität zu Berlin |
| Author(s): |
Morten Riis, University of Aarhus Kim Allan Andersen, University of Aarhus | Title: | Applying the minimax criterion in stochastic recourse programs |
| Date of Acceptance: | 05.07.2002 |
| Submission Date: | 23.05.2002 |
| Series Title: |
Stochastic Programming E-Print Series (SPEPS) |
| Editors: | Julie L. Higle; Werner Römisch; Surrajeet Sen |
| Keywords (eng): | stability, Stochastic programming, minimax techniques, algorithms |
| Appeared in: |
European journal of operational research : EJOR 3 (Vol. 165, 2005)
North-Holland Publ. Co. (Amsterdam) |
| Metadata export:
To export the complete metadata set as Endote or Bibtex format please click to the appropriate link.
|
Endnote Bibtex |
| Abstract (eng): | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| We consider an optimization problem in which some uncertain parmeters are replaced by random variables. The minimax approach to stochastic programming concerns the problem of minimizing the worst expected value of the objective function with respect to the set of probability measures that are consistent with the available information on random data. Only very few practicable solution procedures have been proposed for this problem and the existing ones rely on simplifying assumptions. In this paper, we establish a number of stability results for the minimax stochastic program, justifying in particular the approach of restricting attention to probability measures with support in some unknown finite set. Following this approach, we elaborate solution procedures for the minimax problem in the setting of two-stage stochastic recourse models, considering the linear recourse case as well as the integer recourse case. Since the solution procedures are modifications of well-known algorithms, their efficacy is immediate from the computational testing of these procedures and we do not report results of any computational experiments. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Access Statistics:
These data concerning access statistics for individual documents
have been compiled using the webserver log files aggregated by AWSTATS.
They refer to a monthly access count to the full text documents as well as to the entry page.
As for format versions of a document which consist of multiple files (such as HTML) the highest monthly access number to one of the files (chapters) is shown respectivly. To see the detailled access numbers please move the mouse pointer over the single bars of the digaram. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Gesamtzahl der Zugriffe seit May 2011:
|
|
| |||
