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

Carolyn D Heising-goodman

Omega, 1981, vol. 9, issue 3, 313-319

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.

Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(81)90038-4
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:9:y:1981:i:3:p:313-319

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().