Stability of the feasible set in balanced transportation problems.

dc.contributor.author	Gómez y Estrada, Soraya
dc.contributor.author	Hernández Rebollar, Lidia Aurora
dc.contributor.author	Lancho Romero, Guillermo Arturo
dc.date.accessioned	2011-09-14T17:09:45Z
dc.date.available	2011-09-14T17:09:45Z
dc.date.issued	2011-09-14
dc.description.abstract	In this paper we study the stability of the feasible set of a balanced transportation problem. A transportation problem is balanced when the total supply is equal to the total demand. One can easily see that when we make minor adjustments to the data (supply and demand), the resulting problem may lose the property of balance. Therefore, although the transportation problem is a particular case of linear programming, you cannot apply the familiar results of stability. For a fixed number of origins and destinations we have obtained a vector representation for any feasible solution of the transportation problem. We have used this representation to prove that the feasible set mapping is continuous. We have also proved that the extreme point set mapping is lower semi continuous.1	spa
dc.identifier.uri	https://hdl.handle.net/10893/259
dc.language.iso	en	spa
dc.rights.accessrights	info:eu-repo/semantics/openAccess	spa
dc.subject	Transportation problem	spa
dc.subject	Stability	spa
dc.subject	Linear programming	spa
dc.title	Stability of the feasible set in balanced transportation problems.	spa
dc.type	Artículo de revista	spa
dspace.entity.type	Publication

Mostrando 1 - 1 de 1

Nombre:: Stability of the feasible set in balanced transportation problems.pdf
Tamaño:: 370.65 KB
Formato:: Adobe Portable Document Format

Mostrando 1 - 1 de 1