One-Center Location With Block and Euclidean Distance.
A geometrical analysis is made of the dual simplex algorithm applied to a linear programming formulation of the one-center location problem in IR (2) using block distance. A geometric rule is given, and shown to be equivalent to the minimum ratio rule of the simplex algorithm, for updating the dual basis. The geometric analysis is applied to the Euclidean distance one-center problem and yields an alternative updating procedure for the dual algorithm.
Department of Mathematical Sciences, Clemson University, Clemson, SC 29634.
P M
PM
Dearing
Department of Mathematical Sciences, Clemson University, Clemson, SC 29634.
Phantipa
P
Thipwiwatpotjana
block distance; fundamental directions; linear program; one-center location problem; polar directions; polyhedral distance