Author:
Xi-ming Liang,Long-hua Ma,Ji-xin Qian
Publisher
Zhejiang University Press
Reference13 articles.
1. Fletcher, R., 1987. Practical Methods of Optimization, 2nd edition. Wiley Pub, New York, p. 115–174.
2. Hock, W. and Schittkowski, K., 1981. Test Examples for Nonlinear Programming Codes. Springer, Berlin. p. 26–140
3. Kappor, S. and Vaidya, P. M., 1986. Fast algorithms for convex quadratic programming and multicommodity flows, Proceedings of the 18th Annual ACM Symposium on Theory of Computing. California, p. 147–159.
4. Karmarkar, N., 1984. A new polynomial time algorithm for linear programming.Combinatorica,4: 373–393.
5. Kozlov, M. K., Tarasov, S. P. and Khachiyan, L. G., 1979. Polynomial solvability of convex quadratic programming.Soviet Mathematics Doklady,20: 1108–1111.