In this paper, we study a generalized version of the Weber problem finding point that minimizes sum its distances to finite number given points. our setting, these may be cut off at value [Formula: see text], and allow for option an empty solution fixed cost text]. We analyze under which circumstances problems can reduced simpler problem, also when definitely have solve more complex with cutoff...