Journal
OR SPECTRUM
Volume 29, Issue 2, Pages 335-350Publisher
SPRINGER
DOI: 10.1007/s00291-006-0044-5
Keywords
multiple objective programming; epsilon-efficient solutions; epsilon-Pareto outcomes; approximation
Categories
Ask authors/readers for more resources
It is a common characteristic of many multiple objective programming problems that the efficient solution set can only be identified in approximation: as this set often contains an infinite number of points, only a discrete representation can be computed, and due to numerical difficulties, each of these points itself might, in general, be only approximate to some efficient point. From among the various approximation concepts, this paper considers the notion of epsilon-efficient solutions and proposes several new methods for their generation. Supporting theoretical results are established and a numerical example is provided.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available