Advanced search
Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 69, 2020 - Issue 4
Submit an article Journal homepage
252
Views
5
CrossRef citations to date
0
Altmetric
Articles

Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation

N. GadhiDepartment of Mathematics, LSO, Sidi Mohamed Ben Abdellah University, Dhar El Mahraz, Fes, MoroccoView further author information
,
K. HamdaouiDepartment of Mathematics, LSO, Sidi Mohamed Ben Abdellah University, Dhar El Mahraz, Fes, MoroccoView further author information
&
M. El idrissiDepartment of Mathematics, LSO, Sidi Mohamed Ben Abdellah University, Dhar El Mahraz, Fes, MoroccoCorrespondence[email protected]
View further author information
Pages 681-702 | Received 16 Dec 2018, Accepted 22 May 2019, Published online: 13 Jun 2019

References

  • Gadhi N, Dempe S. Necessary optimality conditions and a new approach to multi-objective bilevel optimization problems. J Optim Theory Appl. 2012;155:100–114. doi: 10.1007/s10957-012-0046-1
  • Babahadda H, Gadhi N. Necessary optimality conditions for bilevel optimization problems using convexificators. J Global Optim. 2006;34:535–549. doi: 10.1007/s10898-005-1650-5
  • Bard JF. Optimality conditions for the bilevel programming problem. Nav Res Logist Q. 1984;31:13–26. doi: 10.1002/nav.3800310104
  • Chuong TD. Optimality conditions for nonsmooth multiobjective bilevel optimization problems. Ann Oper Res. 2017. doi:10.1007/s10479-017-2734-6
  • Dempe S, Gadhi N. Second order optimality conditions for bilevel set optimization problems. J Global Optim. 2010;47:233–245. doi: 10.1007/s10898-009-9468-1
  • Gadhi N, El idrissi M. An equivalent one level optimization problem to a semivectorial bilevel problem. Positivity. 2017;22:261–274. doi: 10.1007/s11117-017-0511-z
  • Lafhim L, Gadhi N, Hamdaoui K, et al. Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation. Optimization. 2018;67:1–11. doi: 10.1080/02331934.2018.1523402
  • Ye JJ. Constraint qualification and KTT conditions for bilevel programming problems. Oper Res. 2006;31:211–824.
  • Demyanov VF. Convexification and concavification of a positively homogeneous function by the same family of linear functions. Report 3, 208, 802, Universita di Pisa (1994).
  • Dutta J, Chandra S. Convexificators, generalized convexity and optimality conditions. J Optim Theory Appl. 2002;113:41–65. doi: 10.1023/A:1014853129484
  • Jeyakumar V, Luc T. Nonsmooth calculus, minimality and monotonicity of convexificators. J Optim Theory Appl. 1999;101:599–621. doi: 10.1023/A:1021790120780
  • Dutta J, Chandra S. Convexificator, generalized convexity and vector optimization. Optimization. 2004;53:77–94. doi: 10.1080/02331930410001661505
  • Hiriart-Urruty JB. Tangent cones, generalized gradients and mathematical programming in Banach spaces. Math Oper Res. 1979;4:79–97. doi: 10.1287/moor.4.1.79
  • Ciligot-Travain M. On Lagrange-Kuhn-Tucker multipliers for Pareto optimization problems. Numer Funct Anal Optim. 1994;15:689–693. doi: 10.1080/01630569408816587
  • Clarke FC. Optimization and nonsmooth analysis. New York: Wiley-Interscience; 1983.
  • Penot M. A generalized derivatives for calm and stable functions. Differ Integr Equ. 1992;5:433–454.
  • Mordukhovich BS, Shao Y. A non convex subdifferential calculus in Banach space. J Convex Anal. 1995;2:211–227.
  • Jeyakumar V, Luc DT. Nonsmooth vector functions and continuous optimization. New York: Springer; 2008.
  • Abadie J. On the Kuhn–Tucker theorem. In: Abadie J, editor. Nonlinear programming. Amsterdam: North-Holland; 1967. p. 19–36.
  • Li W. Abadie's constraint qualification, metric regularity, and error bounds for differentiable convex inequalities. SIAM J Optim. 1997;7:966–978. doi: 10.1137/S1052623495287927
  • Li W, Nahak C, Singer I. Constraint qualifications for semi-infinite systems of convex inequalities. SIAM J Optim. 2000;11:31–52. doi: 10.1137/S1052623499355247

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.