Compromise programming with Tchebycheff norm for discrete stochastic orders

Sebastian Sitarz ()

Annals of Operations Research, 2013, vol. 211, issue 1, 433-446

Abstract: This paper presents a method of decision making with returns in the form of discrete random variables. The proposed method is based on two approaches: stochastic orders and compromise programming used in multi-objective programming. Stochastic orders are represented by stochastic dominance and inverse stochastic dominance. Compromise programming uses the augmented Tchebycheff norm. This norm, in special cases, takes form of the Kantorovich and Kolmogorov probability metrics. Moreover, in the paper we show applications of the presented methodology in the following problems: projects selections, decision tree and choosing a lottery. Copyright The Author(s) 2013

Keywords: Multi-objective programming; Compromise programming; Tchebycheff norm; Stochastic dominance (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-013-1493-2 (text/html)
Access to full text is restricted to subscribers.

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:spr:annopr:v:211:y:2013:i:1:p:433-446:10.1007/s10479-013-1493-2

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-013-1493-2

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().