{"id":"https://openalex.org/W1976466849","doi":"https://doi.org/10.1137/07069821x","title":"The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs","display_name":"The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1976466849","doi":"https://doi.org/10.1137/07069821x","mag":"1976466849"},"language":"en","primary_location":{"id":"doi:10.1137/07069821x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/07069821x","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/A5068752903","display_name":"Marco C. Campi","orcid":"https://orcid.org/0000-0002-5209-3312"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. C. Campi","raw_affiliation_strings":["marco.campi@ing.unibs.it and http://bsing.ing.unibs.it/$\\\\sim$campi/#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"marco.campi@ing.unibs.it and http://bsing.ing.unibs.it/$\\\\sim$campi/#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080248970","display_name":"Simone Garatti","orcid":"https://orcid.org/0000-0002-5451-6892"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Garatti","raw_affiliation_strings":["sgaratti@elet.polimi.it and http://home.dei.polimi.it/sgaratti/#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"sgaratti@elet.polimi.it and http://home.dei.polimi.it/sgaratti/#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":18.3396,"has_fulltext":false,"cited_by_count":560,"citation_normalized_percentile":{"value":0.99430955,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"19","issue":"3","first_page":"1211","last_page":"1230"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9994999766349792,"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.9994999766349792,"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/T10969","display_name":"Water resources management and optimization","score":0.9984999895095825,"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"}},{"id":"https://openalex.org/T12135","display_name":"Fuzzy Systems and Optimization","score":0.9975000023841858,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7173562049865723},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.656059205532074},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6052315831184387},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6010489463806152},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5713485479354858},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4969156086444855},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.49569785594940186},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4481394588947296},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4257241487503052},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3386988639831543},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.183355450630188},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12320148944854736}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7173562049865723},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.656059205532074},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6052315831184387},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6010489463806152},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5713485479354858},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4969156086444855},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.49569785594940186},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4481394588947296},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4257241487503052},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3386988639831543},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.183355450630188},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12320148944854736},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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":2,"locations":[{"id":"doi:10.1137/07069821x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/07069821x","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:iris.unibs.it:11379/23300","is_oa":false,"landing_page_url":"http://hdl.handle.net/11379/23300","pdf_url":null,"source":{"id":"https://openalex.org/S4306400804","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Brescia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66752286","host_organization_name":"University of Milano-Bicocca","host_organization_lineage":["https://openalex.org/I66752286"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W88909337","https://openalex.org/W599836893","https://openalex.org/W611187539","https://openalex.org/W1594563152","https://openalex.org/W1875804059","https://openalex.org/W1994382933","https://openalex.org/W1995285162","https://openalex.org/W2006041100","https://openalex.org/W2035238076","https://openalex.org/W2048679451","https://openalex.org/W2049606892","https://openalex.org/W2071439977","https://openalex.org/W2084575717","https://openalex.org/W2089105401","https://openalex.org/W2112015490","https://openalex.org/W2112892237","https://openalex.org/W2117781171","https://openalex.org/W2117844706","https://openalex.org/W2125299871","https://openalex.org/W2140520100","https://openalex.org/W2158479468","https://openalex.org/W2167412190","https://openalex.org/W2204898024"],"related_works":["https://openalex.org/W3153752017","https://openalex.org/W3035814349","https://openalex.org/W2518949622","https://openalex.org/W4285101096","https://openalex.org/W4320477335","https://openalex.org/W1561889708","https://openalex.org/W4382725876","https://openalex.org/W2275184629","https://openalex.org/W2115614142","https://openalex.org/W2794161546"],"abstract_inverted_index":{"Many":[0],"optimization":[1],"problems":[2,79,88,99],"are":[3],"naturally":[4],"delivered":[5],"in":[6,22],"an":[7],"uncertain":[8,35,45],"framework,":[9],"and":[10,142],"one":[11],"would":[12],"like":[13],"to":[14,34,43],"exercise":[15],"prudence":[16],"against":[17],"the":[18,23,69,73,76,90,108,111,124,127],"uncertainty":[19],"elements":[20],"present":[21],"problem.":[24],"In":[25,57],"previous":[26,140],"contributions,":[27],"it":[28,147],"has":[29],"been":[30],"shown":[31],"that":[32,38,85,107],"solutions":[33,113],"convex":[36,117],"programs":[37,118],"bear":[39],"a":[40,95],"high":[41],"probability":[42],"satisfy":[44],"constraints":[46],"can":[47,119],"be":[48,120],"obtained":[49],"at":[50],"low":[51],"computational":[52],"cost":[53],"through":[54],"constraint":[55],"randomization.":[56],"this":[58,101,137],"paper,":[59],"we":[60],"establish":[61],"new":[62],"feasibility":[63,71,92,109,125,134],"results":[64],"for":[65,72,114,126,150],"randomized":[66,112],"algorithms.":[67],"Specifically,":[68],"exact":[70,149],"class":[74,129],"of":[75,100,110,130,136],"so-called":[77],"fully-supported":[78,87,131,151],"is":[80,104,143,148],"obtained.":[81],"It":[82,103],"turns":[83],"out":[84],"all":[86,115],"share":[89],"same":[91],"properties,":[93],"revealing":[94],"deep":[96],"kinship":[97],"among":[98],"class.":[102],"further":[105],"proven":[106],"other":[116],"bounded":[121],"based":[122],"on":[123],"prototype":[128],"problems.":[132,152],"The":[133],"result":[135],"paper":[138],"outperforms":[139],"bounds":[141],"not":[144],"improvable":[145],"because":[146]},"counts_by_year":[{"year":2026,"cited_by_count":8},{"year":2025,"cited_by_count":24},{"year":2024,"cited_by_count":39},{"year":2023,"cited_by_count":42},{"year":2022,"cited_by_count":37},{"year":2021,"cited_by_count":32},{"year":2020,"cited_by_count":42},{"year":2019,"cited_by_count":52},{"year":2018,"cited_by_count":50},{"year":2017,"cited_by_count":31},{"year":2016,"cited_by_count":31},{"year":2015,"cited_by_count":39},{"year":2014,"cited_by_count":39},{"year":2013,"cited_by_count":33},{"year":2012,"cited_by_count":19}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}