| Article ID: | iaor1993423 |
| Country: | Netherlands |
| Volume: | 51 |
| Issue: | 1 |
| Start Page Number: | 24 |
| End Page Number: | 34 |
| Publication Date: | Mar 1991 |
| Journal: | European Journal of Operational Research |
| Authors: | Sharma R.R.K. |
| Keywords: | location, programming: integer |
The fertiliser production-distribution problem is formulated as a mixed zero-one integer linear programming problem. The distinguishing features of the problem are described. Benders’ decomposition is used as a solution procedure. Two Lagrangean relaxation procedures are developed to solve the primal problem, one of them converging at a much faster rate. The computational performance and the implementation details of the solution are discussed.