Answers are grounded in this paper and cite their sources.
We present a procedure for globally minimizing a concave function over a (bounded) polytope by successively minimizing the function over polytopes containing the feasible region, and collapsing to the feasible region. The initial containing polytope is a simplex, and, at the kth iteration, the procedure chooses the most promising vertex of the current containing polytope to refine the approximation. The method generates a tree whose ultimate terminal nodes coincide with the vertices of the feasible region, and accounts for the vertices of the containing polytopes.
No takes yet. Share an insight, caveat, or question.
Falk et al. (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: