{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:04:08Z","timestamp":1770815048627,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T00:00:00Z","timestamp":1628121600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T00:00:00Z","timestamp":1628121600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s12351-021-00664-z","type":"journal-article","created":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T10:03:05Z","timestamp":1628157785000},"page":"3183-3201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimizing a linear function over an efficient set"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6362-9979","authenticated-orcid":false,"given":"Hadjer","family":"Belkhiri","sequence":"first","affiliation":[]},{"given":"Mohamed El-Amine","family":"Chergui","sequence":"additional","affiliation":[]},{"given":"Fatma Zohra","family":"Oua\u00efl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,5]]},"reference":[{"issue":"1","key":"664_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF00120667","volume":"1","author":"HP Benson","year":"1991","unstructured":"Benson HP (1991) An all-linear programming relaxation algorithm for optimizing over the efficient set. J Global Opt 1(1):83\u2013104","journal-title":"J Global Opt"},{"issue":"1","key":"664_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01100242","volume":"3","author":"HP Benson","year":"1993","unstructured":"Benson HP (1993) A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case. J Global Optim 3(1):95\u2013111","journal-title":"J Global Optim"},{"issue":"3","key":"664_CR3","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s10898-011-9786-y","volume":"52","author":"HP Benson","year":"2011","unstructured":"Benson HP (2011) An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem. J Global Optim 52(3):553\u2013574","journal-title":"J Global Optim"},{"issue":"3","key":"664_CR4","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1016\/j.ejor.2016.02.037","volume":"260","author":"N Boland","year":"2017","unstructured":"Boland N, Charkhgard H, Savelsbergh M (2017) A new method for optimizing a linear function over the efficient set of a multiobjective integer program. Eur J Oper Res 260(3):904\u2013919","journal-title":"Eur J Oper Res"},{"issue":"1\u20133","key":"664_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01582141","volume":"61","author":"S Bolintineanu","year":"1993","unstructured":"Bolintineanu S (1993) Minimization of a quasi-concave function over an efficient set. Math Program 61(1\u20133):89\u2013110","journal-title":"Math Program"},{"issue":"1","key":"664_CR6","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF01580453","volume":"8","author":"JG Ecker","year":"1975","unstructured":"Ecker JG, Kouada IA (1975) Finding efficient points for linear multiple objective programs. Math Program 8(1):375\u2013377","journal-title":"Math Program"},{"issue":"3","key":"664_CR7","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/BF02207641","volume":"83","author":"JG Ecker","year":"1994","unstructured":"Ecker JG, Song JH (1994) Optimizing a linear function over an efficient set. J Optim Theory Appl 83(3):541\u2013563","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"664_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/A:1004657827134","volume":"105","author":"J F\u00fcl\u00f6p","year":"2000","unstructured":"F\u00fcl\u00f6p J, Muu LD (2000) Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem. J Optim Theory Appl 105(1):37\u201354","journal-title":"J Optim Theory Appl"},{"issue":"4","key":"664_CR9","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s10898-013-0098-2","volume":"59","author":"AH Hamel","year":"2013","unstructured":"Hamel AH, L\u00f6hne A, Rudloff B (2013) Benson type algorithms for linear vector optimization and applications. J Global Optim 59(4):811\u2013836","journal-title":"J Global Optim"},{"issue":"1","key":"664_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1287\/opre.22.1.189","volume":"22","author":"H Isermann","year":"1974","unstructured":"Isermann H (1974) Technical note\u2013proper efficiency and the linear vector maximum problem. Oper Res 22(1):189\u2013191","journal-title":"Oper Res"},{"issue":"1","key":"664_CR11","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ejor.2008.02.005","volume":"195","author":"JM Jorge","year":"2009","unstructured":"Jorge JM (2009) An algorithm for optimizing a linear function over an integer efficient set. Eur J Oper Res 195(1):98\u2013103","journal-title":"Eur J Oper Res"},{"issue":"10","key":"664_CR12","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1080\/02331934.2018.1484922","volume":"67","author":"Z Liu","year":"2018","unstructured":"Liu Z, Ehrgott M (2018) Primal and dual algorithms for optimization over the efficient set. Optimization 67(10):1661\u20131686","journal-title":"Optimization"},{"issue":"4","key":"664_CR13","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s10898-013-0136-0","volume":"60","author":"A L\u00f6hne","year":"2014","unstructured":"L\u00f6hne A, Rudloff B, Ulus F (2014) Primal and dual approximation algorithms for convex vector optimization problems. J Global Optim 60(4):713\u2013736","journal-title":"J Global Optim"},{"issue":"1","key":"664_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01584543","volume":"2","author":"J Philip","year":"1972","unstructured":"Philip J (1972) Algorithms for the vector maximization problem. Math Program 2(1):207\u2013229","journal-title":"Math Program"},{"issue":"2","key":"664_CR15","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ejor.2019.02.042","volume":"277","author":"CA Piercy","year":"2019","unstructured":"Piercy CA, Steuer RE (2019) Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming. Eur J Oper Res 277(2):653\u2013666","journal-title":"Eur J Oper Res"},{"issue":"4","key":"664_CR16","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1026544116333","volume":"18","author":"NV Thoai","year":"2000","unstructured":"Thoai NV (2000) Conical algorithm in global optimization for optimizing over efficient sets. J Global Optim 18(4):321\u2013336","journal-title":"J Global Optim"},{"key":"664_CR17","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1013875600711","volume":"22","author":"Y Yamamoto","year":"2002","unstructured":"Yamamoto Y (2002) Optimization over the efficient set: overview. J Global Optim 22:285\u2013317","journal-title":"J Global Optim"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-021-00664-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-021-00664-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-021-00664-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,18]],"date-time":"2022-08-18T10:29:30Z","timestamp":1660818570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-021-00664-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,5]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["664"],"URL":"https:\/\/doi.org\/10.1007\/s12351-021-00664-z","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,5]]},"assertion":[{"value":"1 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}