Network constrained security control using an interior point algorithm
- National Sun Yat-Sen Univ., Kaohsiung (Taiwan, Province of China)
- Harris Controls and Composition Div., Melbourne, FL (United States)
Karmarkar's interior point method, said to perform much faster than the simplex method in solving large scale linear programming problems, has attracted a great deal of attention in recent years. In this paper the authors present a preliminary implementation of the interior point algorithm and test results on the network constrained security control problem. Test results indicate that when solving various sizes of the network constrained security control linear programming problems with increasing numbers of controls and constraints, both the total number of iterations and the overall execution time grow at a slower rate in the interior point method than in the simplex method. The number of iterations required by the interior point method is relatively insensitive to problem size and composition, while iteration counts for the simplex method tend to be much higher in the presence of large numbers of control variables and/or constraints.
- OSTI ID:
- 5676693
- Journal Information:
- IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers); (United States), Journal Name: IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers); (United States) Vol. 8:3; ISSN ITPSEG; ISSN 0885-8950
- Country of Publication:
- United States
- Language:
- English
Similar Records
A tutorial description of an interior point method and its applications to security-constrained economic dispatch
A fast algorithm for power system optimization problems using an interior point method