On the characterization of Pareto-optimal solutions in bicriterion optimization

descriptionPublicationkeyboard_double_arrow_right Article 01 Feb 1979 English Publisher:Springer Science and Business Media LLCJournal:Journal of Optimization Theory and Applications, volume 27, pages 301-307 (issn: 0022-3239, eissn: 1573-2878,

Copyright policy )

Authors: Gearhart, W. B.;

doi: 10.1007/bf00933233

On the characterization of Pareto-optimal solutions in bicriterion optimization

- Summary
- Subjects
- Metrics

Abstract

For bicriterion optimization involving objective functionsf 1 andf 2 defined on a decision spaceX, a condition is presented under which the Pareto-optimal points can be characterized as solutions of the scalar optimization problems: Minimizef 1(x), subject tof 2(x)≤α,x ∈X, which α ranges over a certain interval. Using this condition, it is shown how the Pareto-optimal points can be so characterized in both convex and nonconvex situations.

Related Organizations

The University of Texas at San Antonio
United States

Keywords

Mathematical programming

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	12
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average