{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/102862"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/102862","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Risk-sensitive security-constrained economic dispatch via critical region exploration","abstract":"A security-constrained economic dispatch (SCED) problem is regularly solved by system operators in electric power networks to make day-ahead and real-time dispatch decisions. Preventive SCED is conservative and requires dispatch decisions that are secure against any single component failure. Corrective (recourse) actions can significantly reduce operational costs. Even with linear power flow models, corrective SCED poses significant computational challenges owing to an increase in the dimensionality arising from additional recourse decisions and the number of contingencies to guard against. This thesis analyzes the benefits of allowing recourse actions for simple networks and tackles the computational challenges of solving the problem at scale through a decomposition of the problem via a critical region exploration technique that exploits the problem structure using properties of multi-parametric linear programming. This thesis concludes with numerical results on various IEEE test networks.","abstract_html":"A security-constrained economic dispatch (SCED) problem is regularly solved by system operators in electric power networks to make day-ahead and real-time dispatch decisions. Preventive SCED is conservative and requires dispatch decisions that are secure against any single component failure. Corrective (recourse) actions can significantly reduce operational costs. Even with linear power flow models, corrective SCED poses significant computational challenges owing to an increase in the dimensionality arising from additional recourse decisions and the number of contingencies to guard against. This thesis analyzes the benefits of allowing recourse actions for simple networks and tackles the computational challenges of solving the problem at scale through a decomposition of the problem via a critical region exploration technique that exploits the problem structure using properties of multi-parametric linear programming. This thesis concludes with numerical results on various IEEE test networks.","abstract_has_math":false,"creators":["Madavan, Avinash N."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Bose, Subhonmesh"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2019,"date_issued":"2019-02-07T20:44:29Z","date_published":"2019-02-07T20:44:29Z","updated_at":"2026-07-22T22:24:42Z","subjects":["security-constrained economic dispatch","risk-sensitive"],"languages":["en"],"rights":["Copyright 2018 Avinash Madavan"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/102862","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Bose, Subhonmesh"]},{"key":"dc:creator","label":"Author","values":["Madavan, Avinash N."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2019-02-07T20:44:29Z","2021-02-08T10:15:36Z","2018-12-12","2018-12"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["security-constrained economic dispatch","risk-sensitive"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2018 Avinash Madavan"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/102862"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["A security-constrained economic dispatch (SCED) problem is regularly solved by system operators in electric power networks to make day-ahead and real-time dispatch decisions. Preventive SCED is conservative and requires dispatch decisions that are secure against any single component failure. Corrective (recourse) actions can significantly reduce operational costs. Even with linear power flow models, corrective SCED poses significant computational challenges owing to an increase in the dimensionality arising from additional recourse decisions and the number of contingencies to guard against. This thesis analyzes the benefits of allowing recourse actions for simple networks and tackles the computational challenges of solving the problem at scale through a decomposition of the problem via a critical region exploration technique that exploits the problem structure using properties of multi-parametric linear programming. This thesis concludes with numerical results on various IEEE test networks.","Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2020-12-01","The student, Avinash Madavan, accepted the attached license on 2018-12-12 at 14:34.","The student, Avinash Madavan, submitted this Thesis for approval on 2018-12-12 at 14:39.","This Thesis was approved for publication on 2018-12-12 at 16:06.","DSpace SAF Submission Ingestion Package generated from Vireo submission #13306 on 2019-02-07 at 14:23:29","Made available in DSpace on 2019-02-07T20:44:29Z (GMT). No. of bitstreams: 2 MADAVAN-THESIS-2018.pdf: 714670 bytes, checksum: 7e6046381f62ac6a80319a9665a32640 (MD5) LICENSE.txt: 4212 bytes, checksum: 18ce4b0a6ff2e56ddaad5aabab5b1304 (MD5) Previous issue date: 2018-12-12","Embargo set by: Seth Robbins for item 109888 Lift date: 2021-02-07T20:44:35Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only Restriction Lifted for Item 109888 on 2021-02-08T10:15:36Z."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Risk-sensitive security-constrained economic dispatch via critical region exploration"]}]}],"canonical_facts":{"dc:contributor":["Bose, Subhonmesh"],"dc:creator":["Madavan, Avinash N."],"dc:date":["2019-02-07T20:44:29Z","2021-02-08T10:15:36Z","2018-12-12","2018-12"],"dc:description":["A security-constrained economic dispatch (SCED) problem is regularly solved by system operators in electric power networks to make day-ahead and real-time dispatch decisions. Preventive SCED is conservative and requires dispatch decisions that are secure against any single component failure. Corrective (recourse) actions can significantly reduce operational costs. Even with linear power flow models, corrective SCED poses significant computational challenges owing to an increase in the dimensionality arising from additional recourse decisions and the number of contingencies to guard against. This thesis analyzes the benefits of allowing recourse actions for simple networks and tackles the computational challenges of solving the problem at scale through a decomposition of the problem via a critical region exploration technique that exploits the problem structure using properties of multi-parametric linear programming. This thesis concludes with numerical results on various IEEE test networks.","Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2020-12-01","The student, Avinash Madavan, accepted the attached license on 2018-12-12 at 14:34.","The student, Avinash Madavan, submitted this Thesis for approval on 2018-12-12 at 14:39.","This Thesis was approved for publication on 2018-12-12 at 16:06.","DSpace SAF Submission Ingestion Package generated from Vireo submission #13306 on 2019-02-07 at 14:23:29","Made available in DSpace on 2019-02-07T20:44:29Z (GMT). No. of bitstreams: 2 MADAVAN-THESIS-2018.pdf: 714670 bytes, checksum: 7e6046381f62ac6a80319a9665a32640 (MD5) LICENSE.txt: 4212 bytes, checksum: 18ce4b0a6ff2e56ddaad5aabab5b1304 (MD5) Previous issue date: 2018-12-12","Embargo set by: Seth Robbins for item 109888 Lift date: 2021-02-07T20:44:35Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only Restriction Lifted for Item 109888 on 2021-02-08T10:15:36Z."],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/102862"],"dc:language":["en"],"dc:rights":["Copyright 2018 Avinash Madavan"],"dc:subject":["security-constrained economic dispatch","risk-sensitive"],"dc:title":["Risk-sensitive security-constrained economic dispatch via critical region exploration"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:42Z"}