{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T02:16:35Z","timestamp":1776651395252,"version":"3.51.2"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1993,11]]},"DOI":"10.1007\/bf01299449","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T04:29:16Z","timestamp":1111724956000},"page":"207-227","source":"Crossref","is-referenced-by-count":88,"title":["Bilinear separation of two sets inn-space"],"prefix":"10.1007","volume":"2","author":[{"given":"Kristin P.","family":"Bennett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O. L.","family":"Mangasarian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8-2","author":"F.A. Al-Khayyal","year":"1983","unstructured":"F.A. Al-Khayyal and J.E. Falk, ?Jointly constrained biconvex programming,? Math. Oper. Res., 8-2, pp. 273?286, 1983.","journal-title":"Math. Oper. Res."},{"key":"CR2","unstructured":"E.B. Baum, Private communication, 1992."},{"key":"CR3","first-page":"81","volume-title":"Advances in Neural Information Processing Systems I","author":"E.B. Baum","year":"1989","unstructured":"E.B. Baum and D. Haussler, ?What size net gives valid generalization,? Advances in Neural Information Processing Systems I (D.S. Touretzky, ed.), Morgan Kaufmann: San Mateo, CA, 1989, pp. 81?90."},{"key":"CR4","unstructured":"K.P. Bennett, ?Decision tree construction via linear programming,? in Proc. of the 4th Midwest Artificial Intelligence and Cognitive Science Society Conf. (M. Evans, ed.), 1992, pp. 97?101."},{"key":"CR5","first-page":"56","volume-title":"Advances in Optimization and Parallel Computing","author":"K.P. Bennett","year":"1992","unstructured":"K.P. Bennett and O.L. Mangasarian, ?Neural network training via linear programming,? Advances in Optimization and Parallel Computing (P.M. Pardalos, ed.), North Holland, Amsterdam, 1992, pp. 56?67."},{"key":"CR6","series-title":"Optimization Methods and Software","first-page":"23","volume-title":"Robust linear programming discrimination of two linearly inseparable sets","author":"K.P. Bennett","year":"1992","unstructured":"K.P. Bennett and O.L. Mangasarian, ?Robust linear programming discrimination of two linearly inseparable sets,? Optimization Methods and Software 1, Gordon and Breach Science Publishers: Reading, England, 1992, pp. 23?34."},{"key":"CR7","volume-title":"Programming, Games and Transportation Networks","author":"C. Berge","year":"1965","unstructured":"C. Berge and A. Ghouila-Houri, Programming, Games and Transportation Networks, Wiley: New York, 1965."},{"key":"CR8","first-page":"494","volume-title":"Advances in Neural Information Processing System I","author":"A. Blum","year":"1989","unstructured":"A. Blum and R.L. Rivest, ?Training a 3-node neural network is np-complete,? Advances in Neural Information Processing System I (D.S. Touretzky, ed.), Morgan Kaufmann: San Mateo, CA, 1989, pp. 494?501."},{"key":"CR9","first-page":"67","volume-title":"Computer and Information Sciences","author":"A. Charnes","year":"1964","unstructured":"A. Charnes, ?Some fundamental theorems of perceptron theory and their geometry,? Computer and Information Sciences (J.T. Lou and R.H. Wilcox, eds.), Spartan Books: Washington, 1964, pp. 67?74."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M. Frank","year":"1956","unstructured":"M. Frank and P. Wolfe, ?An algorithm for quadratic programming,? Nav. Res. Logistics Q. 3, pp. 95?110, 1956.","journal-title":"Nav. Res. Logistics Q."},{"key":"CR11","volume-title":"Introduction to the Theory of Neural Computation","author":"J. Hertz","year":"1991","unstructured":"J. Hertz, A. Krogh, and R.G. Palmer, Introduction to the Theory of Neural Computation, Addison-Wesley: Redwood City, CA, 1991."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1109\/TEC.1961.5219287","volume":"10","author":"W.H. Highleyman","year":"1961","unstructured":"W.H. Highleyman, ?A note on linear separation,? IEEE Trans. Electronic Comput., vol. 10, pp. 777?778, 1961.","journal-title":"IEEE Trans. Electronic Comput."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01580893","volume":"56","author":"H. Konno","year":"1992","unstructured":"H. Konno and T. Kuno, ?Linear multiplicative programming,? Math. Prog., vol. 56, pp. 51?64, 1992.","journal-title":"Math. Prog."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.13.3.444","volume":"13","author":"O.L. Mangasarian","year":"1965","unstructured":"O.L. Mangasarian, ?Linear and nonlinear separation of patterns by linear programming,? Oper. Res. vol. 13, pp. 444?452, 1965.","journal-title":"Oper. Res."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1109\/TIT.1968.1054229","volume":"14","author":"O.L. Mangasarian","year":"1968","unstructured":"O.L. Mangasarian, ?Multi-surface method of pattern separation,? IEEE Trans. Information Theory, vol. IT-14, pp. 801?807, 1968.","journal-title":"IEEE Trans. Information Theory"},{"key":"CR16","volume-title":"Nonlinear Programming","author":"O.L. Mangasarian","year":"1969","unstructured":"O.L. Mangasarian, Nonlinear Programming, McGraw-Hill: New York, 1969."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/BFb0120783","volume":"7","author":"O.L. Mangasarian","year":"1978","unstructured":"O.L. Mangasarian, ?Characterization of linear complementarity problems as linear programs,? Math. Prog. Study, vol. 7, pp. 74?87, 1978.","journal-title":"Math. Prog. Study"},{"key":"CR18","first-page":"22","volume-title":"Proc. Workshop on Large-Scale Numerical Optimization","author":"O.L. Mangasarian","year":"1989","unstructured":"O.L. Mangasarian, R. Setiono, and W.H. Wolberg, ?Pattern recognition via linear programming: Theory and application to medical diagnosis,? in Proc. Workshop on Large-Scale Numerical Optimization, (T.F. Coleman and Y. Li, eds.), Cornell University, Ithaca, New York, 1989, pp. 22?31."},{"key":"CR19","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5237.001.0001","volume-title":"Explorations in Parallel Distributed Processing: A Handbook of Models, Programs, and Exercises","author":"J.L. McClelland","year":"1987","unstructured":"J.L. McClelland and D.E. Rummelhart, Explorations in Parallel Distributed Processing: A Handbook of Models, Programs, and Exercises, MIT Press: Cambridge, MA, 1987."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02187916","volume":"3","author":"N. Megiddo","year":"1988","unstructured":"N. Megiddo, ?On the complexity of polyhedral separability,? Discrete and Comput. Geometry, vol. 3, pp. 325?337, 1988.","journal-title":"Discrete and Comput. Geometry"},{"key":"CR21","volume-title":"Perceptrons: An Introduction to Computational Geometry","author":"M. Minsky","year":"1969","unstructured":"M. Minsky and S. Papert, Perceptrons: An Introduction to Computational Geometry, MIT Press: Cambridge, MA, 1969."},{"key":"CR22","series-title":"Technical Report SOL 83.20","doi-asserted-by":"crossref","DOI":"10.21236\/ADA138522","volume-title":"MINOS 5.0 user's guide","author":"B.A. Murtagh","year":"1983","unstructured":"B.A. Murtagh and M.A. Saunders, ?MINOS 5.0 user's guide,? Technical Report SOL 83.20, Stanford University: Stanford, CA, 1983."},{"key":"CR23","volume-title":"Linear Programming","author":"K.G. Murty","year":"1983","unstructured":"K.G. Murty, Linear Programming, John Wiley & Sons: New York, 1983."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1080\/02331939008843615","volume":"21","author":"P.M. Pardalos","year":"1990","unstructured":"P.M. Pardalos, ?Polynomial time algorithm for some classes of constrained non-convex quadratic problems,? Optimization, vol. 21, pp. 843?853, 1990.","journal-title":"Optimization"},{"key":"CR25","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar, Convex Analysis, Princeton University Press: Princeton, NJ, 1970."},{"key":"CR26","volume-title":"Principles of Neurodynamics","author":"F. Rosenblatt","year":"1959","unstructured":"F. Rosenblatt, Principles of Neurodynamics, Spartan Books: New York, 1959."},{"key":"CR27","doi-asserted-by":"crossref","first-page":"318","DOI":"10.7551\/mitpress\/5236.001.0001","volume-title":"Parallel Distributed Processing","author":"D.E. Rumelhart","year":"1986","unstructured":"D.E. Rumelhart, G.E. Hinton, and J.L. McClelland, ?Learning internal representations,? Parallel Distributed Processing (D.E. Rumelhart and J.L. McClelland, eds.), MIT Press: Cambridge, MA, 1986, pp. 318?362."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1109\/TC.1968.229395","volume":"17","author":"F.W. Smith","year":"1968","unstructured":"F.W. Smith, ?Pattern classifier design by linear programming,? IEEE Trans. Comput., vol. C-17, pp. 367?372, 1968.","journal-title":"IEEE Trans. Comput."},{"key":"CR29","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01580766","volume":"41","author":"T.V. Thieu","year":"1988","unstructured":"T.V. Thieu, ?A note on the solution of bilinear programming problems by reduction to concave minimization,? Math. Prog., vol. 41, pp. 249?260, 1988.","journal-title":"Math. Prog."},{"key":"CR30","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01580892","volume":"56","author":"D.J. White","year":"1992","unstructured":"D.J. White, ?A linear programming approach to solving bilinear programs,? Math. Prog., vol. 56, pp. 45?50, 1992.","journal-title":"Math. Prog."},{"key":"CR31","doi-asserted-by":"crossref","unstructured":"W.H. Wolberg and O.L. Mangasarian, ?Multisurface method of pattern separation for medical diagnosis applied to breast cytology,? in Proc. Nat. Acad. Sci., vol. 87, 1990, pp. 9193?9196.","DOI":"10.1073\/pnas.87.23.9193"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF00119989","volume":"1","author":"Y. Yajima","year":"1991","unstructured":"Y. Yajima and H. Konno, ?Efficient algorithms for solving rank two and rank three bilinear programming problems,? J. Global Optimization, vol. 1, pp. 155?171, 1991.","journal-title":"J. Global Optimization"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299449.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01299449\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:49:51Z","timestamp":1586180991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01299449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["BF01299449"],"URL":"https:\/\/doi.org\/10.1007\/bf01299449","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}