A partitioning algorithm based on Benders's method1is described. This algorithm makes possible the solution of a large problem in a limited computer memory. The special properties of the partial problems of the partitioned problem are exploited to reduce further memory requirements and computation time. This method has been implemented on the SEL 32/55 computer of the UNERG at Charleroi in Belgium.