2007
DOI: 10.1007/s00158-007-0185-4
|View full text |Cite
|
Sign up to set email alerts
|

A new perspective on multiobjective optimization by enhanced normalized normal constraint method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
46
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
7
2
1

Relationship

1
9

Authors

Journals

citations
Cited by 68 publications
(46 citation statements)
references
References 14 publications
0
46
0
Order By: Relevance
“…The generalization and application of the weighted sum and normal boundary intersection methods to optimization problems with more than 2 objectives is straightforward (Marler and Arora 2004;Das and Dennis 1998). On the other hand, the normalized normal constraint method has to be modified in order to properly handle more than 2 objectives and the enhanced normalized normal constraint method of Sanchis et al (2008) can be used.…”
Section: Case Studymentioning
confidence: 99%
“…The generalization and application of the weighted sum and normal boundary intersection methods to optimization problems with more than 2 objectives is straightforward (Marler and Arora 2004;Das and Dennis 1998). On the other hand, the normalized normal constraint method has to be modified in order to properly handle more than 2 objectives and the enhanced normalized normal constraint method of Sanchis et al (2008) can be used.…”
Section: Case Studymentioning
confidence: 99%
“…Some of the classical strategies to approximate the Pareto set include: normal constraint method [32,33], normal boundary intersection (NBI) method [34], epsilon constraint techniques [28] and physical programming [35]. Multi-objective evolutionary algorithms (MOEA) have been used to approximate a Pareto set [36], due to their flexibility when evolving an entire population towards the Pareto front.…”
Section: Multi-objective Optimization Processmentioning
confidence: 99%
“…The tri-objective portfolio Problems (15) and (17) will be tackled by considering this extended version of the NC procedure, even if other more efficient solutions are possible (see, for instance, [47][48][49]), because these improvements necessitate much more modifications to the original optimization scheme.…”
Section: A New Variant Of the Normal Constraint Algorithmmentioning
confidence: 99%