Use of Lagrangian decomposition in supply chain planning

Citations of this article
Mendeley users who have this article in their library.


The integrated planning of transportation of raw material, production and distribution of products of the supply chain for a large pulp company is studied. The planning period is one year and a number of time periods are considered. The tactical decisions included in the model regard transportation of raw materials from harvest areas to pulp mills, production mix and contents at pulp mills, distribution of pulp products from mills to customers either via terminals or directly, and the selection of potential orders and their levels at customers. A mixed integer linear programming model for the supply chain problem is developed. The main solution method in this paper is a Lagrangian heuristic method based on Lagrangian decomposition. The heuristic divides the problem into two subproblems representing different physical stages in the supply chain, each including several time periods. The advantage of the proposed solution approach is that it generates feasible solutions of high quality in short time. A number of cases based on real data is analysed. © 2011 Elsevier Ltd.




Lidestam, H., & Rönnqvist, M. (2011). Use of Lagrangian decomposition in supply chain planning. Mathematical and Computer Modelling, 54(9–10), 2428–2442.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free