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

Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets

Author

Listed:
  • Donald M. Topkis

    (University of California, Berkeley, California)

Abstract

This note shows that a framework I developed earlier can be used to give a simplified proof of conditions given by Eaves and Zangwill (which weaken the uniform concavity requirement on my earlier objective function) under which inactive constraints may be dropped after each subproblem in cutting-plane algorithms. Here the convergence rate I established previously as an extension of the results of Levitin and Polyak is improved and its application extended.

Suggested Citation

  • Donald M. Topkis, 1970. "Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets," Operations Research, INFORMS, vol. 18(6), pages 1216-1220, December.
  • Handle: RePEc:inm:oropre:v:18:y:1970:i:6:p:1216-1220
    DOI: 10.1287/opre.18.6.1216
    as

    Download full text from publisher

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

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

    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:18:y:1970:i:6:p:1216-1220. 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.