Share This Article:

Combined Algorithms of Optimal Resource Allocation

Full-Text HTML Download Download as PDF (Size:238KB) PP. 78-85
DOI: 10.4236/am.2012.31013    4,044 Downloads   6,685 Views Citations


Under study is the problem of optimum allocation of a resource. The following is proposed: the algorithm of dynamic programming in which on each step we only use the set of Pareto-optimal points, from which unpromising points are in addition excluded. For this purpose, initial approximations and bilateral prognostic evaluations of optimum are used. These evaluations are obtained by the method of branch and bound. A new algorithm “descent-ascent” is proposed to find upper and lower limits of the optimum. It repeatedly allows to increase the efficiency of the algorithm in the comparison with the well known methods. The results of calculations are included.

Cite this paper

V. Struchenkov, "Combined Algorithms of Optimal Resource Allocation," Applied Mathematics, Vol. 3 No. 1, 2012, pp. 78-85. doi: 10.4236/am.2012.31013.

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.