This paper founds a 0-1 integral programming model for science and technology project management prob-lem by applying mathematical programming method, researching the object function and constraint conditions, andgive...This paper founds a 0-1 integral programming model for science and technology project management prob-lem by applying mathematical programming method, researching the object function and constraint conditions, andgives a responsible polynomial approximation algorithm. The software package for decision support is developed, itcan availably solve the realistic problem of planning project.展开更多
集值折扣{0-1}背包问题(Discounted{0-1}Knapsack Problem with Setup,D{0-1}KPS)指在同一类别中可选择多个项,每个类别对目标函数和约束条件都增加了额外的固定设置成本。提出一种求解D{0-1}KPS的改进动态规划算法,算法针对D{0-1}KPS...集值折扣{0-1}背包问题(Discounted{0-1}Knapsack Problem with Setup,D{0-1}KPS)指在同一类别中可选择多个项,每个类别对目标函数和约束条件都增加了额外的固定设置成本。提出一种求解D{0-1}KPS的改进动态规划算法,算法针对D{0-1}KPS问题本身结构特征,融合多目标优化问题中非支配解集思想,通过利用状态之间的支配与非支配关系,对每个阶段的状态集进行剪枝,形成非支配状态集,从而提出改进动态规划算法。通过实例验证了该算法的有效性和可行性。展开更多
基金国家自然科学基金( the National Natural Science Foundation of China under Grant No.30570431)国家高技术研究发展计划( 863)( the National High-Tech Research and Development Plan of China under Grant No.2006AA01Z104)+4 种基金国家教育部新世纪人才支持计划( the New Century Excellent Talent Foundation from MOE of China under Grant No.NCET- 06- 555)安徽省优秀青年基金( No.06042088)安徽省教育厅自然科学( No.2006kj068A No.KJ2007B173)安徽省人才基金资助。
文摘This paper founds a 0-1 integral programming model for science and technology project management prob-lem by applying mathematical programming method, researching the object function and constraint conditions, andgives a responsible polynomial approximation algorithm. The software package for decision support is developed, itcan availably solve the realistic problem of planning project.
文摘集值折扣{0-1}背包问题(Discounted{0-1}Knapsack Problem with Setup,D{0-1}KPS)指在同一类别中可选择多个项,每个类别对目标函数和约束条件都增加了额外的固定设置成本。提出一种求解D{0-1}KPS的改进动态规划算法,算法针对D{0-1}KPS问题本身结构特征,融合多目标优化问题中非支配解集思想,通过利用状态之间的支配与非支配关系,对每个阶段的状态集进行剪枝,形成非支配状态集,从而提出改进动态规划算法。通过实例验证了该算法的有效性和可行性。
