1991
DOI: 10.1007/bf00941577
|View full text |Cite
|
Sign up to set email alerts
|

A gap between multiobjective optimization and scalar optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

1994
1994
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(6 citation statements)
references
References 2 publications
0
6
0
Order By: Relevance
“…In the single-objective case this condition holds at an optimal point considering any direction v in the closed convex hull of T (X, x 0 ), i. e. in the cone P(X, x 0 ). This is no longer true in the multiobjective case, as Wang and Yang (1991) have shown. However (see Castellani and Pappalardo (2001)…”
Section: Vector Optimization With a Set Constraint Basic Resultsmentioning
confidence: 94%
“…In the single-objective case this condition holds at an optimal point considering any direction v in the closed convex hull of T (X, x 0 ), i. e. in the cone P(X, x 0 ). This is no longer true in the multiobjective case, as Wang and Yang (1991) have shown. However (see Castellani and Pappalardo (2001)…”
Section: Vector Optimization With a Set Constraint Basic Resultsmentioning
confidence: 94%
“…If the gradients , are linearly pendent, just set , has been obtained by Lin [18] and by Singh [19]; however, their proofs work only if 0 x is a weak Pareto optimal point for (vop) 1 , and not a local weak Pareto optimal point. The flaw is corr ed in Marusciac [20]; s ect ee also the errata corrige of Singh [19], who, however, does not justify his rectification; see also the paper of Wang [21], more specific on this point.…”
Section: Proofmentioning
confidence: 99%
“…has no so Applying t rnative, we get the following (weak) Karush-KuhnTucker-type multiplier rule for (vop) 1 . (6) and (7) hold.…”
Section: Definitionmentioning
confidence: 99%
See 2 more Smart Citations