IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v189y2021i3d10.1007_s10957-021-01864-5.html
   My bibliography  Save this article

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

Author

Listed:
  • Nazih Abderrazzak Gadhi

    (Sidi Mohamed Ben Abdellah University)

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.

Suggested Citation

  • Nazih Abderrazzak Gadhi, 2021. "Comments on “A Note on the Paper “Optimality Conditions for Optimistic Bilevel Programming Problem Using Convexifactors””," Journal of Optimization Theory and Applications, Springer, vol. 189(3), pages 938-943, June.
    • Handle: RePEc:spr:joptap:v:189:y:2021:i:3:d:10.1007_s10957-021-01864-5
    DOI: 10.1007/s10957-021-01864-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-021-01864-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-021-01864-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bhawna Kohli, 2012. "Optimality Conditions for Optimistic Bilevel Programming Problem Using Convexifactors," Journal of Optimization Theory and Applications, Springer, vol. 152(3), pages 632-651, March.
    2. Bhawna Kohli, 2019. "A Note on the Paper “Optimality Conditions for Optimistic Bilevel Programming Problem Using Convexifactors”," Journal of Optimization Theory and Applications, Springer, vol. 181(2), pages 706-707, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Do Luu, 2014. "Necessary and Sufficient Conditions for Efficiency Via Convexificators," Journal of Optimization Theory and Applications, Springer, vol. 160(2), pages 510-526, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:189:y:2021:i:3:d:10.1007_s10957-021-01864-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.