An Application of Dynamic Programming to the Selection of Optimal Production Lengths Based on the Minimum Cutting Loss

최소절단손실(最小切斷損失)에 의한 최적생산(最適生産)길이의 선정(選定)에 대한 동적계획법응용(動的計劃法應用)

The assortment problem with deterministic demand has been formulated so that a dynamic programming can be applied to find optimal production lengths that will minimize the sum of cutting losses. The original minimization problem can be reformulated as the maximization problem with a different objective function. This problem can be solved by the dynamic programming technique. A numerical example illustrates this approach. The ratio of computation amount of emumeration method to that of this dynamic programming is approximately n to 1.