Resource title

A Note on Nadir Values in Bicriteria Programming Problems

Resource image

image for OpenScout resource :: A Note on Nadir Values in Bicriteria Programming Problems

Resource description

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) ; Series: Forschungsberichte / Institut für Statistik

Resource author

Mirjam Dür

Resource publisher

Resource publish date

Resource language

en

Resource content type

application/pdf

Resource resource URL

http://epub.wu.ac.at/546/1/document.pdf

Resource license

Adapt according to the license agreement. Always reference the original source and author.