Author:
Konno Hiroshi,Kuno Takahito
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference30 articles.
1. F.A. Al-Khayyal, “Linear, quadratic and bilinear programming approaches to linear complementarity problem,”European Journal of Operational Research 24 (1986) 216–227.
2. Y.P. Aneja, V. Aggarwal and K.P.K. Nair, “On a class of quadratic programming,”European Journal of Operational Research 18 (1984) 62–70.
3. E. Balas and C.A. Burdet, “Maximizing a convex quadratic function subject to linear constraints,” MSRR 299 GSIA, Carnegie-Mellon University (Pittsburgh, PA, 1973).
4. C.R. Bector and M. Dahl, “Simplex type finite iteration technique and reality for a special type of pseudo-concave quadratic functions,”Cahiers du Centre d'Etudes de Recherche Operetionnelle 16 (1974) 207–222.
5. A.V. Cabot, “Variations on a cutting plane method for solving concave minimization problem with linear constraints,”Naval Research Logistics Quarterly 21 (1974) 265–274.
Cited by
90 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献