Power-system load scheduling with security constraints using dual linear programming /
The optimisation of power-system operating conditions is formulated as aduallinear programming problem. This suboptimal model allows fast solutions to be obtained dependably by applyingn the revised simplex I.p method to the problem of minimising total generation costs subject to the constraints...
| Main Authors: | , |
|---|---|
| Format: | |
| Subjects: |
| _version_ | 1796681420871041024 |
|---|---|
| author | 439131 Shen, C. M. Laughton, M. A. |
| author_facet | 439131 Shen, C. M. Laughton, M. A. |
| author_sort | 439131 Shen, C. M. |
| collection | OCEAN |
| description | The optimisation of power-system operating conditions is formulated as aduallinear programming problem. This suboptimal model allows fast solutions to be obtained dependably by applyingn the revised simplex I.p method to the problem of minimising total generation costs subject to the constraints imposed. These constraints include the network equations, the inequalities restricting generator loading, running-spare capacity and transmission-line loading under normal and outage conditions. The fast speed of solution and low computer-storage requirements result from the reduced mathematical model developed by means of the variable elimination and the computing strategy used. The computational procedure automatically adjusts the size of the problem to be solved according to indications obtained of the likely critical line-outage security constraints, a small number in relation to the prohibitivelylarge number of possible outage constraints. A sample application of the method is given for a 2700MW, 275/132kv system of 23 busbars,30 lines and transformers, supplied by 24 generators. Using ALGOL 60 on the Atlas computer, solutions were obtained in 5's neglecting line-outage security, and 11.5's including security under all possible single-line-outage conditons. For accuracy, comparisons are also made with the network-flow technique and the full nonlinear programming solutions. |
| first_indexed | 2024-03-04T21:27:52Z |
| format | |
| id | KOHA-OAI-TEST:179617 |
| institution | Universiti Teknologi Malaysia - OCEAN |
| last_indexed | 2024-03-04T21:27:52Z |
| record_format | dspace |
| spelling | KOHA-OAI-TEST:1796172020-12-19T17:04:57ZPower-system load scheduling with security constraints using dual linear programming / 439131 Shen, C. M. Laughton, M. A. The optimisation of power-system operating conditions is formulated as aduallinear programming problem. This suboptimal model allows fast solutions to be obtained dependably by applyingn the revised simplex I.p method to the problem of minimising total generation costs subject to the constraints imposed. These constraints include the network equations, the inequalities restricting generator loading, running-spare capacity and transmission-line loading under normal and outage conditions. The fast speed of solution and low computer-storage requirements result from the reduced mathematical model developed by means of the variable elimination and the computing strategy used. The computational procedure automatically adjusts the size of the problem to be solved according to indications obtained of the likely critical line-outage security constraints, a small number in relation to the prohibitivelylarge number of possible outage constraints. A sample application of the method is given for a 2700MW, 275/132kv system of 23 busbars,30 lines and transformers, supplied by 24 generators. Using ALGOL 60 on the Atlas computer, solutions were obtained in 5's neglecting line-outage security, and 11.5's including security under all possible single-line-outage conditons. For accuracy, comparisons are also made with the network-flow technique and the full nonlinear programming solutions.The optimisation of power-system operating conditions is formulated as aduallinear programming problem. This suboptimal model allows fast solutions to be obtained dependably by applyingn the revised simplex I.p method to the problem of minimising total generation costs subject to the constraints imposed. These constraints include the network equations, the inequalities restricting generator loading, running-spare capacity and transmission-line loading under normal and outage conditions. The fast speed of solution and low computer-storage requirements result from the reduced mathematical model developed by means of the variable elimination and the computing strategy used. The computational procedure automatically adjusts the size of the problem to be solved according to indications obtained of the likely critical line-outage security constraints, a small number in relation to the prohibitivelylarge number of possible outage constraints. A sample application of the method is given for a 2700MW, 275/132kv system of 23 busbars,30 lines and transformers, supplied by 24 generators. Using ALGOL 60 on the Atlas computer, solutions were obtained in 5's neglecting line-outage security, and 11.5's including security under all possible single-line-outage conditons. For accuracy, comparisons are also made with the network-flow technique and the full nonlinear programming solutions.12PSZJBLElectric power systemsLinear programming |
| spellingShingle | Electric power systems Linear programming 439131 Shen, C. M. Laughton, M. A. Power-system load scheduling with security constraints using dual linear programming / |
| title | Power-system load scheduling with security constraints using dual linear programming / |
| title_full | Power-system load scheduling with security constraints using dual linear programming / |
| title_fullStr | Power-system load scheduling with security constraints using dual linear programming / |
| title_full_unstemmed | Power-system load scheduling with security constraints using dual linear programming / |
| title_short | Power-system load scheduling with security constraints using dual linear programming / |
| title_sort | power system load scheduling with security constraints using dual linear programming |
| topic | Electric power systems Linear programming |
| work_keys_str_mv | AT 439131shencm powersystemloadschedulingwithsecurityconstraintsusingduallinearprogramming AT laughtonma powersystemloadschedulingwithsecurityconstraintsusingduallinearprogramming |