{"paper":{"title":"A Novel Projected Two Binary Variables Formulation for Unit Commitment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chen Zhang, Jinbao Jian, Ke Meng, LinFeng Yang, Zhaoyang Dong","submitted_at":"2016-06-18T00:24:50Z","abstract_excerpt":"The thermal unit commitment (UC) problem often can be formulated as a mixed integer quadratic programming (MIQP), which is difficult to solve efficiently, especially for large-scale instances. In this paper, with projecting unit generation level onto [0,1] and reformulation techniques, a novel two binary (2-bin) variables MIQP formulation for UC problem is presented. We show that 2-bin formulation is more compact than the state-of-the-art one binary (1-bin) variable formulation and three binary (3-bin) variables formulation. Moreover, 2-bin formulation is tighter than 1-bin and 3-bin formulati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05710","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}