Exploiting special structure in interior-point algorithms for power generation dispatching
Different mathematical models of the power generation dispatching problem can be solved using interior-point algorithms for linear programming. The efficiency of these algorithms is related to the effort required to factorise the matrix used to solve for the search direction at each iteration. In this paper, it is shown that when the problems are formulated in symmetric form (i.e. the constraints are ), two mathematically equivalent forms for the search direction can be obtained. These are the primal form and the dual form, both involving positive definite matrices. By analysing the fill-in in both forms prior to factorisation, a form with the least fill-in is found for each of the dispatching problems. Simulation results on standard IEEE test systems and on a practical network confirm that the primal form is most advantageous for unconstrained scheduling problems but for constrained problems with a DC network model, the dual form is superior.
fill-in economic operation primaldual