混合约束非线性规划问题的复合形算法  

An improved complex method algorithm for nonlinear programming problems with mixed constraints

作　　者：卢虎生[1] 周静 

机构地区：[1]内蒙古科技大学经济管理学院,内蒙古包头014010 [2]内蒙古科技大学材料与冶金学院,内蒙古包头014010

出　　处：《内蒙古科技大学学报》2007年第3期277-279,共3页Journal of Inner Mongolia University of Science and Technology

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

摘　　要：针对混合约束非线性规划问题,提出了一种改进的复合形方法,并给出了相应的算法步骤.应用此改进复合形法求解一典型算例,经过23次迭代达到了收敛条件,其结果与MATLAB计算得到的最优解误差为0.002%.An improved complex method was presented to solve the nonlinear programming problems of mixed constraints,with the corresponding algorithm and its procedure given.A representative illustration was computed by using the improved complex method,and the condition of convergence was satisfied after twenty-three times of iterative operations.The error is 0.002 percent between the results computed by this algorithm and the optimal solution computed by MATLAB.

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

分 类 号：TB112[理学—数学]