In this paper we propose an MILP model to address the optimization of the tactical planning for the Fast Moving Consumer Goods (FMCG) industry. This model is demonstrated for a case containing 10 Stock-Keeping Units (SKUs), but is intractable for realistically sized problems. Therefore, we propose a decomposition based on single-SKU submodels. To account for the interaction between SKUs, slack variables are introduced into the capacity constraints. In an iterative procedure the cost of violating the capacity is slowly increased, and eventually a feasible solution is obtained. Even for the relatively small 10-SKU case, the required CPU time could be reduced from 1144 s to 175 s using the algorithm. Moreover, the algorithm was used to optimize cases of up to 1000 SKUs, whereas the full model is intractable for cases of 25 or more SKUs. The solutions obtained with the algorithm are typically within a few percent of the global optimum. (C) 2013 Elsevier Ltd. All rights reserved.