{"id":"https://openalex.org/W2262591609","doi":"https://doi.org/10.11648/j.pamj.20160501.11","title":"The Modified Sequential Linear Goal Programming Method for Solving Multiple Objectives Linear Programming Problems","display_name":"The Modified Sequential Linear Goal Programming Method for Solving Multiple Objectives Linear Programming Problems","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2262591609","doi":"https://doi.org/10.11648/j.pamj.20160501.11","mag":"2262591609"},"language":"en","primary_location":{"id":"doi:10.11648/j.pamj.20160501.11","doi":"https://doi.org/10.11648/j.pamj.20160501.11","is_oa":true,"landing_page_url":"https://doi.org/10.11648/j.pamj.20160501.11","pdf_url":null,"source":{"id":"https://openalex.org/S2764787255","display_name":"Pure and Applied Mathematics Journal","issn_l":"2326-9790","issn":["2326-9790","2326-9812"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319272","host_organization_name":"Science Publishing Group","host_organization_lineage":["https://openalex.org/P4310319272"],"host_organization_lineage_names":["Science Publishing Group"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pure and Applied Mathematics Journal","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.11648/j.pamj.20160501.11","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055539677","display_name":"Geleta Tadele Mohammed","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Geleta Tadele Mohammed","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5055539677"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2803,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.59826775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":95},"biblio":{"volume":"5","issue":"1","first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multi-objective-linear-programming","display_name":"multi-objective linear programming","score":0.9070000052452087},{"id":"https://openalex.org/keywords/best-compromise-solution","display_name":"best compromise solution","score":0.8130000233650208},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"multi-objective optimization","score":0.6840000152587891},{"id":"https://openalex.org/keywords/conflicting-objectives","display_name":"conflicting objectives","score":0.5490000247955322}],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7587056756019592},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7509958744049072},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6592543721199036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.595546543598175},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.5206807851791382},{"id":"https://openalex.org/C61157135","wikidata":"https://www.wikidata.org/wiki/Q1345279","display_name":"Goal programming","level":2,"score":0.5195696353912354},{"id":"https://openalex.org/C191157680","wikidata":"https://www.wikidata.org/wiki/Q17085895","display_name":"Revised simplex method","level":4,"score":0.43639615178108215},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.4212411642074585},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35881590843200684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35298049449920654}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.11648/j.pamj.20160501.11","doi":"https://doi.org/10.11648/j.pamj.20160501.11","is_oa":true,"landing_page_url":"https://doi.org/10.11648/j.pamj.20160501.11","pdf_url":null,"source":{"id":"https://openalex.org/S2764787255","display_name":"Pure and Applied Mathematics Journal","issn_l":"2326-9790","issn":["2326-9790","2326-9812"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319272","host_organization_name":"Science Publishing Group","host_organization_lineage":["https://openalex.org/P4310319272"],"host_organization_lineage_names":["Science Publishing Group"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pure and Applied Mathematics Journal","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.11648/j.pamj.20160501.11","doi":"https://doi.org/10.11648/j.pamj.20160501.11","is_oa":true,"landing_page_url":"https://doi.org/10.11648/j.pamj.20160501.11","pdf_url":null,"source":{"id":"https://openalex.org/S2764787255","display_name":"Pure and Applied Mathematics Journal","issn_l":"2326-9790","issn":["2326-9790","2326-9812"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319272","host_organization_name":"Science Publishing Group","host_organization_lineage":["https://openalex.org/P4310319272"],"host_organization_lineage_names":["Science Publishing Group"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Pure and Applied Mathematics Journal","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2001368153","https://openalex.org/W2011002606","https://openalex.org/W2042532809","https://openalex.org/W2049251457","https://openalex.org/W2062176950","https://openalex.org/W2088932153","https://openalex.org/W2094476259","https://openalex.org/W2099681346"],"related_works":["https://openalex.org/W2011002606","https://openalex.org/W2095178757","https://openalex.org/W2995515589","https://openalex.org/W1989549564","https://openalex.org/W4307534210","https://openalex.org/W4285496801","https://openalex.org/W2176902835","https://openalex.org/W2331155470","https://openalex.org/W2008014456","https://openalex.org/W7211867845"],"abstract_inverted_index":{"Most":[0],"of":[1,20,58,104],"real":[2],"world":[3],"decision":[4],"making":[5],"problems":[6,24],"have":[7],"multiple":[8],"objectives,":[9],"which":[10,94],"cannot":[11],"be":[12,26,44],"optimized":[13],"simultaneously":[14],"due":[15],"to":[16,31,46,97],"the":[17,21,33,56,69,80],"conflicting":[18],"nature":[19],"objectives.":[22],"Such":[23],"can":[25,43],"solved":[27],"by":[28,114],"various":[29],"methods":[30],"obtain":[32],"best-compromise":[34],"solutions.":[35],"Modified":[36],"Sequential":[37],"Linear":[38,50,62],"Goal":[39],"Programming":[40,63],"(MSLGP)":[41],"method":[42,111],"used":[45,96],"solve":[47,98],"Multiple":[48],"Objective":[49],"programming":[51],"Problems.":[52],"In":[53,83],"this":[54,84],"paper,":[55],"use":[57],"existing":[59],"single":[60],"objective":[61],"(LP)":[64],"techniques":[65],"is":[66,87,95,112],"there,":[67],"and":[68,118],"information":[70],"required":[71],"for":[72],"MSLGP":[73,99],"in":[74],"each":[75],"iteration":[76],"are":[77],"taken":[78],"from":[79],"previous":[81],"iteration.":[82],"study,":[85],"there":[86],"a":[88],"great":[89],"Revised":[90],"Multi-phase":[91],"Simplex":[92],"Algorithm,":[93],"Accordingly":[100],"within":[101],"small":[102],"number":[103],"computations":[105],"as":[106,108],"much":[107],"possible.":[109],"This":[110],"illustrated":[113],"some":[115],"numerical":[116],"examples,":[117],"provides":[119],"\u2018best":[120],"compromise\u2019":[121],"solution.":[122]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}