Dynamic programming and penalty functions (Q749459)

The authors modify the augmentable method for the solution of optimization problems with constraints by using penalty functions in association with the dynamic programming technique and demonstrate that the dynamic programming technique can play an effective role in the method of penalty functions. They then manipulate optimization problems with one or several constraints related to three basic inequalities - the arithmetic-geometric inequality, the Hölder inequality, and the Minkowski inequality - as models to illustrate their findings.