Construction and algebraic characterizations of a planar four-index transportation problem equivalent to a circularization network flow problem

Bulut H., Bulut S.

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, cilt.80, sa.11, ss.1373-1383, 2003 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 80 Sayı: 11
  • Basım Tarihi: 2003
  • Doi Numarası: 10.1080/00207160310001603325
  • Dergi Adı: INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1373-1383
  • Anahtar Kelimeler: transportation problem, planar four-index transportation problem, circularization network flow problem, generalized inverses, singular value decomposition, DECOMPOSITIONS, MATRIX
  • Dokuz Eylül Üniversitesi Adresli: Hayır

Özet

In this study, a circularization network flow problem with m + n + 2 nodes and (m + 1)(n + 1) arcs is described as a planar four-index transportation problem of order 1 x m x n x 1. Construction and several algebraic characterizations of the planar four-index transportation problem of order 1 x m x n x 1 are investigated using the generalized inverse and singular value decomposition of its coefficient matrix. The results are compared with some results we obtained on the transportation problem with m sources and n destinations. It is shown that these problems can be solved in terms of eigenvectors of the matrices J(m) and J(n), where J(m) is a m x m matrix whose entries are 1.