{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T03:06:57Z","timestamp":1766545617344,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,3,5]],"date-time":"2018-03-05T00:00:00Z","timestamp":1520208000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["LO-1379\/7-1"],"award-info":[{"award-number":["LO-1379\/7-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10898-018-0627-0","type":"journal-article","created":{"date-parts":[[2018,3,5]],"date-time":"2018-03-05T00:41:03Z","timestamp":1520210463000},"page":"347-372","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A vector linear programming approach for certain global optimization problems"],"prefix":"10.1007","volume":"72","author":[{"given":"Daniel","family":"Ciripoi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0872-4735","authenticated-orcid":false,"given":"Andreas","family":"L\u00f6hne","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Wei\u00dfing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,5]]},"reference":[{"issue":"1","key":"627_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1008215702611","volume":"13","author":"HP Benson","year":"1998","unstructured":"Benson, H.P.: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. J. Glob. Optim. 13(1), 1\u201324 (1998)","journal-title":"J. Glob. Optim."},{"key":"627_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"4","key":"627_CR3","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s10898-011-9709-y","volume":"52","author":"M Ehrgott","year":"2012","unstructured":"Ehrgott, M., L\u00f6hne, A., Shao, L.: A dual variant of Benson\u2019s \u201couter approximation algorithm\u201d for multiple objective linear programming. J. Glob. Optim. 52(4), 757\u2013778 (2012)","journal-title":"J. Glob. Optim."},{"key":"627_CR4","doi-asserted-by":"crossref","unstructured":"Ferrer, A.: Applying global optimization to a problem in short-term hydrothermal scheduling. In: Generalized Convexity, Generalized Monotonicity and Applications, volume\u00a077 of Nonconvex Optimization Application, pp.\u00a0263\u2013285. Springer, New York (2005)","DOI":"10.1007\/0-387-23639-2_15"},{"issue":"1","key":"627_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10898-014-0159-1","volume":"61","author":"A Ferrer","year":"2015","unstructured":"Ferrer, A., Bagirov, A., Beliakov, G.: Solving DC programs using the cutting angle method. J. Glob. Optim. 61(1), 71\u201389 (2015)","journal-title":"J. Glob. Optim."},{"key":"627_CR6","unstructured":"F\u00fcl\u00f6p, J.: On the equivalence between a linear bilevel programming problem and linear optimization over the efficient set. Technical report. Working Paper 93-1. Laboratory of Operations Research and Decision Systems, Computer and Automation Institute, Hungarian Academy of Sciences, Budapest (1993)"},{"issue":"4","key":"627_CR7","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s10898-013-0098-2","volume":"59","author":"AH Hamel","year":"2014","unstructured":"Hamel, A.H., L\u00f6hne, A., Rudloff, B.: Benson type algorithms for linear vector optimization and applications. J. Glob. Optim. 59(4), 811\u2013836 (2014)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"627_CR8","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1137\/060674831","volume":"19","author":"F Heyde","year":"2008","unstructured":"Heyde, F., L\u00f6hne, A.: Geometric duality in multiple objective linear programming. SIAM J. Optim. 19(2), 836\u2013845 (2008)","journal-title":"SIAM J. Optim."},{"key":"627_CR9","doi-asserted-by":"crossref","unstructured":"Horst, R., Pardalos, P.M. (eds.): Handbook of Global Optimization, volume 2 of Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Dordrecht (1995)","DOI":"10.1007\/978-1-4615-2025-2"},{"key":"627_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02947-3","volume-title":"Global Optimization","author":"R Horst","year":"1993","unstructured":"Horst, R., Tuy, H.: Global Optimization, second edn. Springer, Berlin (1993)","edition":"second"},{"key":"627_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18351-5","volume-title":"Vector Optimization with Infimum and Supremum. Vector Optimization","author":"A L\u00f6hne","year":"2011","unstructured":"L\u00f6hne, A.: Vector Optimization with Infimum and Supremum. Vector Optimization. Springer, Heidelberg (2011)"},{"issue":"2","key":"627_CR12","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10898-017-0519-8","volume":"69","author":"A L\u00f6hne","year":"2017","unstructured":"L\u00f6hne, A., Wagner, A.: Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver. J. Glob. Optim. 69(2), 369\u2013385 (2017)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"627_CR13","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00186-016-0554-0","volume":"84","author":"A L\u00f6hne","year":"2016","unstructured":"L\u00f6hne, A., Wei\u00dfing, B.: Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming. Math. Methods Oper. Res. 84(2), 411\u2013426 (2016)","journal-title":"Math. Methods Oper. Res."},{"key":"627_CR14","unstructured":"L\u00f6hne, A., Wei\u00dfing, B., Ciripoi, D.: Bensolve tools, 2014\u20132017. Bensolve interface for Gnu Octave\/Matlab. http:\/\/tools.bensolve.org"},{"key":"627_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(74)90070-3","volume":"9","author":"A Majthay","year":"1974","unstructured":"Majthay, A., Whinston, A.: Quasi-concave minimization subject to linear constraints. Discrete Math. 9, 35\u201359 (1974)","journal-title":"Discrete Math."},{"issue":"1\u20132","key":"627_CR16","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10107-011-0511-x","volume":"141","author":"S Mittal","year":"2013","unstructured":"Mittal, S., Schulz, A.S.: An FPTAS for optimizing a class of low-rank functions over a polytope. Math. Program. 141(1\u20132), 103\u2013120 (2013)","journal-title":"Math. Program."},{"key":"627_CR17","unstructured":"Sahinidis, N.V.: BARON 14.3.1: Global optimization of mixed-integer nonlinear programs, user\u2019s manual (2014). http:\/\/www.minlp.com\/downloads\/docs\/baron%20manual.pdf"},{"issue":"2","key":"627_CR18","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1080\/02331934.2015.1051534","volume":"65","author":"L Shao","year":"2016","unstructured":"Shao, L., Ehrgott, M.: Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes. Optimization 65(2), 415\u2013431 (2016)","journal-title":"Optimization"},{"key":"627_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225\u2013249 (2005)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"627_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1080\/02331939208843778","volume":"24","author":"H Tuy","year":"1992","unstructured":"Tuy, H., Tam, B.T.: An efficient solution method for rank two quasiconcave minimization problems. Optimization 24(1\u20132), 43\u201356 (1992)","journal-title":"Optimization"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-0627-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0627-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0627-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,12]],"date-time":"2019-10-12T01:57:07Z","timestamp":1570845427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-0627-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,5]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["627"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-0627-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2018,3,5]]},"assertion":[{"value":"5 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}