求解线性规划的对偶算法  

The Dual Method to Solve Linear Programming

作　　者：韩伟一[1] HAN Weiyi(School of Economic and Management,Harbin Institute of Technology,Harbin 150001,China)

机构地区：[1]哈尔滨工业大学经济与管理学院,哈尔滨150001

出　　处：《大学数学》2023年第3期1-8,共8页College Mathematics

基　　金：国家自然科学基金资助项目(12171121);哈尔滨工业大学研究生教育改革项目(22HX0901)。

摘　　要：单纯形法一般采用行变换进行计算.本文给出了两种列变换的计算方法,一种与原始单纯形法等价,一种与对偶单纯形法等价,本文称之为对偶方法.这两种方法不引入松弛变量或剩余变量,计算规模小,有明显竞争优势.Simplex methods are generally based on row transformation.Two new simplex methods based on column transformation are proposed.It is proved theoretically that one method is equivalent to primal simplex method and the other is equivalent to dual simplex method.So they are called as dual method.Two methods don’t need to introduce slack variables and surplus variables,have a small computational scale and obvious competitive advantage..

关 键 词：线性规划 原始单纯形法 对偶单纯形法 对偶方法 对偶理论 

分 类 号：O221[理学—运筹学与控制论]