| Article ID: | iaor20033311 |
| Country: | Germany |
| Volume: | 56 |
| Issue: | 3 |
| Start Page Number: | 413 |
| End Page Number: | 437 |
| Publication Date: | Jan 2002 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Tind J., Klamroth Kathrin, Wiecek Margaret M. |
Algorithms generating piecewise linear approximations of the nondominated set for general, convex and nonconvex, multicriteria programs are developed. Polyhedral distance functions are used to construct the approximation and evaluate its quality. The functions automatically adapt to the problem structure and scaling which makes the approximation process unbiased and self-driven. Decision makers' preferences, if available, can be easily incorporated but are not required by the procedure.