Abstract | ||
---|---|---|
An algorithm to approximate the nondominated set of continuous and discrete bicriteria programs is proposed. The algorithm employs block norms to find an approximation and evaluate its quality. By automatically adapting to the problem's structure and scaling, the approximation is constructed objectively without interaction with the decision maker. Mathematical and practical examples are included. |
Year | DOI | Venue |
---|---|---|
2001 | 10.1023/A:1011267305444 | Comp. Opt. and Appl. |
Keywords | Field | DocType |
approximation,nondominated points,bicriteria programs,block norms | Mathematical optimization,Norm (social),Scaling,Decision maker,Mathematics | Journal |
Volume | Issue | ISSN |
20 | 1 | 1573-2894 |
Citations | PageRank | References |
11 | 1.96 | 3 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Bernd Schandl | 1 | 21 | 3.19 |
Kathrin Klamroth | 2 | 579 | 41.93 |
Margaret M. Wiecek | 3 | 213 | 22.90 |