The pivot and probe algorithm for solving a linear program-Reference-Cited by-同舟云学术

The pivot and probe algorithm for solving a linear program

Published:1984-06 Issue:2 Volume:29 Page:219-233
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Sethi Awanti P.,Thompson Gerald L.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02592222.pdf

Reference11 articles.

1. R.G. Bland, “New finite pivoting rules for the simplex method”,Mathematics of Operations Research 2 (1977) 103–107.

2. A. Charnes, “Optimality and degeneracy in linear programming”,Econometrica 3 (1952) 160–170.

3. G.B. Dantzig, A. Orden and P. Wolfe, “Notes on linear programming: Part I—The generalized simplex method for minimizing a linear form under linear inequality constraints”, RAND Corporation Research Memorandum, RM-1264, Santa Monica, CA, April 5, 1954, Published inPacific Journal of Mathematics 5 (1955) 183–195.

4. F.J. Gould, “Proximate linear programming: A variable extreme point method”,Mathematical Programming 3 (1972) 326–338.

5. A.H. Land and S. PowellFortran codes for mathematical programming, linear, quadratic and discrete (Wiley, London, 1973).

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bibliography;Linear Programming and Network Flows;2011-08-15

2. Algorithmic Game Theory;Lecture Notes in Economics and Mathematical Systems;2010

3. Greedy Basis Pursuit;IEEE Transactions on Signal Processing;2007-07

4. A computationally stable solution algorithm for linear programs;Applied Mathematics and Computation;2007-05

5. Computational results with a primal–dual subproblem simplex method;Operations Research Letters;1999-11