Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytopes

DOI10.1287/moor.13.3.479zbMath0651.90058OpenAlexW2035396705MaRDI QIDQ3796968

M. A. Hamami, Stephen E. Jacobsen

Publication date: 1988

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.13.3.479

zbMATH Keywords

concave minimizationsystem of linear inequalitiesbounded convex polytopenondegenerate cone splitting process

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items

On the relation between concavity cuts and the surrogate dual for convex maximization problems, On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope, Normal conical algorithm for concave minimization over polytopes, Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms, A convergent conical algorithm with \(\omega \)-bisection for concave minimization, Subdivision of simplices relative to a cutting plane and finite concave minimization, Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems