A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
This paper concerns an optimization problem over the efficient set of a multiobjective linear programming problem. We propose and solve an equivalent mixed integer programming (MIP) problem to compute an optimal solution to the original problem. Compared with the previous MIP approach by Sun, the pr...
Gespeichert in:
| Veröffentlicht in: | Optimization letters Jg. 14; H. 8; S. 2323 - 2333 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.11.2020
|
| Schlagworte: | |
| ISSN: | 1862-4472, 1862-4480 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | This paper concerns an optimization problem over the efficient set of a multiobjective linear programming problem. We propose and solve an equivalent mixed integer programming (MIP) problem to compute an optimal solution to the original problem. Compared with the previous MIP approach by Sun, the proposed approach relaxes a strong assumption and reduces the numbers of constraints and binary variables of the MIP problem. By conducting numerical experiments, we find that the proposed approach is more accurate and faster than the previous MIP approach. The proposed MIP problem can be efficiently solved with current state-of-the-art MIP solvers when the objective function is convex or linear. |
|---|---|
| AbstractList | This paper concerns an optimization problem over the efficient set of a multiobjective linear programming problem. We propose and solve an equivalent mixed integer programming (MIP) problem to compute an optimal solution to the original problem. Compared with the previous MIP approach by Sun, the proposed approach relaxes a strong assumption and reduces the numbers of constraints and binary variables of the MIP problem. By conducting numerical experiments, we find that the proposed approach is more accurate and faster than the previous MIP approach. The proposed MIP problem can be efficiently solved with current state-of-the-art MIP solvers when the objective function is convex or linear. |
| Author | Shi, Jianming Mizuno, Shinji Lu, Kuan |
| Author_xml | – sequence: 1 givenname: Kuan orcidid: 0000-0002-7840-4318 surname: Lu fullname: Lu, Kuan email: lu.k.aa@m.titech.ac.jp organization: Tokyo Institute of Technology – sequence: 2 givenname: Shinji surname: Mizuno fullname: Mizuno, Shinji organization: Tokyo Institute of Technology – sequence: 3 givenname: Jianming surname: Shi fullname: Shi, Jianming organization: Tokyo University of Science |
| BookMark | eNp9kE1LAzEQhoNUsK3-AU_5A6vJ7mazeyzFLyh40XNIspM2ZTdZsmn9uPjXjVYEPfQwzAy8z8A8MzRx3gFCl5RcUUL49Ugpa0hG8lSUsTLjJ2hK6yrPyrImk9-Z52doNo5bQipKm2aKPhbYwQvu7Su02LoIawh4CH4dZN9bt8ZySJvUG2x8wH6ItrfvMlrvsN-naNwABmOstuAiHiFib7DE_a5LGbUFHe0ecGcdyL9306w66M_RqZHdCBc_fY6eb2-elvfZ6vHuYblYZbpgPGY5ANHEVIZWeVUwpVrFFAFaqpw0hvK2rDVvjKqbUlcFbzUzjTGMUU5kTVlRzFF9uKuDH8cARmgbv_-IQdpOUCK-RIqDSJFEim-Rgic0_4cOwfYyvB2HigM0prBLUsXW74JLLx6jPgHr6ItI |
| CitedBy_id | crossref_primary_10_1002_acs_3603 crossref_primary_10_1007_s11571_023_09998_0 crossref_primary_10_1080_01605682_2024_2416510 crossref_primary_10_1093_comjnl_bxaf100 crossref_primary_10_1109_ACCESS_2022_3213050 crossref_primary_10_1093_comjnl_bxae105 crossref_primary_10_1007_s00500_025_10550_x |
| Cites_doi | 10.1007/BF02192023 10.1007/978-3-319-31484-6 10.1017/CBO9780511983658 10.1007/BF00940077 10.1007/BF01582141 10.1007/s10898-011-9786-y 10.1023/A:1013875600711 10.1007/BF01593807 10.1007/s10957-016-1030-y 10.1016/0041-5553(80)90061-0 10.1016/0377-2217(86)90085-8 10.1023/A:1022523615101 10.1007/BF01279451 10.1007/BF01584543 10.1080/02331934.2018.1484922 10.1016/0167-6377(96)00022-3 10.1007/BF02192205 10.1007/s10898-010-9644-3 10.1007/s00186-014-0470-0 |
| ContentType | Journal Article |
| Copyright | Springer-Verlag GmbH Germany, part of Springer Nature 2020 |
| Copyright_xml | – notice: Springer-Verlag GmbH Germany, part of Springer Nature 2020 |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s11590-020-01554-7 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics |
| EISSN | 1862-4480 |
| EndPage | 2333 |
| ExternalDocumentID | 10_1007_s11590_020_01554_7 |
| GrantInformation_xml | – fundername: Grant-in-Aid for Science Research of Japan Society for the Promotion of Science grantid: (A) 19H00808; (C) 17K01272 |
| GroupedDBID | -5D -5G -BR -EM -Y2 -~C .VR 06D 0R~ 0VY 123 1N0 203 2J2 2JN 2JY 2KG 2KM 2LR 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBXA ABDZT ABECU ABFTV ABHQN ABJNI ABJOX ABKCH ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ AXYYD AYJHY B-. BA0 BAPOH BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HLICF HMJXF HQYDN HRMNR HZ~ IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z J9A JBSCW JCJTX JZLTJ KDC KOV LLZTM M4Y MA- N9A NPVJJ NQJWS NU0 O9- O93 O9J OAM P2P P9M PF0 PT4 QOS R89 R9I ROL RPX RSV S16 S1Z S27 S3B SAP SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7Y Z83 Z88 ZMTXR ~A9 AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC AEZWR AFDZB AFHIU AFOHR AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION |
| ID | FETCH-LOGICAL-c357t-2ee0c0f6f162635bbdb5b0e14b209f17d48c79fb894c637dc5f9ff55170a81533 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 11 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000516275000003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1862-4472 |
| IngestDate | Sat Nov 29 02:44:11 EST 2025 Tue Nov 18 21:42:03 EST 2025 Fri Feb 21 02:36:57 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 8 |
| Keywords | Mixed integer programming Global optimization Efficient set Linear complementarity conditions Multiobjective programming |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c357t-2ee0c0f6f162635bbdb5b0e14b209f17d48c79fb894c637dc5f9ff55170a81533 |
| ORCID | 0000-0002-7840-4318 |
| PageCount | 11 |
| ParticipantIDs | crossref_citationtrail_10_1007_s11590_020_01554_7 crossref_primary_10_1007_s11590_020_01554_7 springer_journals_10_1007_s11590_020_01554_7 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-11-01 |
| PublicationDateYYYYMMDD | 2020-11-01 |
| PublicationDate_xml | – month: 11 year: 2020 text: 2020-11-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg |
| PublicationTitle | Optimization letters |
| PublicationTitleAbbrev | Optim Lett |
| PublicationYear | 2020 |
| Publisher | Springer Berlin Heidelberg |
| Publisher_xml | – name: Springer Berlin Heidelberg |
| References | Tuy (CR24) 2016 Benson (CR4) 2012; 52 Schrijver (CR19) 1998 Yamamoto (CR26) 2002; 22 Cottle, Pang, Stone (CR7) 1992 Philip (CR17) 1972; 2 Luo, Pang, Ralph (CR15) 1996 Shi, Yamamoto (CR20) 1997; 22 Hu, Mitchell, Pang, Yu (CR9) 2012; 53 Bolintineanu (CR6) 1993; 61 Liu, Ehrgott (CR12) 2018; 67 Phong, Tuyen (CR18) 2000; 28 Dauer, Fosnaugh (CR8) 1995; 7 Shigeno, Takahashi, Yamamoto (CR21) 2003; 25 Sun (CR22) 2017; 172 Thach, Konno, Yokota (CR23) 1996; 88 Benson (CR2) 1986; 25 Jünger, Liebling, Naddef, Nemhauser, Pulleyblank, Reinelt, Rinaldi, Wolsey (CR10) 2009 Benson (CR3) 1992; 73 Benson, Lee (CR5) 1996; 88 Khachiyan (CR11) 1980; 20 Wendell, Lee (CR25) 1977; 12 An, Tao, Muu (CR1) 1996; 19 Muu, Thuy (CR16) 2014; 80 Lu, Mizuno, Shi (CR14) 2019; 2108 Lu, Mizuno, Shi (CR13) 2018; 64 ZQ Luo (1554_CR15) 1996 M Jünger (1554_CR10) 2009 RW Cottle (1554_CR7) 1992 HP Benson (1554_CR5) 1996; 88 LD Muu (1554_CR16) 2014; 80 HP Benson (1554_CR2) 1986; 25 LG Khachiyan (1554_CR11) 1980; 20 JP Dauer (1554_CR8) 1995; 7 LTH An (1554_CR1) 1996; 19 Z Liu (1554_CR12) 2018; 67 K Lu (1554_CR14) 2019; 2108 P Thach (1554_CR23) 1996; 88 K Lu (1554_CR13) 2018; 64 E Sun (1554_CR22) 2017; 172 A Schrijver (1554_CR19) 1998 H Tuy (1554_CR24) 2016 HP Benson (1554_CR4) 2012; 52 RE Wendell (1554_CR25) 1977; 12 J Hu (1554_CR9) 2012; 53 Y Yamamoto (1554_CR26) 2002; 22 M Shigeno (1554_CR21) 2003; 25 TQ Phong (1554_CR18) 2000; 28 HP Benson (1554_CR3) 1992; 73 S Bolintineanu (1554_CR6) 1993; 61 J Shi (1554_CR20) 1997; 22 J Philip (1554_CR17) 1972; 2 |
| References_xml | – volume: 22 start-page: 271 issue: 1 year: 1997 end-page: 287 ident: CR20 article-title: A global optimization method for minimum maximal flow problem publication-title: Acta Math. Vietnam. – volume: 28 start-page: 217 year: 2000 end-page: 226 ident: CR18 article-title: Bisection search algorithm for optimizing over the efficient set publication-title: Vietnam J. Math. – volume: 88 start-page: 77 issue: 1 year: 1996 end-page: 105 ident: CR5 article-title: Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem publication-title: J. Optim. Theory Appl. doi: 10.1007/BF02192023 – volume: 2108 start-page: 70 year: 2019 end-page: 79 ident: CR14 article-title: Optimization over the efficient set of a linear multiobjective programming: Algorithm and applications publication-title: RIMS Kôkyûroku – year: 2016 ident: CR24 publication-title: Convex Analysis and Global Optimization doi: 10.1007/978-3-319-31484-6 – year: 1996 ident: CR15 publication-title: Mathematical Programs with Equilibrium Constraints doi: 10.1017/CBO9780511983658 – volume: 73 start-page: 47 issue: 1 year: 1992 end-page: 64 ident: CR3 article-title: A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set publication-title: J. Optim. Theory Appl. doi: 10.1007/BF00940077 – volume: 61 start-page: 89 issue: 1–3 year: 1993 end-page: 110 ident: CR6 article-title: Minimization of a quasi-concave function over an efficient set publication-title: Math. Program. doi: 10.1007/BF01582141 – volume: 52 start-page: 553 issue: 3 year: 2012 end-page: 574 ident: CR4 article-title: An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem publication-title: J. Glob. Optim. doi: 10.1007/s10898-011-9786-y – volume: 22 start-page: 285 issue: 1–4 year: 2002 end-page: 317 ident: CR26 article-title: Optimization over the efficient set: overview publication-title: J. Glob. Optim. doi: 10.1023/A:1013875600711 – volume: 12 start-page: 406 issue: 1 year: 1977 end-page: 414 ident: CR25 article-title: Efficiency in multiple objective optimization problems publication-title: Math. Program. doi: 10.1007/BF01593807 – volume: 172 start-page: 236 issue: 1 year: 2017 end-page: 246 ident: CR22 article-title: On optimization over the efficient set of a multiple objective linear programming problem publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-016-1030-y – volume: 20 start-page: 53 issue: 1 year: 1980 end-page: 72 ident: CR11 article-title: Polynomial algorithms in linear programming publication-title: USSR Comput. Math. Math. Phys. doi: 10.1016/0041-5553(80)90061-0 – volume: 25 start-page: 192 issue: 2 year: 1986 end-page: 199 ident: CR2 article-title: An algorithm for optimizing over the weakly-efficient set publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(86)90085-8 – volume: 25 start-page: 425 issue: 4 year: 2003 end-page: 443 ident: CR21 article-title: Minimum maximal flow problem: an optimization over the efficient set publication-title: J. Glob. Optim. doi: 10.1023/A:1022523615101 – volume: 7 start-page: 261 issue: 3 year: 1995 end-page: 277 ident: CR8 article-title: Optimization over the efficient set publication-title: J. Glob. Optim. doi: 10.1007/BF01279451 – volume: 64 start-page: 261 issue: 4 year: 2018 end-page: 271 ident: CR13 article-title: A mixed integer programming approach for the minimum maximal flow publication-title: J. Oper. Res. Soc. Jpn. – volume: 2 start-page: 207 issue: 1 year: 1972 end-page: 229 ident: CR17 article-title: Algorithms for the vector maximization problem publication-title: Math. Program. doi: 10.1007/BF01584543 – year: 1992 ident: CR7 publication-title: The Linear Complementarity Problem – year: 2009 ident: CR10 publication-title: 50 Years of Integer Programming 1958–2008: From the Early Years to the State-of-the-Art – volume: 67 start-page: 1661 issue: 10 year: 2018 end-page: 1686 ident: CR12 article-title: Primal and dual algorithms for optimization over the efficient set publication-title: Optimization doi: 10.1080/02331934.2018.1484922 – volume: 19 start-page: 117 issue: 3 year: 1996 end-page: 128 ident: CR1 article-title: Numerical solution for optimization over the efficient set by dc optimization algorithms publication-title: Oper. Res. Lett. doi: 10.1016/0167-6377(96)00022-3 – volume: 88 start-page: 689 issue: 3 year: 1996 end-page: 707 ident: CR23 article-title: Dual approach to minimization on the set of pareto-optimal solutions publication-title: J. Optim. Theory Appl. doi: 10.1007/BF02192205 – year: 1998 ident: CR19 publication-title: Theory of Linear and Integer Programming – volume: 53 start-page: 29 issue: 1 year: 2012 end-page: 51 ident: CR9 article-title: On linear programs with linear complementarity constraints publication-title: J. Glob. Optim. doi: 10.1007/s10898-010-9644-3 – volume: 80 start-page: 83 issue: 1 year: 2014 end-page: 97 ident: CR16 article-title: On dc optimization algorithms for solving minmax flow problems publication-title: Math. Methods Oper. Res. doi: 10.1007/s00186-014-0470-0 – volume: 172 start-page: 236 issue: 1 year: 2017 ident: 1554_CR22 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-016-1030-y – volume: 19 start-page: 117 issue: 3 year: 1996 ident: 1554_CR1 publication-title: Oper. Res. Lett. doi: 10.1016/0167-6377(96)00022-3 – volume: 2 start-page: 207 issue: 1 year: 1972 ident: 1554_CR17 publication-title: Math. Program. doi: 10.1007/BF01584543 – volume: 73 start-page: 47 issue: 1 year: 1992 ident: 1554_CR3 publication-title: J. Optim. Theory Appl. doi: 10.1007/BF00940077 – volume-title: 50 Years of Integer Programming 1958–2008: From the Early Years to the State-of-the-Art year: 2009 ident: 1554_CR10 – volume: 53 start-page: 29 issue: 1 year: 2012 ident: 1554_CR9 publication-title: J. Glob. Optim. doi: 10.1007/s10898-010-9644-3 – volume: 25 start-page: 425 issue: 4 year: 2003 ident: 1554_CR21 publication-title: J. Glob. Optim. doi: 10.1023/A:1022523615101 – volume: 64 start-page: 261 issue: 4 year: 2018 ident: 1554_CR13 publication-title: J. Oper. Res. Soc. Jpn. – volume: 88 start-page: 689 issue: 3 year: 1996 ident: 1554_CR23 publication-title: J. Optim. Theory Appl. doi: 10.1007/BF02192205 – volume-title: Mathematical Programs with Equilibrium Constraints year: 1996 ident: 1554_CR15 doi: 10.1017/CBO9780511983658 – volume: 12 start-page: 406 issue: 1 year: 1977 ident: 1554_CR25 publication-title: Math. Program. doi: 10.1007/BF01593807 – volume-title: The Linear Complementarity Problem year: 1992 ident: 1554_CR7 – volume: 67 start-page: 1661 issue: 10 year: 2018 ident: 1554_CR12 publication-title: Optimization doi: 10.1080/02331934.2018.1484922 – volume: 22 start-page: 285 issue: 1–4 year: 2002 ident: 1554_CR26 publication-title: J. Glob. Optim. doi: 10.1023/A:1013875600711 – volume: 25 start-page: 192 issue: 2 year: 1986 ident: 1554_CR2 publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(86)90085-8 – volume-title: Convex Analysis and Global Optimization year: 2016 ident: 1554_CR24 doi: 10.1007/978-3-319-31484-6 – volume: 2108 start-page: 70 year: 2019 ident: 1554_CR14 publication-title: RIMS Kôkyûroku – volume: 61 start-page: 89 issue: 1–3 year: 1993 ident: 1554_CR6 publication-title: Math. Program. doi: 10.1007/BF01582141 – volume: 80 start-page: 83 issue: 1 year: 2014 ident: 1554_CR16 publication-title: Math. Methods Oper. Res. doi: 10.1007/s00186-014-0470-0 – volume: 28 start-page: 217 year: 2000 ident: 1554_CR18 publication-title: Vietnam J. Math. – volume: 52 start-page: 553 issue: 3 year: 2012 ident: 1554_CR4 publication-title: J. Glob. Optim. doi: 10.1007/s10898-011-9786-y – volume: 88 start-page: 77 issue: 1 year: 1996 ident: 1554_CR5 publication-title: J. Optim. Theory Appl. doi: 10.1007/BF02192023 – volume-title: Theory of Linear and Integer Programming year: 1998 ident: 1554_CR19 – volume: 20 start-page: 53 issue: 1 year: 1980 ident: 1554_CR11 publication-title: USSR Comput. Math. Math. Phys. doi: 10.1016/0041-5553(80)90061-0 – volume: 7 start-page: 261 issue: 3 year: 1995 ident: 1554_CR8 publication-title: J. Glob. Optim. doi: 10.1007/BF01279451 – volume: 22 start-page: 271 issue: 1 year: 1997 ident: 1554_CR20 publication-title: Acta Math. Vietnam. |
| SSID | ssj0061199 |
| Score | 2.2737398 |
| Snippet | This paper concerns an optimization problem over the efficient set of a multiobjective linear programming problem. We propose and solve an equivalent mixed... |
| SourceID | crossref springer |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 2323 |
| SubjectTerms | Computational Intelligence Mathematics Mathematics and Statistics Numerical and Computational Physics Operations Research/Decision Theory Optimization Original Paper Simulation |
| Title | A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem |
| URI | https://link.springer.com/article/10.1007/s11590-020-01554-7 |
| Volume | 14 |
| WOSCitedRecordID | wos000516275000003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: Springer LINK customDbUrl: eissn: 1862-4480 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0061199 issn: 1862-4472 databaseCode: RSV dateStart: 20070101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEA5aPejBt1hfzMGbBpJtdrN7LGLxoEV80duSbBKo2K50q3jzr5uk2daCFPS4MDssyWS-b8nMNwidiZizItICK0FTzBJFsGgxhjXTVLQiorjx6vo3vNtNe73sLjSFVXW1e30l6TP1rNnNIi_B7nfH4TzDfBmtWLhL3cCG-4fnOv8mdDI1kqauH4jxKLTK_O5jHo7m70I9xHQ2__dxW2gjUEpoT2JgGy3p4Q5a_yE0aJ9up-qs1S76aoMl0zDof2oFXi9CjyAUag2sPdRC42AZLZQ2qQxCtya4gk-wrkB76QmLWFDpMZQGBPjaxFK-TFIoOP4q5v2G6TV76Klz9Xh5jcMgBly0Yj7GkdakICYx1GvXSKlkLImmTEYkM5QrlhY8MzLNWJG0uCpikxljuRgnInWEch81huVQHyCQKhORikRMTcIyQyz9caKFVEhLnDOimojW-5EXQaXcDct4zWf6ym6pc7vUuV_qnDfR-fSdt4lGx0Lri3oL83BeqwXmh38zP0JrkYsC3614jBrj0bs-QavFx7hfjU59oH4DC-vjfA |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEA6-QD34FutzDt40kGyzm91jEUWxLaJVeluSTQKKbaVbxZt_3STNVgsi6HFhdliSyXzfkplvEDoWMWdFpAVWgqaYJYpgUWcMa6apqEdEcePV9Zu83U673ewmNIWVVbV7dSXpM_VXs5tFXoLd747DeYb5LJpnFrGcYv7t3UOVfxM6nhpJU9cPxHgUWmV-9jENR9N3oR5iLlb_93FraCVQSmiMY2Adzej-Blr-JjRon1oTddZyE300wJJp6D2-awVeL0IPIRRq9aw9VELjYBktDGxS6YVuTXAFn2BdgfbSExaxoNQjGBgQ4GsTB_JpnELB8Vcx7TdMr9lC9xfnnbNLHAYx4KIe8xGOtCYFMYmhXrtGSiVjSTRlMiKZoVyxtOCZkWnGiqTOVRGbzBjLxTgRqSOU22iuP-jrHQRSZSJSkYipSVhmiKU_TrSQCmmJc0ZUDdFqP_IiqJS7YRnP-Ze-slvq3C517pc65zV0MnnnZazR8av1abWFeTiv5S_mu38zP0KLl51WM29eta_30FLkIsJ3Lu6judHwVR-gheJt9FgOD33QfgK-fOZg |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEA66iujBt7g-5-BNg0k3bdrjoi6Kugg-8FaSJoEV98FuFW_-dZO01V2QBfFYmIYwSWa-kPm-QehIhJxlgRZYCRpjFimCRYMxrJmmohEQxY1X17_h7Xb8_JzcjbH4fbV79SRZcBqcSlMvPx0oc_pDfLNZmGB39XE5n2E-i-aYK6R39_X7pyoWR7ToIEljxw1iPChpM7-PMZmaJt9Ffbpprfx_oqtouYSa0Cz2xhqa0b11tDQmQGi_br9VW0cb6LMJFmRDt_OhFXgdCT2EsoCra-2hEiAHi3Shb4NNt2RxgisEBTsUaC9JYScII51D34AAX7PYly9FaAWHa8XkuGVXm0302Lp4OLvEZYMGnDVCnuNAa5IRExnqNW2kVDKURFMmA5IYyhWLM54YGScsixpcZaFJjLEYjRMRO6C5hWq9fk9vI5AqEYEKREhNxBJDLCxyYoZUSAuoE6LqiFZrk2alerlrovGa_uguO1en1tWpd3XK6-j4-59Bod0x1fqkWs60PMejKeY7fzM_RAt356305qp9vYsWA7chPKFxD9Xy4ZveR_PZe94ZDQ_8_v0CrtrvRA |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+new+mixed+integer+programming+approach+for+optimization+over+the+efficient+set+of+a+multiobjective+linear+programming+problem&rft.jtitle=Optimization+letters&rft.au=Lu%2C+Kuan&rft.au=Mizuno%2C+Shinji&rft.au=Shi%2C+Jianming&rft.date=2020-11-01&rft.issn=1862-4472&rft.eissn=1862-4480&rft.volume=14&rft.issue=8&rft.spage=2323&rft.epage=2333&rft_id=info:doi/10.1007%2Fs11590-020-01554-7&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s11590_020_01554_7 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1862-4472&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1862-4472&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1862-4472&client=summon |