Correction to: Polynomial time algorithms and extended formulations for unit commitment problems (IISE Transactions, (2018), 50, 8, (735-751), 10.1080/24725854.2017.1397303)

Y. Guan, K. Pan, K. Zhou

Research output: Journal article publicationComment/debate/erratum

Abstract

In this notice, we correct imprecise statements in the article above [2]. In Proposition 1, we claimed that formulation (9) produces optimal solutions that are binary with respect to α, β, γ and θ for general convex function (Formula presented.) This statement is not precise. Proposition 1 holds for piecewise linear convex functions instead of general convex functions. This can be slightly revised to be a correct conclusion. In fact, constraint (8n) should be kept in the formulation when formulation (8) was reformulated to the formulation (9) by maintaining (Formula presented.) as a decision variable, and thereafter the conclusion in Proposition 1 holds under piecewise linear convex functions. To that end, we make the following corrections:On Page 736 right column: Replace “(ii) …with both general convex and piecewise linear cost functions” with “(ii) …with piecewise linear cost functions.”On Pages 738: Replace “2.2. An extended …with general convex cost function” with “2.2. An extended …with piecewise linear convex cost function.”On Pages 739 and 740 in (8c), (8d), and (9c): Replace “ (Formula presented.) ” with “ (Formula presented.) ”On Page 740 left column: Delete the paragraph “Note here that …function as (Formula presented.) ”; replace “ (Formula presented.) ” with “ (Formula presented.) ” in expression (9a).On Page 740 right column: combine expressions (8n) and (9k) as the new (9k); replace “we assume that” with “since”; replace “with the same set of Constraints (9b)-(9k) but with” with “with the same set of Constraints (9b)-(9k) without the term included in (8n) but with.”On Page 741 right column: In Proposition 1, replace “The” with “There exists an” and delete “is”; replace the entire proof of Proposition 1 with “The conclusion directly follows from Theorem 1 and linear objective function (9a).”On Page 742 left column: Replace “single-UC problem with a general convex cost function …and add” with “single-UC problem by adding.”On Page 742 Theorem 2: Replace “general convex” with “general piecewise linear convex”; replace the objective function “ (Formula presented.) “with “(9a)”; delete “(1i)-(1k)”; delete the proof section.On Page 742 right column: In Remark 1, replace “but also provides an … due to Theorem 2” with “but also provides an optimal objective converging to that of the deterministic single-UC problem (1) when (Formula presented.) is a general convex function due to the compactness of the feasible region and bounded objective value for the single-UC problem and Theorem 2.”On Page 746, replace “ (Formula presented.) ” with “ (Formula presented.) ” and “(20b)-(20e)” with “(16), (20b)-(20e)” in Theorem 3.On Page 749, replace “ (Formula presented.) ” with “ (Formula presented.) ” and “(29b)-(29e)” with “(26), (29b)-(29e)” in Theorem 4. The updated integral formulations with the precise statements have been available at https://arxiv.org/abs/1906.07862 (i.e., formulation (2) in Section II and corresponding proof in Section III). We can observe that our extended formulation not only describes an integral polytope with respect to variables (Formula presented.) due to Theorem 1, but also provides an optimal objective converging to that of the deterministic single-UC problem (1) when (Formula presented.) is a general convex function, as the number of line segments increases, due to the compactness of the feasible region and bounded objective value for the single-UC problem. Furthermore, since (Formula presented.) is a quadratic function in general, an alternative way to obtain an optimal solution that is binary with respect to variables (Formula presented.) under the quadratic function (Formula presented.) is to utilize the convex envelope of (Formula presented.) as described in [3] (Theorem 3) and the integral polytope proved in our Theorem 1, because Theorem 1 provides an explicit description of the (Formula presented.) defined in [3]. Thus, following [3], the convex envelope of our original formulation (9) in [2] when (Formula presented.) is a quadratic function (e.g., (Formula presented.)) can be described as (Formula presented.) An independent work compared with [3] is available in [1]. Both of them investigate extended formulations of the UC problem from the perspective of nonlinear programming, while our work in [2] focuses on the extended formulations with piecewise linear convex objective functions in the form of linear program. Finally, the authors thank Yanan Yu, Tiziano Bacci, Antonio Frangioni, and Claudio Gentile for their sincere suggestions.

Original language English 486-487 2 IISE Transactions 52 4 https://doi.org/10.1080/24725854.2019.1697094 Published - 2 Apr 2020

ASJC Scopus subject areas

• Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'Correction to: Polynomial time algorithms and extended formulations for unit commitment problems (IISE Transactions, (2018), 50, 8, (735-751), 10.1080/24725854.2017.1397303)'. Together they form a unique fingerprint.