6533b86efe1ef96bd12cb245
RESEARCH PRODUCT
A primal-dual algorithm for the fermat-weber problem involving mixed gauges
O. LefebvreC. Michelotsubject
Set (abstract data type)Fermat's Last TheoremMathematical optimizationSimple (abstract algebra)General MathematicsNumerical analysisApplied mathematicsWeber problemFinite setSoftwareCounterexampleDual (category theory)Mathematicsdescription
We give a new algorithm for solving the Fermat-Weber location problem involving mixed gauges. This algorithm, which is derived from the partial inverse method developed by J.E. Spingarn, simultaneously generates two sequences globally converging to a primal and a dual solution respectively. In addition, the updating formulae are very simple; a stopping rule can be defined though the method is not dual feasible and the entire set of optimal locations can be obtained from the dual solution by making use of optimality conditions. When polyhedral gauges are used, we show that the algorithm terminates in a finite number of steps, provided that the set of optimal locations has nonepty interior and a counterexample to finite termination is given in a case where this property is violated. Finally, numerical results are reported and we discuss possible extensions of these results.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1987-10-01 | Mathematical Programming |