Separable concave minimization via partial outer approximation and branch and bound

Authors:
Harold P. Benson
Affiliations:
University of Florida, 351 Business Building, Gainesville, FL 32611, USA
Venue:
Operations Research Letters
Year:
1990

Citing 10
Cited 1

Methods for global concave minimization: A bibliographic survey

SIAM Review
A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization

Journal of Optimization Theory and Applications
Constrained global optimization: algorithms and applications

Constrained global optimization: algorithms and applications
Concave minimization via collapsing polytopes

Operations Research
Deterministic global optimization with partition sets whose feasibility is not known: application to concave minimization reverse convex

Journal of Optimization Theory and Applications
Convergence and restart in branch-and-bound algorithms for global optimization. application to concave minimization and d.c. optimization problems

Mathematical Programming: Series A and B - Special Issue: Essays on Nonconvex Optimization
On the structure and properties of linear multilevel programming problem

Journal of Optimization Theory and Applications
Concave minimization via conical partitions and polyhedral outer approximation

Mathematical Programming: Series A and B
Ic layout generation and compaction using mathematical optimization

Ic layout generation and compaction using mathematical optimization
On finding new vertices and redundant constraints in cutting plane algorithms for global optimization

Operations Research Letters

Capacity planning in networks of queues with manufacturing applications

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new algorithm for globally minimizing a separable, concave function over a compact convex set. The algorithm uses partial outer approximation and branch and bound. The major computational effort required is solving linear programming problems at some nodes of the branch and bound tree, and solving simple univariate minimizations in some iterations. The algorithm partially mitigates the rapid growth in the number of constraints of the linear programs that would frequently occur if traditional outer approximation were used. Furthermore, unlike outer approximation, the algorithm does not explicitly construct polyhedra which contain the feasible region.