Name
Abstract | ||
|---|---|---|
It is a common characteristic of many multiple objective programming problems that the e-cient solution set can only be identifled in approximation: since this set often contains an inflnite number of points, only a discrete representation can be com- puted, and due to numerical di-culties, each of these points itself might in general be only approximate to some e-cient point. From among the various approximation con- cepts, this paper considers the notion of epsilon-e-ciency which has also been shown to be of relevance other than merely for the purpose to approximate solutions. Following preceding work by the same authors, new generating methods are proposed to resolve various drawbacks of those methods derived earlier. Supporting theoretical results are established and the methods demonstrated on an engineering design example. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s00291-006-0044-5 | Or Spektrum |
Keywords | Field | DocType |
multiple objective programming · epsilon-efficient solutions · epsilon-pareto outcomes · approximation,optimization,object oriented programming,computer programming,engineering,efficiency | Mathematical optimization,Object-oriented programming,Multiple objective programming,Reactive programming,Solution set,Discrete representation,Computer programming,Mathematics | Journal |
Volume | Issue | ISSN |
29 | 2 | 0171-6468 |
Citations | PageRank | References |
6 | 0.65 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Engau | 1 | 81 | 7.65 |
| Margaret M. Wiecek | 2 | 213 | 22.90 |