IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v16y1968i4p849-857.html
   My bibliography  Save this article

Asymptotic Lagrange Regularity for Pseudoconcave Programming with Weak Constraint Qualification

Author

Listed:
  • K. O. Kortanek

    (Cornell University, Ithaca, New York)

  • J. P. Evans

    (Cornell University, Ithaca, New York)

Abstract

In a previous paper we obtained characterizations of constraint sets determined by a finite number of differentiate pseudoconcave constraint functions possessing an interior point, and showed that they are convex Lagrange regular. In this paper we introduce a weaker type of constraint qualification and obtain asymptotic Lagrange regularity conditions from the constructs of semi-infinite programming. We impose the constraint qualification that each constraint function possess an interior point, possibly different for different constraint functions. Computationally speaking, it is relatively easy to verify since each constraint function is examined individually for interior points in consistent problems. Artificial vectors are adjoined to the dual problem and within the constructs of this problem involving no new data, convergence is assured asymptotically to Lagrangian type conditions. In this case the dual objective value tends to the optimal primal value in the limit. In case the constraint functions are differentiable concave, then asymptotic Lagrange regularity is obtained without any constraint qualification whatever.

Suggested Citation

  • K. O. Kortanek & J. P. Evans, 1968. "Asymptotic Lagrange Regularity for Pseudoconcave Programming with Weak Constraint Qualification," Operations Research, INFORMS, vol. 16(4), pages 849-857, August.
  • Handle: RePEc:inm:oropre:v:16:y:1968:i:4:p:849-857
    DOI: 10.1287/opre.16.4.849
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.16.4.849
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.16.4.849?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
    ---><---

    Citations

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


    Cited by:

    1. Giorgio Giorgi & Bienvenido Jiménez & Vicente Novo, 2014. "Some Notes on Approximate Optimality Conditions in Scalar and Vector Optimization Problems," DEM Working Papers Series 095, University of Pavia, Department of Economics and Management.
    2. Giorgio Giorgi & Bienvenido Jiménez & Vicente Novo, 2016. "Approximate Karush–Kuhn–Tucker Condition in Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 70-89, October.

    More about this item

    Statistics

    Access and download statistics

    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:inm:oropre:v:16:y:1968:i:4:p:849-857. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.