Related Experiment Video
Updated: Mar 19, 2026

A Finite Element Approach for Locating the Center of Resistance of Maxillary Teeth
Published on: April 8, 2020
One-Center Location With Block and Euclidean Distance
P M Dearing1, Phantipa Thipwiwatpotjana1
1Department of Mathematical Sciences, Clemson University, Clemson, SC 29634.
Abstract:
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.
Related Concept Videos
The Distance Formula
The Midpoint Formula
Distance Problem
Design Example: Measuring Distance Between Two Points with Obstructions
Circles
Lattice Centering and Coordination Number
Types of Unit Cells
Imagine taking a large number of identical...

