{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T19:07:51Z","timestamp":1769022471305,"version":"3.49.0"},"reference-count":9,"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\/bf01580892","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:58:11Z","timestamp":1114678691000},"page":"45-50","source":"Crossref","is-referenced-by-count":18,"title":["A linear programming approach to solving bilinear programmes"],"prefix":"10.1007","volume":"56","author":[{"given":"Douglas J.","family":"White","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"G. Anandalingham and D.J. White, \u201cA penalty function method for solving linear bi-level programs,\u201d working paper, Departments of Systems, University of Pennsylvania, and of Decision Theory, University of Manchester, and Systems Engineering, University of Virginia (1989)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01580119","volume":"5","author":"J.E. Falk","year":"1973","unstructured":"J.E. Falk, \u201cA linear max-min problem,\u201dMathematical Programming 5 (1973) 169\u2013188.","journal-title":"Mathematical Programming"},{"key":"CR3","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.R. Hoffman, \u201cA successive underestimation method for concave minimisation problems,\u201dMathematics of Operations Research 1 (1976) 251\u2013259.","journal-title":"Mathematics of Operations Research"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"K. von Kleibohm,Bermorkungen zum Problem der Nichtconvexen Programmierung (Unternehmensforschung, 1967) pp. 49\u201360.","DOI":"10.1007\/BF01922383"},{"key":"CR5","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":"CR6","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,\u201dZeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete 4 (1966) 340\u2013351.","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01581626","volume":"19","author":"H.D. Sherali","year":"1980","unstructured":"H.D. Sherali and C.M. Shetty, \u201cA finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts,\u201dMathematical Programming 19 (1980) 14\u201331.","journal-title":"Mathematical Programming"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01580766","volume":"41","author":"T.V. Thieu","year":"1988","unstructured":"T.V. Thieu, \u201cA note on the solution of bilinear programming problems by reduction to concave minimisation,\u201dMathematical Programming 41 (1988) 249\u2013260.","journal-title":"Mathematical Programming"},{"key":"CR9","unstructured":"H. Tui, \u201cConcave programming under linear constraints,\u201dSoviet Mathematics (1964) 1437\u20131440."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580892.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580892\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580892","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:50:39Z","timestamp":1586231439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580892"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["BF01580892"],"URL":"https:\/\/doi.org\/10.1007\/bf01580892","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}