Varignon Frame
   HOME

TheInfoList



OR:

The Varignon frame, named after
Pierre Varignon Pierre Varignon (1654 – 23 December 1722) was a French mathematician. He was educated at the Jesuit College and the University of Caen, where he received his M.A. in 1682. He took Holy Orders the following year. Varignon gained his first ex ...
, is a mechanical device which can be used to determine an optimal location of a warehouse for the destribution of goods to a set of shops. Optimal means that the sum of the ''weighted distances'' of the shops to the warehouse should be minimal. The frame consists of a board with n holes corresponding to the n shops at the locations \mathbf x_1, ...\mathbf x_n, n strings are tied together in a knot at one end, the loose ends are passed, one each, through the holes and are attached to weights below the board (see diagram). If the influence of friction and other odds of the real world are neglected, the knot will take a position of equilibrium \mathbf v. It can be shown (see below), that point \mathbf v is the optimal location which minimizes the weighted sum of distances :(1): \ D(\mathbf x)=\sum_^n m_i\, \mathbf x_i-\mathbf x\, . The optimization problem is called
Weber problem In geometry, the Weber problem, named after Alfred Weber, is one of the most famous problems in location theory. It requires finding a point in the plane that minimizes the sum of the transportation costs from this point to ''n'' destination point ...
.


Mechanical Problem - Optimization Problem

If the holes have locations \mathbf x_1, \dots, \mathbf x_n and the masses of the weights are m_1,...,m_n then the force acting at the i-th string has the magnitude m_i\cdot g (g=9.81 \text : constant of gravity) and direction \tfrac (unitvector). Summing up all forces and cancelling the common term g one gets the equation :(2):\ \mathbf F(\mathbf v)=\sum_^n m_i\frac=\mathbf 0. (At the point of ''equilibrium'' the sum of all forces is zero !) This is a
non-linear system In mathematics and science, a nonlinear system is a system in which the change of the output is not proportional to the change of the input. Nonlinear problems are of interest to engineers, biologists, physicists, mathematicians, and many other ...
for the coordinates of point \mathbf v which can be solved iteratively by the ''Weiszfeld-algorithm'' (see below) The connection between equation (1) and equation (2) is: :(3): \ \mathbf F(\mathbf x)= \nabla D(\mathbf x) = \begin \frac \\ \frac \end. Hence Function D has at point \mathbf v a local extremum and the Varignon frame provides the optimal location experimentally.


Example

For the following example the points are :\mathbf x_1=(0,0),\ \mathbf x_2=(40,0),\ \mathbf x_3=(50,40), :\mathbf x_4=(10,50),\ \mathbf x_5=(-10,30) and the weights :m_1=10,\; m_2=10,\; m_3=20,\; m_4=10,\; m_5=5. The coordinates of the optimal solution (red) are (32.5, 30.1) and the optimal weighted sum of lengths is L_\text = 1679. The second picture shows level curves which consist of points of equal but not optimal sums. Level curves can be used for assigning areas, where the weighted sums do not exceed a fixed level. Geometrically they are
implicit curve In mathematics, an implicit curve is a plane curve defined by an implicit equation relating two coordinate variables, commonly ''x'' and ''y''. For example, the unit circle is defined by the implicit equation x^2+y^2=1. In general, every implic ...
s with equations :\; D(\mathbf x)-c=0, \; c>L_\text\; (see equation (1)).


Special cases n=1 und n=2

* In case of n=1 one gets \mathbf v = \mathbf x_1. * In case of n=2 and m_2>m_1 one gets \mathbf v = \mathbf x_2. * In case of n=2 and m_2=m_1 point \mathbf v can be any point of the line section \overline (see diagram). In this case the level curves (points with the same ''not-optimal'' sum) are confocal ellipses with the points \mathbf x_1,\mathbf x_2 as common foci.


Weiszfeld-algorithm and a fixpoint problem

Replacing in formula (2) vector \mathbf v in the nominator by \mathbf v_ and in the denominator by \mathbf v_k and solving the equation for \mathbf v_ one gets: :(4):\quad \mathbf v_=\sum_^n \frac\big/ \sum_^n \frac which describes an iteration. A suitable starting point is the center of mass with mass m_i in point \mathbf x_i: :\mathbf v_0= \frac. This algorithm is called Weiszfeld-algorithm.see ''Facility location, p. 9 Formula (4) can be seen as the iteration formula for determining the fixed point of function :(5)\quad \mathbf G(\mathbf x)=\sum_^n \frac\big/ \sum_^n \frac with fixpoint equation :\quad \mathbf x= G(\mathbf x) (see fixed point) Remark on numerical problems:
The iteration algorithm described here may have numerical problems if point \mathbf v_k is close to one of the points \mathbf x_1,...\mathbf x_n.


See also

*
Fermat point In Euclidean geometry, the Fermat point of a triangle, also called the Torricelli point or Fermat–Torricelli point, is a point such that the sum of the three distances from each of the three vertices of the triangle to the point is the smallest ...
(case n=3, m_1=m_2=m_3=1) *
Varignon's theorem Varignon's theorem is a statement in Euclidean geometry, that deals with the construction of a particular parallelogram, the Varignon parallelogram, from an arbitrary quadrilateral (quadrangle). It is named after Pierre Varignon, whose proof was ...
*
geometric median In geometry, the geometric median of a discrete set of sample points in a Euclidean space is the point minimizing the sum of distances to the sample points. This generalizes the median, which has the property of minimizing the sum of distances ...


External links


MathePrisma Uni Wuppertal: Lösung eines Standort-Problems mit GeoGebra

The Frame of Varignon: Mathematical Treatment


References

* Uwe Götze: ''Risikomanagement'', Physica-Verlag HD, 2013, , S. 268 * Andrew Wood, Susan Roberts : ''Economic Geography'', Taylor & Francis, 2012, , p. 22 * H. A. Eiselt, Carl-Louis Sandblom :''Operations Research'', Springer Berlin Heidelberg, 2010, , p. 239 * Robert E. Kuenne: ''General Equilibrium Economics'', Palgrave Macmillan UK, 1992, {{ISBN, 9781349127528, p. 226 Cartography