This paper presents a fuzzy goal programming model for locating multip
le new facilities on a plane bounded by a convex polygon under the cri
teria: (1) minimize the sum of all the transportation costs and (2) mi
nimize the maximum distances from the facilities to the demand points.
It has also been proved that the methodology given will always give a
nondominated solution. Recti-linear distances have been taken as the
scenario may be thought of in an urban setting. A numerical example ha
s been given to illustrate the solution methodology.