Updating an Input-Output Matrix with Sign-preservation: Some Improved Objective Functions and their Solutions
This paper presents an easy-to-use method for updating input-output (IO) matrices with sign-preservation by combining Lagrangian multipliers and penalty functions. Biproportional methods such as the representative RAS are very simple and popular because a target matrix can be obtained simply by iterative computation. However, they cannot reasonably deal with matrices that include negative entries. Although a generalized version, GRAS, can do so, its objective function is questionable. In contrast, some non-biproportional methods such as those that take weighted or unweighted squared differences between the target and original matrix as objective functions can deal with negative entries, but it is difficult to guarantee the signs of entries. In this study, GRAS and some conventional objective functions were improved and their solutions for preserving the signs of entries are presented. Comparisons of applying these objective functions to a simple example show that both the Improved Normalized Squared Differences (INSD) function and the Improved GRAS (IGRAS) function yield a good target matrix and are close to each other; we suggest that INSD or IGRAS be used for updating IO transaction matrices in practice.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 20 (2008)
Issue (Month): 1 ()
|Contact details of provider:|| Web page: http://www.tandfonline.com/CESR20|
|Order Information:||Web: http://www.tandfonline.com/pricing/journal/CESR20|
When requesting a correction, please mention this item's handle: RePEc:taf:ecsysr:v:20:y:2008:i:1:p:111-123. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Michael McNulty)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.