Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems
Operations Research · 1985 · Volume 33 · Issue 1
Abstract
Given a polytope and an arbitrary subset of its vertices, we show how to construct a differentiable concave function that assumes any arbitrary value (within a specified ε-tolerance) at each vertex of the subset, with each vertex in the subset a strong local constrained minimum. We also show how this construction method can be used to generate test problems for linearly constrained concave minimization algorithms.
Keywords
643, 646, and 650 construction of difficult global minimization problems
Enable JavaScript for citation tools and additional paper interactions.