| Article ID: | iaor1988295 |
| Country: | United States |
| Volume: | 35 |
| Issue: | 6 |
| Start Page Number: | 697 |
| End Page Number: | 705 |
| Publication Date: | Dec 1988 |
| Journal: | Naval Research Logistics Quarterly |
| Authors: | Pelegrin B. |
| Keywords: | location |
This article is devoted to an MCDM problem connected with locational analysis. The MCDM problem can be formulated so as to minimize the distance between a facility and a given set of points. The efficient points of this problem are candidates for optimal solutions to many location problems. The paper proposes an algorithm to find all efficient points when distance is measured by any polyhedral norm.