1992
DOI: 10.1016/0956-0521(92)90029-i
|View full text |Cite
|
Sign up to set email alerts
|

Parallel Lagrangian relaxation in power scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

1996
1996
2018
2018

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 4 publications
0
5
0
Order By: Relevance
“…Many methods of optimisation have been proposed in the context of control systems, such as Lagrangian relaxation (LR) [1][2][3][4], dynamic programming (DP) [5][6][7], mixed-integer programming [8,9], branch and bound [10,11], and logic programming [12]. Although the introduction of the Lagrangian multiplier simplifies the calculation by structuring the dual problem in the LR, it is challenging to deal with coupling constraints between units.…”
Section: Introductionmentioning
confidence: 99%
“…Many methods of optimisation have been proposed in the context of control systems, such as Lagrangian relaxation (LR) [1][2][3][4], dynamic programming (DP) [5][6][7], mixed-integer programming [8,9], branch and bound [10,11], and logic programming [12]. Although the introduction of the Lagrangian multiplier simplifies the calculation by structuring the dual problem in the LR, it is challenging to deal with coupling constraints between units.…”
Section: Introductionmentioning
confidence: 99%
“…Over many years, numerous researchers have developed various mathematical programming and optimization techniques, including equal increment method, branch and bound algorithm, mixed integer linear programming (MILP), decomposition approach, Lagrangian relaxation, and dynamic programming (DP) to solve inner-plant economical operation of hydropower stations (Allen & Bridgeman 1986;Cohen & Yoshimura 1987;Snyder et al 1987;Oliveira et al 1992;Guan et al 1995;Georgakakos et al 1997;Cheng et al 2000;Martin 2000;Siu et al 2001;Baltar et al 2002;Yi et al 2003). Among the different optimization approaches, DP has enjoyed much popularity, because it can offer convenient and efficient solutions for optimizing committed hydro units' load scheduling.…”
Section: Introductionmentioning
confidence: 99%
“…where SSR is the sum of squares of reserves as in (19), TMV is the total manpower violation of (21), and TLV is the total load violation of (22). The weighting coefficients ω O, , ω M and ω L are chosen so that the penalty values for the constraint violations dominate over the objective function, and the violation of the relatively hard load constraint (22) gives a greater penalty value than for the relatively soft crew constraint.…”
Section: Test Gms Problemmentioning
confidence: 99%
“…Recent work has favoured Lagrangian Relaxation [18], in which the global constraints of demand and reserve are admitted into the objective function, and the problem decomposed into master problem and unit subproblems. This natural algorithmic decomposition admits parallelisation [19]. The method provides bounds on the original optimum but a heuristic must be employed to construct a feasible solution for the original problem.…”
Section: Introductionmentioning
confidence: 99%