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

变量有广义界线性规划的叠累单纯形法
引用本文:梁远信. 变量有广义界线性规划的叠累单纯形法[J]. 经济数学, 2001, 18(2): 79-87
作者姓名:梁远信
作者单位:广西经济管理干部学院,基础课部,南宁,530007
摘    要:本文建立变量有广义界线性规划一个新的转轴算法,称之为叠累单纯形算法,新算法其有三个主要特征:1对于检验数为“坏”的非基变量 xs,进行一轮子转轴运算,使得xs进基,转轴中具有“好”的检验数的变量始终保持“好”的检验数;2x.进基的子转轴所产生的基既不是原始可行基,也不是对偶可行基,但子转轴结束时产生的基是原始可行的;3目标函数值在整个转抽运算中是单调下降,从而算法可有限步终止.

关 键 词:广义界  线性规划  叠累单纯形法
修稿时间:2001-02-09

A MONOTONIC BUILD-UP SIMPLEX ALGORITHM FOR LINEAR PROGRAMMING WITH GENERALIZED BOUNDED VARIABLES
Liang Yuan-xin. A MONOTONIC BUILD-UP SIMPLEX ALGORITHM FOR LINEAR PROGRAMMING WITH GENERALIZED BOUNDED VARIABLES[J]. Mathematics in Economics, 2001, 18(2): 79-87
Authors:Liang Yuan-xin
Abstract:in this paper,a new pivoting algorithm for solving linear programming with generalized bounded variables is presented,it is called a monotonic build-up simplex algorithm. This new algorithm possesses three main properties :I For a nonbasic variable xs with"bad" reduced cost,the new algorithm produees a sequence of pivoting operation such that xs enters the basis, moreover, all variables with"good"reduced costs remain good reduced costs throughout the pivoting process; 2. The bases generated by the sequence of pivoting operation making Xs enter the basis are neither primal feasible nor dual feasible,but once xs enters the basis, the related basis returns to primal feasible; 3. The objective value is decreasing throughout the pivoting operation,hence the algorithm terminates in a finite number of pivots.
Keywords:Generalized bounded variables .linear programming  monotonic build-up simplex algorithm.  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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