Abstract
We introduce a version of the weighted 1-maximin problem in a convex polygon, where the weights are functions of a parameter. The 1-maximin problem is applicable in the location of undesirable facilities. Its objective is to find an optimal location such that the minimum weighted distance to a given set of points is maximized. We show that the parametric 1-maximin problem is equivalent to a 1-minimax problem, where the costs are non-linearly decreasing functions of distance. Using different values of the parameter in the 1-maximin problem, one can model different disutility functions for the users of the facility. Furthermore, the parameterization provides for a systematic way of reducing the effects of the weights, resulting in the unweighted 1-maximin problem in the limit. For two example problems we construct the optimal trajectory as a function of the parameter, and demonstrate that the trajectory may be discontinuous.
Sign-in/Register to access full text options 
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.
