Optimization Allocation Research of Enterprise Resources Based on Dynamic Programming

Abstract:

Dynamic programming algorithm is classical strategy to solve the optimization problem. The distributing of enterprise resource is a multistage decision problem, having the characteristic of dynamic programming algorithm. We establish distribution of mathematical model of planning target, using dynamic programming principle and method to divide enterprise resource allocation stage reasonably, and then we use the recursion method to structure dynamic programming equation from the bottom up. Using VC++6.0 development platform is to compute the optimal decision-making sequence and maximum of profit. Dynamic programming makes optimum resource allocation for an enterprise, and it is high application value in resource allocation.

• Periodical: Applied Mechanics and Materials (Volumes 55-57)
• Pages: 2157-2162
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.55-57.2157
• Online since: May 2011
• Authors: Mei Zhang, Jing Hua Wen, Wei Xiao
• Keywords: Direction Recursion, Dynamic Programming, Optimization Scheme, Sequence of Decision

References

[1] Wang Yan, Li Yusheng, LengQiang. enterprise resource planning via dynamic planning model - taking enterprise with labour denseness as example, higher education and learning research, 6, 202-204(2007).

[2] E Bellman: Dynamic Programming, Princeton，NJ (1957).

[3] Lu Zhiwen, resource alignment algorithm based on dynamic planning, Fujian computer, 2 (2005).

[4] Fu Guofang, The application of linear Optimization model in enterprise management, Information of science and technology, 11(2006).

[5] Lv Guoying, Ren Ruizheng, Qian Yuhua. Design and analysis of algorithm, Qinghua University Company, 6(2010).