摘要
本文讨论变量有广义界线性规划问题借助标准形线性规划同单纯形法技术,建立问题的一个直接对偶单纯形法。分析了方法的性质,给出了初始对偶可行基的计算方法,并用实例说明方法的具体操作。
This paper discusses linear programming problems with generalized bounded variables. With the help of the technique of simplex method for standard constrained linear programming, a direct dual simplex method for the discussed problems is presented. Some properties of the proposed are analysed, and a method for computing a dual feasible basis of the discussed problem is given. Two examples are given to illustrate the iteration operations in details.
出处
《运筹与管理》
CSCD
2006年第1期18-24,共7页
Operations Research and Management Science
基金
国家自然科学基金资助项目(10261001)
广西科学基金(02360010249003)资助项目
关键词
变量有界
线性规划
对偶单纯形法
对偶可行基
对偶可行解
bounded variables
linear programming
dual simplex method
dual feasible basis
dual feasible solution
