{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T21:13:44Z","timestamp":1773868424592,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T00:00:00Z","timestamp":1582070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T00:00:00Z","timestamp":1582070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Grant-in-Aid for Science Research of Japan Society for the Promotion of Science","award":["(A) 19H00808"],"award-info":[{"award-number":["(A) 19H00808"]}]},{"name":"Grant-in-Aid for Science Research of Japan Society for the Promotion of Science","award":["(C) 17K01272"],"award-info":[{"award-number":["(C) 17K01272"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s11590-020-01554-7","type":"journal-article","created":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T18:13:56Z","timestamp":1582136036000},"page":"2323-2333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7840-4318","authenticated-orcid":false,"given":"Kuan","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinji","family":"Mizuno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianming","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,19]]},"reference":[{"issue":"3","key":"1554_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0167-6377(96)00022-3","volume":"19","author":"LTH An","year":"1996","unstructured":"An, L.T.H., Tao, P.D., Muu, L.D.: Numerical solution for optimization over the efficient set by dc optimization algorithms. Oper. Res. Lett. 19(3), 117\u2013128 (1996)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1554_CR2","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/0377-2217(86)90085-8","volume":"25","author":"HP Benson","year":"1986","unstructured":"Benson, H.P.: An algorithm for optimizing over the weakly-efficient set. Eur. J. Oper. Res. 25(2), 192\u2013199 (1986)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1554_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF00940077","volume":"73","author":"HP Benson","year":"1992","unstructured":"Benson, H.P.: A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set. J. Optim. Theory Appl. 73(1), 47\u201364 (1992)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1554_CR4","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s10898-011-9786-y","volume":"52","author":"HP Benson","year":"2012","unstructured":"Benson, H.P.: An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem. J. Glob. Optim. 52(3), 553\u2013574 (2012)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1554_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02192023","volume":"88","author":"HP Benson","year":"1996","unstructured":"Benson, H.P., Lee, D.: Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem. J. Optim. Theory Appl. 88(1), 77\u2013105 (1996)","journal-title":"J. Optim. Theory Appl."},{"issue":"1\u20133","key":"1554_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01582141","volume":"61","author":"S Bolintineanu","year":"1993","unstructured":"Bolintineanu, S.: Minimization of a quasi-concave function over an efficient set. Math. Program. 61(1\u20133), 89\u2013110 (1993)","journal-title":"Math. Program."},{"key":"1554_CR7","volume-title":"The Linear Complementarity Problem","author":"RW Cottle","year":"1992","unstructured":"Cottle, R.W., Pang, J.S., Stone, R.E.: The Linear Complementarity Problem, vol. 60. SIAM, Philadelphia (1992)"},{"issue":"3","key":"1554_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF01279451","volume":"7","author":"JP Dauer","year":"1995","unstructured":"Dauer, J.P., Fosnaugh, T.A.: Optimization over the efficient set. J. Glob. Optim. 7(3), 261\u2013277 (1995)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1554_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10898-010-9644-3","volume":"53","author":"J Hu","year":"2012","unstructured":"Hu, J., Mitchell, J.E., Pang, J.S., Yu, B.: On linear programs with linear complementarity constraints. J. Glob. Optim. 53(1), 29\u201351 (2012)","journal-title":"J. Glob. Optim."},{"key":"1554_CR10","volume-title":"50 Years of Integer Programming 1958\u20132008: From the Early Years to the State-of-the-Art","author":"M J\u00fcnger","year":"2009","unstructured":"J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A.: 50 Years of Integer Programming 1958\u20132008: From the Early Years to the State-of-the-Art. Springer, Berlin (2009)"},{"issue":"1","key":"1554_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0041-5553(80)90061-0","volume":"20","author":"LG Khachiyan","year":"1980","unstructured":"Khachiyan, L.G.: Polynomial algorithms in linear programming. USSR Comput. Math. Math. Phys. 20(1), 53\u201372 (1980)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"10","key":"1554_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.: Primal and dual algorithms for optimization over the efficient set. Optimization 67(10), 1661\u20131686 (2018)","journal-title":"Optimization"},{"issue":"4","key":"1554_CR13","first-page":"261","volume":"64","author":"K Lu","year":"2018","unstructured":"Lu, K., Mizuno, S., Shi, J.: A mixed integer programming approach for the minimum maximal flow. J. Oper. Res. Soc. Jpn. 64(4), 261\u2013271 (2018)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"1554_CR14","first-page":"70","volume":"2108","author":"K Lu","year":"2019","unstructured":"Lu, K., Mizuno, S., Shi, J.: Optimization over the efficient set of a linear multiobjective programming: Algorithm and applications. RIMS K\u00f4ky\u00fbroku 2108, 70\u201379 (2019)","journal-title":"RIMS K\u00f4ky\u00fbroku"},{"key":"1554_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511983658","volume-title":"Mathematical Programs with Equilibrium Constraints","author":"ZQ Luo","year":"1996","unstructured":"Luo, Z.Q., Pang, J.S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)"},{"issue":"1","key":"1554_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s00186-014-0470-0","volume":"80","author":"LD Muu","year":"2014","unstructured":"Muu, L.D., Thuy, L.Q.: On dc optimization algorithms for solving minmax flow problems. Math. Methods Oper. Res. 80(1), 83\u201397 (2014)","journal-title":"Math. Methods Oper. Res."},{"issue":"1","key":"1554_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01584543","volume":"2","author":"J Philip","year":"1972","unstructured":"Philip, J.: Algorithms for the vector maximization problem. Math. Program. 2(1), 207\u2013229 (1972)","journal-title":"Math. Program."},{"key":"1554_CR18","first-page":"217","volume":"28","author":"TQ Phong","year":"2000","unstructured":"Phong, T.Q., Tuyen, J.: Bisection search algorithm for optimizing over the efficient set. Vietnam J. Math. 28, 217\u2013226 (2000)","journal-title":"Vietnam J. Math."},{"key":"1554_CR19","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, London (1998)"},{"issue":"1","key":"1554_CR20","first-page":"271","volume":"22","author":"J Shi","year":"1997","unstructured":"Shi, J., Yamamoto, Y.: A global optimization method for minimum maximal flow problem. Acta Math. Vietnam. 22(1), 271\u2013287 (1997)","journal-title":"Acta Math. Vietnam."},{"issue":"4","key":"1554_CR21","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1023\/A:1022523615101","volume":"25","author":"M Shigeno","year":"2003","unstructured":"Shigeno, M., Takahashi, I., Yamamoto, Y.: Minimum maximal flow problem: an optimization over the efficient set. J. Glob. Optim. 25(4), 425\u2013443 (2003)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1554_CR22","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/s10957-016-1030-y","volume":"172","author":"E Sun","year":"2017","unstructured":"Sun, E.: On optimization over the efficient set of a multiple objective linear programming problem. J. Optim. Theory Appl. 172(1), 236\u2013246 (2017)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1554_CR23","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/BF02192205","volume":"88","author":"P Thach","year":"1996","unstructured":"Thach, P., Konno, H., Yokota, D.: Dual approach to minimization on the set of pareto-optimal solutions. J. Optim. Theory Appl. 88(3), 689\u2013707 (1996)","journal-title":"J. Optim. Theory Appl."},{"key":"1554_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31484-6","volume-title":"Convex Analysis and Global Optimization","author":"H Tuy","year":"2016","unstructured":"Tuy, H.: Convex Analysis and Global Optimization. Springer, Berlin (2016)"},{"issue":"1","key":"1554_CR25","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/BF01593807","volume":"12","author":"RE Wendell","year":"1977","unstructured":"Wendell, R.E., Lee, D.: Efficiency in multiple objective optimization problems. Math. Program. 12(1), 406\u2013414 (1977)","journal-title":"Math. Program."},{"issue":"1\u20134","key":"1554_CR26","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1013875600711","volume":"22","author":"Y Yamamoto","year":"2002","unstructured":"Yamamoto, Y.: Optimization over the efficient set: overview. J. Glob. Optim. 22(1\u20134), 285\u2013317 (2002)","journal-title":"J. Glob. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01554-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-020-01554-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01554-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T07:58:32Z","timestamp":1613721512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-020-01554-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,19]]},"references-count":26,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1554"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01554-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,19]]},"assertion":[{"value":"5 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}