Deterministic methods in constrained global optimization: Some recent advances and new fields of application

Reiner Horst

Naval Research Logistics (NRL), 1990, vol. 37, issue 4, 433-471

Abstract: Recent developments in deterministic global optimization methods have considerably enlarged the fields of optimization where those methods can be successfully applied. It is the purpose of the present article to give a brief survey of both some of the most promising methods and new fields of application. The methods considered comprise branch and bound and outer approximation as well as combinations of branch and bound with outer approximation. The fields of applications to be discussed include concave minimization, reverse convex programming, d.c. programming, Lipschitzian optimization, systems of equations, and (or) inequalities and global integer programming.

Date: 1990
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199008)37:43.0.CO;2-2

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:wly:navres:v:37:y:1990:i:4:p:433-471

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().