2016
DOI: 10.4018/ijaie.2016010102
|View full text |Cite
|
Sign up to set email alerts
|

Economic Load Dispatch Using Linear Programming

Abstract: This paper presents an optimum solution of the economic dispatch (ED) problem without considering transmission losses using linear programming (LP). In the ED problem, several on-line units (generators) are available, and it is needed to determine the power to produce by each unit in order to meet the required load at minimum total cost. To apply LP, the nonlinear cost functions of all generators are approximated by linear piecewise functions. To examine the effectiveness of this linearization method, a compre… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 26 publications
0
3
0
Order By: Relevance
“…As discussed previously, the cost function presented in ( 2) is in a quadratic form. Given this nonlinear cost equation for generator i, it is possible to approximate the nonlinear curve by a series of straight-line segments [28]. Figure 2 shows an example of a linearized cost function represented by three linear segments.…”
Section: Linearization Methodology and Linear Programmingmentioning
confidence: 99%
“…As discussed previously, the cost function presented in ( 2) is in a quadratic form. Given this nonlinear cost equation for generator i, it is possible to approximate the nonlinear curve by a series of straight-line segments [28]. Figure 2 shows an example of a linearized cost function represented by three linear segments.…”
Section: Linearization Methodology and Linear Programmingmentioning
confidence: 99%
“…This traditional representation of ED difficulty formulates the price purpose of generating unit as a single quadratic function, this formulation ignores the valve-point effects hence the inaccurate results [5], [7].The realistic ED difficulty is nonlinear, non-smooth, non-convex and more complex owed in occurrence of valve-point loading and ramp limits which complicates the global optimum search [5], [8]. In excess of the precedent decades, a lot of classical techniques have been used for solving the ED problem like linear programming [9], non-linear programming [10], quadratic programming [11], dynamic programming [12], interior point programming [13], mixed integer programming [14], Pattern Search method [15], Lagrangian relaxation algorithm [16] , Newton-Raphson method [17],Lambda iteration [18] and Gradient method. These classical methods suffer from some limitations and inconveniences such as: Worse convergence and computational complexity [19], High sensitivity of initial approximate calculations [20], Difficulties in handling nonlinear, non-convex and non-smooth problems [21], The accurate optimum solution is only guaranteed to continuous cost function which does not coincide with the practical ED problem [22], Not applicable to several real-life problems.…”
Section: Introductionmentioning
confidence: 99%
“…A huge number of optimization approaches using mathematical programming have been widely applied so far for solving the considered OLD problem such as dynamic programming (DP) [2], lambda iteration method [3], Newton Raphson and Lagrangian multiplier (NRLM) method [4], and linear programming (LP) [5,6]. Conventional methods focused on the systems with simple constraints and convex objective function where nonlinear constraints and the effects of valve loading process were not considered.…”
Section: Introductionmentioning
confidence: 99%