{"id":"https://openalex.org/W2799970771","doi":"https://doi.org/10.1137/16m1094725","title":"On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems","display_name":"On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2799970771","doi":"https://doi.org/10.1137/16m1094725","mag":"2799970771"},"language":"en","primary_location":{"id":"doi:10.1137/16m1094725","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1094725","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/A5048142877","display_name":"Weijun Xie","orcid":"https://orcid.org/0000-0001-5157-1194"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Weijun Xie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5027399293","display_name":"Shabbir Ahmed","orcid":"https://orcid.org/0000-0001-7049-7305"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shabbir Ahmed","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.7407,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.9789835,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"28","issue":"2","first_page":"1151","last_page":"1182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9997000098228455,"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.9997000098228455,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9918000102043152,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.984000027179718,"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/mathematics","display_name":"Mathematics","score":0.7180988788604736},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6968898177146912},{"id":"https://openalex.org/keywords/ambiguity","display_name":"Ambiguity","score":0.625624418258667},{"id":"https://openalex.org/keywords/moment","display_name":"Moment (physics)","score":0.6146571636199951},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.5614407062530518},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5216251611709595},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.5179361701011658},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.507157564163208},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45950764417648315},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4527684450149536},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.4325546622276306},{"id":"https://openalex.org/keywords/moment-problem","display_name":"Moment problem","score":0.4244837462902069},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.41712379455566406},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19599217176437378}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7180988788604736},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6968898177146912},{"id":"https://openalex.org/C2780522230","wikidata":"https://www.wikidata.org/wiki/Q1140419","display_name":"Ambiguity","level":2,"score":0.625624418258667},{"id":"https://openalex.org/C179254644","wikidata":"https://www.wikidata.org/wiki/Q13222844","display_name":"Moment (physics)","level":2,"score":0.6146571636199951},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.5614407062530518},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5216251611709595},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.5179361701011658},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.507157564163208},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45950764417648315},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4527684450149536},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.4325546622276306},{"id":"https://openalex.org/C4285052","wikidata":"https://www.wikidata.org/wiki/Q3406268","display_name":"Moment problem","level":3,"score":0.4244837462902069},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.41712379455566406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19599217176437378},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16m1094725","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1094725","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7799999713897705}],"awards":[{"id":"https://openalex.org/G3526341773","display_name":"Risk Averse Multistage Stochastic Integer Programming","funder_award_id":"1633196","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W760153864","https://openalex.org/W1568307856","https://openalex.org/W1967729795","https://openalex.org/W1968355947","https://openalex.org/W1971867489","https://openalex.org/W1981776996","https://openalex.org/W1983609582","https://openalex.org/W1988622494","https://openalex.org/W1993599556","https://openalex.org/W2057427500","https://openalex.org/W2066503680","https://openalex.org/W2067065966","https://openalex.org/W2067796483","https://openalex.org/W2092660864","https://openalex.org/W2096011304","https://openalex.org/W2099506495","https://openalex.org/W2117156423","https://openalex.org/W2125417745","https://openalex.org/W2375159103","https://openalex.org/W2734649263","https://openalex.org/W3106992008"],"related_works":["https://openalex.org/W4386382407","https://openalex.org/W2005678164","https://openalex.org/W1992995584","https://openalex.org/W3138725819","https://openalex.org/W4311064410","https://openalex.org/W3146909488","https://openalex.org/W4292572523","https://openalex.org/W2952007803","https://openalex.org/W2346229102","https://openalex.org/W3117518978"],"abstract_inverted_index":{"A":[0],"joint":[1,32,39],"chance":[2,33,40],"constrained":[3,34],"optimization":[4,35],"problem":[5,36],"involves":[6],"multiple":[7],"uncertain":[8,68,120,146,156,170],"constraints,":[9,142],"i.e.,":[10],"constraints":[11,69,149,171],"with":[12,22,153],"stochastic":[13,52],"parameters,":[14],"that":[15,99,161,195],"are":[16,93,150,166,172],"jointly":[17],"required":[18,43],"to":[19,44,155,193],"be":[20,103,178,203],"satisfied":[21],"probability":[23,48],"exceeding":[24],"a":[25,29,55,100,106,118,129,175,181,190],"prespecified":[26],"threshold.":[27],"In":[28,59,95],"distributionally":[30],"robust":[31],"(DRCCP),":[37],"the":[38,51,111,123,134,145,163,169,196],"constraint":[41],"is":[42,117,126,137],"hold":[45],"for":[46],"all":[47],"distributions":[49],"of":[50,83],"parameters":[53],"from":[54],"given":[56],"ambiguity":[57,72,124,135],"set.":[58],"this":[60],"work,":[61],"we":[62,97,188],"consider":[63],"DRCCPs":[64],"involving":[65],"convex":[66,76,107,185,200],"nonlinear":[67],"and":[70,86,143,147,168],"an":[71],"set":[73,125,136],"specified":[74],"by":[75,128,139,206],"moment":[77,131,141,148],"constraints.":[78],"We":[79,158],"investigate":[80],"deterministic":[81,91,182],"reformulations":[82,92],"such":[84,90],"problems":[85],"conditions":[87,113],"under":[88],"which":[89],"convex.":[94],"particular":[96],"show":[98,160],"DRCCP":[101,176],"can":[102,177,202],"reformulated":[104,179],"as":[105,180],"program":[108],"if":[109,162],"one":[110],"following":[112],"hold:":[114],"(i)":[115],"there":[116],"single":[119,130],"constraint,":[121,132],"(ii)":[122],"defined":[127,138],"(iii)":[133],"linear":[140,173],"(iv)":[144],"positively":[151],"homogeneous":[152],"respect":[154],"parameters.":[157],"further":[159],"decision":[164],"variables":[165],"binary":[167],"then":[174],"mixed":[183,198],"integer":[184,199],"program.":[186],"Finally,":[187],"present":[189],"numerical":[191],"study":[192],"illustrate":[194],"proposed":[197],"reformulation":[201],"solved":[204],"efficiently":[205],"existing":[207],"solvers.":[208]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":19},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}