The problem of locating a point that is as far as possible from arcs a
nd nodes of a network is investigated. Each are or node may have a dif
ferent multiplicative factor (weight) for its distance. A graphical so
lution approach, as well as a computational algorithm, is presented.