Abstract
In 1952, Radstrom proved a lemma which states that the Hausdorff distance between two convex sets A and B equals the Hausdorff distance between the translated sets A + X and B + X, provided X is bounded. This paper extends this result to more general types of translations. The theory developed is then applied to the problem of establishing upper bounds on the Hausdorff distance between two unbounded convex feasible regions, one of which is obtained by perturbing the data defining the other.
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.
