IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v9y1981i3p313-319.html
   My bibliography  Save this article

A survey of methodology for the global minimization of concave functions subject to convex constraints

Author

Listed:
  • Heising-goodman, Carolyn D

Abstract

Methodology is described for the global solution to problems of the form minimize f(x) subject to x[set membership, variant]G, ui [greater-or-equal, slanted] xi [greater-or-equal, slanted] li where f(x) is a concave function of the vector x in Rn space and G is a convex polytope. This paper investigates recent work accomplished to solve this problem. Basically, solution algorithms can be categorized into three distinct areas: (1) branch-and-bound methods, (2) cutting plane methods, and (3) build-up of polyhedra methods. Computational experience with these methods is also examined. Particular attention is paid to the possibility for extension of these algorithms to problems of large scale, specifically to those evidencing separable objective functions which are subject to linear sets of constraints.

Suggested Citation

  • Heising-goodman, Carolyn D, 1981. "A survey of methodology for the global minimization of concave functions subject to convex constraints," Omega, Elsevier, vol. 9(3), pages 313-319.
  • Handle: RePEc:eee:jomega:v:9:y:1981:i:3:p:313-319
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(81)90038-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:jomega:v:9:y:1981:i:3:p:313-319. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.