2016
DOI: 10.1007/s12190-015-0979-2
|View full text |Cite
|
Sign up to set email alerts
|

Global efficiency for multiobjective bilevel programming problems under generalized invexity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 33 publications
0
1
0
Order By: Relevance
“…Multiobjective bilevel programming problem, where one of the objective functions of the upper-level problem and/or the lower-level problem is a vector function, needs to be investigated intensively as it is demanded from the point-of-view of applications. They have been studied in the literature by authors such as Bouibed et al [8], Ye [36], Bonnel [5], Bonnel and Morgan [6,7], Tung [35], Luu and Mai [29] and others. Recently, Luu and Mai [29] developed necessary and sufficient efficiency conditions for multiobjective bilevel programming problem via convexifactors.…”
Section: Introductionmentioning
confidence: 99%
“…Multiobjective bilevel programming problem, where one of the objective functions of the upper-level problem and/or the lower-level problem is a vector function, needs to be investigated intensively as it is demanded from the point-of-view of applications. They have been studied in the literature by authors such as Bouibed et al [8], Ye [36], Bonnel [5], Bonnel and Morgan [6,7], Tung [35], Luu and Mai [29] and others. Recently, Luu and Mai [29] developed necessary and sufficient efficiency conditions for multiobjective bilevel programming problem via convexifactors.…”
Section: Introductionmentioning
confidence: 99%