IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v18y1972i9p567-573.html
   My bibliography  Save this article

Constraint Qualifications Revisited

Author

Listed:
  • M. S. Bazaraa

    (Georgia Institute of Technology)

  • J. J. Goode

    (Georgia Institute of Technology)

  • C. M. Shetty

    (Georgia Institute of Technology)

Abstract

In this study we investigate the constraint qualifications for the Kuhn-Tucker conditions to hold for an inequality-constrained nonlinear programming problem. We present the qualifications in a consistent manner so that the interrelationships between them are highlighted. This gives rise naturally to two types of constraint qualifications, and it will be seen that air the qualifications of one type are almost equally weak whereas the other type of qualifications makes relatively strong assumptions. In the study we also slightly relax the Kuhn-Tucker and some other constraint qualifications, and also show the interrelationship between some of the qualifications which have not been established thus far.

Suggested Citation

  • M. S. Bazaraa & J. J. Goode & C. M. Shetty, 1972. "Constraint Qualifications Revisited," Management Science, INFORMS, vol. 18(9), pages 567-573, May.
    • Handle: RePEc:inm:ormnsc:v:18:y:1972:i:9:p:567-573
    DOI: 10.1287/mnsc.18.9.567
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.18.9.567
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.18.9.567?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. Johri, Pravin K., 1996. "Implied constraints and an alternate unified development of nonlinear programming theory," European Journal of Operational Research, Elsevier, vol. 88(3), pages 537-549, February.
    2. Stanley Baiman & Jerrold H. May & Arijit Mukherji, 1990. "Optimal employment contracts and the returns to monitoring in a principal†agent context," Contemporary Accounting Research, John Wiley & Sons, vol. 6(2), pages 761-799, March.
    3. Polyxeni-Margarita Kleniati & Claire Adjiman, 2014. "Branch-and-Sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part I: Theoretical development," Journal of Global Optimization, Springer, vol. 60(3), pages 425-458, November.

    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:ormnsc:v:18:y:1972:i:9:p:567-573. 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.