Dynamic programming using the Fritz–John conditions

This paper presents a new method for action elimination in deterministic dynamic programming problems. It uses the Fritz–John conditions. When this action elimination is applied, the complexity of dynamic programming in many examples is reduced by at least one order of magnitude. Gaslift problems in oil production optimization are an example for a class of problems which can be solved using this new method.