from
Quadratic Programming Solution to Dynamic Economic Dispatch
by Saloman Danaraj
This program solves the Dynamic Economic Dispatch by quadratic Programming.
|
| test1.m |
clear;
clc;
% This program solves the dynamic economic dispatch by
% quadratic programming and equal incremental cost critetion
% the data matrix should have 5 columns of fuel cost coefficients and plant limits.
% 1.a ($/MW^2) 2. b $/MW 3. c ($) 4.lower lomit(MW) 5.Upper limit(MW)
data=[0.0051 2.2034 15.0000 12.0000 73.0000
0.0040 1.9104 25.0000 26.0000 93.0000
0.0039 1.8518 40.0000 42.0000 143.0000
0.0038 1.6966 32.0000 18.0000 70.0000
0.0021 1.8015 29.0000 30.0000 93.0000
0.0026 1.5354 72.0000 100.0000 350.0000
0.0029 1.2643 49.0000 100.0000 248.0000
0.0015 1.2130 82.0000 40.0000 190.0000
0.0013 1.1954 105.0000 70.0000 190.0000
0.0014 1.1285 100.0000 40.0000 113.0000];
Pd1=[796 867 898 963 1072 1190 1391]';
dyneld
Allocation=PP'
Tcost
|
|
Contact us at files@mathworks.com