Abstract
The problem of finding the distance to a reverse (or complement of a) convex subset in a normed vector space is considered. This nonconvex and, in general, nonsmooth optimization problem arises in quantitative economics in the theory of measuring the technical efficiency of production units. In this context, applying a suitable duality theorem similar to the Nirenberg's one known for the distance to a convex subset, the problem reduces to a finite number of independent linear programming problems.
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 callDisclaimer: 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.
