Global minimization of a concave function subject to mixed linear and reverse convex constraints
From MaRDI portal
Publication:913663
zbMath0699.90083MaRDI QIDQ913663
Publication date: 1988
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
branch-and-bound; global minimization; concave function; nonconvex domain; generalized simplices; polyhedral convex set
90C30: Nonlinear programming
Related Items
Convex programs with an additional reverse convex constraint, On the global minimization of a convex function under general nonconvex constraints, Sequential convexification in reverse convex and disjunctive programming, Optimization by level set methods vi:generalizations of surrogate type reverse convex duality