Article ID: | iaor19932418 |
Country: | United Kingdom |
Volume: | 16 |
Start Page Number: | 53 |
End Page Number: | 65 |
Publication Date: | Nov 1992 |
Journal: | Mathematical and Computer Modelling |
Authors: | Nagurney Anna, Robinson Alan G. |
Keywords: | programming: quadratic |
In this paper the authors propose two algorithms for the quadratic constrained matrix problem-the problem of computing the best possible estimate of an unknown matrix with known bounds on individual entries, known row and column totals, and known weight totals of subsets of individual entries. The problem has been widely studied since it frequently appears as a ‘core’ problem in a variety of application areas. To date, the diagonal case of this problem has received the majority of attention from researchers; here the authors focus primarily on the solution of problems with