Some properties of pareto-optimal choices in decision problems
AbstractEstimates are derived for the expected number of Pareto-optimal choices when n candidates are compared with respect to q qualities. The number of comparisons needed to find the Pareto-optimal choices, and the possible advantages of suboptimization procedures, are briefly discussed.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Omega.
Volume (Year): 4 (1976)
Issue (Month): 2 ()
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Hanne, Thomas, 1999. "On the convergence of multiobjective evolutionary algorithms," European Journal of Operational Research, Elsevier, vol. 117(3), pages 553-564, September.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.