J4

Previous Articles     Next Articles

Dual Simplex Method of Linear Programmingwith Bounded Variabl

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

  1. 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: 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

CLC Number: 

  • O221.1