{"id":"https://openalex.org/W2072180977","doi":"https://doi.org/10.1109/tac.2011.2162878","title":"A Hierarchy of Near-Optimal Policies for Multistage Adaptive Optimization","display_name":"A Hierarchy of Near-Optimal Policies for Multistage Adaptive Optimization","publication_year":2011,"publication_date":"2011-08-25","ids":{"openalex":"https://openalex.org/W2072180977","doi":"https://doi.org/10.1109/tac.2011.2162878","mag":"2072180977"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2011.2162878","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2011.2162878","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/74604","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025940525","display_name":"Dimitris Bertsimas","orcid":"https://orcid.org/0000-0002-1985-1003"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dimitris Bertsimas","raw_affiliation_strings":["Faculty of the Sloan School of Management and the Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, USA","Sloan Sch. of Manage. & the Oper. Res. Center, Massachusetts Inst. of Technol., Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Faculty of the Sloan School of Management and the Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Sloan Sch. of Manage. & the Oper. Res. Center, Massachusetts Inst. of Technol., Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078362074","display_name":"Dan A. Iancu","orcid":"https://orcid.org/0000-0001-9890-0928"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dan Andrei Iancu","raw_affiliation_strings":["Faculty of the Graduate School of Business, Stanford University, Stanford, CA, USA","Grad. Sch. of Bus., Stanford Univ., Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Faculty of the Graduate School of Business, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Grad. Sch. of Bus., Stanford Univ., Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031935416","display_name":"Pablo A. Parrilo","orcid":"https://orcid.org/0000-0003-1132-8477"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pablo A. Parrilo","raw_affiliation_strings":["Faculty of Electrical Engineering and Computer, Science and the Laboratory of Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","Labs. for Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering and Computer, Science and the Laboratory of Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Labs. for Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025940525"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":10.1572,"has_fulltext":false,"cited_by_count":125,"citation_normalized_percentile":{"value":0.98245909,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"56","issue":"12","first_page":"2809","last_page":"2824"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9991000294685364,"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.9991000294685364,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9983999729156494,"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.9965000152587891,"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/hierarchy","display_name":"Hierarchy","score":0.8054221272468567},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7218626737594604},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7172620296478271},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.7014548778533936},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5835630893707275},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.5653205513954163},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5621548891067505},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.5340394377708435},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.5275784730911255},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4975166618824005},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.45599812269210815},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.44906747341156006},{"id":"https://openalex.org/keywords/stochastic-control","display_name":"Stochastic control","score":0.42505955696105957},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.41905441880226135},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3744394779205322},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3010513186454773},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14536187052726746}],"concepts":[{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.8054221272468567},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7218626737594604},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7172620296478271},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7014548778533936},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5835630893707275},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.5653205513954163},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5621548891067505},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.5340394377708435},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.5275784730911255},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4975166618824005},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.45599812269210815},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.44906747341156006},{"id":"https://openalex.org/C170131372","wikidata":"https://www.wikidata.org/wiki/Q7617811","display_name":"Stochastic control","level":3,"score":0.42505955696105957},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.41905441880226135},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3744394779205322},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3010513186454773},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14536187052726746},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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":4,"locations":[{"id":"doi:10.1109/tac.2011.2162878","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2011.2162878","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.207.6745","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.6745","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/dbertsim/www/papers/Robust%20Optimization/A%20hierarchy%20of%20policies%20for%20adaptive%20optimization.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.649.3838","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.649.3838","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://faculty.chicagobooth.edu/workshops/omscience/past/more/pdf/Iancu2.pdf","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/74604","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/74604","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/74604","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/74604","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":69,"referenced_works":["https://openalex.org/W100327610","https://openalex.org/W242065599","https://openalex.org/W1489384219","https://openalex.org/W1494704940","https://openalex.org/W1545452079","https://openalex.org/W1548917674","https://openalex.org/W1569990960","https://openalex.org/W1570740775","https://openalex.org/W1576026844","https://openalex.org/W1583497301","https://openalex.org/W1588998206","https://openalex.org/W1594682877","https://openalex.org/W1601081659","https://openalex.org/W1605729888","https://openalex.org/W1745373831","https://openalex.org/W1964730816","https://openalex.org/W1967184028","https://openalex.org/W1967344706","https://openalex.org/W1983643871","https://openalex.org/W1999913571","https://openalex.org/W2000248128","https://openalex.org/W2006093909","https://openalex.org/W2031279008","https://openalex.org/W2033745948","https://openalex.org/W2042860556","https://openalex.org/W2057511182","https://openalex.org/W2061293389","https://openalex.org/W2073424058","https://openalex.org/W2076558707","https://openalex.org/W2078135889","https://openalex.org/W2078355481","https://openalex.org/W2097415784","https://openalex.org/W2098432798","https://openalex.org/W2103201064","https://openalex.org/W2108434419","https://openalex.org/W2116509768","https://openalex.org/W2119303899","https://openalex.org/W2120465407","https://openalex.org/W2129316296","https://openalex.org/W2133404041","https://openalex.org/W2134702196","https://openalex.org/W2135119491","https://openalex.org/W2136914524","https://openalex.org/W2142092335","https://openalex.org/W2144884795","https://openalex.org/W2153473676","https://openalex.org/W2154558981","https://openalex.org/W2158479468","https://openalex.org/W2169039617","https://openalex.org/W2182510773","https://openalex.org/W2484459806","https://openalex.org/W2487144912","https://openalex.org/W2492791808","https://openalex.org/W2536620281","https://openalex.org/W2595897327","https://openalex.org/W2600094625","https://openalex.org/W2616845728","https://openalex.org/W2912522929","https://openalex.org/W3097982649","https://openalex.org/W3105032021","https://openalex.org/W3122835744","https://openalex.org/W3143187486","https://openalex.org/W3148930403","https://openalex.org/W4205326910","https://openalex.org/W4211042066","https://openalex.org/W4251616545","https://openalex.org/W4255442211","https://openalex.org/W6634084870","https://openalex.org/W6669512161"],"related_works":["https://openalex.org/W175006096","https://openalex.org/W2994118822","https://openalex.org/W2086136595","https://openalex.org/W1518635954","https://openalex.org/W2599556035","https://openalex.org/W1590308505","https://openalex.org/W2330125470","https://openalex.org/W3116776104","https://openalex.org/W4300052603","https://openalex.org/W2791142594"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,28,45,53,57],"new":[6],"tractable":[7],"framework":[8,81],"for":[9],"dealing":[10],"with":[11],"linear":[12],"dynamical":[13],"systems":[14],"affected":[15],"by":[16,43,56],"uncertainty,":[17],"applicable":[18],"to":[19],"multistage":[20],"robust":[21,95],"optimization":[22],"and":[23,36,74,92],"stochastic":[24],"programming.":[25],"We":[26,78],"introduce":[27],"hierarchy":[29,54],"of":[30,62,85,97],"near-optimal":[31],"polynomial":[32,64],"disturbance-feedback":[33],"control":[34],"policies,":[35],"show":[37],"how":[38],"these":[39],"can":[40],"be":[41],"computed":[42],"solving":[44],"single":[46,58],"semidefinite":[47],"programming":[48],"problem.":[49],"The":[50],"approach":[51],"yields":[52],"parameterized":[55],"variable":[59],"(the":[60],"degree":[61],"the":[63,68,71,75,83],"policies),":[65],"which":[66,102],"controls":[67],"trade-off":[69],"between":[70],"optimality":[72],"gap":[73],"computational":[76,112],"requirements.":[77],"evaluate":[79],"our":[80],"in":[82,89,94],"context":[84],"three":[86],"classical":[87],"applications-two":[88],"inventory":[90],"management,":[91],"one":[93],"regulation":[96],"an":[98],"active":[99],"suspension":[100],"system-in":[101],"very":[103],"strong":[104],"numerical":[105],"performance":[106],"is":[107],"exhibited,":[108],"at":[109],"relatively":[110],"modest":[111],"expense.":[113]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}