{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T12:54:34Z","timestamp":1770987274298,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0167-6377(01)00052-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:28:48Z","timestamp":1027607328000},"page":"81-92","source":"Crossref","is-referenced-by-count":10,"title":["Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem"],"prefix":"10.1016","volume":"28","author":[{"given":"Hoang","family":"Q. Tuyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le","family":"D. Muu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(01)00052-9_BIB1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/moor.8.2.273","article-title":"Jointly constrained biconvex programming","volume":"8","author":"Al-Khayyal","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00052-9_BIB2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0167-6377(96)00022-3","article-title":"Numerical solution for optimization over the efficient set by DC optimization algorithms","volume":"19","author":"An","year":"1996","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(01)00052-9_BIB3","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/0377-2217(86)90085-8","article-title":"An algorithm for optimizing over the weakly-efficient set","volume":"25","author":"Benson","year":"1986","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00052-9_BIB4","unstructured":"C. Berge, Topological Spaces, MacMillan, New York, 1968."},{"key":"10.1016\/S0167-6377(01)00052-9_BIB5","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1006\/jmaa.1993.1085","article-title":"Optimality condition for minimization over the (weakly or properly) efficient set","volume":"173","author":"Bolintineanu","year":"1993","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/S0167-6377(01)00052-9_BIB6","first-page":"295","article-title":"Penalisation dans l'optimisation sur l'ensemble faiblement efficient","volume":"31","author":"Bolintineanu","year":"1997","journal-title":"Rech. Oper."},{"key":"10.1016\/S0167-6377(01)00052-9_BIB7","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF00933830","article-title":"Bicriteria linear fractional programming","volume":"36","author":"Choo","year":"1982","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0167-6377(01)00052-9_BIB8","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/mnsc.29.2.250","article-title":"Connectedness in multiple linear fractional programming","volume":"29","author":"Choo","year":"1983","journal-title":"Management Sci."},{"key":"10.1016\/S0167-6377(01)00052-9_BIB9","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1023\/A:1022687222060","article-title":"Lagrange duality and partioning techniques in nonconvex global optimization","volume":"95","author":"Dur","year":"1997","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0167-6377(01)00052-9_BIB10","doi-asserted-by":"crossref","first-page":"1397","DOI":"10.1016\/0098-1354(90)80020-C","article-title":"A global optimization algorithm for certain classes of nonconvex NLPs, Part 1: theory","volume":"14","author":"Floudas","year":"1990","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/S0167-6377(01)00052-9_BIB11","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF00939667","article-title":"Primal-relaxed dual global optimization approach","volume":"78","author":"Floudas","year":"1993","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0167-6377(01)00052-9_BIB12","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01580678","article-title":"An algorithm for nonconvex programming problems","volume":"10","author":"Horst","year":"1976","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(01)00052-9_BIB13","series-title":"Global Optimization (Deterministic Approaches)","author":"Horst R","year":"1996"},{"key":"10.1016\/S0167-6377(01)00052-9_BIB14","series-title":"Theory of Vector Optimization","author":"Luc","year":"1989"},{"key":"10.1016\/S0167-6377(01)00052-9_BIB15","unstructured":"C. Malivert, Mulicriteria fractional optimization, Proceedings of the second Catalans Days on Applied Mathematics, Presses Universitaires de Perpignan, Paris, 1995, pp. 189\u2013198."},{"key":"10.1016\/S0167-6377(01)00052-9_BIB16","doi-asserted-by":"crossref","unstructured":"B. Ricceri, S. Simons (Eds.), Minimax Theory and Application, Kluwer Academic Publishers, Dordrecht, 1998.","DOI":"10.1007\/978-94-015-9113-3"},{"key":"10.1016\/S0167-6377(01)00052-9_BIB17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0377-2217(81)90272-1","article-title":"Fractional programming: applications and algorithms","volume":"7","author":"Schaible","year":"1981","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00052-9_BIB18","series-title":"Multiple Criteria Optimization: Theory, Computation, and Application","author":"Steuer","year":"1986"},{"key":"10.1016\/S0167-6377(01)00052-9_BIB19","doi-asserted-by":"crossref","first-page":"1419","DOI":"10.1016\/0098-1354(90)80021-3","article-title":"A global optimization algorithm for certain classes of nonconvex NLPs, Part 2: applications of theory and test problems","volume":"14","author":"Visweswaran","year":"1990","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/S0167-6377(01)00052-9_BIB20","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1008336124425","article-title":"An inner approximation method for optimization over the weakly efficient set","volume":"16","author":"Yamada","year":"2000","journal-title":"J. Global Optim."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000529?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000529?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T00:10:43Z","timestamp":1583971843000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637701000529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0167637701000529"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(01)00052-9","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}