A branch and bound-outer approximation algorithm for concave minimization over a convex set

DOI10.1016/0898-1221(91)90161-VzbMath0722.90055MaRDI QIDQ757243

Reiner Horst, Harold P. Benson

Publication date: 1991

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

branch and boundouter approximation

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (12)

Deterministic methods in constrained global optimization: Some recent advances and new fields of application ⋮ A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron ⋮ On solving general reverse convex programming problems by a sequence of linear programs and line searches ⋮ Capacity planning in networks of queues with manufacturing applications ⋮ A norm minimization-based convex vector optimization algorithm ⋮ On geometry and convergence of a class of simplicial covers ⋮ On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope ⋮ An all-linear programming relaxation algorithm for optimizing over the efficient set ⋮ On solving a d.c. programming problem by a sequence of linear programs ⋮ A new simplicial cover technique in constrained global optimization ⋮ On nonconvex optimization problems with separated nonconvex variables ⋮ Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An outer approximation method for globally minimizing a concave function over a compact convex set
• Minimizing a concave function over a compact convex set
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
• Outer approximation by polyhedral convex sets
• Relationship between bilinear programming and concave minimization under linear constraints
• A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
• A finite algorithm for concave minimization over a polyhedron
• Methods for Global Concave Minimization: A Bibliographic Survey
• A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
• A method for globally minimizing concave functions over convex sets
• Convergent Algorithms for Minimizing a Concave Function
• An algorithm for nonconvex programming problems
• A Successive Underestimation Method for Concave Minimization Problems
• A Deterministic Multiproduct, Multi-Facility Production and Inventory Model
• Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints

This page was built for publication: A branch and bound-outer approximation algorithm for concave minimization over a convex set