Home > Research > Publications & Outputs > Optimisation methods for electric power system ...

Electronic data

  • 2025LiPhD

    Final published version, 4.17 MB, PDF document

    Embargo ends: 12/02/26

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

Text available via DOI:

View graph of relations

Optimisation methods for electric power system operations

Research output: ThesisDoctoral Thesis

Published

Standard

Optimisation methods for electric power system operations. / Li, Liam.
Lancaster University, 2025. 194 p.

Research output: ThesisDoctoral Thesis

Harvard

APA

Li, L. (2025). Optimisation methods for electric power system operations. [Doctoral Thesis, Lancaster University]. Lancaster University. https://doi.org/10.17635/lancaster/thesis/2865

Vancouver

Li L. Optimisation methods for electric power system operations. Lancaster University, 2025. 194 p. doi: 10.17635/lancaster/thesis/2865

Author

Bibtex

@phdthesis{5afcfa5186254b1297db04a066352060,
title = "Optimisation methods for electric power system operations",
abstract = "Economically efficient and contingency-reliable operations in electric power systems are vital for modern society, with optimisation-based decision support systems serving as instrumental tools. This thesis focuses on advancing solution methods for the AC Optimal Power Flow (OPF) and AC Optimal Transmission Switching (OTS) problems, both fundamental to power system operations. The first part of this thesis explores mixed-integer linear programming (MILP) approaches for the OPF and OTS problems. Extensive computational experiments are conducted to investigate the advantages and disadvantages of a widely used MILP method for the OTS problem. Building upon these insights, a new MILP-based approach for the OTS problem is proposed, with computational experiments demonstrating its effectiveness under a special operating condition. Additionally, a piecewise linear relaxation of the OPF problem utilising state-of-the-art mixed-integer programming techniques is introduced, with computational experiments illustrating its effectiveness under certain operating conditions. The second part explores convex conic optimisation methods for the AC OPF problem and mixed-integer convex conic optimisation approaches for the AC OTS problem. Two classes of valid inequalities are developed to strengthen an existing convex conic relaxation of the AC OPF problem. Moreover, one of these classes of valid inequalities is adapted to improve an existing mixed-integer second-order conic programming relaxation of the OTS problem, further strengthened by polyhedral results to mitigate computational challenges. Computational experiments demonstrate the effectiveness of the proposed approaches for both the AC OPF and AC OTS problems.",
author = "Liam Li",
year = "2025",
doi = "10.17635/lancaster/thesis/2865",
language = "English",
publisher = "Lancaster University",
school = "Lancaster University",

}

RIS

TY - BOOK

T1 - Optimisation methods for electric power system operations

AU - Li, Liam

PY - 2025

Y1 - 2025

N2 - Economically efficient and contingency-reliable operations in electric power systems are vital for modern society, with optimisation-based decision support systems serving as instrumental tools. This thesis focuses on advancing solution methods for the AC Optimal Power Flow (OPF) and AC Optimal Transmission Switching (OTS) problems, both fundamental to power system operations. The first part of this thesis explores mixed-integer linear programming (MILP) approaches for the OPF and OTS problems. Extensive computational experiments are conducted to investigate the advantages and disadvantages of a widely used MILP method for the OTS problem. Building upon these insights, a new MILP-based approach for the OTS problem is proposed, with computational experiments demonstrating its effectiveness under a special operating condition. Additionally, a piecewise linear relaxation of the OPF problem utilising state-of-the-art mixed-integer programming techniques is introduced, with computational experiments illustrating its effectiveness under certain operating conditions. The second part explores convex conic optimisation methods for the AC OPF problem and mixed-integer convex conic optimisation approaches for the AC OTS problem. Two classes of valid inequalities are developed to strengthen an existing convex conic relaxation of the AC OPF problem. Moreover, one of these classes of valid inequalities is adapted to improve an existing mixed-integer second-order conic programming relaxation of the OTS problem, further strengthened by polyhedral results to mitigate computational challenges. Computational experiments demonstrate the effectiveness of the proposed approaches for both the AC OPF and AC OTS problems.

AB - Economically efficient and contingency-reliable operations in electric power systems are vital for modern society, with optimisation-based decision support systems serving as instrumental tools. This thesis focuses on advancing solution methods for the AC Optimal Power Flow (OPF) and AC Optimal Transmission Switching (OTS) problems, both fundamental to power system operations. The first part of this thesis explores mixed-integer linear programming (MILP) approaches for the OPF and OTS problems. Extensive computational experiments are conducted to investigate the advantages and disadvantages of a widely used MILP method for the OTS problem. Building upon these insights, a new MILP-based approach for the OTS problem is proposed, with computational experiments demonstrating its effectiveness under a special operating condition. Additionally, a piecewise linear relaxation of the OPF problem utilising state-of-the-art mixed-integer programming techniques is introduced, with computational experiments illustrating its effectiveness under certain operating conditions. The second part explores convex conic optimisation methods for the AC OPF problem and mixed-integer convex conic optimisation approaches for the AC OTS problem. Two classes of valid inequalities are developed to strengthen an existing convex conic relaxation of the AC OPF problem. Moreover, one of these classes of valid inequalities is adapted to improve an existing mixed-integer second-order conic programming relaxation of the OTS problem, further strengthened by polyhedral results to mitigate computational challenges. Computational experiments demonstrate the effectiveness of the proposed approaches for both the AC OPF and AC OTS problems.

U2 - 10.17635/lancaster/thesis/2865

DO - 10.17635/lancaster/thesis/2865

M3 - Doctoral Thesis

PB - Lancaster University

ER -