{"id":"https://openalex.org/W1976392670","doi":"https://doi.org/10.1109/cdc.2011.6161342","title":"A scenario approach for estimating the suboptimality of linear decision rules in two-stage robust optimization","display_name":"A scenario approach for estimating the suboptimality of linear decision rules in two-stage robust optimization","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W1976392670","doi":"https://doi.org/10.1109/cdc.2011.6161342","mag":"1976392670"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2011.6161342","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2011.6161342","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Conference on Decision and Control and European Control Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/196330","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036335577","display_name":"Michael Jason Hadjiyiannis","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Michael J. Hadjiyiannis","raw_affiliation_strings":["Department of Computing, Imperial College London, UK","Department of Computing, Imperial College, London, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Imperial College London, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Department of Computing, Imperial College, London, UK","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001694225","display_name":"Paul J. Goulart","orcid":"https://orcid.org/0000-0002-0456-4124"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Paul J. Goulart","raw_affiliation_strings":["Department of Aeronautics, Imperial College London, UK","Department of Aeronautics, Imperial College, London, UK"],"affiliations":[{"raw_affiliation_string":"Department of Aeronautics, Imperial College London, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Department of Aeronautics, Imperial College, London, UK","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065780980","display_name":"Daniel K\u00fchn","orcid":"https://orcid.org/0000-0003-2697-8886"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Daniel Kuhn","raw_affiliation_strings":["Department of Computing, Imperial College London, UK","Department of Computing, Imperial College, London, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Imperial College London, UK","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Department of Computing, Imperial College, London, UK","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036335577"],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":null,"apc_paid":null,"fwci":2.0485,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.86545108,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"7386","last_page":"7391"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9995999932289124,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.9995999932289124,"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"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/T10969","display_name":"Water resources management and optimization","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/bounding-overwatch","display_name":"Bounding overwatch","score":0.814353346824646},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6434938311576843},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.6140398979187012},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5207241177558899},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.49839353561401367},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4976637661457062},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47640669345855713},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46924710273742676},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41582101583480835},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1067064106464386}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.814353346824646},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6434938311576843},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.6140398979187012},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5207241177558899},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.49839353561401367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4976637661457062},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47640669345855713},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46924710273742676},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41582101583480835},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1067064106464386},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cdc.2011.6161342","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2011.6161342","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Conference on Decision and Control and European Control Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:infoscience.epfl.ch:196330","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/196330","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:infoscience.tind.io:196330","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/100229","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:196330","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/196330","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.5600000023841858},{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1594103238","https://openalex.org/W1995285162","https://openalex.org/W1999560794","https://openalex.org/W2014923785","https://openalex.org/W2031279008","https://openalex.org/W2072180977","https://openalex.org/W2078135889","https://openalex.org/W2107968842","https://openalex.org/W2117781171","https://openalex.org/W2119303899","https://openalex.org/W2132462531","https://openalex.org/W2134702196","https://openalex.org/W2600094625","https://openalex.org/W3097982649","https://openalex.org/W3143187486","https://openalex.org/W4251616545"],"related_works":["https://openalex.org/W2132137594","https://openalex.org/W2069783012","https://openalex.org/W2085967955","https://openalex.org/W4256335355","https://openalex.org/W3098612666","https://openalex.org/W2138867060","https://openalex.org/W1499116563","https://openalex.org/W2023859141","https://openalex.org/W2182290077","https://openalex.org/W3149055374"],"abstract_inverted_index":{"Robust":[0],"dynamic":[1],"optimization":[2,68],"problems":[3],"involving":[4],"adaptive":[5,22],"decisions":[6,23],"are":[7,57],"computationally":[8],"intractable":[9,123],"in":[10,70,124,145],"general.":[11],"Tractable":[12],"upper":[13],"bounding":[14,41],"approximations":[15,56],"can":[16],"be":[17,25],"obtained":[18,58],"by":[19,60,73],"requiring":[20],"the":[21,47,52,66,80,87,93,97,101,104,108,116,146],"to":[24,45,96,132],"representable":[26],"as":[27],"linear":[28],"decision":[29],"rules":[30],"(LDRs).":[31],"In":[32],"this":[33],"paper":[34],"we":[35],"investigate":[36],"families":[37],"of":[38,49,51,65,79,86,103,148],"tractable":[39],"lower":[40,89,119,135],"approximations,":[42],"which":[43],"serve":[44],"estimate":[46],"degree":[48],"suboptimality":[50],"best":[53,117],"LDR.":[54],"These":[55],"either":[59],"solving":[61],"a":[62],"dual":[63],"version":[64],"robust":[67],"problem":[69],"LDRs":[71],"or":[72,100],"utilizing":[74],"an":[75,129],"inclusion-wise":[76],"discrete":[77],"approximation":[78],"problem's":[81],"uncertainty":[82,109],"set.":[83],"The":[84,137],"quality":[85],"resulting":[88,138],"bounds":[90,120,140,144],"depends":[91],"on":[92],"distribution":[94],"assigned":[95],"uncertain":[98],"parameters":[99],"choice":[102],"discretization":[105],"points":[106],"within":[107],"set,":[110],"respectively.":[111],"We":[112],"prove":[113],"that":[114],"identifying":[115],"possible":[118],"is":[121],"generally":[122],"both":[125],"cases":[126],"and":[127],"propose":[128],"efficient":[130],"procedure":[131],"construct":[133],"suboptimal":[134],"bounds.":[136],"instance-wise":[139],"outperform":[141],"known":[142],"worst-case":[143],"majority":[147],"our":[149],"test":[150],"cases.":[151]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}