Abstract
Given a polytope and an arbitrary subset of its vertices, the author shows how to construct a differentiable concave function that assumes any arbitrary value (within a specified epsilon -tolerance) at each vertex of the subset, with each vertex in the subset a strong local constrained minimum. The author also shows how this construction method can be used to generate test problems for linearly constrained concave minimization algorithms.
Original language | English (US) |
---|---|
Pages (from-to) | 222-227 |
Number of pages | 6 |
Journal | Operations Research |
Volume | 33 |
Issue number | 1 |
DOIs | |
State | Published - 1985 |
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Management Science and Operations Research