A Duality Approach for a Class of Semivectorial Bilevel Programming Problems
Overview & Synopsis
In this paper, we present a duality approach using conjugacy for a semivectorial bilevel programming problem (S) where the upper and lower levels are vectorial and scalar respectively. This approach uses the Fenchel–Lagrange duality and is given via a regularization of problem (S) and the operation of scalarization. Then, using this approach, we provide necessary optimality conditions for a class of properly efficient solutions of (S). Finally, sufficient optimality conditions are given for (S) regardless of the duality approach. Examples are given for illustration.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | A Duality Approach for a Class of Semivectorial Bilevel Programming Problems |
|---|---|
| Author / Organization | Abdelmalek Aboussoror, Samir Adly, Fatima Ezzahra Saissi |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2018 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-34275 |
| Original Source Link | Visit Source Page on hal.science » |