{"id":"https://openalex.org/W7153134661","doi":"https://doi.org/10.1007/s12532-026-00316-3","title":"A novel linear optimization presolve technique based on Fourier-Motzkin elimination","display_name":"A novel linear optimization presolve technique based on Fourier-Motzkin elimination","publication_year":2026,"publication_date":"2026-04-10","ids":{"openalex":"https://openalex.org/W7153134661","doi":"https://doi.org/10.1007/s12532-026-00316-3"},"language":"en","primary_location":{"id":"doi:10.1007/s12532-026-00316-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-026-00316-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-026-00316-3.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s12532-026-00316-3.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100388096","display_name":"Yi Zhang","orcid":"https://orcid.org/0000-0002-0249-0547"},"institutions":[{"id":"https://openalex.org/I4210089412","display_name":"Applied Optimization (United States)","ror":"https://ror.org/004b0n253","country_code":"US","type":"company","lineage":["https://openalex.org/I4210089412"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yi Zhang","raw_affiliation_strings":["The Optimization Firm, LLC, GA, Atlanta, USA"],"raw_orcid":"https://orcid.org/0000-0002-0249-0547","affiliations":[{"raw_affiliation_string":"The Optimization Firm, LLC, GA, Atlanta, USA","institution_ids":["https://openalex.org/I4210089412"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010858186","display_name":"\u039d\u03b9\u03ba\u03cc\u03bb\u03b1\u03bf\u03c2 \u03a0\u03bb\u03cc\u03c3\u03ba\u03b1\u03c2","orcid":"https://orcid.org/0000-0001-5876-9945"},"institutions":[{"id":"https://openalex.org/I89506807","display_name":"University of Western Macedonia","ror":"https://ror.org/00a5pe906","country_code":"GR","type":"education","lineage":["https://openalex.org/I89506807"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Nikolaos Ploskas","raw_affiliation_strings":["Department of Electrical & Computer Engineering, University of Western Macedonia, Kozani, Greece"],"raw_orcid":"https://orcid.org/0000-0001-5876-9945","affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, University of Western Macedonia, Kozani, Greece","institution_ids":["https://openalex.org/I89506807"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5132739175","display_name":"Nikolaos V Sahinidis","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]},{"id":"https://openalex.org/I4210089412","display_name":"Applied Optimization (United States)","ror":"https://ror.org/004b0n253","country_code":"US","type":"company","lineage":["https://openalex.org/I4210089412"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nikolaos V. Sahinidis","raw_affiliation_strings":["H. Milton Stewart School of Industrial & Systems Engineering and School of Chemical & Biomolecular Engineering, Georgia Institute of Technology, Atlanta, GA, USA","The Optimization Firm, LLC, GA, Atlanta, USA"],"raw_orcid":"https://orcid.org/0000-0003-2087-9131","affiliations":[{"raw_affiliation_string":"H. Milton Stewart School of Industrial & Systems Engineering and School of Chemical & Biomolecular Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"The Optimization Firm, LLC, GA, Atlanta, USA","institution_ids":["https://openalex.org/I4210089412"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5132739175"],"corresponding_institution_ids":["https://openalex.org/I130701444","https://openalex.org/I4210089412"],"apc_list":{"value":2390,"currency":"EUR","value_usd":3090},"apc_paid":{"value":2390,"currency":"EUR","value_usd":3090},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.58416311,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"2","first_page":"345","last_page":"378"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.820900022983551,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.820900022983551,"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"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.033900000154972076,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.01730000041425228,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.8274000287055969},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.7849000096321106},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7078999876976013},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6421999931335449},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.5654000043869019},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4936999976634979},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.47760000824928284},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4318999946117401},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.42739999294281006}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.8274000287055969},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.7849000096321106},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7078999876976013},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6513000130653381},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6421999931335449},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5654000043869019},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.522599995136261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5012000203132629},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4936999976634979},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.47760000824928284},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4318999946117401},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.42739999294281006},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42170000076293945},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3959999978542328},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.39160001277923584},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.384799987077713},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.35929998755455017},{"id":"https://openalex.org/C169272836","wikidata":"https://www.wikidata.org/wiki/Q5668307","display_name":"Variable elimination","level":3,"score":0.3472999930381775},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.336899995803833},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.323199987411499},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3093999922275543},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.2922999858856201},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.2922999858856201},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.2614000141620636},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.2597000002861023},{"id":"https://openalex.org/C163175372","wikidata":"https://www.wikidata.org/wiki/Q3339222","display_name":"Linear model","level":2,"score":0.2565000057220459},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.2549999952316284}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s12532-026-00316-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-026-00316-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-026-00316-3.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s12532-026-00316-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-026-00316-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-026-00316-3.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7153134661.pdf","grobid_xml":"https://content.openalex.org/works/W7153134661.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W150927061","https://openalex.org/W1485566054","https://openalex.org/W1529128749","https://openalex.org/W1971910179","https://openalex.org/W1998899775","https://openalex.org/W2000472767","https://openalex.org/W2000600476","https://openalex.org/W2009073392","https://openalex.org/W2013168719","https://openalex.org/W2016761488","https://openalex.org/W2017610243","https://openalex.org/W2026514179","https://openalex.org/W2049890071","https://openalex.org/W2052256717","https://openalex.org/W2056219099","https://openalex.org/W2063558363","https://openalex.org/W2080197321","https://openalex.org/W2112502194","https://openalex.org/W2127470768","https://openalex.org/W2143693303","https://openalex.org/W2149454052","https://openalex.org/W2155258508","https://openalex.org/W2318318384","https://openalex.org/W2321711143","https://openalex.org/W2576928011","https://openalex.org/W2587095554","https://openalex.org/W2775458410","https://openalex.org/W2999184561","https://openalex.org/W3096446191","https://openalex.org/W4405054800"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Linear":[1],"optimization":[2,132],"solvers":[3,52],"commonly":[4],"employ":[5],"presolve":[6,48,63,115,169],"techniques":[7],"to":[8,54,74,92,103,161,172],"simplify":[9],"and":[10,78,126,180],"improve":[11],"the":[12,67,76,113,121,137,140,154],"solution":[13],"characteristics":[14],"of":[15,123,143,145],"models":[16,162],"before":[17],"a":[18,31,47,61,135],"simplex":[19,146],"or":[20],"interior":[21],"point":[22],"algorithm":[23,34,83,138],"is":[24],"used":[25],"for":[26,35,174],"solution.":[27],"The":[28,82],"Fourier-Motzkin":[29,68,117],"elimination,":[30,69],"well-known":[32],"mathematical":[33],"removing":[36],"columns":[37,91],"from":[38],"linear":[39,131],"inequality":[40],"systems,":[41],"has":[42],"not":[43],"been":[44],"utilized":[45],"as":[46],"method":[49,64],"in":[50,129,148],"existing":[51],"due":[53],"its":[55],"exponential":[56],"row":[57,85],"growth.":[58],"We":[59],"propose":[60],"novel":[62],"based":[65],"on":[66,99],"along":[70],"with":[71,116,153],"postsolve":[72],"algorithms":[73],"recover":[75],"primal":[77,176],"dual":[79,178],"optimal":[80],"solutions.":[81],"controls":[84],"growth":[86],"by":[87,167],"judiciously":[88],"selecting":[89],"which":[90],"eliminate":[93],"after":[94],"computing":[95],"an":[96],"upper":[97],"bound":[98],"model":[100],"size":[101],"prior":[102],"each":[104],"variable":[105],"elimination":[106,118],"step.":[107],"Our":[108],"computational":[109],"results":[110],"demonstrate":[111],"that":[112],"proposed":[114],"effectively":[119],"reduces":[120,139],"number":[122,142],"rows,":[124],"columns,":[125],"nonzero":[127],"elements":[128],"general":[130],"problems.":[133],"As":[134],"result,":[136],"total":[141],"iterations":[144],"methods":[147],"CPLEX.":[149],"Additionally,":[150],"when":[151],"combined":[152],"CPLEX":[155,168],"presolve,":[156],"our":[157],"FME":[158],"implementation":[159],"leads":[160],"smaller":[163],"than":[164],"those":[165],"obtained":[166],"alone,":[170],"leading":[171],"speed-ups":[173],"CPLEX\u2019s":[175],"simplex,":[177,179],"barrier":[181],"methods.":[182]},"counts_by_year":[],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2026-04-11T00:00:00"}