{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T17:26:24Z","timestamp":1772126784798,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"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":[[1992,8]]},"DOI":"10.1007\/bf01580893","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:58:11Z","timestamp":1114664291000},"page":"51-64","source":"Crossref","is-referenced-by-count":100,"title":["Linear multiplicative programming"],"prefix":"10.1007","volume":"56","author":[{"given":"Hiroshi","family":"Konno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takahito","family":"Kuno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0377-2217(86)90043-3","volume":"24","author":"F.A. Al-Khayyal","year":"1986","unstructured":"F.A. Al-Khayyal, \u201cLinear, quadratic and bilinear programming approaches to linear complementarity problem,\u201dEuropean Journal of Operational Research 24 (1986) 216\u2013227.","journal-title":"European Journal of Operational Research"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/0377-2217(84)90262-5","volume":"18","author":"Y.P. Aneja","year":"1984","unstructured":"Y.P. Aneja, V. Aggarwal and K.P.K. Nair, \u201cOn a class of quadratic programming,\u201dEuropean Journal of Operational Research 18 (1984) 62\u201370.","journal-title":"European Journal of Operational Research"},{"key":"CR3","volume-title":"\u201cMaximizing a convex quadratic function subject to linear constraints,\u201d MSRR 299 GSIA","author":"E. Balas","year":"1973","unstructured":"E. Balas and C.A. Burdet, \u201cMaximizing a convex quadratic function subject to linear constraints,\u201d MSRR 299 GSIA, Carnegie-Mellon University (Pittsburgh, PA, 1973)."},{"key":"CR4","first-page":"207","volume":"16","author":"C.R. Bector","year":"1974","unstructured":"C.R. Bector and M. Dahl, \u201cSimplex type finite iteration technique and reality for a special type of pseudo-concave quadratic functions,\u201dCahiers du Centre d'Etudes de Recherche Operetionnelle 16 (1974) 207\u2013222.","journal-title":"Cahiers du Centre d'Etudes de Recherche Operetionnelle"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/nav.3800210206","volume":"21","author":"A.V. Cabot","year":"1974","unstructured":"A.V. Cabot, \u201cVariations on a cutting plane method for solving concave minimization problem with linear constraints,\u201dNaval Research Logistics Quarterly 21 (1974) 265\u2013274.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR6","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 nonconvex minimization problems by ranking the extreme points,\u201dOperations Research 18 (1970) 82\u201386.","journal-title":"Operations Research"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1287\/moor.1.3.251","volume":"1","author":"J.E. Falk","year":"1976","unstructured":"J.E. Falk and K.L. Hoffman, \u201cA successive underestimation method for concave minimization problems,\u201dMathematics of Operations Research 1 (1976) 251\u2013259.","journal-title":"Mathematics of Operations Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","volume":"15","author":"J.E. Falk","year":"1969","unstructured":"J.E. Falk and R.M. Soland, \u201cAn algorithm for solving separable nonconvex programming problems,\u2019Management Science 15 (1969) 550\u2013569.","journal-title":"Management Science"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1287\/opre.15.1.39","volume":"15","author":"A. Geoffrion","year":"1967","unstructured":"A. Geoffrion, \u201cSolving bicriterion mathematical programs,\u201dOperations Research 15 (1967) 39\u201354.","journal-title":"Operations Research"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01721096","volume":"9","author":"R. Horst","year":"1987","unstructured":"R. Horst, N.V. Thoai and H. Tuy, \u201cOuter approximation by polyhedral convex sets,\u201dOR Spektrum 9 (1987) 153\u2013159.","journal-title":"OR Spektrum"},{"key":"CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02598-7","volume-title":"Global Optimization","author":"R. Horst","year":"1990","unstructured":"R. Horst and H. Tuy,Global Optimization (Springer, Berlin, 1990)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/moor.12.3.544","volume":"12","author":"B. Kalantari","year":"1987","unstructured":"B. Kalantari and J.B. Rosen, \u201cAn algorithm for global minimization of linearly constrained concave quadratic functions,\u201dMathematics of Operations Research 12 (1987) 544\u2013561.","journal-title":"Mathematics of Operations Research"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01580367","volume":"11","author":"H. Konno","year":"1976","unstructured":"H. Konno, \u201cA cutting plane algorithm for solving bilinear programs,\u201dMathematical Programming 11 (1976) 14\u201327.","journal-title":"Mathematical Programming"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01580380","volume":"11","author":"H. Konno","year":"1976","unstructured":"H. Konno, \u201cMaximization of a convex quadratic function under linear constraints,\u201dMathematical Programming 11 (1976) 117\u2013127.","journal-title":"Mathematical Programming"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"171","DOI":"10.15807\/jorsj.23.171","volume":"23","author":"H. Konno","year":"1980","unstructured":"H. Konno, \u201cMaximizing a convex quadratic function over a hypercube,\u201dJournal of the Operations Research Society of Japan 23 (1980) 171\u2013189.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF01580763","volume":"41","author":"H. Konno","year":"1988","unstructured":"H. Konno, \u201cMinimum concave cost production sytem: A further generalization of multi-echelon model,\u201dMathematical Programming 41 (1988) 185\u2013193.","journal-title":"Mathematical Programming"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02283691","volume":"25","author":"H. Konno","year":"1990","unstructured":"H. Konno and T. Kuno, \u201cGeneralized linear multiplicative and fractional programming,\u201dAnnals of Operations Research 25 (1990) 147\u2013162.","journal-title":"Annals of Operations Research"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00120666","volume":"1","author":"H. Konno","year":"1991","unstructured":"H. Konno, Y. Yajima and T. Matsui, \u201cParametric simplex algorithms for solving a special class of nonconvex minimization problems,\u201dJournal of Global Optimization 1 (1991) 65\u201381.","journal-title":"Journal of Global Optimization"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF00119935","volume":"1","author":"T. Kuno","year":"1991","unstructured":"T. Kuno and H. Konno, \u201cA parametric successive underestimation method for convex multiplicative programming problems,\u201dJournal of Global Optimization 1 (1991) 267\u2013285.","journal-title":"Journal of Global Optimization"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0012-365X(74)90070-3","volume":"1","author":"A. Majthay","year":"1974","unstructured":"A. Majthay and A. Whinston, \u201cQuasiconcave minimization subject to linear constraints,\u201dDiscrete Mathematics 1 (1974) 35\u201339.","journal-title":"Discrete Mathematics"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/opre.16.2.268","volume":"16","author":"K.G. Murty","year":"1969","unstructured":"K.G. Murty, \u201cSolving the fixed charge problem by ranking the extreme points,\u201dOperations Research 16 (1969) 268\u2013279.","journal-title":"Operations Research"},{"key":"CR22","volume-title":"Polynomial time algorithms for some classes of constrained non-convex quadratic problems","author":"P.M. Pardalos","year":"1988","unstructured":"P.M. Pardalos, \u201cPolynomial time algorithms for some classes of constrained non-convex quadratic problems,\u201d Computer Science Department, The Pennsylvania State University (University Park, PA, 1988)."},{"key":"CR23","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0000035","volume-title":"Constrained Global Optimization: Algorithms and Applications. Lecture Notes in Computer Science No. 268","author":"P.M. Pardalos","year":"1987","unstructured":"P.M. Pardalos and J.B. Rosen,Constrained Global Optimization: Algorithms and Applications. Lecture Notes in Computer Science No. 268 (Springer, Berlin, 1987)."},{"key":"CR24","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 functions,\u201dZeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete 4 (1966) 340\u2013351.","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1287\/moor.8.2.215","volume":"8","author":"J.B. Rosen","year":"1983","unstructured":"J.B. Rosen, \u201cGlobal minimization of a linearly constrained concave function by partition of feasible domain,\u201dMathematics of Operations Research 8 (1983) 215\u2013230.","journal-title":"Mathematics of Operations Research"},{"key":"CR26","first-page":"133","volume":"8","author":"K. Swarup","year":"1966","unstructured":"K. Swarup, \u201cProgramming with indefinite quadratic function with linear constraints,\u201dCahiers du Centre d'\u00c9tudes de Recherche Op\u00e9rationnelle 8 (1966) 133\u2013136.","journal-title":"Cahiers du Centre d'\u00c9tudes de Recherche Op\u00e9rationnelle"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/moor.5.4.556","volume":"5","author":"N.V. Thoai","year":"1980","unstructured":"N.V. Thoai and H. Tuy, \u201cConvergent algorithms for minimizing a concave function,\u201dMathematics of Operations Research 5 (1980) 556\u2013566.","journal-title":"Mathematics of Operations Research"},{"key":"CR28","first-page":"1437","volume":"5","author":"H. Tuy","year":"1964","unstructured":"H. Tuy, \u201cConcave programming under linear constraints,\u201dSoviet Mathematics Doklady 5 (1964) 1437\u20131440.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1287\/mnsc.15.9.506","volume":"15","author":"W.I. Zangwill","year":"1969","unstructured":"W.I. Zangwill, \u201cA backlogging model and a multi-echelon model of a dynamic economic lot size production system \u2014 A network approach,\u201dManagement Science 15 (1969) 506\u2013527.","journal-title":"Management Science"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1287\/opre.22.3.602","volume":"22","author":"P.B. Zwart","year":"1974","unstructured":"P.B. Zwart, \u201cGlobal maximization of a convex function with linear inequality constraints,\u201dOperations Research 22 (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\/BF01580893.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580893\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:12Z","timestamp":1556881932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":30,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["BF01580893"],"URL":"https:\/\/doi.org\/10.1007\/bf01580893","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}