线性互补问题的一种混合整数线性规划解法  

A mixed integer linear programming method to linear complementary problem

作　　者：雍龙泉[1] 邓方安[1] 赵景服[1] 

机构地区：[1]陕西理工学院数学系,陕西汉中723001

出　　处：《陕西理工学院学报（自然科学版）》2007年第4期80-82,共3页Journal of Shananxi University of Technology:Natural Science Edition

基　　金：国家自然科学基金资助项目(70472072);陕西省中青年科技人才培养计划项目(04JK299);陕西理工学院科研基金资助项目(SLGQD0517SLGQD0627)

摘　　要：经典算法一般采用迭代过程求解线性互补问题,研究了线性互补问题的直接求解方法。把线性互补问题转化为一个混合整数线性规划,然后采用数学软件进行求解;数值实验结果表明,所给出的方法能够准确快速地求得原问题的最优解。Classical algorithms fof solving linear complementary problem are iteration method. A direct algorithm is investigated for linear complementary problem in this paper. First, linear complementary problem is transformed into a mixed Integer linear programming, By using mathematics software, the solution to the problem is obtained. The numerical experiment results demonstrate that the proposed algorithm can fast and effectively solve the problem, and this algorithm is an efficient method because of its easy maneuverability.

关 键 词：线性互补问题 混合整数线性规划 数学软件 

分 类 号：O221[理学—运筹学与控制论]