In this work we investigate multipartition models, the subset of log-linear models for which one can perform the classical iterative proportional scaling (IPS) algorithm to numerically compute the maximum likelihood estimate (MLE). Multipartition models include families of models such as hierarchical models and balanced, stratified staged trees. We define a sufficient condition, called the Generalized Running Intersection Property (GRIP), on the matrix representation of a multipartition model under which the classical IPS algorithm produces the exact MLE in one cycle. In this case, the MLE is a rational function of the data. Additionally we connect the GRIP to the toric fiber product and to previous results for hierarchical models and balanced, stratified staged trees. This leads to a characterization of balanced, stratified staged trees in terms of the GRIP.