The theory of linear programming:skew symmetric self-dual problems and the central path *
暂无分享,去创建一个
[1] J. Neumann,et al. Theory of games and economic behavior , 1945, 100 Years of Math Milestones.
[2] A. J. Goldman,et al. 4. Theory of Linear Programming , 1957 .
[3] A. Tucker. 1 . Dual Systems of Homogeneous Linear Relations , 1957 .
[4] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[5] Elmer Earl. Branstetter,et al. The theory of linear programming , 1963 .
[6] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .
[7] A. W. Tucker,et al. Duality Theory of Linear Programs: A Constructive Approach with Applications , 1969 .
[8] J. Stoer,et al. Convexity and Optimization in Finite Dimensions I , 1970 .
[9] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[10] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[11] T. Terlaky. A convergent criss-cross method , 1985 .
[12] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[13] Clyde L. Monma,et al. An Implementation of a Primal-Dual Interior Point Method for Linear Programming , 1989, INFORMS J. Comput..
[14] N. Megiddo. Pathways to the optimal set in linear programming , 1989 .
[15] Yinyu Ye,et al. An O(square-root[nL])-Iteration Homogeneous and Self-Dual Linear Programming Algorithm , 1992 .