首页 | 本学科首页   官方微博 | 高级检索  
     

单纯形法的旋转迭代算法在二次规划中的应用
引用本文:郑小鸣,邹自德. 单纯形法的旋转迭代算法在二次规划中的应用[J]. 系统工程, 2005, 23(6): 123-125
作者姓名:郑小鸣  邹自德
作者单位:1. 湖南省社会科学院,系统所,湖南,长沙,410003
2. 广州市广播电视大学,广东,广州,510260
摘    要:二次规划是非线形规划中非常重要的一类,对它的求解人们通常是利用K—T条件将其转化为线性规划来进行。但由于在转化成线性规划的过程中要引入人工变量,从而使求解过程变得复杂且不易操作。本文应用单纯形法的旋转迭代算法求解二次规划,从而避免了以上困难,得到满意结果。

关 键 词:非线性规划 二次规划 kuhn—Tucker条件 单纯形法的旋转迭代算法
文章编号:1001-4098(2005)06-0123-03
收稿时间:2005-03-29
修稿时间:2005-03-29

An Application of Twiddle Iteration Algorithm of Simplex Method in Quadratic programming
ZHENG Xiao-ming,ZOU Zi-de. An Application of Twiddle Iteration Algorithm of Simplex Method in Quadratic programming[J]. Systems Engineering, 2005, 23(6): 123-125
Authors:ZHENG Xiao-ming  ZOU Zi-de
Abstract:Quadratic programming is a very important kind of nonlinear programming. Usually, we translate the quadratic programming problem into linear programming problem, and then solve it by using K-T condition. However, we need to introduce artificial variable during transforming, which make the procedure of solving complex and difficult to operation.The paper solve the quadratic programming by using twiddle iteration algorithm of simplex method, avoid above difficultyand obtain satisfied results.
Keywords:Nonlinear Programming   Quadratic Programming   Kuhn-Tucker Conditions   Twiddle Iteration Algorithm of Simplex Method
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号