【摘要】 二次规划是非线形规划中非常重要的一类,对它的求解人们通常是利用K-T条件将其转化为线性规划来进行。但由于在转化成线性规划的过程中要引入人工变量,从而使求解过程变得复杂且不易操作。本文应用单纯形法的旋转迭代算法[4]求解二次规划,从而避免了以上困难,得到满意结果。更多还原

【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 difficulty and (obtain) satisfied results.更多还原