Abstract
The median problem is a basic model in location theory and transportation sciences. This problem deals with locating a facility on a network, to minimize the sum of weighted distances between the facility and the vertices of the network. In this paper, the cases that weights of vertices, edge lengths or both of them are grey numbers, are considered. For all these cases, we show that the set of vertices of network contains a solution of the median problem. This property is called vertex optimality. Median problem with grey parameters and its properties are first considered in this paper.
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 callMore From: Statistics, Optimization & Information Computing
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.
