改进的复合形算法在产品组合优化中的应用  

Application of Improved Complex Algorithm in Product Combination Optimization

作　　者：周静[1] 卢虎生[2] 陈鹏[1] 

机构地区：[1]山东服装职业技术学院信息工程系,山东泰安271000 [2]内蒙古科技大学经济管理学院,内蒙古包头014010

出　　处：《计算机与现代化》2009年第2期67-70,共4页Computer and Modernization

基　　金：国家自然科学基金资助项目(70662002)

摘　　要：针对混合约束非线性规划问题,本文提出了一种改进的复合形方法,并给出了相应的算法步骤。应用此改进复合形法求解一典型算例,经过23次迭代达到了收敛条件,其结果与MATLAB计算得到的最优解误差为0.002%,并应用于求解一产品组合边际贡献模型,其结果与MATLAB计算结果相近。An improved complex method is presented to solve the nonlinear programming problems with mixed constraints, and corresponding algorithm and its procedure are also given. A representative illustration is computed by the improved complex method, and the condition of convergence is satisfied after twenty-three times of iterative operation. The error between the results computed by this algorithm and the optimal solution computed by MATLAB is 0.002 percent. And a contribution margin model of product combination is computed by the improved complex method, too, the result computed by this algorithm is similar to the result computed by MATLAB.

关 键 词：混合约束 非线性规划 最优化 复合形法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]