{"id":{"repo_id":"clemson","oai_identifier":"oai:open.clemson.edu:all_theses-5428"},"canonical_url":"https://search.ndltd.org/etd/clemson/oai:open.clemson.edu:all_theses-5428","repository":{"repo_id":"clemson","name":"Clemson University","base_url":"https://open.clemson.edu/do/oai/"},"display":{"title":"Bounding the Convex Hull Relaxation of the Unit Commitment Problem with the Shapley-Folkman Theorem","abstract":"The Unit Commitment (UC) problem finds an optimal schedule for a set of generators by minimizing the total operation cost subject to demand and operational constraints. The UC problem is often modeled with a mixed-integer linear program (MILP). We employ the Shapley-Folkman Theorem to provide a bound on the size of fractional solutions of its convex hull relaxation. This result is used to obtain a bound on the optimality gap between the MILP and the convex hull relaxation, which is further tightened using several problem-specific properties of UC. We conduct extensive numerical experiments to study the tightness of this threshold, and how it is impacted by different parameters.","abstract_html":"The Unit Commitment (UC) problem finds an optimal schedule for a set of generators by minimizing the total operation cost subject to demand and operational constraints. The UC problem is often modeled with a mixed-integer linear program (MILP). We employ the Shapley-Folkman Theorem to provide a bound on the size of fractional solutions of its convex hull relaxation. This result is used to obtain a bound on the optimality gap between the MILP and the convex hull relaxation, which is further tightened using several problem-specific properties of UC. We conduct extensive numerical experiments to study the tightness of this threshold, and how it is impacted by different parameters.","abstract_has_math":false,"creators":["Henderson, Lauren"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Mathematical Sciences","degree_department":null,"school":null,"contributors":["Dr. Cheng Guo","Dr. Boshi Yang","Dr. Yongjia Song"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:33:12Z","subjects":["Convex-hull","Shapley-Folkman","MIP","Unit Commitment","Other Applied Mathematics","Other Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://open.clemson.edu/all_theses/4435","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://open.clemson.edu/all_theses/4435","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://open.clemson.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopen.clemson.edu%3Aall_theses-5428","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Dr. Cheng Guo","Dr. Boshi Yang","Dr. Yongjia Song"]},{"key":"dc:creator","label":"Author","values":["Henderson, Lauren"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2024-11-11T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2024-12-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Convex-hull","Shapley-Folkman","MIP","Unit Commitment","Other Applied Mathematics","Other Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://open.clemson.edu/all_theses/4435"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The Unit Commitment (UC) problem finds an optimal schedule for a set of generators by minimizing the total operation cost subject to demand and operational constraints. The UC problem is often modeled with a mixed-integer linear program (MILP). We employ the Shapley-Folkman Theorem to provide a bound on the size of fractional solutions of its convex hull relaxation. This result is used to obtain a bound on the optimality gap between the MILP and the convex hull relaxation, which is further tightened using several problem-specific properties of UC. We conduct extensive numerical experiments to study the tightness of this threshold, and how it is impacted by different parameters."]},{"key":"dc:title","label":"Title","values":["Bounding the Convex Hull Relaxation of the Unit Commitment Problem with the Shapley-Folkman Theorem"]}]}],"canonical_facts":{"dc:contributor":["Dr. Cheng Guo","Dr. Boshi Yang","Dr. Yongjia Song"],"dc:creator":["Henderson, Lauren"],"dc:date.available":["2024-11-11T08:00:00Z"],"dc:date.created":["2024-12-01T08:00:00Z"],"dc:description.abstract":["The Unit Commitment (UC) problem finds an optimal schedule for a set of generators by minimizing the total operation cost subject to demand and operational constraints. The UC problem is often modeled with a mixed-integer linear program (MILP). We employ the Shapley-Folkman Theorem to provide a bound on the size of fractional solutions of its convex hull relaxation. This result is used to obtain a bound on the optimality gap between the MILP and the convex hull relaxation, which is further tightened using several problem-specific properties of UC. We conduct extensive numerical experiments to study the tightness of this threshold, and how it is impacted by different parameters."],"dc:identifier":["https://open.clemson.edu/all_theses/4435"],"dc:subject":["Convex-hull","Shapley-Folkman","MIP","Unit Commitment","Other Applied Mathematics","Other Mathematics"],"dc:title":["Bounding the Convex Hull Relaxation of the Unit Commitment Problem with the Shapley-Folkman Theorem"],"thesis:degree_discipline":["Mathematical Sciences"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T07:33:12Z"}