Further results on the algebraic characterizations of a minimum cost network flow problem equivalent to the transportation problem.

Autor:	özel, Mustafa1 (AUTHOR) mustafa.ozel@deu.edu.tr, Şafak, Süleyman1 (AUTHOR), Bulut, Hamza1 (AUTHOR)
Předmět:	Matrices (Mathematics) Eigenvectors Vector spaces Algebra Numerical analysis Mathematical models
Zdroj:	International Journal of Computer Mathematics. May2005, Vol. 82 Issue 5, p609-616. 8p.
Abstrakt:	In this study a minimum cost network flow problem with m + n +2 nodes and mn arcs, which is equivalent to the transportation problem with m sources and n destinations, is described as an axial four-index transportation problem of order 1× m × n ×1. Several algebraic characterizations of this problem of order 1× m × n ×1 are investigated using the singular value decomposition and generalized inverses of its coefficient matrix. The results are compared with some results on the planar four-index transportation problem. It is shown that these problems have common algebraic characterizations and can be solved in terms of eigenvectors of the matrices J m and J n where J m is an m × m matrix, all of whose entries are 1. [ABSTRACT FROM AUTHOR]
Databáze:	Library, Information Science & Technology Abstracts
Externí odkaz:	Zobrazit plný text záznamu Plný text ve formátu HTML
Nepřihlášeným uživatelům se plný text nezobrazuje	K zobrazení výsledku je třeba se přihlásit.