{"id":"https://openalex.org/W2889230202","doi":"https://doi.org/10.1137/17m112470x","title":"Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations","display_name":"Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2889230202","doi":"https://doi.org/10.1137/17m112470x","mag":"2889230202"},"language":"en","primary_location":{"id":"doi:10.1137/17m112470x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m112470x","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090122844","display_name":"Denis A\u00dfmann","orcid":"https://orcid.org/0000-0002-6539-0308"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Denis A\u00dfmann","raw_affiliation_strings":["Friedrich-Alexander University Erlangen-N\u00fcrnberg"],"raw_orcid":"https://orcid.org/0000-0002-6539-0308","affiliations":[{"raw_affiliation_string":"Friedrich-Alexander University Erlangen-N\u00fcrnberg","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006613126","display_name":"Frauke Liers","orcid":"https://orcid.org/0000-0002-1671-0344"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frauke Liers","raw_affiliation_strings":["Friedrich-Alexander University Erlangen-N\u00fcrnberg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Friedrich-Alexander University Erlangen-N\u00fcrnberg","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013459854","display_name":"Michael Stingl","orcid":"https://orcid.org/0000-0002-3626-0723"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Stingl","raw_affiliation_strings":["Friedrich-Alexander University Erlangen-N\u00fcrnberg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Friedrich-Alexander University Erlangen-N\u00fcrnberg","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002345780","display_name":"Juan C. Vera","orcid":"https://orcid.org/0000-0003-1394-3422"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Juan C. Vera","raw_affiliation_strings":["Econometrics and Operations Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Econometrics and Operations Research","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1241,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.79294905,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"28","issue":"3","first_page":"2489","last_page":"2517"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11053","display_name":"Process Optimization and Integration","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T11053","display_name":"Process Optimization and Integration","score":0.9990000128746033,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9976000189781189,"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.9952999949455261,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7080710530281067},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6675437688827515},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.530686616897583},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.49223819375038147},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.48692190647125244},{"id":"https://openalex.org/keywords/explained-sum-of-squares","display_name":"Explained sum of squares","score":0.4826527237892151},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.4775886535644531},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4713805615901947},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.45602864027023315},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.44103413820266724},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.43676045536994934},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43484750390052795},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.42809611558914185},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.42359402775764465},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.35551244020462036},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2713685631752014},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23075518012046814}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7080710530281067},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6675437688827515},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.530686616897583},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.49223819375038147},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.48692190647125244},{"id":"https://openalex.org/C49847556","wikidata":"https://www.wikidata.org/wiki/Q3964631","display_name":"Explained sum of squares","level":2,"score":0.4826527237892151},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.4775886535644531},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4713805615901947},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.45602864027023315},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.44103413820266724},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.43676045536994934},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43484750390052795},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.42809611558914185},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.42359402775764465},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.35551244020462036},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2713685631752014},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23075518012046814},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/17m112470x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m112470x","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:tilburguniversity.edu:openaire_cris_publications/ab36c813-7839-4d3f-8ec5-9e67955fcbd4","is_oa":false,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/ab36c813-7839-4d3f-8ec5-9e67955fcbd4","pdf_url":null,"source":{"id":"https://openalex.org/S4406923027","display_name":"Tilburg University Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"A\u00dfmann, D, Liers, F, Stingl, M & Vera, J C 2018, 'Deciding robust feasibility and infeasibility using a set containment approach : An application to stationary passive gas network operations', SIAM Journal on Optimization, vol. 28, no. 3, pp. 2489-2517. https://doi.org/10.1137/17M112470X","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:tilburguniversity.edu:publications/ab36c813-7839-4d3f-8ec5-9e67955fcbd4","is_oa":false,"landing_page_url":"https://epubs.siam.org/doi/10.1137/17M112470X","pdf_url":null,"source":{"id":"https://openalex.org/S4306401490","display_name":"Research portal (Tilburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193700539","host_organization_name":"Tilburg University","host_organization_lineage":["https://openalex.org/I193700539"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"A\u00dfmann, D, Liers, F, Stingl, M & Vera, J C 2018, 'Deciding robust feasibility and infeasibility using a set containment approach : An application to stationary passive gas network operations', SIAM Journal on Optimization, vol. 28, no. 3, pp. 2489-2517. https://doi.org/10.1137/17M112470X","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Climate action","id":"https://metadata.un.org/sdg/13","score":0.4399999976158142}],"awards":[{"id":"https://openalex.org/G2862657677","display_name":null,"funder_award_id":"CRC TRR 154","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320366","display_name":"European Cooperation in Science and Technology","ror":"https://ror.org/01bstzn19"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320335337","display_name":"Elitenetzwerk Bayern","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W20026804","https://openalex.org/W1545324631","https://openalex.org/W1967184028","https://openalex.org/W1967344706","https://openalex.org/W1971414972","https://openalex.org/W1978492002","https://openalex.org/W1999913571","https://openalex.org/W2021527565","https://openalex.org/W2031279008","https://openalex.org/W2049087128","https://openalex.org/W2049225870","https://openalex.org/W2055088712","https://openalex.org/W2090967418","https://openalex.org/W2110964083","https://openalex.org/W2120934134","https://openalex.org/W2131315471","https://openalex.org/W2146586176","https://openalex.org/W2529781235","https://openalex.org/W2962695108","https://openalex.org/W3125338181","https://openalex.org/W4255442211"],"related_works":["https://openalex.org/W2005678164","https://openalex.org/W2493494838","https://openalex.org/W2389198916","https://openalex.org/W2321904532","https://openalex.org/W2963700124","https://openalex.org/W4297923520","https://openalex.org/W2624196447","https://openalex.org/W2077924482","https://openalex.org/W2905097288","https://openalex.org/W2128891880"],"abstract_inverted_index":{"In":[0,168],"this":[1,55,169],"paper":[2],"we":[3],"study":[4],"feasibility":[5,14,70,94,107,214],"and":[6,71,87,95,182],"infeasibility":[7,96,216],"of":[8,35,83,118,194,202,226],"nonlinear":[9],"two-stage":[10],"fully":[11],"adjustable":[12],"robust":[13,93,213],"problems":[15],"with":[16,120,159],"an":[17],"empty":[18],"first":[19],"stage.":[20],"This":[21],"is":[22,30,97,104,113,135,152,197,232],"equivalent":[23],"to":[24,48,154,163],"deciding":[25],"whether":[26],"the":[27,33,36,40,43,110,121,126,171,178,184,192,195,227],"uncertainty":[28],"set":[29,112],"contained":[31],"within":[32],"projection":[34],"feasible":[37,111],"region":[38],"onto":[39],"uncertainty-space.":[41],"Moreover,":[42],"considered":[44],"sets":[45],"are":[46,66,79,132],"assumed":[47],"be":[49,143,174,218],"described":[50,114],"by":[51,115,176],"polynomials.":[52],"For":[53],"answering":[54],"question,":[56],"two":[57],"very":[58],"general":[59],"approaches":[60],"using":[61,89,146],"methods":[62,78,196],"from":[63],"polynomial":[64,188],"optimization":[65,189],"presented---one":[67],"for":[68,73,99,210],"showing":[69,74],"one":[72,160],"infeasibility.":[75],"The":[76],"developed":[77],"approximated":[80],"through":[81],"sum":[82],"squares":[84],"(SOS)":[85],"polynomials":[86,119],"solved":[88],"semidefinite":[90],"programs.":[91],"Deciding":[92],"important":[98],"gas":[100,127],"network":[101,128,141,158],"operations,":[102],"which":[103],"a":[105,116,138,150,156,164,200],"nonconvex":[106],"problem":[108,172],"where":[109,212],"composition":[117],"absolute":[122,179],"value":[123,180],"function.":[124],"Concerning":[125],"problem,":[129],"different":[130],"topologies":[131],"considered.":[133],"It":[134,206],"shown":[136],"that":[137,209],"tree":[139,157],"structured":[140],"can":[142,173,217],"decided":[144,175,219],"exactly":[145],"linear":[147],"programming.":[148],"Furthermore,":[149],"method":[151],"presented":[153],"reduce":[155],"additional":[161],"arc":[162],"single":[165],"cycle":[166],"network.":[167],"case,":[170],"eliminating":[177],"functions":[181],"solving":[183],"resulting":[185],"linearly":[186],"many":[187],"problems.":[190],"Lastly,":[191],"effectivity":[193],"tested":[198],"on":[199],"variety":[201],"small":[203],"cyclic":[204],"networks.":[205],"turns":[207],"out":[208],"instances":[211],"or":[215,223],"successfully,":[220],"level":[221,224],"2":[222],"3":[225],"Lasserre":[228],"relaxation":[229],"hierarchy":[230],"typically":[231],"sufficient.":[233]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-06-20T22:02:38.213706","created_date":"2025-10-10T00:00:00"}