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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.