|
Diskretnyi Analiz i Issledovanie Operatsii, 2008, Volume 15, Issue 6, Pages 58–62
(Mi da557)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Dynamic programming on Pareto sets
V. I. Struchenkov Moscow State Institute of Radio-Engineering, Electronics and Automation (Technical University)
Abstract:
The problem of optimal distribution of a resource is considered. A dynamic programming scheme is proposed. Instead of recurrent equations, stepwise computation of Pareto-optimal points is used on the plane of values of the goal function and resource. Practical realization demonstrates efficiency of this approach. Bibl. 2.
Keywords:
dynamic programming, Pareto set.
Received: 27.05.2008 Revised: 23.09.2008
Citation:
V. I. Struchenkov, “Dynamic programming on Pareto sets”, Diskretn. Anal. Issled. Oper., 15:6 (2008), 58–62; J. Appl. Industr. Math., 4:3 (2010), 428–430
Linking options:
https://www.mathnet.ru/eng/da557 https://www.mathnet.ru/eng/da/v15/i6/p58
|
Statistics & downloads: |
Abstract page: | 987 | Full-text PDF : | 347 | References: | 76 | First page: | 12 |
|