IPF allows one to find a matrix S, close to an input matrix T, but such that the row sums of S are R, and the column sums of S are C.Its useful in a range of tasks like traffic matrix problems, statistics for examining independence assumptions in contingency tables, etc. ...