Cargando…
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 b...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
[Gaithersburg, MD] : U.S. Dept. of Commerce, National Institute of Standards and Technology
2006
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4662497/ https://www.ncbi.nlm.nih.gov/pubmed/27274919 http://dx.doi.org/10.6028/jres.111.007 |