| Article ID: | iaor1988278 |
| Country: | Germany |
| Volume: | 19 |
| Start Page Number: | 485 |
| End Page Number: | 489 |
| Publication Date: | Dec 1988 |
| Journal: | Optimization |
| Authors: | Cieslik D. |
For a finite set of points in a Minkowski space a point has to be found such that the sum of the distances between this point and the points of the set is as small as possible. It is shown that a solution can be constructed by solving a linear programming problem, at least approximately.