Abstract
This note describes an efficient minimum information loss solution to the general multi-proportional updating problem. The method provides a robust algorithm which allows additional constraints on groups of elements on the interior of the matrix to be applied, and multi-regional economies to be adjusted simulteneously. A Lagrangian derivation of the scaling algorithm is presented, and the conditions for the existence, uniqueness and convergence of the iterative solutions are explained. The method overcomes restrictions on the bi-proportional method and its extensions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
