A class of problems solved byProgrammingdynamic dynamic programming (DP) methods represents another specific branch of optimization dealing withConstraintsinequality inequality constraintsConstraint. The reign of DP covers a wide range of problems and techniques; however, the solution to the problems expressed by a generally non-linearFunctionnon-linear (separable) objective functionFunctionnon-linearseparable with a linear constraint in the form of inequalities will only be introduced in this chapter. Hence, it constitutes a more general task than the LPProgramminglinear problem.