{"id":"https://openalex.org/W2071468246","doi":"https://doi.org/10.1137/060650003","title":"Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets","display_name":"Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2071468246","doi":"https://doi.org/10.1137/060650003","mag":"2071468246"},"language":"en","primary_location":{"id":"doi:10.1137/060650003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060650003","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":true,"oa_status":"green","oa_url":"https://research.birmingham.ac.uk/en/publications/f70bd5c6-3550-4931-b96c-4eeb01bd25ae","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071262933","display_name":"Igor Averbakh","orcid":"https://orcid.org/0000-0001-6168-4424"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Igor Averbakh","raw_affiliation_strings":["University of Toronto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050493484","display_name":"Yun-Bin Zhao","orcid":"https://orcid.org/0000-0001-9285-2793"},"institutions":[{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"government","lineage":["https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yun-Bin Zhao","raw_affiliation_strings":["Academy of Mathematics and Systems Science, Chinese Academy of Sciences,#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Academy of Mathematics and Systems Science, Chinese Academy of Sciences,#TAB#","institution_ids":["https://openalex.org/I19820366"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.528,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.9217855,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"18","issue":"4","first_page":"1436","last_page":"1466"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9998999834060669,"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.9998999834060669,"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/T12135","display_name":"Fuzzy Systems and Optimization","score":0.988099992275238,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/T10969","display_name":"Water resources management and optimization","score":0.9830999970436096,"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/robust-optimization","display_name":"Robust optimization","score":0.7795621752738953},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7358724474906921},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7012295722961426},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5964496731758118},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5901728868484497},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5789589881896973},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49615392088890076},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.44207215309143066},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4241471290588379},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22691643238067627}],"concepts":[{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.7795621752738953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7358724474906921},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7012295722961426},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5964496731758118},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5901728868484497},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5789589881896973},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49615392088890076},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.44207215309143066},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4241471290588379},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22691643238067627},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/060650003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060650003","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:pure.atira.dk:Publications/f70bd5c6-3550-4931-b96c-4eeb01bd25ae","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/f70bd5c6-3550-4931-b96c-4eeb01bd25ae","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/f70bd5c6-3550-4931-b96c-4eeb01bd25ae","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Averbakh, I & Zhao, Y-B 2008, 'Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets', SIAM Journal on Optimization, vol. 18, no. 4, pp. 1436-1466. https://doi.org/10.1137/060650003","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/f70bd5c6-3550-4931-b96c-4eeb01bd25ae","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/portal/en/publications/explicit-reformulations-for-robust-optimization-problems-with-general-uncertainty-sets(f70bd5c6-3550-4931-b96c-4eeb01bd25ae).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/f70bd5c6-3550-4931-b96c-4eeb01bd25ae","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/f70bd5c6-3550-4931-b96c-4eeb01bd25ae","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Averbakh, I & Zhao, Y-B 2008, 'Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets', SIAM Journal on Optimization, vol. 18, no. 4, pp. 1436-1466. https://doi.org/10.1137/060650003","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W66590886","https://openalex.org/W1963888335","https://openalex.org/W1970226744","https://openalex.org/W1971867489","https://openalex.org/W1990275757","https://openalex.org/W1995285162","https://openalex.org/W2003777645","https://openalex.org/W2004220372","https://openalex.org/W2005678164","https://openalex.org/W2006041100","https://openalex.org/W2009807645","https://openalex.org/W2012964043","https://openalex.org/W2046217872","https://openalex.org/W2048679451","https://openalex.org/W2057609912","https://openalex.org/W2058391199","https://openalex.org/W2065163895","https://openalex.org/W2066503680","https://openalex.org/W2067318832","https://openalex.org/W2069099760","https://openalex.org/W2071439977","https://openalex.org/W2080208950","https://openalex.org/W2084575717","https://openalex.org/W2089105401","https://openalex.org/W2092123844","https://openalex.org/W2094182730","https://openalex.org/W2102426156","https://openalex.org/W2118578357","https://openalex.org/W2120974482","https://openalex.org/W2127331687","https://openalex.org/W2131387435","https://openalex.org/W2138765659","https://openalex.org/W2146444777","https://openalex.org/W2147127428","https://openalex.org/W2165775468","https://openalex.org/W2168170446","https://openalex.org/W2170645540","https://openalex.org/W3124486855"],"related_works":["https://openalex.org/W3149055374","https://openalex.org/W2216231335","https://openalex.org/W2053131036","https://openalex.org/W4386254288","https://openalex.org/W4292572523","https://openalex.org/W2809352861","https://openalex.org/W2056349093","https://openalex.org/W2952007803","https://openalex.org/W2919687292","https://openalex.org/W3159863825"],"abstract_inverted_index":{"We":[0,25],"consider":[1],"a":[2,20,64,81],"rather":[3],"general":[4],"class":[5,33],"of":[6,22,31,34,67,84,123,127,136,146],"mathematical":[7],"programming":[8],"problems":[9,35,52,85],"with":[10,53],"data":[11],"uncertainty,":[12],"where":[13],"the":[14,28,75,121,124,128,134,137,144,147],"uncertainty":[15,54,89,148],"set":[16],"is":[17],"represented":[18],"by":[19,57],"system":[21],"convex":[23,58],"inequalities.":[24],"prove":[26],"that":[27,70],"robust":[29,113,129],"counterparts":[30],"this":[32,98],"can":[36],"be":[37],"reformulated":[38],"equivalently":[39],"as":[40],"finite":[41],"and":[42,77,86,142],"explicit":[43],"optimization":[44,107,114,140],"problems.":[45,115],"Moreover,":[46],"we":[47],"develop":[48],"simplified":[49],"reformulations":[50],"for":[51],"sets":[55,90],"defined":[56],"homogeneous":[59],"functions.":[60],"Our":[61],"results":[62],"provide":[63],"unified":[65],"treatment":[66],"many":[68],"situations":[69],"have":[71],"been":[72],"investigated":[73],"in":[74,97],"literature":[76],"are":[78],"applicable":[79],"to":[80,103,109],"wider":[82],"range":[83],"more":[87,111],"complicated":[88,112],"than":[91],"those":[92],"considered":[93],"before.":[94],"The":[95,116],"analysis":[96,117],"paper":[99],"makes":[100],"it":[101],"possible":[102],"use":[104],"existing":[105],"continuous":[106],"algorithms":[108],"solve":[110],"also":[118],"shows":[119],"how":[120],"structure":[122,135,145],"resulting":[125],"reformulation":[126],"counterpart":[130],"depends":[131],"both":[132],"on":[133,143],"original":[138],"nominal":[139],"problem":[141],"set.":[149]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}
