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...

Descripción completa

Detalles Bibliográficos
Autores principales: Dearing, P. M., Thipwiwatpotjana, Phantipa
Formato: Online Artículo Texto
Lenguaje:English
Publicado: [Gaithersburg, MD] : U.S. Dept. of Commerce, National Institute of Standards and Technology 2006
Materias:
Article
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
_version_ 1782403167991889920
author Dearing, P. M.
Thipwiwatpotjana, Phantipa
author_facet Dearing, P. M.
Thipwiwatpotjana, Phantipa
author_sort Dearing, P. M.
collection PubMed
description 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.
format Online
Article
Text
id pubmed-4662497
institution National Center for Biotechnology Information
language English
publishDate 2006
publisher [Gaithersburg, MD] : U.S. Dept. of Commerce, National Institute of Standards and Technology
record_format MEDLINE/PubMed
spelling pubmed-46624972016-06-03 One-Center Location With Block and Euclidean Distance Dearing, P. M. Thipwiwatpotjana, Phantipa J Res Natl Inst Stand Technol Article 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. [Gaithersburg, MD] : U.S. Dept. of Commerce, National Institute of Standards and Technology 2006 2006-04-01 /pmc/articles/PMC4662497/ /pubmed/27274919 http://dx.doi.org/10.6028/jres.111.007 Text en https://creativecommons.org/publicdomain/zero/1.0/ The Journal of Research of the National Institute of Standards and Technology is a publication of the U.S. Government. The papers are in the public domain and are not subject to copyright in the United States. Articles from J Res may contain photographs or illustrations copyrighted by other commercial organizations or individuals that may not be used without obtaining prior approval from the holder of the copyright.
spellingShingle Article
Dearing, P. M.
Thipwiwatpotjana, Phantipa
One-Center Location With Block and Euclidean Distance
title One-Center Location With Block and Euclidean Distance
title_full One-Center Location With Block and Euclidean Distance
title_fullStr One-Center Location With Block and Euclidean Distance
title_full_unstemmed One-Center Location With Block and Euclidean Distance
title_short One-Center Location With Block and Euclidean Distance
title_sort one-center location with block and euclidean distance
topic Article
url 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
work_keys_str_mv AT dearingpm onecenterlocationwithblockandeuclideandistance
AT thipwiwatpotjanaphantipa onecenterlocationwithblockandeuclideandistance

Ejemplares similares