Learn More
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(More)
  • 1