Finding a Dual Feasible Solution to an LP with M Equalities in (l&M) Dual Iterations
收藏NBER1975-08-01 更新2025-01-04 收录
下载链接：
https://www.nber.org/papers/w0100
下载链接
链接失效反馈官方服务：
资源简介：
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
