{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T17:40:43Z","timestamp":1751391643491},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T00:00:00Z","timestamp":1567036800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T00:00:00Z","timestamp":1567036800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s00186-019-00677-7","type":"journal-article","created":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T16:03:52Z","timestamp":1567094632000},"page":"55-72","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The polyhedral projection problem"],"prefix":"10.1007","volume":"91","author":[{"given":"Benjamin","family":"Wei\u00dfing","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,29]]},"reference":[{"key":"677_CR1","unstructured":"Burton BA, \u00d6zlen M (2010) Projective geometry and the outer approximation algorithm for multiobjective linear programming. ArXiv e-prints"},{"issue":"2","key":"677_CR2","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10898-018-0627-0","volume":"72","author":"D Ciripoi","year":"2018","unstructured":"Ciripoi D, L\u00f6hne A, Wei\u00dfing B (2018a) A vector linear programming approach for certain global optimization problems. J Glob Optim 72(2):347\u2013372. \nhttps:\/\/doi.org\/10.1007\/s10898-018-0627-0","journal-title":"J Glob Optim"},{"key":"677_CR3","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2018.1518447","author":"D Ciripoi","year":"2018","unstructured":"Ciripoi D, L\u00f6hne A, Wei\u00dfing B (2018b) Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver. Optimization. \nhttps:\/\/doi.org\/10.1080\/02331934.2018.1518447","journal-title":"Optimization"},{"key":"677_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9760-6","author":"L Csirmaz","year":"2015","unstructured":"Csirmaz L (2015) Using multiobjective optimization to map the entropy region. Comput Optim Appl. \nhttps:\/\/doi.org\/10.1007\/s10589-015-9760-6","journal-title":"Comput Optim Appl"},{"key":"677_CR5","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0024-3795(92)90281-E","volume":"166","author":"JP Dauer","year":"1992","unstructured":"Dauer JP, Saleh OA (1992) A representation of the set of feasible objectives in multiple objective linear programs. Linear Algebra Appl 166:261\u2013275. \nhttps:\/\/doi.org\/10.1016\/0024-3795(92)90281-E","journal-title":"Linear Algebra Appl"},{"key":"677_CR6","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-61576-8_77","volume-title":"Combinatorics and computer science (Brest, 1995)","author":"K Fukuda","year":"1996","unstructured":"Fukuda K, Prodon A (1996) Double description method revisited. In: Deza M, Euler R, Manoussakis I (eds) Combinatorics and computer science (Brest, 1995), vol 1120. Lecture Notes in Comput. Sci. Springer, Berlin, pp 91\u2013111. \nhttps:\/\/doi.org\/10.1007\/3-540-61576-8_77"},{"key":"677_CR7","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0019-9","volume-title":"Convex polytopes","author":"B Gr\u00fcnbaum","year":"2003","unstructured":"Gr\u00fcnbaum B (2003) Convex polytopes, vol 221, 2nd edn. Graduate Texts in Mathematics. Springer, New York. \nhttps:\/\/doi.org\/10.1007\/978-1-4613-0019-9\n\n (Prepared and with a preface by Volker Kaibel, Victor Klee and G\u00fcnter M. Ziegler)","edition":"2"},{"issue":"1","key":"677_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1137\/080743494","volume":"1","author":"AH Hamel","year":"2010","unstructured":"Hamel AH, Heyde F (2010) Duality for set-valued measures of risk. SIAM J Financ Math 1(1):66\u201395. \nhttps:\/\/doi.org\/10.1137\/080743494","journal-title":"SIAM J Financ Math"},{"issue":"2","key":"677_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s11579-013-0094-9","volume":"7","author":"AH Hamel","year":"2013","unstructured":"Hamel AH, Rudloff B, Yankova M (2013) Set-valued average value at risk and its computation. Math Financ Econ 7(2):229\u2013246. \nhttps:\/\/doi.org\/10.1007\/s11579-013-0094-9","journal-title":"Math Financ Econ"},{"key":"677_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24828-6","volume-title":"Vector optimization","author":"J Jahn","year":"2004","unstructured":"Jahn J (2004) Vector optimization. Springer, Berlin. \nhttps:\/\/doi.org\/10.1007\/978-3-540-24828-6\n\n (Theory, applications, and extensions)"},{"key":"677_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 (2011) Vector optimization with infimum and supremum. Vector Optimization. Springer, Heidelberg. \nhttps:\/\/doi.org\/10.1007\/978-3-642-18351-5"},{"issue":"2","key":"677_CR12","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 (2016) Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming. Math Methods Oper Res 84(2):411\u2013426. \nhttps:\/\/doi.org\/10.1007\/s00186-016-0554-0","journal-title":"Math Methods Oper Res"},{"key":"677_CR13","volume-title":"Convex analysis. Princeton Landmarks in Mathematics","author":"RT Rockafellar","year":"1997","unstructured":"Rockafellar RT (1997) Convex analysis. Princeton Landmarks in Mathematics. Princeton University Press, Princeton (Reprint of the 1970 original, Princeton Paperbacks)"},{"key":"677_CR14","unstructured":"Wei\u00dfing B (2017) The polyhedral projection problem. Ph.D. thesis, Friedrich Schiller University, Jena"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-019-00677-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-019-00677-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-019-00677-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T23:22:00Z","timestamp":1598570520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-019-00677-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,29]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["677"],"URL":"https:\/\/doi.org\/10.1007\/s00186-019-00677-7","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,29]]},"assertion":[{"value":"31 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}