scholarly journals Security-Constrained Unit Commitment Based on a Realizable Energy Delivery Formulation

2012 ◽  
Vol 2012 ◽  
pp. 1-22 ◽  
Author(s):  
Hongyu Wu ◽  
Qiaozhu Zhai ◽  
Xiaohong Guan ◽  
Feng Gao ◽  
Hongxing Ye
Keyword(s):  
Unit Commitment ◽  
Piecewise Linear ◽  
Optimal Solution ◽  
Piecewise Linear Function ◽  
Mixed Integer ◽  
Comparative Case Study ◽  
Dynamic Programming Method ◽  
Individual Unit ◽  
New Formulation ◽  
Bus System

Security-constrained unit commitment (SCUC) is an important tool for independent system operators in the day-ahead electric power market. A serious issue arises that the energy realizability of the staircase generation schedules obtained in traditional SCUC cannot be guaranteed. This paper focuses on addressing this issue, and the basic idea is to formulate the power output of thermal units as piecewise-linear function. All individual unit constraints and systemwide constraints are then reformulated. The new SCUC formulation is solved within the Lagrangian relaxation (LR) framework, in which a double dynamic programming method is developed to solve individual unit subproblems. Numerical testing is performed for a 6-bus system and an IEEE 118-bus system on Microsoft Visual C# .NET platform. It is shown that the energy realizability of generation schedules obtained from the new formulation is guaranteed. Comparative case study is conducted between LR and mixed integer linear programming (MILP) in solving the new formulation. Numerical results show that the near-optimal solution can be obtained efficiently by the proposed LR-based method.

scholarly journals Non-convex nested Benders decomposition

2022 ◽  
Author(s):  
Christian Füllner ◽  
Steffen Rebennack
Keyword(s):  
Benders Decomposition ◽  
Unit Commitment ◽  
Piecewise Linear ◽  
Optimal Solution ◽  
Mixed Integer ◽  
Global Optimality ◽  
Value Functions ◽  
State Variables ◽  
Lipschitz Continuous ◽  
Nested Benders Decomposition

AbstractWe propose a new decomposition method to solve multistage non-convex mixed-integer (stochastic) nonlinear programming problems (MINLPs). We call this algorithm non-convex nested Benders decomposition (NC-NBD). NC-NBD is based on solving dynamically improved mixed-integer linear outer approximations of the MINLP, obtained by piecewise linear relaxations of nonlinear functions. Those MILPs are solved to global optimality using an enhancement of nested Benders decomposition, in which regularization, dynamically refined binary approximations of the state variables and Lagrangian cut techniques are combined to generate Lipschitz continuous non-convex approximations of the value functions. Those approximations are then used to decide whether the approximating MILP has to be dynamically refined and in order to compute feasible solutions for the original MINLP. We prove that NC-NBD converges to an $$\varepsilon $$ ε -optimal solution in a finite number of steps. We provide promising computational results for some unit commitment problems of moderate size.

scholarly journals MINLP formulations for continuous piecewise linear function fitting

2021 ◽  
Author(s):  
Noam Goldberg ◽  
Steffen Rebennack ◽  
Youngdae Kim ◽  
Vitaliy Krasko ◽  
Sven Leyffer
Keyword(s):  
Linear Function ◽  
Piecewise Linear ◽  
Piecewise Linear Function ◽  
Mixed Integer ◽  
Function Fitting ◽  
Computational Performance ◽  
Integer Nonlinear Programming ◽  
Minlp Model ◽  
Necessary Constraints ◽  
Continuous Piecewise Linear Function

AbstractWe consider a nonconvex mixed-integer nonlinear programming (MINLP) model proposed by Goldberg et al. (Comput Optim Appl 58:523–541, 2014. 10.1007/s10589-014-9647-y) for piecewise linear function fitting. We show that this MINLP model is incomplete and can result in a piecewise linear curve that is not the graph of a function, because it misses a set of necessary constraints. We provide two counterexamples to illustrate this effect, and propose three alternative models that correct this behavior. We investigate the theoretical relationship between these models and evaluate their computational performance.

scholarly journals A Novel Approach for Solving Nonsmooth Optimization Problems with Application to Nonsmooth Equations

2013 ◽  
Vol 2013 ◽  
pp. 1-10
Author(s):  
Hamid Reza Erfanian ◽  
M. H. Noori Skandari ◽  
A. V. Kamyad
Keyword(s):  
Nonsmooth Optimization ◽  
Optimization Problems ◽  
Piecewise Linear ◽  
Linear Optimization ◽  
Optimal Solution ◽  
Piecewise Linear Function ◽  
Nonsmooth Equations ◽  
Smooth Functions ◽  
Generalized Derivative ◽  
Novel Approach

