Finding a Dual Feasible Solution to an LP with M Equalities in (l&M) Dual Iterations
收藏数据链接：
官方服务：
资源简介：
Lemke's dual-simplex method of linear programming is usually considered inferior to the primal simplex method for any general linear programming problems. One reason given is the difficulty of finding a starting dual-feasible basis. In this paper, a new starting technique is presented, which finds a
提供机构：
美国国家经济研究局创建时间：
1975-08-01
