×

A comparison of primal and dual methods of linear programming. (English) Zbl 0149.16601


PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[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). · JFM 39.0629.01
[2] Cheney, E. W., andA. A. Goldstein: Newton’s method for convex programming and Tchebycheff approximation. Numer. Math.1, 253–268 (1959). · Zbl 0113.10703 · doi:10.1007/BF01386389
[3] Dantzig, G. B.: Linear Programming and Extensions. Princeton, N. J.: Princeton Univ. Press 1963. · Zbl 0108.33103
[4] Davis, C.: Theory of positive linear dependence. Amer. J. Math.76, 733–746 (1954). · Zbl 0058.25201 · doi:10.2307/2372648
[5] Descloux, J.: Note on convex programming. J. Soc. Indust. Appl. Math.11, 737–747 (1963). · Zbl 0121.14606 · doi:10.1137/0111056
[6] Fieldhouse, M.: Some properties of simplex polytopes. Dittoed notes. Cambridge, Mass.: Harvard Univ. 1962.
[7] Gale, D.: Neighboring vertices on a convex polyhedron. Ann. of Math. Study no.38, pp. 255–263. Linear Inequalities and Related Systems. Princeton, N.J.: Princeton Univ. Press 1956. · Zbl 0072.37805
[8] —- Neighborly and cyclic polytopes. Proc. Symposia in Pure Math.7, 225–232. Convexity. Providence, R.I.: Amer. Math. Soc. 1963.
[9] —- On the number of faces of a convex polytope. Canad. J. Math.16, 12–17 (1964). · Zbl 0128.17103 · doi:10.4153/CJM-1964-002-x
[10] Grünbaum, B.: Convex Polytopes. New York: Wiley and Sons 1967. · Zbl 0163.16603
[11] Hadley, G.: Linear Programming. Reading, Mass.: Addison-Wesley 1962. · Zbl 0102.36304
[12] Klee, V.: On the number of vertices of a convex polytope. Canad. J. Math. 16, 701–720 (1964). · Zbl 0128.17201 · doi:10.4153/CJM-1964-067-6
[13] Kruskal, J. B.: The number of simplices in a complex. Mathematical Optimization Techniques 251–278. Berkely, Calif.: Univ. of California Press 1963. · Zbl 0116.35102
[14] Lemke, C. E.: The dual method of solving the linear programming problem. Naval Research Logistics Quarterly1, 48–54 (1954). · Zbl 0128.39605 · doi:10.1002/nav.3800010107
[15] Steinitz, E.: Polyeder und Raumeinteilungen. Enzyklopädie der mathematischen Wissenschaften,3, part1, second half, pp. 1–139. Leipzig: Teubner 1922.
[16] Wagner, H.W.: A practical guide to the dual theorem. Operations Research6, 364–384 (1958). · doi:10.1287/opre.6.3.364
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.