We present a new approach for solving nonsmooth optimization problems and a system of nonsmooth equations which is based on generalized derivative. For this purpose, we introduce the first order of generalized Taylor expansion of nonsmooth functions and replace it with smooth functions. In other words, nonsmooth function is approximated by a piecewise linear function based on generalized derivative. In the next step, we solve smooth linear optimization problem whose optimal solution is an approximate solution of main problem. Then, we apply the results for solving system of nonsmooth equations. Finally, for efficiency of our approach some numerical examples have been presented.

scholarly journals The Unit Re-Balancing Problem

Mathematics ◽  
2021 ◽  
Vol 9 (24) ◽  
pp. 3205
Author(s):  
Robin Dee ◽  
Armin Fügenschuh ◽  
George Kaimakamis
Keyword(s):  
Numerical Solutions ◽  
Piecewise Linear ◽  
Geographic Area ◽  
Piecewise Linear Function ◽  
Linear Functions ◽  
Mixed Integer ◽  
Mixed Integer Linear Program ◽  
Commodity Flow ◽  
The Status ◽  
Status Assessment

We describe the problem of re-balancing a number of units distributed over a geographic area. Each unit consists of a number of components. A value between 0 and 1 describes the current rating of each component. By a piecewise linear function, this value is converted into a nominal status assessment. The lowest of the statuses determines the efficiency of a unit, and the highest status its cost. An unbalanced unit has a gap between these two. To re-balance the units, components can be transferred. The goal is to maximize the efficiency of all units. On a secondary level, the cost for the re-balancing should be minimal. We present a mixed-integer nonlinear programming formulation for this problem, which describes the potential movement of components as a multi-commodity flow. The piecewise linear functions needed to obtain the status values are reformulated using inequalities and binary variables. This results in a mixed-integer linear program, and numerical standard solvers are able to compute proven optimal solutions for instances with up to 100 units. We present numerical solutions for a set of open test instances and a bi-criteria objective function, and discuss the trade-off between cost and efficiency.

Study and Application on Real Time Optimum Operation for Plant Units

2005 ◽  
Author(s):  
Yanfen Liao ◽  
Jiejin Cai ◽  
Xiaoqian Ma
Keyword(s):  
Power Plant ◽  
Large Scale ◽  
Unit Commitment ◽  
Operating Cost ◽  
Target Function ◽  
Optimal Solution ◽  
Mixed Integer ◽  
Coal Consumption ◽  
Allocation Model ◽  
Load Demand

The optimum unit commitment is to determine an optimal scheme which can minimize the system operating cost during a period while the load demand, operation constrains of the individual unit are simultaneously satisfied. Since it is characterized as a nonlinear, large scale, discrete, mixed-integer combinatorial optimization problem with constrains, it is always hard to find out the theoretical optimal solution. In this paper, a method combining the priority-order with dynamic comparison is brought out to obtain an engineering optimal solution, and is validated in a power plant composed of three 200MW and two 300MW units. Through simulating the on-line running datum from the DCS system in the power plant, the operating cost curves are obtained in different units, startup/shut-down mode and load demand. According to these curves, an optimum unit commitment model is established based on equal incremental rate principle principle. Make target function be minimum gross coal consumption, the results show that compared with the duty-chief-mode that allocates the load based on operators’ experience, the units’ mean gross coal consumption rate is reduced about 0.5g/(kW·h) when operating by this unit commitment model, and its economic profit is far more than the load economic allocation model that doesn’t considered the units’ start-up/shut-down.

A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting

2021 ◽  
Author(s):  
John Alasdair Warwicker ◽  
Steffen Rebennack
Keyword(s):  
Linear Programming ◽  
Linear Function ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Piecewise Linear ◽  
Piecewise Linear Function ◽  
Mixed Integer ◽  
Data Sets ◽  
Binary Variables ◽  
Function Fitting

