Benders decomposition for solving unit commitment
2016-08-23
10 0 0
3.0
Other
Earn points
Benders Decomposition algorithm was first proposed by j.f.benders in 1962. It is an algorithm for solving mixed integer programming problems. Benders Decomposition algorithm decomposes the programming problem with complex variables into linear programming and integer programming, decomposes the main problem and subproblem by cutting plane method, and solves the optimal value by iterative method.
matlab
Related Source Codes
GMSK Linear Receiver
0
0
no vote
NSGA-II algorithm
0
0
no vote
NSGA-III multi-objective optimization algorithm
0
0
no vote
Compressed sensing example
0
0
no vote
CFAR detector example
0
0
no vote
No comment