一种线性不等式组的矩阵变换定解方法  

A Matrix Column-Transform Solution-Decision Method for the System of Linear Inequalities

作　　者：刘道建[1,2] 黄天民[1] 

机构地区：[1]西南交通大学电气工程学院,成都610031 [2]湖南科技大学数学与计算科学学院,湖南湘潭411201

出　　处：《上海交通大学学报》2012年第10期1701-1706,共6页Journal of Shanghai Jiaotong University

摘　　要：通过构造一种关于线性不等式组的特殊矩阵——强迫性极点转移矩阵,以及定义一种特殊的矩阵运算——负旋转迭代运算,为解决不等式组的定解问题建立了一个崭新的数学平台,该平台较好地结合与反映了不等式组的线性与几何平面两面性特点,而且以该数学平台为基础提出了一种全新的不等式组定解方法.新定解方法将不等式组的定解过程转化成一系列矩阵初等列变换,定解操作简单快捷,结构化程度高,易程序化处理,便于在计算机上实现.此外,为了解决退化极点的转移问题,提出了单纯形局部ε(小量正参数)正则化方法,有效消除了退化现象对极点转移过程的不利影响.With a view to more efficiently solving system of linear inequalities,a special matrix,imposed basis-point transition matrix,was given together with a special negative pivoting iteration operation,by which it can be better displayed that system of linear inequalities has both linear feature and geometric-plane feature.Moreover,based on the above platform,a new solution-decision method for system of linear inequalities was proposed.With the help of this new method,the solution-decision process of system of linear inequalities can be changed into a series of elementary column transformations of matrixes.So,this method not only works fast and simply but also can be more easily translated into programs and more efficiently accomplished on computers.In addition,a simplex locally ε regularized method was proposed so as to overcome the bad effect coming from vertex degeneration,to the vertex transition iteration processes.

关 键 词：线性不等式组 强迫性极点转移矩阵 负旋转迭代 局部ε正则化 定解问题 

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