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.

 
  • 摘要給出變量有上界的線(xiàn)性規劃問(wèn)題的對偶單純形算法,該算法包含了一般線(xiàn)性規劃問(wèn)題的對偶單純形算法,為解變量有上界的線(xiàn)性規劃問(wèn)題提供了又一種方法。
今日熱詞
目錄 附錄 查詞歷史
国内精品美女A∨在线播放xuan