Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
We present some complexity results on checking necessary efficiency in interval multiobjective linear programming. Supposing that objective function coefficients perturb within prescribed intervals, a feasible point x * is called necessarily efficient if it is efficient for all instances of interval...
Uložené v:
| Vydané v: | Optimization letters Ročník 6; číslo 5; s. 893 - 899 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Berlin/Heidelberg
Springer-Verlag
01.06.2012
|
| Predmet: | |
| ISSN: | 1862-4472, 1862-4480 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We present some complexity results on checking necessary efficiency in interval multiobjective linear programming. Supposing that objective function coefficients perturb within prescribed intervals, a feasible point
x
* is called necessarily efficient if it is efficient for all instances of interval data. We show that the problem of checking necessary efficiency is co-NP-complete even for the case of only one objective. Provided that
x
* is a non-degenerate basic solution, the problem is polynomially solvable for one objective, but remains co-NP-hard in the general case. Some open problems are mentioned at the end of the paper. |
|---|---|
| AbstractList | We present some complexity results on checking necessary efficiency in interval multiobjective linear programming. Supposing that objective function coefficients perturb within prescribed intervals, a feasible point
x
* is called necessarily efficient if it is efficient for all instances of interval data. We show that the problem of checking necessary efficiency is co-NP-complete even for the case of only one objective. Provided that
x
* is a non-degenerate basic solution, the problem is polynomially solvable for one objective, but remains co-NP-hard in the general case. Some open problems are mentioned at the end of the paper. |
| Author | Hladík, Milan |
| Author_xml | – sequence: 1 givenname: Milan surname: Hladík fullname: Hladík, Milan email: milan.hladik@matfyz.cz organization: Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University |
| BookMark | eNp9kM9KAzEQh4Mo2FYfwFteYDWzSbqboxT_QcGLnkM2O1lSdpOSbIt9e7dUPIgUBmYOv2-Y-ebkMsSAhNwBuwfGqocMIBUrGEDBOMgCLsgM6mVZCFGzy9-5Kq_JPOcNY0sApWakW8Vh2-OXHw80OhrQYs4mHSg6563HYA_Uh6lGTHvT094HNIluU-ySGQYfOmpCS4ddP_rYbNCOfo__pG7IlTN9xtufviCfz08fq9di_f7ytnpcF5ZLMRauldaaqq04x7ouaykrp1qUgjctBxRKLq1pXamsYK4EbCzUtmmUdQIMY5wvSHXaa1PMOaHT1o9mui2MyfheA9NHX_rkS0--9NGXhomEP-Q2-WFScZYpT0yesqHDpDdxl8L04BnoG14qgpo |
| CitedBy_id | crossref_primary_10_1007_s12597_013_0167_9 crossref_primary_10_1007_s10100_022_00804_6 crossref_primary_10_1016_j_ejor_2016_04_032 crossref_primary_10_1007_s10700_015_9226_4 crossref_primary_10_1007_s40305_016_0145_z crossref_primary_10_1007_s12597_021_00512_w crossref_primary_10_1016_j_ejor_2018_07_035 crossref_primary_10_1016_j_seps_2018_07_004 crossref_primary_10_1007_s10700_022_09383_2 crossref_primary_10_1016_j_ejor_2018_03_018 crossref_primary_10_1007_s40815_020_00800_5 crossref_primary_10_3390_sym15101883 crossref_primary_10_1016_j_ejor_2013_01_045 crossref_primary_10_1016_j_ins_2019_02_012 crossref_primary_10_1016_j_chaos_2022_112751 crossref_primary_10_3390_axioms14080569 crossref_primary_10_1016_j_amc_2015_08_003 crossref_primary_10_1007_s40819_015_0113_z crossref_primary_10_1016_j_ejor_2019_11_009 crossref_primary_10_1007_s11590_012_0589_y crossref_primary_10_1007_s11590_016_1088_3 crossref_primary_10_3390_math9141628 crossref_primary_10_1080_0305215X_2013_772602 crossref_primary_10_1016_j_ins_2018_01_006 crossref_primary_10_1007_s10100_014_0353_8 crossref_primary_10_1007_s10957_023_02311_3 |
| Cites_doi | 10.1023/B:REOM.0000032120.83979.d4 10.1287/mnsc.26.7.694 10.1016/S0893-9659(03)00071-5 10.1016/0165-0114(94)90206-2 10.1016/j.ejor.2005.12.042 10.1016/0165-0114(95)00169-7 10.1080/03081080008818644 10.1080/10556780802264204 10.1007/s10958-009-9606-9 10.1007/s10479-007-0186-0 10.1007/978-1-4757-3145-3 10.1515/9783112727553 10.1109/SCAN.2006.42 10.1007/978-3-662-12273-0 10.1007/978-3-642-56680-6_19 10.1002/zamm.19980781594 |
| ContentType | Journal Article |
| Copyright | Springer-Verlag 2011 |
| Copyright_xml | – notice: Springer-Verlag 2011 |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s11590-011-0315-1 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics |
| EISSN | 1862-4480 |
| EndPage | 899 |
| ExternalDocumentID | 10_1007_s11590_011_0315_1 |
| 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-c354t-fd5cca7d733e8828557f9de543bd31e4956cadf29c40f21ebc18cbb9cf41a0033 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 30 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000304624700007&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 | Tue Nov 18 21:23:44 EST 2025 Sat Nov 29 08:10:10 EST 2025 Fri Feb 21 02:42:30 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | Interval matrix Multiobjective linear programming Efficient solution NP-completeness |
| Language | English |
| License | http://www.springer.com/tdm |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c354t-fd5cca7d733e8828557f9de543bd31e4956cadf29c40f21ebc18cbb9cf41a0033 |
| PageCount | 7 |
| ParticipantIDs | crossref_citationtrail_10_1007_s11590_011_0315_1 crossref_primary_10_1007_s11590_011_0315_1 springer_journals_10_1007_s11590_011_0315_1 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-06-01 |
| PublicationDateYYYYMMDD | 2012-06-01 |
| PublicationDate_xml | – month: 06 year: 2012 text: 2012-06-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg |
| PublicationTitle | Optimization letters |
| PublicationTitleAbbrev | Optim Lett |
| PublicationYear | 2012 |
| Publisher | Springer-Verlag |
| Publisher_xml | – name: Springer-Verlag |
| References | Rohn (CR21) 1998; 78 Bitran (CR1) 1980; 26 Fiedler, Nedoma, Ramík, Rohn, Zimmermann (CR4) 2006 Inuiguchi, Sakawa (CR13) 1996; 78 CR8 CR19 CR7 Inuiguchi, Sakawa (CR12) 1994; 67 CR9 Rohn (CR22) 2000; 47 CR14 CR24 Ida (CR11) 2004; 10 Oliveira, Antunes (CR16) 2007; 181 Oliveira, Antunes (CR17) 2009; 161 Schrijver (CR23) 1998 Padberg (CR18) 1999 Hladík (CR6) 2008; 23 Rockafellar, Wets (CR20) 2004 Nožička, Grygarová, Lommatzsch (CR15) 1988 Ida (CR10) 2003; 16 Chinchuluun, Pardalos (CR2) 2007; 154 Ehrgott (CR3) 2005 Floudas, Pardalos (CR5) 2009 M. Ida (315_CR11) 2004; 10 M. Inuiguchi (315_CR13) 1996; 78 315_CR24 M. Hladík (315_CR6) 2008; 23 315_CR14 C. Oliveira (315_CR16) 2007; 181 R.T. Rockafellar (315_CR20) 2004 315_CR19 F. Nožička (315_CR15) 1988 A. Schrijver (315_CR23) 1998 M. Padberg (315_CR18) 1999 315_CR9 M. Ehrgott (315_CR3) 2005 315_CR7 A. Chinchuluun (315_CR2) 2007; 154 315_CR8 (315_CR5) 2009 G.R. Bitran (315_CR1) 1980; 26 M. Ida (315_CR10) 2003; 16 J. Rohn (315_CR22) 2000; 47 M. Fiedler (315_CR4) 2006 M. Inuiguchi (315_CR12) 1994; 67 C. Oliveira (315_CR17) 2009; 161 J. Rohn (315_CR21) 1998; 78 |
| References_xml | – volume: 10 start-page: 389 issue: 5 year: 2004 end-page: 400 ident: CR11 article-title: Solutions for the portfolio selection problem with interval and fuzzy coefficients publication-title: Reliab. Comput. doi: 10.1023/B:REOM.0000032120.83979.d4 – volume: 26 start-page: 694 year: 1980 end-page: 706 ident: CR1 article-title: Linear multiple objective problems with interval coefficients publication-title: Manage. Sci. doi: 10.1287/mnsc.26.7.694 – volume: 16 start-page: 709 issue: 5 year: 2003 end-page: 713 ident: CR10 article-title: Portfolio selection problem with interval coefficients publication-title: Appl. Math. Lett. doi: 10.1016/S0893-9659(03)00071-5 – ident: CR19 – volume: 67 start-page: 29 issue: 1 year: 1994 end-page: 46 ident: CR12 article-title: Possible and necessary optimality tests in possibilistic linear programming problems publication-title: Fuzzy Sets Syst. doi: 10.1016/0165-0114(94)90206-2 – ident: CR14 – volume: 78 start-page: S1051 issue: Supplement 3 year: 1998 end-page: S1052 ident: CR21 article-title: Linear programming with inexact data is NP-hard publication-title: Z. Angew. Math. Mech. (ZAMM) – ident: CR9 – volume: 181 start-page: 1434 issue: 3 year: 2007 end-page: 1463 ident: CR16 article-title: Multiple objective linear programming models with interval coefficients—an illustrated overview publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.12.042 – year: 2004 ident: CR20 publication-title: Variational Analysis. Corr. 2nd print – volume: 78 start-page: 231 issue: 2 year: 1996 end-page: 241 ident: CR13 article-title: Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test publication-title: Fuzzy Sets Syst. doi: 10.1016/0165-0114(95)00169-7 – ident: CR7 – ident: CR8 – volume: 47 start-page: 195 issue: 3 year: 2000 end-page: 204 ident: CR22 article-title: Computing the norm || || is NP-hard publication-title: Linear Multilinear Algebra doi: 10.1080/03081080008818644 – volume: 23 start-page: 731 issue: 5 year: 2008 end-page: 739 ident: CR6 article-title: Computing the tolerances in multiobjective linear programming publication-title: Optim. Methods Softw. doi: 10.1080/10556780802264204 – volume: 161 start-page: 854 issue: 6 year: 2009 end-page: 866 ident: CR17 article-title: An interactive method of tackling uncertainty in interval multiple objective linear programming publication-title: J. Math. Sci. doi: 10.1007/s10958-009-9606-9 – volume: 154 start-page: 29 year: 2007 end-page: 50 ident: CR2 article-title: A survey of recent developments in multiobjective optimization publication-title: Ann. Oper. Res. doi: 10.1007/s10479-007-0186-0 – year: 2006 ident: CR4 publication-title: Linear Optimization Problems with Inexact Data – year: 2005 ident: CR3 publication-title: Multicriteria Optimization – year: 2009 ident: CR5 publication-title: Encyclopedia of Optimization – ident: CR24 – year: 1988 ident: CR15 publication-title: Geometrie konvexer Mengen und konvexe Analysis – year: 1999 ident: CR18 publication-title: Linear optimization and extensions – year: 1998 ident: CR23 publication-title: Theory of Linear and Integer Programming. Repr – ident: 315_CR19 doi: 10.1007/978-1-4757-3145-3 – volume-title: Geometrie konvexer Mengen und konvexe Analysis year: 1988 ident: 315_CR15 doi: 10.1515/9783112727553 – volume-title: Theory of Linear and Integer Programming. Repr year: 1998 ident: 315_CR23 – volume-title: Multicriteria Optimization year: 2005 ident: 315_CR3 – volume: 23 start-page: 731 issue: 5 year: 2008 ident: 315_CR6 publication-title: Optim. Methods Softw. doi: 10.1080/10556780802264204 – volume: 67 start-page: 29 issue: 1 year: 1994 ident: 315_CR12 publication-title: Fuzzy Sets Syst. doi: 10.1016/0165-0114(94)90206-2 – volume: 16 start-page: 709 issue: 5 year: 2003 ident: 315_CR10 publication-title: Appl. Math. Lett. doi: 10.1016/S0893-9659(03)00071-5 – volume-title: Encyclopedia of Optimization year: 2009 ident: 315_CR5 – volume: 154 start-page: 29 year: 2007 ident: 315_CR2 publication-title: Ann. Oper. Res. doi: 10.1007/s10479-007-0186-0 – ident: 315_CR14 doi: 10.1109/SCAN.2006.42 – volume: 26 start-page: 694 year: 1980 ident: 315_CR1 publication-title: Manage. Sci. doi: 10.1287/mnsc.26.7.694 – volume-title: Linear optimization and extensions year: 1999 ident: 315_CR18 doi: 10.1007/978-3-662-12273-0 – ident: 315_CR9 – volume: 78 start-page: 231 issue: 2 year: 1996 ident: 315_CR13 publication-title: Fuzzy Sets Syst. doi: 10.1016/0165-0114(95)00169-7 – volume-title: Variational Analysis. Corr. 2nd print year: 2004 ident: 315_CR20 – ident: 315_CR8 – volume: 47 start-page: 195 issue: 3 year: 2000 ident: 315_CR22 publication-title: Linear Multilinear Algebra doi: 10.1080/03081080008818644 – ident: 315_CR7 – volume: 161 start-page: 854 issue: 6 year: 2009 ident: 315_CR17 publication-title: J. Math. Sci. doi: 10.1007/s10958-009-9606-9 – ident: 315_CR24 doi: 10.1007/978-3-642-56680-6_19 – volume-title: Linear Optimization Problems with Inexact Data year: 2006 ident: 315_CR4 – volume: 181 start-page: 1434 issue: 3 year: 2007 ident: 315_CR16 publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.12.042 – volume: 10 start-page: 389 issue: 5 year: 2004 ident: 315_CR11 publication-title: Reliab. Comput. doi: 10.1023/B:REOM.0000032120.83979.d4 – volume: 78 start-page: S1051 issue: Supplement 3 year: 1998 ident: 315_CR21 publication-title: Z. Angew. Math. Mech. (ZAMM) doi: 10.1002/zamm.19980781594 |
| SSID | ssj0061199 |
| Score | 2.0445135 |
| Snippet | We present some complexity results on checking necessary efficiency in interval multiobjective linear programming. Supposing that objective function... |
| SourceID | crossref springer |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 893 |
| SubjectTerms | Computational Intelligence Mathematics Mathematics and Statistics Numerical and Computational Physics Operations Research/Decision Theory Optimization Original Paper Simulation |
| Title | Complexity of necessary efficiency in interval linear programming and multiobjective linear programming |
| URI | https://link.springer.com/article/10.1007/s11590-011-0315-1 |
| Volume | 6 |
| WOSCitedRecordID | wos000304624700007&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 Journals New Starts & Take-Overs Collection 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/eLvHCXMwnV1LS8NAEF6ketCDb7G-2IMnJZDNbl5HEYsHLeKj9Bb2KRVNJYlC_707m6S1UAU9BiZDmJ3M7DDffIPQaaKUb7QBmn1bqzJBmCeIVl4USJ9qbrhyqxMGN3G_nwyH6V0zx122aPe2Jeki9WzYzWZeAFEBBIiEni15lm22S2Bfw_3DoA2_EamXRpIExoFYHLStzEUq5pPRfCfUJZjexr8-bROtN_dJfFE7wBZa0vk2WvvGMmifbqfUrOUOeoYIACyY1QSPDc41zAnwYoK1I5OASUw8yvHIYSGtZriG8gI3OK43qxHzXGEHRByLlzpeLpDaRU-9q8fLa6_ZtuBJGrLKMyq0pxmrmFKdAK9dGJtU6ZBRoSjRUEhJrkyQSuabgGghSSKFSKVhhMNKuD3Uyce53kc41aHNgVaDMjFLhT1wKU1k8x5nikZGdpHfmj2TDRU5bMR4zWYkymDRzFo0A4tmpIvOpq-81zwcvwmft-eUNb9k-bP0wZ-kD9Gq9eqgRosdoU5VfOhjtCI_q1FZnDhX_ALJVtsq |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF6kCurBt1ife_CkBLLJ5nUUsVRsi2gtvYV9SkVTSaLQf-9OHq2FKugxMBnC7GRmh_nmG4TOQyltrTTQ7JtalXJCLU6UtHxH2K5imslidcKgE_R64XAY3Vdz3FmNdq9bkkWkng27mcwLICqAABHPMiXPMjUJCwjzHx4Hdfj1Sbk0koQwDkQDp25lLlIxn4zmO6FFgmlt_uvTttBGdZ_EV6UDbKMlleyg9W8sg-apO6VmzXbRM0QAYMHMJ3iscaJgToClE6wKMgmYxMSjBI8KLKTRDNdQluIKx_VmNGKWSFwAEcf8pYyXC6T20FPrpn_dtqptC5ZwPZpbWnrmNAMZuK4KgdfOC3QklUddLl2ioJASTGonEtTWDlFckFBwHglNCYOVcPuokYwTdYBwpDyTA40GqQMacXPgQmjf5D1Gpetr0UR2bfZYVFTksBHjNZ6RKINFY2PRGCwakya6mL7yXvJw_CZ8WZ9TXP2S2c_Sh3-SPkOr7X63E3due3dHaM14uFMix45RI08_1AlaEZ_5KEtPC7f8AhiW3g4 |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEF5ERfTgW6zPPXhSQrPJ5nUUtSjWUlBLb2GfUtG0JFHov3cnj9ZCFcRjYDKE2cnMDvPNNwidhVLaWmmg2Te1KuWEWpwoafmOsF3FNJPF6oReO-h0wn4_6lZ7TrMa7V63JMuZBmBpSvLmSOrmdPDNZGEAVAEciHiWKX-WKODooVx_7NWh2CflAkkSwmgQDZy6rTlPxWximu2KFsmmtfHvz9xE69U9E1-WjrGFFlSyjda-sQ-ap4cJZWu2g14gMgA7Zj7GQ40TBfMDLB1jVZBMwIQmHiR4UGAkjWa4nrIUV_iud6MRs0TiAqA45K9lHJ0jtYueWzdPV7dWtYXBEq5Hc0tLz5xyIAPXVSHw3XmBjqTyqMulSxQUWIJJ7USC2tohigsSCs4joSlhsCpuDy0mw0TtIxwpz-RGo0HqgEbcOIIQ2jf5kFHp-lo0kF0fQSwqinLYlPEWT8mVwaKxsWgMFo1JA51PXhmV_By_CV_UZxZXv2r2s_TBn6RP0Ur3uhW37zr3h2jVOL5TAsqO0GKefqhjtCw-80GWnhQe-gX-Beby |
| 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=Complexity+of+necessary+efficiency+in+interval+linear+programming+and+multiobjective+linear+programming&rft.jtitle=Optimization+letters&rft.au=Hlad%C3%ADk%2C+Milan&rft.date=2012-06-01&rft.issn=1862-4472&rft.eissn=1862-4480&rft.volume=6&rft.issue=5&rft.spage=893&rft.epage=899&rft_id=info:doi/10.1007%2Fs11590-011-0315-1&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s11590_011_0315_1 |
| 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 |