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

Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems

Author

Listed:
  • Bahman Kalantari

    (Rutgers University, New Brunswick, New Jersey)

Abstract

Given a polytope and an arbitrary subset of its vertices, we show how to construct a differentiable concave function that assumes any arbitrary value (within a specified ε-tolerance) at each vertex of the subset, with each vertex in the subset a strong local constrained minimum. We also show how this construction method can be used to generate test problems for linearly constrained concave minimization algorithms.

Suggested Citation

  • Bahman Kalantari, 1985. "Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems," Operations Research, INFORMS, vol. 33(1), pages 222-227, February.
    • Handle: RePEc:inm:oropre:v:33:y:1985:i:1:p:222-227
    DOI: 10.1287/opre.33.1.222
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.33.1.222
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.33.1.222?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
    ---><---

    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:33:y:1985:i:1:p:222-227. 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.