dc.contributor.author |
Labbiento, Julianne M. |
|
dc.contributor.other |
Youngstown State University. Department of Mathematics. |
|
dc.date.accessioned |
2021-04-26T15:58:47Z |
|
dc.date.available |
2021-04-26T15:58:47Z |
|
dc.date.issued |
1994 |
|
dc.identifier.other |
B1672463x |
|
dc.identifier.uri |
https://jupiter.ysu.edu:443/record=b1672463 |
|
dc.identifier.uri |
http://hdl.handle.net/1989/16213 |
|
dc.description |
41 leaves: bibl., appendix |
en_US |
dc.description.abstract |
The classical matrix balancing problem has many applications in areas such as economics and statistics. Generally, solutions to instances of this problem are found by minimizing either a squared or entropy objective function. This paper introduces a new procedure for solving the problem derived from a weighted least absolute value objective function.
An efficient algorithm, incorporating the ideas of piecewise linear programming with the traditional transportation algorithm, is developed and presented. A simple example is illustrated and a computer program, written in FORTRAN, is given. Finally, special features of the program are discussed. |
en_US |
dc.description.sponsorship |
Youngstown State University. Department of Mathematics. |
en_US |
dc.language.iso |
en_US |
en_US |
dc.relation.ispartofseries |
Master's Theses;no. 0495 |
|
dc.title |
Solving the matrix balancing problem An algorithm based on a modification of the transportation problem |
en_US |
dc.type |
Thesis |
en_US |