{"id":"https://openalex.org/W7204856088","doi":"https://doi.org/10.48550/arxiv.2608.27707","title":"Solution Methods for Infinite-Dimensional Generalized Disjunctive Programming","display_name":"Solution Methods for Infinite-Dimensional Generalized Disjunctive Programming","publication_year":2026,"publication_date":"2026-08-27","ids":{"openalex":"https://openalex.org/W7204856088","doi":"https://doi.org/10.48550/arxiv.2608.27707"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2608.27707","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.27707","pdf_url":"https://arxiv.org/pdf/2608.27707","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2608.27707","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5148769365","display_name":"Daniel Nguyen","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Nguyen, Daniel","raw_affiliation_strings":["Department of Chemical Engineering University of Waterloo , 200 University Ave W , Waterloo , ON N2L 3G1 , Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Chemical Engineering University of Waterloo , 200 University Ave W , Waterloo , ON N2L 3G1 , Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036452308","display_name":"Joshua L. Pulsipher","orcid":"https://orcid.org/0000-0002-7813-7870","observed_orcids":["https://orcid.org/0000-0002-7813-7870"]},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Pulsipher, Joshua L.","raw_affiliation_strings":["Department of Chemical Engineering University of Waterloo , 200 University Ave W , Waterloo , ON N2L 3G1 , Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Chemical Engineering University of Waterloo , 200 University Ave W , Waterloo , ON N2L 3G1 , Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9990000128746033,"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.9990000128746033,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.00019999999494757503,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/generalized-disjunctive-programming","display_name":"generalized disjunctive programming","score":0.9829999804496765},{"id":"https://openalex.org/keywords/infinite-dimensional-optimization","display_name":"infinite-dimensional optimization","score":0.972000002861023},{"id":"https://openalex.org/keywords/kriging-surrogate-model","display_name":"Kriging surrogate model","score":0.6069999933242798},{"id":"https://openalex.org/keywords/dynamic-optimization","display_name":"dynamic optimization","score":0.5709999799728394},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"stochastic optimization","score":0.9810000061988831}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5717999935150146},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5702999830245972},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5435000061988831},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48030000925064087},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4625999927520752},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4602999985218048},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45159998536109924},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.41830000281333923},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4120999872684479},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.41130000352859497},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3982999920845032},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.36739999055862427},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.34529998898506165},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34220001101493835},{"id":"https://openalex.org/C37423430","wikidata":"https://www.wikidata.org/wiki/Q6750281","display_name":"Hull","level":2,"score":0.3310999870300293},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.33059999346733093},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3273000121116638},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3199000060558319},{"id":"https://openalex.org/C136726353","wikidata":"https://www.wikidata.org/wiki/Q903789","display_name":"Disjunctive normal form","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.28859999775886536},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.2799000144004822},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2759000062942505},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.2621000111103058},{"id":"https://openalex.org/C2780394207","wikidata":"https://www.wikidata.org/wiki/Q7449304","display_name":"Semi-infinite programming","level":3,"score":0.26089999079704285},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2574000060558319},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2551000118255615},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.25380000472068787}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2608.27707","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.27707","pdf_url":"https://arxiv.org/pdf/2608.27707","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2608.27707","doi":"https://doi.org/10.48550/arxiv.2608.27707","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2608.27707","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2608.27707","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.27707","pdf_url":"https://arxiv.org/pdf/2608.27707","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322676","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7204856088.pdf","grobid_xml":"https://content.openalex.org/works/W7204856088.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4409351598","https://openalex.org/W976882809","https://openalex.org/W6884745535","https://openalex.org/W6959601608","https://openalex.org/W7097478258","https://openalex.org/W2962470881","https://openalex.org/W4292918120","https://openalex.org/W4229818549","https://openalex.org/W2234456864","https://openalex.org/W2810113033"],"abstract_inverted_index":{"Generalized":[0],"disjunctive":[1],"programming":[2],"(GDP)":[3],"expresses":[4],"mixed":[5],"discrete-continuous":[6],"decisions":[7],"through":[8],"Boolean":[9],"indicators":[10],"and":[11,13,42,48,89,143,157],"disjunctions,":[12],"can":[14,154],"be":[15],"systematically":[16],"solved":[17],"via":[18],"a":[19,99,116,168],"library":[20],"of":[21,54,103,119,164,170],"methods":[22,76,134,153],"proposed":[23],"in":[24,128,141],"the":[25,46,51,55,62,80,90,108,112,120,129,150,162],"literature.":[26],"The":[27,133,146],"recent":[28],"InfiniteGDP":[29],"abstraction":[30],"lifts":[31],"this":[32,68],"modeling":[33],"layer":[34],"to":[35,61,77],"continuous":[36],"domains":[37],"such":[38],"as":[39],"time,":[40],"space,":[41],"uncertainty,":[43],"but":[44],"only":[45],"big-M":[47,82,105,109,156,166],"hull":[49],"reformulations,":[50],"two":[52],"endpoints":[53],"relaxation":[56],"spectrum,":[57],"have":[58],"been":[59],"generalized":[60,151],"infinite":[63,113],"setting.":[64],"This":[65],"work":[66],"closes":[67],"gap":[69],"by":[70],"generalizing":[71],"four":[72],"other":[73],"GDP":[74],"solution":[75,152],"infinite-dimensional":[78],"optimization:":[79],"multiple":[81,104,165],"reformulation,":[83,85,88],"P-split":[84],"cutting":[86],"plane":[87],"logic-based":[91],"outer":[92],"approximation":[93],"algorithm.":[94],"It":[95],"further":[96],"proposes":[97],"MBM-GP,":[98],"novel":[100],"Gaussian-process":[101],"variant":[102],"that":[106],"learns":[107],"function":[110],"over":[111],"domain":[114],"from":[115],"small":[117],"subset":[118],"subproblem":[121],"solves.":[122],"Moreover,":[123],"these":[124],"approaches":[125],"are":[126,135],"implemented":[127],"Julia":[130],"package":[131],"InfiniteDisjunctiveProgramming.jl.":[132],"benchmarked":[136],"on":[137],"case":[138],"studies":[139],"arising":[140],"dynamic":[142],"stochastic":[144],"optimization.":[145],"results":[147],"demonstrate":[148],"how":[149],"outperform":[155],"hull,":[158],"with":[159],"MBM-GP":[160],"retaining":[161],"tightness":[163],"at":[167],"fraction":[169],"its":[171],"reformulation":[172],"cost.":[173]},"counts_by_year":[],"updated_date":"2026-11-06T12:05:46.655746","created_date":"2026-09-01T00:00:00"}