{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T08:44:34Z","timestamp":1768985074060,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1976,12,1]],"date-time":"1976-12-01T00:00:00Z","timestamp":218246400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1976,12]]},"DOI":"10.1007\/bf01580380","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:55:54Z","timestamp":1114667754000},"page":"117-127","source":"Crossref","is-referenced-by-count":68,"title":["Maximization of A convex quadratic function under linear constraints"],"prefix":"10.1007","volume":"11","author":[{"given":"Hiroshi","family":"Konno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"CR1","first-page":"741","volume":"19","author":"M. Altman","year":"1968","unstructured":"M. Altman, \u201cBilinear programming\u201d,Bulletin de l'Acad\u00e9mie Polonaise des Sciences 19 (9) (1968) 741\u2013746.","journal-title":"Bulletin de l'Acad\u00e9mie Polonaise des Sciences"},{"key":"CR2","volume-title":"\u201cMaximizing a convex quadratic function subject to linear constraints\u201d, Management Science Research Report No. 299","author":"E. Balas","year":"1973","unstructured":"E. Balas and C.-A. Burdet, \u201cMaximizing a convex quadratic function subject to linear constraints\u201d, Management Science Research Report No. 299, GSIA. Carnegie-Mellon University, Pittsburgh, Pa. (July 1973)."},{"issue":"1","key":"CR3","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/opre.18.1.82","volume":"18","author":"A.V. Cabot","year":"1970","unstructured":"A.V. Cabot and R.L. Francis, \u201cSolving certain nonconvex quadratic minimization problems by ranking extreme points\u201d,Operations Research 18 (1) (1970) 82\u201386.","journal-title":"Operations Research"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"132","DOI":"10.2307\/1907747","volume":"25","author":"A. Charnes","year":"1957","unstructured":"A. Charnes and W.W. Cooper, \u201cNonlinear power of adjacent extreme point methods in linear programming\u201d,Econometrica 25 (1957) 132\u2013153.","journal-title":"Econometrica"},{"issue":"3","key":"CR5","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1287\/mnsc.10.3.515","volume":"10","author":"W. Candler","year":"1964","unstructured":"W. Candler and R.J. Townsley, \u201cThe maximization of a quadratic function of variables subject to linear inequalities\u201d,Management Science 10 (3) (1964) 515\u2013523.","journal-title":"Management Science"},{"key":"CR6","volume-title":"Integer and nonlinear programming","author":"R.W. Cottle","year":"1970","unstructured":"R.W. Cottle and W.C. Mylander, \u201cRitter's cutting plane method for nonconvex quadratic programming\u201d, In: J. Abadie, ed.,Integer and nonlinear programming, (North-Holland, Amsterdam, 1970)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01580119","volume":"5","author":"J. Falk","year":"1973","unstructured":"J. Falk, \u201cA linear max-min problem\u201d,Mathematical Programming 5 (1973) 169\u2013188.","journal-title":"Mathematical Programming"},{"key":"CR8","unstructured":"T. Hansen and L. Mathiesen, \u201cGenerating stationary points for a non-concave quadratic program by Lemke's almost complementary pivot algorithm\u201d, Discussion Paper 11\/73. Norwegian School of Economics and Business Administration, Bergen, Norway."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"H. Konno, \u201cA cutting plane algorithm for solving bilinear programs\u201d,Mathematical Programming 11 (1976).","DOI":"10.1007\/BF01580367"},{"key":"CR10","series-title":"Working Paper","volume-title":"Applications of bilinear programming","author":"H. Konno","year":"1975","unstructured":"H. Konno, \u201cApplications of bilinear programming\u201d, Working Paper, International Institute for Applied Systems Analysis, Laxenburg, Austria (1975)."},{"key":"CR11","volume-title":"\u201cNonconvex quadratic programming by a modification of Lemke's method\u201d, RAC-TP-414","author":"W.C. Mylander","year":"1971","unstructured":"W.C. Mylander, \u201cNonconvex quadratic programming by a modification of Lemke's method\u201d, RAC-TP-414 Research Analysis Corporation, McLean, Virg. (1971)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/BF00539118","volume":"4","author":"K. Ritter","year":"1966","unstructured":"K. Ritter, \u201cA method for solving maximum problems with a nonconcave quadratic objective function\u201d,Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und verwandte Gebiete 4 (1966) 340\u2013351.","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und verwandte Gebiete"},{"issue":"4","key":"CR13","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1287\/opre.17.4.680","volume":"17","author":"M. Raghavachari","year":"1969","unstructured":"M. Raghavachari, \u201cOn connections between zero-one integer programming and concave programming under linear constraints\u201d,Operations Research 17 (4) (1969) 680\u2013684.","journal-title":"Operations Research"},{"key":"CR14","unstructured":"H. Tui, \u201cConcave programming under linear constraints\u201d,Soviet Mathematics (1964) 1437\u20131440."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"1260","DOI":"10.1287\/opre.21.6.1260","volume":"21","author":"P. Zwart","year":"1973","unstructured":"P. Zwart, \u201cNonlinear programming: counterexamples to two global optimization algorithms\u201d,Operations Research 21 (1973) 1260\u20131266.","journal-title":"Operations Research"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"P. Zwart, \u201cComputational aspects of the use of cutting planes in global optimization\u201d, In:Proceedings of the 1971 annual conference of the ACM (ACM, 1971) pp. 457\u2013465.","DOI":"10.1145\/800184.810515"},{"issue":"3","key":"CR17","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1287\/opre.22.3.602","volume":"22","author":"P. Zwart","year":"1974","unstructured":"P. Zwart, \u201cGlobal maximization of a convex function with linear inequality constraints\u201d,Operations Research, 22 (3) (1974) 602\u2013609.","journal-title":"Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580380.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580380\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580380","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:07Z","timestamp":1556881927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580380"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,12]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,12]]}},"alternative-id":["BF01580380"],"URL":"https:\/\/doi.org\/10.1007\/bf01580380","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976,12]]}}}