两端固定资源连续分配问题的一种算法  

An Approach for Solving the Problem of Resources Continuous Allocation with Fixed Two Ends

作　　者：赵禹骅[1] 顾国维[1] 李可柏[2] 周小庄[3] 任伟民[3] 

机构地区：[1]同济大学环境科学与工程学院,上海200092 [2]东南大学经济管理学院,南京210096 [3]同济大学经济与管理学院,上海200092

出　　处：《运筹学学报》2006年第2期86-92,共7页Operations Research Transactions

摘　　要：用动态规划可解一端固定,一端自由的资源连续分配问题,对两端固定的此类问题,动态规划解法过程复杂．针对目标函数及约柬条件均为线性函数的此类问题,给出一个简化的一般算法及相应算例,本算法极大简化了计算的复杂性．The problem of resources continuous allocation with fixed one end and free the other can be solved by dynamic program. The process is complicate to solve it with fixed two ends by dynamic program. To solve this kind of problem which both objective and constraint functions are all lineal, a simplified algorithm was proposed, and an illustrative example was presented. The complexity of calculation was simplified by the algorithm.

关 键 词：运筹学 资源分配 动态规划 算法 

分 类 号：O224[理学—运筹学与控制论] TP301.6[理学—数学]