Dynamic programming is a mathematical optimization technique in multistage decision approach. Programming indicates the sense of selecting an optimum allocations of available resources. Optimization solution is obtained in an orderly manner starting form one stage to the next level and is completed till the final stage is reached. The main object is to determine the optimum sub division of given variable in order to maximize the product of distinct n parts. Method applicable for finite number of stages, minimum path problems solution, Linear Programming problem using Dynamic programming, multiplicative separable return approaches, It simplifies the problems involving more than one constraint, multistage problems, Backward forward approach of Dynamic Programming in Production, Approach methods in Dynamic Programming Reliability.