Reliability-Security Constrained Unit Commitment based on benders decomposition and Mixed Integer Non-Linear Programming

2017 ◽  
Author(s):  
Pranda Prasanta Gupta ◽  
Prerna Jain ◽  
Suman Sharma ◽  
Rohit Bhakar
Keyword(s):  
Linear Programming ◽  
Benders Decomposition ◽  
Unit Commitment ◽  
Mixed Integer ◽  
Non Linear Programming ◽  
Non Linear

scholarly journals Security Constrained Unit Commitment in a Power System based on Benders Decomposition and Mixed Integer Non-linear Programming

2018 ◽  
Vol 7 (2.6) ◽  
pp. 283 ◽  
Author(s):  
Pranda Prasanta Gupta ◽  
Prerna Jain ◽  
Suman Sharma ◽  
Rohit Bhakar
Keyword(s):  
Linear Programming ◽  
Network Security ◽  
Power System ◽  
Optimal Power Flow ◽  
Benders Decomposition ◽  
Optimal Solution ◽  
Mixed Integer ◽  
Reserve Requirement ◽  
Non Linear Programming ◽  
Non Linear

In deregulated power markets, Independent System Operators (ISOs) maintains adequate reserve requirement in order to respond to generation and system security constraints. In order to estimate accurate reserve requirement and handling non-linearity and non-convexity of the problem, an efficient computational framework is required. In addition, ISO executes SCUC in order to reach the consistent operation. In this paper, a novel type of application which is Benders decomposition (BD) and Mixed integer non linear programming (MINLP) can be used to assess network security constraints by using AC optimal power flow (ACOPF) in a power system. It performs ACOPF in network security check evaluation with line outage contingency. The process of solving modified system would be close to optimal solution, the gap between the close to optimal and optimal solution is expected to determine whether a close to optimal solutionis accepetable for convenientpurpose. This approach drastically betters the fast computational requirement in practical power system .The numerical case studies are investigated in detail using an IEEE 118-bus system. 

Mixed Integer Non-Linear Programming models for Green Network Design

2013 ◽  
Vol 40 (1) ◽  
pp. 273-281 ◽  
Author(s):  
Rosario G. Garroppo ◽  
Stefano Giordano ◽  
Gianfranco Nencioni ◽  
Maria Grazia Scutellà
Keyword(s):  
Linear Programming ◽  
Network Design ◽  
Programming Models ◽  
Mixed Integer ◽  
Non Linear Programming ◽  
Non Linear

scholarly journals On Vehicle routing Problem using Mixed Integer Non-Linear Programming

2020 ◽  
pp. 32-34
Keyword(s):  
Linear Programming ◽  
Vehicle Routing Problem ◽  
Programming Model ◽  
Minimum Cost ◽  
Mixed Integer ◽  
Routing Problem ◽  
Non Linear Programming ◽  
Electric Vehicle Charging ◽  
The Family ◽  
Non Linear

The family of (VRPs) has received remarkable attention in the field of combinatorial optimization after its introduction in the paper of Dantzig and Ramser. VRPs determine a set of vehicle routes in order to accomplish transportation requests at minimum cost. In this paper we develop a mixed-integer non-linear programming model for vrp and apply it in electric vehicle charging.

Sign in / Sign up

Export Citation Format

Share Document