About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
EJOR
Paper
A decomposition approach for the fuel-constrained economic power-dispatch problem
Abstract
We consider a special class of non-convex programs that are encountered in dispatching the generating units of an electric company. The general form of these problems is {min cTx:lj≤Ajxj≤u j,xj≥0,∑j=1mx i,tj=fi(yi,t),By=d,y≥0}, where c≥0, all entries in A are non-negative, and fi(yi,t)≥0. We show that one can achieve global optimality in the case of lj=0. For the special case in which Aj is a vector of ones, we suggest an alternative formulation in which the non-linearity is moved to the objective function. Numerical results indicate significant improvement in the number of iterations and computer time needed to solve the problem.