On pricing and backward transformation in linear programming-Reference-Cited by-同舟云学术

On pricing and backward transformation in linear programming

Published:1974-12 Issue:1 Volume:6 Page:42-47
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Tomlin J. A.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference7 articles.

1. E.M.L. Beale,Mathematical programming in practice (Pitmans, London, 1968).

2. J. de Buchet, “How to take into account the low density of matrices to design a mathematical programming package”, in:Large sparse sets of linear equations Ed. J.K. Reid (Academic Press, London, 1971) pp. 211–217.

3. G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, N.J., 1963).

4. J.J.H. Forrest and J.A. Tomlin, “Updating triangular factors of the basis to maintain sparsity in the product form simplex method”Mathematical Programming 2 (1972) 263–278.

5. P.M.J. Harris, “Pivot selection methods of the devex LP code”,Mathematical Programming 5 (1973) 1–28.

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

1. Novel update techniques for the revised simplex method;Computational Optimization and Applications;2014-08-23

2. Methods for convex and general quadratic programming;Mathematical Programming Computation;2014-08-21

3. Optimal Decisions from Probabilistic Models: The Intersection-over-Union Case;2014 IEEE Conference on Computer Vision and Pattern Recognition;2014-06

4. Interior-Point Method;Linear Programming Computation;2013-10-10

5. Decomposition Method;Linear Programming Computation;2013-10-10