Calculus of Variations, Maximum Principle, and Dynamic Programming for Supply Chain Optimal Control
摘要
This chapter explains how supply chain dynamic optimization is an optimal control problem and presents the general mathematical model. Then, it describes the calculus of variations, the maximum principle, and dynamic programming. The necessary and sufficient optimization conditions for each of them and the transversality conditions for the free horizon are deduced. Furthermore, the theory of stochastic processes is reviewed to formulate the stochastic optimal control problem and its optimality conditions through Itô’s lemma and dynamic programming. Finally, an illustrative production planning example in free horizon using the three optimal control tools is solved for both the deterministic and stochastic cases. It should be noted that this chapter does not constitute a comprehensive review of optimal control theory applied to supply chain issues. It focuses solely on their mathematical foundations and their direct application to a basic production-inventory problem. However, references to more advanced studies on the subject are provided for the interested reader.