On the simplex, interior-point and objective space approaches to multiobjective linear programming
Most Multiple Objective Linear Programming (MOLP) algorithms working in the decision variable space, are based on the simplex algorithm or interior-point method of Linear Programming. However, objective space based methods are becoming more and more prominent. This paper investigates three algorithm...
Saved in:
| Published in: | Journal of algorithms & computational technology Vol. 15 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
London, England
SAGE Publications
01.10.2021
Sage Publications Ltd SAGE Publishing |
| Subjects: | |
| ISSN: | 1748-3018, 1748-3026 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Most Multiple Objective Linear Programming (MOLP) algorithms working in the decision variable space, are based on the simplex algorithm or interior-point method of Linear Programming. However, objective space based methods are becoming more and more prominent. This paper investigates three algorithms namely the Extended Multiobjective Simplex Algorithm (EMSA), Arbel’s Affine Scaling Interior-point (ASIMOLP) algorithm and Benson’s objective space Outer Approximation (BOA) algorithm. An extensive review of these algorithms is also included. Numerical results on non-trivial MOLP problems show that EMSA and BOA are at par and superior in terms of the quality of a most preferred nondominated point to ASIMOLP. However, ASIMOLP more than holds its own in terms of computing efficiency. |
|---|---|
| AbstractList | Most Multiple Objective Linear Programming (MOLP) algorithms working in the decision variable space, are based on the simplex algorithm or interior-point method of Linear Programming. However, objective space based methods are becoming more and more prominent. This paper investigates three algorithms namely the Extended Multiobjective Simplex Algorithm (EMSA), Arbel’s Affine Scaling Interior-point (ASIMOLP) algorithm and Benson’s objective space Outer Approximation (BOA) algorithm. An extensive review of these algorithms is also included. Numerical results on non-trivial MOLP problems show that EMSA and BOA are at par and superior in terms of the quality of a most preferred nondominated point to ASIMOLP. However, ASIMOLP more than holds its own in terms of computing efficiency. |
| Author | Nyiam, Paschal B Salhi, Abdellah |
| Author_xml | – sequence: 1 givenname: Paschal B orcidid: 0000-0003-2535-3526 surname: Nyiam fullname: Nyiam, Paschal B organization: Department of Mathematical Sciences, University of Essex, Colchester, UK – sequence: 2 givenname: Abdellah surname: Salhi fullname: Salhi, Abdellah organization: Department of Mathematical Sciences, University of Essex, Colchester, UK |
| BookMark | eNp9UcFq3TAQFCGFpGk-oDdBrnWilfwi-VhCmwYCubRnsZbXL3rYkiPplfbvK_eVBFpSgdAyzMyOdt-y4xADMfYexCWA1legW6OEvJYAQpgW2iN2umLNCh4_12BO2HnOO1GPktqAOmX9Q-DlkXj28zLRjw_ch0LJx9QssZYcw8BjvyNX_PfKWtARx2VJEd0jZV4in_dT8S-UyQfCxCtjm3Cefdi-Y29GnDKd_3nP2LfPn77efGnuH27vbj7eN66VUJpu0w1Yr25H6lXnQGrdYw3pjIFu1A5BmlaOxokOrlEOZKDXSislRnJyVGfs7uA7RNzZJfkZ008b0dvfQExbi6l4N5GtNoTODZsWoaVRG1xbb3AUSnVms3pdHLzqP572lIvdxX0KNb6tY-7WWStRWXBguRRzTjQ-dwVh183YfzZTNfovjfMF6wRDSein_yovD8qMW3rJ87rgF7CXoMI |
| CitedBy_id | crossref_primary_10_1080_19427867_2025_2548544 crossref_primary_10_1007_s00500_025_10550_x |
| Cites_doi | 10.1057/jors.1977.147 10.1007/s10589-015-9760-6 10.1016/j.ejor.2008.10.003 10.1007/978-3-642-18351-5 10.1007/BF01580111 10.1007/s10107-016-1061-z 10.1023/A:1022614814789 10.1016/0022-247X(75)90189-4 10.1016/S0377-2217(02)00595-7 10.1051/ro/197408V300511 10.1057/jors.1994.46 10.1007/s10898-013-0098-2 10.1007/BF01584348 10.1057/jors.1994.9 10.1007/BF00935493 10.1057/palgrave.jors.2602589 10.1007/BF01584543 10.1007/978-3-642-80808-1 10.1007/s00186-008-0220-2 10.1145/800057.808695 10.1287/mnsc.23.2.159 10.1023/A:1022628612489 10.1016/0895-7177(93)90173-V 10.1090/conm/114/1097882 10.1007/BF00941298 10.1007/s00186-007-0194-5 10.1023/A:1008215702611 10.1007/BF01588968 10.1016/0305-0548(93)90059-R 10.1007/978-94-017-3383-0 10.1007/s10898-013-0136-0 10.1016/0377-2217(77)90063-7 10.1002/cae.21601 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2021 The Author(s) 2021. This work is licensed under the Creative Commons Attribution License https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: The Author(s) 2021 – notice: The Author(s) 2021. This work is licensed under the Creative Commons Attribution License https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | AFRWT AAYXX CITATION 3V. 7SC 7XB 8FD 8FK 8G5 ABUWG AFKRA AZQEC BENPR CCPQU DWQXO GNUQQ GUQSH JQ2 L7M L~C L~D M2O MBDVC PHGZM PHGZT PIMPY PKEHL PQEST PQQKQ PQUKI PRINS Q9U DOA |
| DOI | 10.1177/17483026211008414 |
| DatabaseName | Sage Journals GOLD Open Access 2024 CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Technology Research Database ProQuest Central (Alumni) (purchase pre-March 2016) Research Library (Alumni Edition) ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central ProQuest One Community College ProQuest Central ProQuest Central Student Research Library Prep ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Research Library Research Library (Corporate) ProQuest Central Premium ProQuest One Academic ProQuest - Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef Publicly Available Content Database Research Library Prep ProQuest Central Student Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) ProQuest One Community College Research Library (Alumni Edition) ProQuest Central China ProQuest Central ProQuest Central Korea ProQuest Research Library ProQuest Central (New) Advanced Technologies Database with Aerospace ProQuest Central Basic ProQuest One Academic Eastern Edition Computer and Information Systems Abstracts Professional ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) |
| DatabaseTitleList | CrossRef Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1748-3026 |
| ExternalDocumentID | oai_doaj_org_article_42feaccd54a14ef78ada595af033985f 10_1177_17483026211008414 10.1177_17483026211008414 |
| GrantInformation_xml | – fundername: Economic and Social Research Council grantid: ES/L011859/1 funderid: https://doi.org/10.13039/501100000269 |
| GroupedDBID | .4S .DC 0R~ 29J 4.4 54M 5GY 5VS 8G5 AAJPV AAOTM AASGM AATZT ABAWP ABQXT ABUWG ACDXX ACGFS ACROE ADBBV ADEBD ADMLS ADOGD AEDFJ AEWDL AFCOW AFKRA AFKRG AFRWT AJUZI ALMA_UNASSIGNED_HOLDINGS AMVHM ARCSS AUTPY AYAKG AZQEC BCNDV BDDNI BENPR BPHCQ CCPQU CKLRP CS3 DWQXO EBS EDO EJD F5P GNUQQ GROUPED_DOAJ GUQSH H13 IL9 IPNFZ J8X J9A K.F KQ8 M2O MET MK~ MV1 O9- OK1 P2P PHGZM PHGZT PIMPY PQQKQ RIG ROL SAUOL SCDPB SCNPE SFC AAYXX ACHEB AFFHD CITATION 3V. 7SC 7XB 8FD 8FK JQ2 L7M L~C L~D MBDVC PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c421t-959da59d74feb39c1277ba813c8819f7ca12842f8c0916a2de81b737330fec2f3 |
| IEDL.DBID | BENPR |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000710554900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1748-3018 |
| IngestDate | Fri Oct 03 12:43:45 EDT 2025 Sun Nov 09 08:45:02 EST 2025 Tue Nov 18 22:04:06 EST 2025 Sat Nov 29 08:16:05 EST 2025 Tue Jun 17 22:29:28 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | affine scaling interior MOLP algorithm outer-approximation algorithm multiobjective simplex algorithm most preferred nondominated point Multiple objective linear programming |
| Language | English |
| License | Creative Commons CC BY: This article is distributed under the terms of the Creative Commons Attribution 4.0 License (https://creativecommons.org/licenses/by/4.0/) which permits any use, reproduction and distribution of the work without further permission provided the original work is attributed as specified on the SAGE and Open Access pages (https://us.sagepub.com/en-us/nam/open-access-at-sage). |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c421t-959da59d74feb39c1277ba813c8819f7ca12842f8c0916a2de81b737330fec2f3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0003-2535-3526 |
| OpenAccessLink | https://www.proquest.com/docview/2629026230?pq-origsite=%requestingapplication% |
| PQID | 2629026230 |
| PQPubID | 4450829 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_42feaccd54a14ef78ada595af033985f proquest_journals_2629026230 crossref_primary_10_1177_17483026211008414 crossref_citationtrail_10_1177_17483026211008414 sage_journals_10_1177_17483026211008414 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-10-01 |
| PublicationDateYYYYMMDD | 2021-10-01 |
| PublicationDate_xml | – month: 10 year: 2021 text: 2021-10-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | London, England |
| PublicationPlace_xml | – name: London, England – name: Brentwood |
| PublicationTitle | Journal of algorithms & computational technology |
| PublicationYear | 2021 |
| Publisher | SAGE Publications Sage Publications Ltd SAGE Publishing |
| Publisher_xml | – name: SAGE Publications – name: Sage Publications Ltd – name: SAGE Publishing |
| References | Junior, Lins 2009; 60 Shao, Ehrgott 2008; 68 Ehrgott, Tenfelde-Podehl 2003; 151 Arbel 1993; 17 Yu, Zeleny 1975; 49 Hamel, Löhne, Rudloff 2014; 59 Lin, Chen, Chen 2006; 17 Abhyankar, Morin, Trafalis 1990; 114 Arbel 1994; 45 Ecker, Hegner, Kouada 1980; 30 Armand, Malivert 1991; 70 Philip 1977; 13 Benson 1998; 97 Ecker, Kouada 1978; 14 Löhne, Rudloff, Ulus 2014; 60 Benson 1998; 13 Rudloff, Ulus, Vanderbei 2017; 163 Yu, Zeleny 1976; 23 Csirmaz 2016; 63 Benson 1998; 98 Philip 1972; 2 Isermann 1977; 28 Gal 1977; 1 Alves, Costa 2009; 198 Arbel 1993; 20 Alves, Antunes, Clímaco 2015; 23 Weng, Wen 2001; 18 Evans, Steuer 1973; 5 Schechter, Steuer 2005; 30 Yu, Zeleny 1974; 8 bibr9-17483026211008414 Saaty TL. (bibr29-17483026211008414) 1980 bibr21-17483026211008414 Weng WT (bibr33-17483026211008414) 2001; 18 bibr47-17483026211008414 bibr6-17483026211008414 bibr3-17483026211008414 Lin C (bibr32-17483026211008414) 2006; 17 Zeleny M. (bibr44-17483026211008414) 1982 Yu P (bibr13-17483026211008414) 1974; 8 Steuer RE. (bibr12-17483026211008414) 2003 bibr14-17483026211008414 bibr27-17483026211008414 bibr37-17483026211008414 bibr1-17483026211008414 Steuer RE. (bibr19-17483026211008414) 1986 Schechter M (bibr25-17483026211008414) 2005; 30 bibr11-17483026211008414 bibr7-17483026211008414 bibr31-17483026211008414 bibr34-17483026211008414 bibr24-17483026211008414 bibr41-17483026211008414 bibr28-17483026211008414 Ehrgott M. (bibr4-17483026211008414) 2006 bibr15-17483026211008414 bibr18-17483026211008414 bibr5-17483026211008414 bibr2-17483026211008414 bibr22-17483026211008414 bibr30-17483026211008414 bibr43-17483026211008414 bibr20-17483026211008414 bibr45-17483026211008414 bibr35-17483026211008414 bibr40-17483026211008414 bibr10-17483026211008414 bibr38-17483026211008414 bibr48-17483026211008414 bibr23-17483026211008414 bibr42-17483026211008414 Eiselt HA (bibr8-17483026211008414) 2007 bibr46-17483026211008414 bibr16-17483026211008414 bibr39-17483026211008414 bibr26-17483026211008414 bibr36-17483026211008414 Isermann H (bibr17-17483026211008414) 1984 |
| References_xml | – volume: 45 start-page: 83 year: 1994 end-page: 96 article-title: Anchoring points and cones of opportunities in interior multiobjective linear programming publication-title: J Oper Res Soc – volume: 68 start-page: 469 year: 2008 end-page: 492 article-title: Approximating the nondominated set of an MOLP by approximately solving its dual problem publication-title: Math Methods Oper Res – volume: 30 start-page: 351 year: 2005 end-page: 360 article-title: A correction to the connectedness of the Evans-Steuer algorithm of multiple objective linear programming publication-title: Found Comput Decis Sci – volume: 17 start-page: 27 year: 1993 end-page: 39 article-title: A weighted-gradient approach to multi-objective linear programming problems using the analytic hierarchy process publication-title: Math Comput Modell – volume: 13 start-page: 1 year: 1998 end-page: 24 article-title: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem publication-title: J Glob Optim – volume: 70 start-page: 467 year: 1991 end-page: 489 article-title: Determination of the efficient set in multiobjective linear programming publication-title: J Optim Theory Appl – volume: 114 start-page: 319 year: 1990 end-page: 341 article-title: Efficient faces of polytopes: interior point algorithms, parametrization of algebraic varieties, and multiple objective optimization publication-title: Contemp Math – volume: 28 start-page: 711 year: 1977 end-page: 725 article-title: The enumeration of the set of all efficient solutions for a linear multiple objective program publication-title: J Oper Res Soc – volume: 18 start-page: 21 year: 2001 end-page: 30 article-title: An interior point algorithm for solving linear optimization over the efficient set problems publication-title: J Chin Inst Ind Eng – volume: 13 start-page: 357 year: 1977 end-page: 359 article-title: Vector maximization at a degenerate vertex publication-title: Math Program – volume: 1 start-page: 307 year: 1977 end-page: 322 article-title: A general method for determining the set of all efficient solutions to a linear vectormaximum problem publication-title: Eur J Oper Res – volume: 49 start-page: 430 year: 1975 end-page: 468 article-title: The set of all nondominated solutions in linear cases and a multicriteria simplex method publication-title: J Math Anal Appl – volume: 98 start-page: 17 year: 1998 end-page: 35 article-title: Hybrid approach for solving multiple-objective linear programs in outcome space publication-title: J Optim Theory Appl – volume: 17 start-page: 107 year: 2006 article-title: On the modified interior point algorithm for solving multi-objective linear programming problems publication-title: Int J Inform Manag Sci – volume: 60 start-page: 713 year: 2014 end-page: 736 article-title: Primal and dual approximation algorithms for convex vector optimization problems publication-title: J Glob Optim – volume: 60 start-page: 728 year: 2009 end-page: 733 article-title: A WIN-WIN approach to multiple objective linear programming problems publication-title: J Oper Res Soc – volume: 8 start-page: 51 year: 1974 end-page: 71 article-title: The techniques of linear multiobjective programming publication-title: Rairo Recherche Opérationnelle – volume: 5 start-page: 54 year: 1973 end-page: 72 article-title: A revised simplex method for linear multiple objective programs publication-title: Math Program – volume: 59 start-page: 811 year: 2014 end-page: 836 article-title: Benson type algorithms for linear vector optimization and applications publication-title: J Glob Optim – volume: 23 start-page: 159 year: 1976 end-page: 170 article-title: Linear multiparametric programming by multicriteria simplex method publication-title: Manage Sci – volume: 30 start-page: 353 year: 1980 end-page: 381 article-title: Generating all maximal efficient faces for multiple objective linear programs publication-title: J Optim Theory Appl – volume: 68 start-page: 257 year: 2008 end-page: 276 article-title: Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning publication-title: Math Meth Oper Res – volume: 97 start-page: 1 year: 1998 end-page: 10 article-title: Further analysis of an outcome set-based algorithm for multiple objective linear programming publication-title: J Optim Theory Appl – volume: 63 start-page: 45 year: 2016 end-page: 67 article-title: Using multiobjective optimization to map the entropy region publication-title: Comput Optim Appl – volume: 163 start-page: 213 year: 2017 end-page: 230 article-title: A parametric simplex algorithm for linear vector optimization problems publication-title: Math Program – volume: 14 start-page: 249 year: 1978 end-page: 261 article-title: Finding all efficient extreme points for multiple objective linear programs publication-title: Math Program – volume: 198 start-page: 637 year: 2009 end-page: 646 article-title: An exact method for computing the nadir values in multiple objective linear programming publication-title: Eur J Oper Res – volume: 151 start-page: 119 year: 2003 end-page: 139 article-title: Computation of ideal and nadir values and implications for their use in MCDM methods publication-title: Eur J Oper Res – volume: 20 start-page: 723 year: 1993 end-page: 735 article-title: An interior multiobjective linear programming algorithm publication-title: Comput Oper Res – volume: 45 start-page: 330 year: 1994 end-page: 344 article-title: Using efficient anchoring points for generating search directions in interior multiobjective linear programming publication-title: J Oper Res Soc – volume: 2 start-page: 207 year: 1972 end-page: 229 article-title: Algorithms for the vector maximization problem publication-title: Math Program – volume: 23 start-page: 314 year: 2015 end-page: 326 article-title: Interactive MOLP explorer: a graphical-based computational tool for teaching and decision support in multi-objective linear programming models publication-title: Comput Appl Eng Educ – ident: bibr16-17483026211008414 doi: 10.1057/jors.1977.147 – ident: bibr39-17483026211008414 doi: 10.1007/s10589-015-9760-6 – ident: bibr6-17483026211008414 doi: 10.1016/j.ejor.2008.10.003 – ident: bibr24-17483026211008414 doi: 10.1007/978-3-642-18351-5 – ident: bibr2-17483026211008414 doi: 10.1007/BF01580111 – volume-title: Multiple criteria optimization: theory, computation, and applications year: 1986 ident: bibr19-17483026211008414 – ident: bibr23-17483026211008414 doi: 10.1007/s10107-016-1061-z – ident: bibr34-17483026211008414 doi: 10.1023/A:1022614814789 – ident: bibr14-17483026211008414 doi: 10.1016/0022-247X(75)90189-4 – volume-title: The analytic hierarchy process: planning, priority setting, resources allocation year: 1980 ident: bibr29-17483026211008414 – ident: bibr45-17483026211008414 doi: 10.1016/S0377-2217(02)00595-7 – volume-title: Multiple criteria decision making year: 1982 ident: bibr44-17483026211008414 – volume: 18 start-page: 21 year: 2001 ident: bibr33-17483026211008414 publication-title: J Chin Inst Ind Eng – volume-title: Linear programming and its applications year: 2007 ident: bibr8-17483026211008414 – volume: 8 start-page: 51 year: 1974 ident: bibr13-17483026211008414 publication-title: Rairo Recherche Opérationnelle doi: 10.1051/ro/197408V300511 – ident: bibr42-17483026211008414 doi: 10.1057/jors.1994.46 – ident: bibr40-17483026211008414 doi: 10.1007/s10898-013-0098-2 – ident: bibr47-17483026211008414 – ident: bibr11-17483026211008414 doi: 10.1007/BF01584348 – volume-title: ADBASE: a multiple objective linear programming solver for all efficient extreme points and all unbounded efficient edges year: 2003 ident: bibr12-17483026211008414 – ident: bibr30-17483026211008414 doi: 10.1057/jors.1994.9 – ident: bibr21-17483026211008414 doi: 10.1007/BF00935493 – volume: 17 start-page: 107 year: 2006 ident: bibr32-17483026211008414 publication-title: Int J Inform Manag Sci – ident: bibr7-17483026211008414 doi: 10.1057/palgrave.jors.2602589 – ident: bibr9-17483026211008414 doi: 10.1007/BF01584543 – ident: bibr10-17483026211008414 doi: 10.1007/978-3-642-80808-1 – ident: bibr36-17483026211008414 doi: 10.1007/s00186-008-0220-2 – volume-title: Multicriteria optimization year: 2006 ident: bibr4-17483026211008414 – ident: bibr26-17483026211008414 doi: 10.1145/800057.808695 – ident: bibr35-17483026211008414 – ident: bibr15-17483026211008414 doi: 10.1287/mnsc.23.2.159 – ident: bibr5-17483026211008414 doi: 10.1023/A:1022628612489 – ident: bibr3-17483026211008414 doi: 10.1016/0895-7177(93)90173-V – ident: bibr27-17483026211008414 doi: 10.1090/conm/114/1097882 – volume: 30 start-page: 351 year: 2005 ident: bibr25-17483026211008414 publication-title: Found Comput Decis Sci – ident: bibr22-17483026211008414 doi: 10.1007/BF00941298 – volume-title: Operating manual for the EFFACET multiple objective linear programming package year: 1984 ident: bibr17-17483026211008414 – ident: bibr37-17483026211008414 doi: 10.1007/s00186-007-0194-5 – ident: bibr1-17483026211008414 doi: 10.1023/A:1008215702611 – ident: bibr38-17483026211008414 – ident: bibr31-17483026211008414 – ident: bibr20-17483026211008414 doi: 10.1007/BF01588968 – ident: bibr28-17483026211008414 doi: 10.1016/0305-0548(93)90059-R – ident: bibr43-17483026211008414 doi: 10.1007/978-94-017-3383-0 – ident: bibr41-17483026211008414 doi: 10.1007/s10898-013-0136-0 – ident: bibr18-17483026211008414 doi: 10.1016/0377-2217(77)90063-7 – ident: bibr46-17483026211008414 doi: 10.1002/cae.21601 – ident: bibr48-17483026211008414 |
| SSID | ssj0000327813 |
| Score | 2.1953113 |
| Snippet | Most Multiple Objective Linear Programming (MOLP) algorithms working in the decision variable space, are based on the simplex algorithm or interior-point... |
| SourceID | doaj proquest crossref sage |
| SourceType | Open Website Aggregation Database Enrichment Source Index Database Publisher |
| SubjectTerms | Algorithms Linear programming Mathematical analysis Multiple objective analysis Simplex method |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NS-UwEA-LeFgPy67u4vOLHARBLNsmaZMcV1G8-HFQ8FbSJANP3Fbat8v--c60fc8ni3rx1o-0GWam85uhw28Y2_dYoIGubOJTwAJFUxwslE9MBIdoEQoroR82oS8vzd2dvV4a9UU9YQM98KC4n0oAxgYfcuUyFUEbF1xucweplNbkQNE31XapmOpjsBTaZHL8jUkMS5h5E9VVQQVPalSmXgBRz9f_Islc6uvqoebsK_sy5oj81yDbN_Yp1uts7WJBsNptsOqq5njKuymx-_474kT70E6bNnls8JC7OvCmuh-iGceo4SOf04fHjs8a3ncSPi-hbNO1fGzX-o2A9p3dnp3enJwn47iExCuRzRKbW1JN0ArQANZnQuvKoRa8QdgH7R1hkQDjMUconAgRU1YttZQpRC9A_mArdVPHTcYdTd8Q-DKorNIVWJOKoHIogtdQiTBh6Vx3pR-5xGmkxUOZjfTh_6l7wg4XjzwORBpvLT4mgywWEgd2fwE9oxw9o3zPMyZsZ27OcvwwuxI3sbSTTCfsgEz8fOtVabY-Qppt9llQO0zfB7jDVmbtn7jLVv3f2bRr93rvfQLC_vBV priority: 102 providerName: Directory of Open Access Journals |
| Title | On the simplex, interior-point and objective space approaches to multiobjective linear programming |
| URI | https://journals.sagepub.com/doi/full/10.1177/17483026211008414 https://www.proquest.com/docview/2629026230 https://doaj.org/article/42feaccd54a14ef78ada595af033985f |
| Volume | 15 |
| WOSCitedRecordID | wos000710554900001&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: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1748-3026 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000327813 issn: 1748-3018 databaseCode: DOA dateStart: 20070101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1748-3026 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000327813 issn: 1748-3018 databaseCode: BENPR dateStart: 20160301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 1748-3026 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000327813 issn: 1748-3018 databaseCode: PIMPY dateStart: 20160301 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest – providerCode: PRVPQU databaseName: Research Library customDbUrl: eissn: 1748-3026 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000327813 issn: 1748-3018 databaseCode: M2O dateStart: 20160301 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELZKy4EeoBQQC23lA1KliojEdmL7hChqBYfdrlCRyily_ECLINkmC-LnM-P17lKh9sIhUeI4lu0Zz4zHo28IeWVhgxZkozObB9igSJSDlbCZ8sGAtnCV5iEmm5CTibq60tPkcBtSWOVKJkZB7TqLPvI3rGIa9gtgMb-dX2eYNQpPV1MKjXtkB5HKgM93Ts8m009rL0vOmVQxRzJY3ioDblbpaBNRl7CMY6OIm6ZEIW4op4jhf8Pw_CvWK6qf80f_2_E98jAZnvTdklMeky3f7pPd8Rq1dXhCmouWwisdZggZ_Ps1RSyJftb12byDR2paR7vm21JEUhBF1tMVJrkf6KKjMTxxUwVNWNPTFAP2A7TkU_L5_Ozy_Ycs5WDIrGDFItOldgYuKQJQVduCSdkYmFKrwJYI0hpUcCwoC4ZHZZjzYAdLLjnPg7cs8Gdku-1a_5xQgyk9GDQWGi1kE7TKmRNlqJyVoWFuRPLV5Nc2AZRjnozvdZEwyf-h14icrH-ZL9E57qp8ihRdV0Rg7VjQ9V_rtE5rGAqoIutKYQrhg1QGh1-akHOuVRlG5GBF5Tqt9qHekHhEjpFHNp9u7c2Luxt6SR4wjJ6JYYMHZHvR__SH5L79tZgN_VFi86PoQYD7mF1A2fTjePrlDzcVA9U |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VLRJwoDzVhRZ8ACEhIhLHie0DQryqrtpd9lCkcgqOY6NFNFmS5fWn-I3MZJNdKkRvPXCIlDiOZSfjediT7wN4YDFA8zLXgQ09BiiS9GAqbKCcN2gtilTHviWbkJOJOj7W0w341f8LQ2mVvU5sFXVRWVojf8pTrjFeQI_5-fxLQKxRtLvaU2gsxeLA_fyOIVvzbPQav-9DzvfeHL3aDzpWgcAKHi0CnejC4CGFx35qG3Epc6Oi2Cq0jl5aQyqbe2XRlKaGFw49OxlLDPy9s9zH2O4F2BQk7APYnI7G0_erVZ0w5lK1nMzo6asAZ4_qtlIJ5YnKYhoE4bQpEYlTxrDlDDjl6P6RW9aau72t_-1FXYOrnWPNXixnwnXYcOUNuDJeodI2NyF_WzK8ZM2MIJF_PGGElVHPqjqYV3jKTFmwKv-0NAEMVa11rMdcdw1bVKxNv1xXIRfd1KzLcTtBL-AWvDuXQd6GQVmVbhuYIcoSjo35XAuZe61CXojEp4WVPufFEML-Y2e2A2AnHpDPWdRhrv8lH0N4vHpkvkQfOavyS5KgVUUCDm8Lqvpj1umhDIeCptYWiTCRcF4qQ8NPjA_jWKvED2Gnl6qs02ZNthapITwimVzf-mdv7pzd0H24tH80PswOR5ODu3CZU6ZQmyK5A4NF_dXtwkX7bTFr6nvdFGPw4byF9TdM7Vyr |
| 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=On+the+simplex%2C+interior-point+and+objective+space+approaches+to+multiobjective+linear+programming&rft.jtitle=Journal+of+algorithms+%26+computational+technology&rft.au=Nyiam%2C+Paschal+B&rft.au=Salhi%2C+Abdellah&rft.date=2021-10-01&rft.issn=1748-3018&rft.eissn=1748-3026&rft.volume=15&rft_id=info:doi/10.1177%2F17483026211008414&rft.externalDBID=n%2Fa&rft.externalDocID=10_1177_17483026211008414 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1748-3018&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1748-3018&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1748-3018&client=summon |