Abstract
This paper proposes an alternate method for finding several Pareto optimal points for a general nonlinear multicriteria optimization problem. Such points collectively capture the trade-off among the various conflicting objectives. It is proved that this method is independent of the relative scales of the functions and is successful in producing an evenly distributed set of points in the Pareto set given an evenly distributed set of parameters, a property which the popular method of minimizing weighted combinations of objective functions lacks. Further, this method can handle more than two objectives while retaining the computational efficiency of continuation-type algorithms. This is an improvement over continuation techniques for tracing the trade-off curve since continuation strategies cannot easily be extended to handle more than two objectives.
Keywords
Mathematical optimizationContinuationIntersection (aeronautics)MathematicsPareto principleMulti-objective optimizationSet (abstract data type)TracingNonlinear systemBoundary (topology)Property (philosophy)Pareto optimalNonlinear programmingFeasible regionComputer science
Related Publications
Scalable multi-objective optimization test problems
After adequately demonstrating the ability to solve different two-objective optimization problems, multi-objective evolutionary algorithms (MOEAs) must show their efficacy in ha...
A New Evolutionary Algorithm for Solving Many-Objective Optimization Problems
In this paper, we focus on the study of evolutionary algorithms for solving multiobjective optimization problems with a large number of objectives. First, a comparative study of...
A niched Pareto genetic algorithm for multiobjective optimization
Many, if not most, optimization problems have multiple objectives. Historically, multiple objectives have been combined ad hoc to form a scalar objective function, usually throu...
Properties of an adaptive archiving algorithm for storing nondominated vectors
Search algorithms for Pareto optimization are designed to obtain multiple solutions, each offering a different tradeoff of the problem objectives. To make the different solution...
A fast and elitist multiobjective genetic algorithm: NSGA-II
Multi-objective evolutionary algorithms (MOEAs) that use non-dominated sorting and sharing have been criticized mainly for: (1) their O(MN/sup 3/) computational complexity (wher...
Publication Info
- Year
- 1998
- Type
- article
- Volume
- 8
- Issue
- 3
- Pages
- 631-657
- Citations
- 2502
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
2502
OpenAlex
188
Influential
2160
CrossRef
Cite This
Indraneel Das,
J. E. Dennis
(1998).
Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems.
SIAM Journal on Optimization
, 8
(3)
, 631-657.
https://doi.org/10.1137/s1052623496307510
Identifiers
- DOI
- 10.1137/s1052623496307510