论文信息 - Duality Theory of Linear Programs: A Constructive Approach with Applications - 字舞流文

Duality Theory of Linear Programs: A Constructive Approach with Applications

A. W. Tucker | M. Balinski

[1] G. Dantzig,et al. Notes on Linear Programming: Part 1. The Generalized Simplex Method for Minimizing a Linear Form under Linear Inequality Restraints , 1954 .

[2] A. W. Tucker. Solving a Matrix Game by Linear Programming , 1960, IBM J. Res. Dev..

[3] R. Rockafellar. A Combinatorial Algorithm for Linear Programs in the General Mixed Form , 1964 .

[4] George B. Dantzig. Inductive Proof of the Simplex Method , 1960, IBM J. Res. Dev..

[5] A Charnes,et al. Constrained Games and Linear Programming. , 1953, Proceedings of the National Academy of Sciences of the United States of America.

[6] A. Charnes. Optimality and Degeneracy in Linear Programming , 1952 .

[7] E. Stiefel. Note on Jordan elimination, linear programming and Tchebycheff approximation , 1960 .

[8] O. H. Brownlee,et al. ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION , 1952 .

[9] C. E. Lemke,et al. The dual method of solving the linear programming problem , 1954 .

[10] P. Gordan. Ueber die Auflösung linearer Gleichungen mit reellen Coefficienten , 1873 .

[11] Th. Motzkin. Beiträge zur Theorie der linearen Ungleichungen , 1936 .

[12] Erich Stiemke. Über positive Lösungen homogener linearer Gleichungen , 1915 .