A Note on Nadir Values in Bicriteria Programming Problems

Dür, Mirjam (2000) A Note on Nadir Values in Bicriteria Programming Problems. Forschungsberichte / Institut für Statistik, 78. Department of Statistics and Mathematics, WU Vienna University of Economics and Business, Vienna.

[img]
Preview
PDF
document.pdf

Download (145kB)

Abstract

In multiple criteria programming, a decision maker has to choose a point from the set of efficient solutions. This is usually done by some interactive procedure, where he or she moves from one efficient point to the next until an acceptable solution has been reached. It is therefore important to provide some information about the "size" of the efficient set, i.e. to know the minimum (and maximum) criterion values over the efficient set. This is a difficult problem in general. In this paper, we show that for the bicriteria problem, the problem is easy. This does not only hold for the linear bicriteria problem, but also for more general problems. (author's abstract)

Item Type: Paper
Keywords: Bicriteria programming / Nadir value
Divisions: Departments > Finance, Accounting and Statistics > Statistics and Mathematics
Depositing User: Repository Administrator
Date Deposited: 12 Jul 2006 05:57
Last Modified: 22 Oct 2019 00:41
URI: https://epub.wu.ac.at/id/eprint/546

Actions

View Item View Item

Downloads

Downloads per month over past year

View more statistics