A TUTORIAL DESCRIPTION OF AN INTERIOR-POINT METHOD AND ITS APPLICATIONS TO SECURITY-CONSTRAINED ECONOMIC-DISPATCH

This paper deals with the use of Successive Linear Programming (SLP) for the solution of the Security-Constrained Economic Dispatch (SCED) problem. We tutorially describe an Interior Point Method (IPM) for the solution of Linear Programming (LP) problems, discussing important implementation issues that really make this method far superior to the simplex method. A study of the convergence of the SLP technique and a practical criterion to avoid oscillatory behavior in the iteration process are also proposed. A comparison of the proposed method with an efficient simplex code (MINOS) is carried out by solving SCED problems on two standard IEEE systems. The results show that the interior point technique is reliable, accurate and more than two times faster than the simplex algorithm.