Applying the minimax criterion in stochastic recourse programs

Applying the minimax criterion in stochastic recourse programs

0.00 Avg rating0 Votes
Article ID: iaor20062316
Country: Netherlands
Volume: 165
Issue: 3
Start Page Number: 569
End Page Number: 584
Publication Date: Sep 2005
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming (minimax)
Abstract:

We consider an optimization problem in which some uncertain parameters 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 the 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 known 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.

Reviews

Required fields are marked *. Your email address will not be published.