A comparison of primal and dual methods of linear programming-Reference-Cited by-同舟云学术

A comparison of primal and dual methods of linear programming

Published:1966-12 Issue:3 Volume:9 Page:227-235
ISSN:0029-599X
Container-title:Numerische Mathematik
language:en
Short-container-title:Numer. Math.

Author:

Klee Victor

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics

Link

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

Reference16 articles.

1. Brückner, M.: Über die Ableitung der allgemeinen Polytope und die nach Isomorphismus verschiedenen Typen der allgemeinen Achtzelle (Oktatope). Verh. Nederl. Akad. Wetensch. Afd. Natuurk. Sect.I, part 10, 3–27 (1909).

2. Cheney, E. W., andA. A. Goldstein: Newton's method for convex programming and Tchebycheff approximation. Numer. Math.1, 253–268 (1959).

3. Dantzig, G. B.: Linear Programming and Extensions. Princeton, N. J.: Princeton Univ. Press 1963.

4. Davis, C.: Theory of positive linear dependence. Amer. J. Math.76, 733–746 (1954).

5. Descloux, J.: Note on convex programming. J. Soc. Indust. Appl. Math.11, 737–747 (1963).

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

1. Rigidity and the lower bound theorem 1;Inventiones Mathematicae;1987-02

2. A lower bound theorem for polytope pairs;Journal of Combinatorial Theory, Series A;1985-03

3. Bounding the Numbers of Faces of Polytope Pairs and Simple Polyhedra;North-Holland Mathematics Studies;1984

4. The Numbers of Faces of Polytope Pairs and Unbounded Polyhedra;European Journal of Combinatorics;1981-12

5. The Minimum Number of Faces of a Simple Polyhedron;European Journal of Combinatorics;1980-03