Approximately Algorithm for Maximin Location Problem on Network

The facility location problem of on network is considered. It is need to find the best location for an undesirable facility on a network such that the least weighted distance to all nodes of network is maximized. The problem is an adequate model of many practical applications from various fields. The problem can be used to determine the location of a facility that generates traffic congestion or other disturbance, such as a shopping center or a stadium. The mathematical model of nonlinear programming of the problem is proposed. The overview of decision’s methods and the properties of the problem are provided. The algorithm for finding of an approximate solution of the problem is proposed. Results of computational experiments are reported.