%0 Journal Article
%T Making Robust Decisions in Discrete Optimization Problems as a Game against Nature
%A Adam Kasperski
%J AUCO Czech Economic Review
%D 2008
%I Charles University in Prague
%X In this paper a discrete optimization problem under uncertainty is discussed. Solving such a problem can be seen as a game against nature. In order to choose a solution, the minmax and minmax regret criteria can be applied. In this paper an extension of the known minmax (regret) approach is proposed. It is shown how different types of uncertainty can be simultaneously taken into account. Some exact and approximation algorithms for choosing a best solution are constructed.
%K Discrete optimization
%K minmax
%K minmax regret
%K game against nature
%U http://auco.fsv.cuni.cz/storage/48_2008_03_237.pdf