The problem of fitting continuous piecewise linear (PWL) functions to discrete data has applications in pattern recognition and engineering, amongst many other fields. To find an optimal PWL function, the positioning of the breakpoints connecting adjacent linear segments must not be constrained and should be allowed to be placed freely. Although the univariate PWL fitting problem has often been approached from a global optimisation perspective, recently, two mixed-integer linear programming approaches have been presented that solve for optimal PWL functions. In this paper, we compare the two approaches: the first was presented by Rebennack and Krasko [Rebennack S, Krasko V (2020) Piecewise linear function fitting via mixed-integer linear programming. INFORMS J. Comput. 32(2):507–530] and the second by Kong and Maravelias [Kong L, Maravelias CT (2020) On the derivation of continuous piecewise linear approximating functions. INFORMS J. Comput. 32(3):531–546]. Both formulations are similar in that they use binary variables and logical implications modelled by big-[Formula: see text] constructs to ensure the continuity of the PWL function, yet the former model uses fewer binary variables. We present experimental results comparing the time taken to find optimal PWL functions with differing numbers of breakpoints across 10 data sets for three different objective functions. Although neither of the two formulations is superior on all data sets, the presented computational results suggest that the formulation presented by Rebennack and Krasko is faster. This might be explained by the fact that it contains fewer complicating binary variables and sparser constraints. Summary of Contribution: This paper presents a comparison of the mixed-integer linear programming models presented in two recent studies published in the INFORMS Journal on Computing. Because of the similarity of the formulations of the two models, it is not clear which one is preferable. We present a detailed comparison of the two formulations, including a series of comparative experimental results across 10 data sets that appeared across both papers. We hope that our results will allow readers to take an objective view as to which implementation they should use.

scholarly journals On Mixed-Integer Programming Formulations for the Unit Commitment Problem

2020 ◽  
Author(s):  
Bernard Knueven ◽  
James Ostrowski ◽  
Jean-Paul Watson
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Unit Commitment ◽  
Piecewise Linear ◽  
Practical Importance ◽  
Production Costs ◽  
Mixed Integer ◽  
Real World Data ◽  
Unit Commitment Problem ◽  
Comprehensive Overview

We provide a comprehensive overview of mixed-integer programming formulations for the unit commitment (UC) problem. UC formulations have been an especially active area of research over the past 12 years due to their practical importance in power grid operations, and this paper serves as a capstone for this line of work. We additionally provide publicly available reference implementations of all formulations examined. We computationally test existing and novel UC formulations on a suite of instances drawn from both academic and real-world data sources. Driven by our computational experience from this and previous work, we contribute some additional formulations for both generator production upper bounds and piecewise linear production costs. By composing new UC formulations using existing components found in the literature and new components introduced in this paper, we demonstrate that performance can be significantly improved—and in the process, we identify a new state-of-the-art UC formulation.

scholarly journals Profit-Based Unit Commitment for a GENCO Equipped with Compressed Air Energy Storage and Concentrating Solar Power Units

Energies ◽  
2021 ◽  
Vol 14 (3) ◽  
pp. 576
Author(s):  
Mostafa Nasouri Gilvaei ◽  
Mahmood Hosseini Imani ◽  
Mojtaba Jabbari Ghadi ◽  
Li Li ◽  
Anahita Golrang
Keyword(s):  
Energy Storage ◽  
Solar Power ◽  
Unit Commitment ◽  
Thermal Power ◽  
System Structure ◽  
Compressed Air ◽  
Mixed Integer ◽  
Compressed Air Energy Storage ◽  
Concentrating Solar Power ◽  
Unit Commitment Problem

With the advent of restructuring in the power industry, the conventional unit commitment problem in power systems, involving the minimization of operation costs in a traditional vertically integrated system structure, has been transformed to the profit-based unit commitment (PBUC) approach, whereby generation companies (GENCOs) perform scheduling of the available production units with the aim of profit maximization. Generally, a GENCO solves the PBUC problem for participation in the day-ahead market (DAM) through determining the commitment and scheduling of fossil-fuel-based units to maximize their own profit according to a set of forecasted price and load data. This study presents a methodology to achieve optimal offering curves for a price-taker GENCO owning compressed air energy storage (CAES) and concentrating solar power (CSP) units, in addition to conventional thermal power plants. Various technical and physical constraints regarding the generation units are considered in the provided model. The proposed framework is mathematically described as a mixed-integer linear programming (MILP) problem, which is solved by using commercial software packages. Meanwhile, several cases are analyzed to evaluate the impacts of CAES and CSP units on the optimal solution of the PBUC problem. The achieved results demonstrate that incorporating the CAES and CSP units into the self-scheduling problem faced by the GENCO would increase its profitability in the DAM to a great extent.

Sign in / Sign up

Export Citation Format

Share Document