Making Robust Decisions in Discrete Optimization Problems as a Game against Nature

Adam Kasperski

Czech Economic Review, 2008, vol. 2, issue 3, 237-250

Abstract: 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.

Keywords: Discrete optimization; minmax; minmax regret; game against nature (search for similar items in EconPapers)
JEL-codes: C61 C79 (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://auco.fsv.cuni.cz/storage/48_2008_03_237.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:fau:aucocz:au2008_237

Ordering information: This journal article can be ordered from
http://auco.cuni.cz/

Access Statistics for this article

More articles in Czech Economic Review from Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies Contact information at EDIRC.
Bibliographic data for series maintained by Lenka Stastna ().