Location and shape of a rectangular facility in ℝn. Convexity properties. Convexity properties

In this paper we address a generalization of the Weber problem, in which we seek for the center and the shape of a rectangle (the facility) minimizing the average distance to a given set (the demand-set) which is not assumed to be finite. Some theoretical properties of the average distance are studi...

Descripción completa

Detalles Bibliográficos
Autores: Carrizosa Priego, Emilio José, Muñoz Márquez, Manuel, Puerto Albandoz, Justo
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:1998
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/107727
Acceso en línea:https://hdl.handle.net/11441/107727
https://doi.org/10.1007/BF02680563
Access Level:acceso abierto
Palabra clave:Regional location
Facilities
Average distance
id ES_4635556cbf2f29d72aa06b920f17f86e
oai_identifier_str oai:idus.us.es:11441/107727
network_acronym_str ES
network_name_str España
repository_id_str
spelling Location and shape of a rectangular facility in ℝn. Convexity properties. Convexity propertiesCarrizosa Priego, Emilio JoséMuñoz Márquez, ManuelPuerto Albandoz, JustoRegional locationFacilitiesAverage distanceIn this paper we address a generalization of the Weber problem, in which we seek for the center and the shape of a rectangle (the facility) minimizing the average distance to a given set (the demand-set) which is not assumed to be finite. Some theoretical properties of the average distance are studied, and an expression for its gradient, involving solely expected distances to rectangles, is obtained. This enables the resolution of the problem by standard optimization techniques.SpringerEstadística e Investigación OperativaFQM329: Optimización1998info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/107727https://doi.org/10.1007/BF02680563reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésMathematical Programming, 83 (2), 277-290.http://doi.org/10.1007/BF02680563info:eu-repo/semantics/openAccessoai:idus.us.es:11441/1077272026-06-17T12:51:07Z
dc.title.none.fl_str_mv Location and shape of a rectangular facility in ℝn. Convexity properties. Convexity properties
title Location and shape of a rectangular facility in ℝn. Convexity properties. Convexity properties
spellingShingle Location and shape of a rectangular facility in ℝn. Convexity properties. Convexity properties
Carrizosa Priego, Emilio José
Regional location
Facilities
Average distance
title_short Location and shape of a rectangular facility in ℝn. Convexity properties. Convexity properties
title_full Location and shape of a rectangular facility in ℝn. Convexity properties. Convexity properties
title_fullStr Location and shape of a rectangular facility in ℝn. Convexity properties. Convexity properties
title_full_unstemmed Location and shape of a rectangular facility in ℝn. Convexity properties. Convexity properties
title_sort Location and shape of a rectangular facility in ℝn. Convexity properties. Convexity properties
dc.creator.none.fl_str_mv Carrizosa Priego, Emilio José
Muñoz Márquez, Manuel
Puerto Albandoz, Justo
author Carrizosa Priego, Emilio José
author_facet Carrizosa Priego, Emilio José
Muñoz Márquez, Manuel
Puerto Albandoz, Justo
author_role author
author2 Muñoz Márquez, Manuel
Puerto Albandoz, Justo
author2_role author
author
dc.contributor.none.fl_str_mv Estadística e Investigación Operativa
FQM329: Optimización
dc.subject.none.fl_str_mv Regional location
Facilities
Average distance
topic Regional location
Facilities
Average distance
description In this paper we address a generalization of the Weber problem, in which we seek for the center and the shape of a rectangle (the facility) minimizing the average distance to a given set (the demand-set) which is not assumed to be finite. Some theoretical properties of the average distance are studied, and an expression for its gradient, involving solely expected distances to rectangles, is obtained. This enables the resolution of the problem by standard optimization techniques.
publishDate 1998
dc.date.none.fl_str_mv 1998
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/107727
https://doi.org/10.1007/BF02680563
url https://hdl.handle.net/11441/107727
https://doi.org/10.1007/BF02680563
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Mathematical Programming, 83 (2), 277-290.
http://doi.org/10.1007/BF02680563
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869407212871352320
score 15,300719

Similares en LA Referencia