Abstract
This paper studies the application of linear programming to the class of production planning problems which maximise profit subject to constraints on interacting production processes which can be represented by a static Leontief model. The method partitions the matrices involved in the solution process which enables the matrices involved in the computational process to become smaller at each iteration. Preliminary computational results show that the partitioning technique is quite efficient in solving such problems and should prove to be very effective on large-scale problems.