Problems of Dynamic Linear Programming
暂无分享,去创建一个
Dynamic linear programming (DLP) can be considered as a new stage of linear programming (LP) development. Nowadays it becomes difficult, maybe even impossible, to make decisions in large systems and not take into account the consequences of the decision over a long-range period. Thus, almost all problems of optimal decision making become dynamic, multi-stage ones. New problems require new approaches. With DLP it is difficult to exploit only LP ideas and methods: even having ,found the optimal program, we often do not know how to use it. This paper represents in some sense the statement of the problem; although it contains a brief survey of DLP, it is focused on the things to be done, rather than on those already being tackled.
[1] G. Dantzig,et al. THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .
[2] George B Dantzig. Formulating a Pilot Model for Energy in Relation to the National Economy , 1975 .
[3] R. Rockafellar. The multiplier method of Hestenes and Powell applied to convex programming , 1973 .
[4] Alan S. Manne,et al. Nested decomposition for dynamic models , 1974, Math. Program..
[5] L. Kantorovich. The best use of economic resources , 1967 .