变量有上界的线性规划的对偶单纯形方法

变量有上界的线性规划的对偶单纯形方法

黄庆道, 吕显瑞, 王国明

吉林大学数学科学学院, 长春 130012

收稿日期:2001-06-13 修回日期:1900-01-01 出版日期:2002-01-26 发布日期:2002-01-26
通讯作者: 黄庆道

Dual Simplex Method of Linear Programmingwith Bounded Variabl

HUANG Qing-dao, LAKU Xian-rui, WANG Guo-ming

College of Mathematics, Jilin University, Changchun 130012, P.R.China

Received:2001-06-13 Revised:1900-01-01 Online:2002-01-26 Published:2002-01-26
Contact: HUANG Qing-dao

摘要/Abstract

摘要： 给出变量有上界的线性规划问题的对偶单纯形算法, 该算法包含了一般线性规划问题的对偶单纯形算法, 为解变量有上界的线性规划问题提供了又一种方法.

关键词: 变量有上界的线性规划, 对偶单纯形方法, 正则解

Abstract: In this paper a dual simplex method for linear programming with bounded variables was given, which generalizes and extends the classic dual simplex method for a general linear programming.

Key words: linear programming with bounded variables, dual simplex method, regular solutions

中图分类号:

O221.1

黄庆道, 吕显瑞, 王国明. 变量有上界的线性规划的对偶单纯形方法[J]. J4, 2002, 40(01): 44-47.

HUANG Qing-dao, LAKU Xian-rui, WANG Guo-ming. Dual Simplex Method of Linear Programmingwith Bounded Variabl[J]. J4, 2002, 40(01): 44-47.