A fast algorithm for power system optimization problems using an interior point method

IEEE Transactions on Power Systems

Volumn 7, Issue 2, 1992, Pages 892-899

  Ponnambalam, K ^a   Quintana, V H ^b   Vannelli, A ^b  

^a Department of Systems Design Engineering ^*  (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Interior Point Methods Hydro Scheduling; Optimization Linear Programming Karmarkar's

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; MATHEMATICAL PROGRAMMING, LINEAR; OPTIMIZATION;

DUAL AFFINE ALGORITHM; INTERIOR POINT METHODS; SIMPLEX CODE MINOS; SIMPLEX METHOD;

ELECTRIC POWER SYSTEMS;

EID: 0026867835     PISSN: 08858950     EISSN: 15580679     Source Type: Journal    
DOI: 10.1109/59.141801     Document Type: Article

References (24)

1. B.Stott, J.L. Marinho and O. Alsac, “Review of Linear Programming Applied Power System Rescheduling”, Proc. of 1979 PICA Conf., pp. 142–154, Minnesota, MN, 1979.
2. J.S. Horton and L. L. Grigsby, ‘Voltage Optimization Using Combined Linear Programming and Gradient Techniques”, IEEE Tran. on Power Apparatus and Systems, Vol. PAS-102,No.7, July 1984.
3. H. Habibollahzadeh, G.X. Luo and A. Semlyen, “Hydrothermal Optimal Power Flow Based on A Combined Linear and Nonlinear Programming Methodology”, IEEE Tran. on Power Systems, Vol.4, No.2., May 1989.
4. N. Karmarkar, “A New Polynomial-time Algorithm for Linear Programming”, Combinatorica, 4, pp. 373–395, 1984.
5. N. Karmarkar and K.G. Ramakrishnan, “Implementation and Computational Results of the Karmarkar Algorithm for Linear Programming, Using an Iterative Method for Computing Projections”, 13th International Math. Prog. Symposium, Tokyo, Japan, August 1988.
6. B.A. Murtaugh and M.A. Saunders, “MINOS 5.0 User's Guide”, Tech. Rep. SOL 83-20, Stanford Univ., CA, 1983.
7. I. I. Dikin, “Iterative Solution of Problems of Linear and Quadratic Programming”, Soviet Math. Doklady, 8, pp. 674–675, 1967.
8. A. Kozlov, “The Karmarkar Algorithm: Is It for Real?, SIAM News, 18(6), pp. 1–4, 1985.
9. I. Adler, N. Karmarkar, M.G.C. Resende and G. Veiga, “An Implementation of Karmarkar’s Algorithm for Linear Programming”, Working Paper, Operations Research Center, Univ. of California, Berkeley, C.A, 1986, (also in Math. Prog., 44, pp. 297–335, 1989).
10. M. S. Bazaraa, J.J. Jarvis and H.D. Sherali, “Linear Programming and Network Flows”, Second Edition, John Wiley and Sons, Toronto, 1990.
11. A. Charnes, K.O. Kortanek and W. Raike, “Extreme Point Solutions in Mathematical Programming: An Opposite Sign Algorithm”, Systems Research Memorandum No. 129, Northwestern University, Evanston, 1965.
12. Y. Ye, and M. Kojima, “Recovering Optimal Dual Solutions in Karmarkar's Polynomial-time Algorithm for Linear Programming”, Math. Prog., 39, pp. 305–318, 1987.
13. N. Megiddo, “On Finding Primal- and Dual-Optimal Bases”, Research Report, RJ 6328 (61997), IBM Yorktown Heights, New York, 1988.
14. K. Ponnambalam, “New Starting and Stopping Procedures for the Dual Affine Method”, Working Paper, Dept. of Civil Engg., University of Waterloo, 1988.
15. K. Ponnambalam, A. Vannelli, E.A. McBean and T.E. Unny, “Solving Large-scale Electric Energy Production Planning and Pollution Control Problems with Karmarkar Algorithms”, Proc. of Workshop on Resource Planning Under Uncertainty for Electric Power Systems, Stanford Univeristy, Eds. G.B. Dantzig and P. Glynn, 179–196, Jan 1989.
16. K. Ponnambalam, “Large Scale Nonlinear Programming Using Interior Point and Successive Linear Programming Methods, SIAM Annual Meeting, July 16-20, Chicago, 1990.
17. Mathematical Programming System Extended (MPSX), IBM Computers Manual, 1979.
18. M.J. Best and K. Ritter, “Linear Programming: Active Set Analysis and Computer Programs”, Prentice Hall Inc., NJ., 1985.
19. J.L. Kennington and R. V. Helgason, “Algorithm for Network Programming”, John Wiley and Sons, N.Y., 1981.
20. K. Ponnambalam, A. Vannelli, and S. Woo, “An Interior Point Implementation for Solving Large Planning Problems in the Oil Refinery Industry”, submitted to Canadian J. of Chem. Engg., July 1990.
21. N. Munksgaard, “Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients”, ACM Trans. on Math. Soft., 6, pp. 206–219, 1980.
22. J.M. Ortega, “Introduction to Parallel and Vector Solution of Linear Systems”, Plenum Press, N.Y., 1988.
23. D. P. Loucks, J.R. Stedinger and D.A. Haith, “Water Resource Systems Planning and Analysis”, Prentice-Hall Inc., N.J., 1981.
24. Anthony Vannelli, “An Adaptation of the Interior Point Method for Solving the Glabal Routine Problem,” IEEE Trans. on Computer-Aided Design, Vol. 10, No. 2, Feb. 1991, pp. 193–203.