Article ID: | iaor1989367 |
Country: | Switzerland |
Volume: | 20 |
Start Page Number: | 141 |
End Page Number: | 157 |
Publication Date: | Aug 1989 |
Journal: | Annals of Operations Research |
Authors: | Cox Lawrence H., George John A. |
Keywords: | programming: transportation, transportation: general |
The problem of rounding in statistical tables to protect confidentiality is an important problem in the area of data publication, especially for official statistics. Controlled rounding involves rounding the table data to a prespecified base while ensuring additivity to totals. Previous research provided a formulation of the controlled rounding problem of a simple two-way table as a transportation problem. This paper extends that work to tables with subtotals by using a capacitated transshipment formulation. It is shown that some forms of tables with subtotals always have a controlled rounding solution. Other table structures cannot be guaranteed such a solution under ‘zero-restrictedness’. Initial computational experience suggests that the method is viable for use in practical situations.