Pareto set
From DDL Wiki
(Difference between revisions)
| Line 1: | Line 1: | ||
In multi-objective optimization, the Pareto set, or Pareto Frontier, is a subset of the attainable set of solutions that contains all points that have at least one objective optimized while holding all other objectives constant. These points are called Pareto optimal points. | In multi-objective optimization, the Pareto set, or Pareto Frontier, is a subset of the attainable set of solutions that contains all points that have at least one objective optimized while holding all other objectives constant. These points are called Pareto optimal points. | ||
| - | |||
This set of points contain all potentially optimal solutions or design given all possible tradeoff situations. | This set of points contain all potentially optimal solutions or design given all possible tradeoff situations. | ||
| + | |||
| + | |||
| + | |||
| + | [[Image:attainable.jpg]] | ||
| + | [[Image:pareto.jpg]] | ||
Revision as of 11:10, 29 November 2006
In multi-objective optimization, the Pareto set, or Pareto Frontier, is a subset of the attainable set of solutions that contains all points that have at least one objective optimized while holding all other objectives constant. These points are called Pareto optimal points.
This set of points contain all potentially optimal solutions or design given all possible tradeoff situations.
