IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v102y1999i2d10.1023_a1021776323080.html
   My bibliography  Save this article

Generalized γ-Valid Cut Procedure for Concave Minimization

Author

Listed:
  • H. P. Benson

    (University of Florida)

Abstract

The concept of a γ-valid cutting plane has been used in many types of algorithms for solving concave minimization problems. Unfortunately, the procedures proposed to date for constructing these cuts are valid only under certain assumptions that often may not hold in practice. Chief among these is the requirement that the feasible region of the concave minimization problem in question have full dimension, and that the objective function of this problem be concave rather than quasiconcave. In this article, we propose, validate, and show how to implement a more general γ-valid cutting plane procedure which eliminates these restrictions.

Suggested Citation

  • H. P. Benson, 1999. "Generalized γ-Valid Cut Procedure for Concave Minimization," Journal of Optimization Theory and Applications, Springer, vol. 102(2), pages 289-298, August.
    • Handle: RePEc:spr:joptap:v:102:y:1999:i:2:d:10.1023_a:1021776323080
    DOI: 10.1023/A:1021776323080
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1021776323080
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1021776323080?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.

    Citations

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


    Cited by:

    1. Darinka Dentcheva & Eli Wolfhagen, 2016. "Two-Stage Optimization Problems with Multivariate Stochastic Order Constraints," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 1-22, February.
    2. Marcus Porembski, 2004. "Cutting Planes for Low-Rank-Like Concave Minimization Problems," Operations Research, INFORMS, vol. 52(6), pages 942-953, December.

    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:102:y:1999:i:2:d:10.1023_a:1021776323080. 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: 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.