Thesis (M.S.)--University of Missouri--Rolla, 1989. / Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed October 7, 2008) Includes bibliographical references (p. 89).

Thesis (Diploma (Electrical Engineering))--Cape Technikon, 1993. / The research objectives were to: Formulate a training structure covering conventional power systems topics; Research existing PC based power systems software resources; Develop a structure for a PC based power systems course; Research the capabilities of the software resources chosen; Develop a structure for a modern PC based power systems course taking into account the capabilities and limitations of the selected software programs; Develop for the PC based power systems course, task orientated computer based laboratory set-ups. The set-ups provide: An introduction into the topics concerned; An explanation of the usage of each program applied, where usage means an explanation of the Input and Output Data of each program; User friendly simulation experiments. These set-ups, together with software programs and a personal computer integrate into a training programme and realize a power systems simulation course.

No description available.

No description available.

Thesis (M.S.)--West Virginia University, 2003. / Title from document title page. Document formatted into pages; contains vii, 68 p. : ill. Includes abstract. Includes bibliographical references (p. 66-68).

published_or_final_version / Architecture / Master / Master of Landscape Architecture

published_or_final_version / Electrical Engineering / Doctoral / Doctor of Philosophy

No description available.

No description available.

This thesis is the result of an investigation to assess the potential of the continuation method to solve the minimum cost optimal power flow problem. For this purpose, a restart homotopy continuation method algorithm is developed, which contains in essence two phases. / The pertinent steps of the first phase are as follows: (1) Create a sub-problem of the complete optimal power flow problem by relaxing boundary limits on all functional variables, namely voltages at load buses, line flows and reactive generations. (2) Parameterize a subset of the whole set of controls which comprises initially of tap-changers, phase-shifters, shunt controllers, and the voltages at generation buses. (3) Optimize the resulting problem. / The solution in step (3) is used as an initial starting point in a continuation process, designed to track this solution to the optimal solution of the sub-problem defined in step (1). The tracking is accomplished via a predictor-corrector path following algorithm embodying certain special features, such that the solution accuracy can be improved to any desired degree through a flexible restart feature developed in this study. Within the tracking process only a subset (identified in step 2 above) of the whole set of controls require specific monitoring for break-points. This feature greatly reduces the computational burden. Termination of the first phase marks an operating point in which all controls are strictly feasible. / If, following the termination of the first phase, functional variables previously ignored prove to be within their respective bounds, the solution to the sub-problem becomes the solution to the complete optimal power flow problem. However, should functional variables violate their bounds the second phase of the algorithm is invoked, which in essence creates a new sub-problem by changing the roles of the control and violated dependent variables, such that the newly modified sub-problem maintains the same basic structure as its predecessor. / Phase I is invoked again at this juncture to solve the modified sub-problem. This process is repeated in cycles until the Kuhn-Tucker optimality conditions are satisfied. Simulations suggest that convergence is usually achieved within two or three Phase I/II cycles. / This being a method unique to the minimum cost optimal power flow problem, numerous examples (up to 118 buses) have been tested and compared against the commercial code MINOS. The newly proposed algorithm appears to be faster and more reliable.