Quicksearch
Table of contents alert
Do you want to receive an email alert about new issue?



   
Indexing
CEEOL DigLib DOAJ EBSCO EconBiz EconLit RePEc Scopus Socolar
Statistics
Total downloads:146330
Total abstract views:241888
Our sponsors
sponsors gacr sophia Faculty of Social Sciences Evropaeum Karolinum

Volume 2, Issue 3

top

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

Kasperski, Adam

Year: 2008   Volume: 2   Issue: 3   Pages: 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.

JEL classification: C61, C79

Keywords: Discrete optimization, minmax, minmax regret, game against nature

RePEc: http://ideas.repec.org/a/fau/aucocz/au2008_237.html

pdf [PDF] print Print   Recommend to others Recommend to others
bottom