IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v194y2009i2p363-367.html
   My bibliography  Save this article

Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming

Author

Listed:
  • Jeyakumar, V.
  • Srisatkunarajah, S.

Abstract

We present geometric criteria for a feasible point that satisfies the Kuhn-Tucker conditions to be a global minimizer of mathematical programming problems with or without bounds on the variables. The criteria apply to multi-extremal programming problems which may have several local minimizers that are not global. We establish such criteria in terms of underestimators of the Lagrangian of the problem. The underestimators are required to satisfy certain geometric property such as the convexity (or a generalized convexity) property. We show that the biconjugate of the Lagrangian can be chosen as a convex underestimator whenever the biconjugate coincides with the Lagrangian at a point. We also show how suitable underestimators can be constructed for the Lagrangian in the case where the problem has bounds on the variables. Examples are given to illustrate our results.

Suggested Citation

  • Jeyakumar, V. & Srisatkunarajah, S., 2009. "Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming," European Journal of Operational Research, Elsevier, vol. 194(2), pages 363-367, April.
    • Handle: RePEc:eee:ejores:v:194:y:2009:i:2:p:363-367
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)01208-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mareček, Jakub & Richtárik, Peter & Takáč, Martin, 2017. "Matrix completion under interval uncertainty," European Journal of Operational Research, Elsevier, vol. 256(1), pages 35-43.

    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:eee:ejores:v:194:y:2009:i:2:p:363-367. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.