Skip to main content
SpringerLink
Log in

Comments on “A Note on the Paper “Optimality Conditions for Optimistic Bilevel Programming Problem Using Convexifactors””

  • Forum
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

Necessary optimality conditions for a bilevel optimization problem are given in the paper by Kohli (J Optim Theory Appl 152: 632–651, 2012). Recently, the same author corrected his results in the note (J Optim Theory Appl 181:706–707, 2019). In this work, we have pointed out that some of the new modifications are wrong. We correct the flaws and present an alternative proof for the main result.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ansari Ardali, A., Movahedian, N., Nobakhtian, S.: Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators. Optimization 56, 67–85 (2016)

    Article  MathSciNet  Google Scholar 

  2. Güler, O.: Separation of convex sets. In: Foundations of Optimization. Graduate Texts in Mathematics, vol. 258. Springer, New York (2010)

  3. Hiriart-Urruty, J.B., Lemarechal, C.: Fundamentals of Convex Analysis. Springer, Berlin (2001)

    Book  Google Scholar 

  4. Kabgani, A., Soleimani-damaneh, M.: Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semiinfinite multiobjective optimization using convexificators. Optimization 67, 217–235 (2017)

    Article  Google Scholar 

  5. Kanzi, N., Nobakhtian, S.: Optimality conditions for nonsmooth semi-infinite multiobjective programming. Optim. Lett. 8, 1517–1528 (2014)

    Article  MathSciNet  Google Scholar 

  6. Kohli, B.: Optimality conditions for optimistic bilevel programming problem using convexificators. J. Optim. Theory Appl. 152, 632–651 (2012)

    Article  MathSciNet  Google Scholar 

  7. Kohli, B.: A note on the paper “Optimality conditions for optimistic bilevel programming problem using convexifactors. J. Optim. Theory Appl. 181, 706–707 (2019)

    Article  MathSciNet  Google Scholar 

  8. Rockafellar RT (1970) Convex Analysis. Princeton, New Jersey

Download references

Acknowledgements

Our sincere acknowledgements to the anonymous referees for their insightful remarks and suggestions.

Author information

Authors and Affiliations

  1. LAMA, FSDM, Sidi Mohamed Ben Abdellah University, Fez, Morocco

    Nazih Abderrazzak Gadhi

Authors
  1. Nazih Abderrazzak Gadhi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nazih Abderrazzak Gadhi.

Additional information

Communicated by Boris S. Mordukhovich.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gadhi, N.A. Comments on “A Note on the Paper “Optimality Conditions for Optimistic Bilevel Programming Problem Using Convexifactors””. J Optim Theory Appl 189, 938–943 (2021). https://doi.org/10.1007/s10957-021-01864-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-021-01864-5

Keywords

Mathematics Subject Classification

Search

Navigation