• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 6
  • 4
  • Tagged with
  • 10
  • 10
  • 6
  • 5
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • 3
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Optimization problems with complementarity constraints in infinite-dimensional spaces

Wachsmuth, Gerd 10 August 2017 (has links) (PDF)
In this thesis we consider optimization problems with complementarity constraints in infinite-dimensional spaces. On the one hand, we deal with the general situation, in which the complementarity constraint is governed by a closed convex cone. We use the local decomposition approach, which is known from finite dimensions, to derive first-order necessary optimality conditions of strongly stationary type. In the non-polyhedric case, stronger conditions are obtained by an additional linearization argument. On the other hand, we consider the optimal control of the obstacle problem. This is a classical example for a problem with complementarity constraints in infinite dimensions. We are concerned with the control-constrained case. Due to the lack of surjectivity, a system of strong stationarity is not necessarily satisfied for all local minimizers. We identify assumptions on the data of the optimal control problem under which strong stationarity of local minimizers can be verified. Moreover, without any additional assumptions on the data, we show that a system of M-stationarity is satisfied provided that some sequence of multipliers converges in capacity. Finally, we also discuss the notion of polyhedric sets. These sets have many applications in infinite-dimensional optimization theory. Since the results concerning polyhedricity are scattered in the literature, we provide a review of the known results. Furthermore, we give some new results concerning polyhedricity of intersections and provide counterexamples which demonstrate that intersections of polyhedric sets may fail to be polyhedric. We also prove a new polyhedricity result for sets in vector-valued Sobolev spaces.
2

Approches basées sur DCA pour la programmation mathématique avec des contraintes d'équilibre / DCA based Approaches for Mathematical Programs with Equilibrium Constraints

Nguyen, Thi Minh Tam 10 September 2018 (has links)
Dans cette thèse, nous étudions des approches basées sur la programmation DC (Difference of Convex functions) et DCA (DC Algorithm) pour la programmation mathématique avec des contraintes d'équilibre, notée MPEC (Mathematical Programming with Equilibrum Constraints en anglais). Etant un sujet classique et difficile de la programmation mathématique et de la recherche opérationnelle, et de par ses diverses applications importantes, MPEC a attiré l'attention de nombreux chercheurs depuis plusieurs années. La thèse se compose de quatre chapitres principaux. Le chapitre 2 étudie une classe de programmes mathématiques avec des contraintes de complémentarité linéaire. En utilisant quatre fonctions de pénalité, nous reformulons le problème considéré comme des problèmes DC standard, i.e minimisation d'une fonction DC sous les contraintes convexes. Nous développons ensuite des algorithmes appropriés basés sur DCA pour résoudre les problèmes DC résultants. Deux d'entre eux sont reformulés encore sous la forme des problèmes DC généraux (i.e. minimisation d'une fonction DC sous des contraintes DC) pour que les sous-problèmes convexes dans DCA soient plus faciles à résoudre. Après la conception de DCA pour le problème considéré, nous développons ces schémas DCA pour deux cas particuliers: la programmation quadratique avec des contraintes de complémentarité linéaire, et le problème de complémentarité aux valeurs propres. Le chapitre 3 aborde une classe de programmes mathématiques avec des contraintes d'inégalité variationnelle. Nous utilisons une technique de pénalisation pour reformuler le problème considéré comme un programme DC. Une variante de DCA et sa version accélérée sont proposées pour résoudre ce programme DC. Comme application, nous résolvons le problème de détermination du prix de péages dans un réseau de transport avec des demandes fixes (" the second-best toll pricing problem with fixed demands" en anglais). Le chapitre 4 se concentre sur une classe de problèmes d'optimisation à deux niveaux avec des variables binaires dans le niveau supérieur. En utilisant une fonction de pénalité exacte, nous reformulons le problème considéré comme un programme DC standard pour lequel nous développons un algorithme efficace basé sur DCA. Nous appliquons l'algorithme proposé pour résoudre le problème d'interdiction de flot maximum dans un réseau ("maximum flow network interdiction problem" en anglais). Dans le chapitre 5, nous nous intéressons au problème de conception de réseau d'équilibre continu ("continuous equilibrium network design problem" en anglais). Il est modélisé sous forme d'un programme mathématique avec des contraintes de complémentarité, brièvement nommé MPCC (Mathematical Program with Complementarity Constraints en anglais). Nous reformulons ce problème MPCC comme un programme DC général et proposons un schéma DCA approprié pour le problème résultant / In this dissertation, we investigate approaches based on DC (Difference of Convex functions) programming and DCA (DC Algorithm) for mathematical programs with equilibrium constraints. Being a classical and challenging topic of nonconvex optimization, and because of its many important applications, mathematical programming with equilibrium constraints has attracted the attention of many researchers since many years. The dissertation consists of four main chapters. Chapter 2 studies a class of mathematical programs with linear complementarity constraints. By using four penalty functions, we reformulate the considered problem as standard DC programs, i.e. minimizing a DC function on a convex set. The appropriate DCA schemes are developed to solve these four DC programs. Two among them are reformulated again as general DC programs (i.e. minimizing a DC function under DC constraints) in order that the convex subproblems in DCA are easier to solve. After designing DCA for the considered problem, we show how to develop these DCA schemes for solving the quadratic problem with linear complementarity constraints and the asymmetric eigenvalue complementarity problem. Chapter 3 addresses a class of mathematical programs with variational inequality constraints. We use a penalty technique to recast the considered problem as a DC program. A variant of DCA and its accelerated version are proposed to solve this DC program. As an application, we tackle the second-best toll pricing problem with fixed demands. Chapter 4 focuses on a class of bilevel optimization problems with binary upper level variables. By using an exact penalty function, we express the bilevel problem as a standard DC program for which an efficient DCA scheme is developed. We apply the proposed algorithm to solve a maximum flow network interdiction problem. In chapter 5, we are interested in the continuous equilibrium network design problem. It was formulated as a Mathematical Program with Complementarity Constraints (MPCC). We reformulate this MPCC problem as a general DC program and then propose a suitable DCA scheme for the resulting problem
3

Optimization problems with complementarity constraints in infinite-dimensional spaces

Wachsmuth, Gerd 19 June 2017 (has links)
In this thesis we consider optimization problems with complementarity constraints in infinite-dimensional spaces. On the one hand, we deal with the general situation, in which the complementarity constraint is governed by a closed convex cone. We use the local decomposition approach, which is known from finite dimensions, to derive first-order necessary optimality conditions of strongly stationary type. In the non-polyhedric case, stronger conditions are obtained by an additional linearization argument. On the other hand, we consider the optimal control of the obstacle problem. This is a classical example for a problem with complementarity constraints in infinite dimensions. We are concerned with the control-constrained case. Due to the lack of surjectivity, a system of strong stationarity is not necessarily satisfied for all local minimizers. We identify assumptions on the data of the optimal control problem under which strong stationarity of local minimizers can be verified. Moreover, without any additional assumptions on the data, we show that a system of M-stationarity is satisfied provided that some sequence of multipliers converges in capacity. Finally, we also discuss the notion of polyhedric sets. These sets have many applications in infinite-dimensional optimization theory. Since the results concerning polyhedricity are scattered in the literature, we provide a review of the known results. Furthermore, we give some new results concerning polyhedricity of intersections and provide counterexamples which demonstrate that intersections of polyhedric sets may fail to be polyhedric. We also prove a new polyhedricity result for sets in vector-valued Sobolev spaces.
4

Closed-loop Dynamic Real-time Optimization for Cost-optimal Process Operations

Jamaludin, Mohammad Zamry January 2016 (has links)
Real-time optimization (RTO) is a supervisory strategy in the hierarchical industrial process automation architecture in which economically optimal set-point targets are computed for the lower level advanced control system, which is typically model predictive control (MPC). Due to highly volatile market conditions, recent developments have considered transforming the conventional steady-state RTO to dynamic RTO (DRTO) to permit economic optimization during transient operation. Published DRTO literature optimizes plant input trajectories without taking into account the presence of the plant control system, constituting an open-loop DRTO (OL-DRTO) approach. The goal of this research is to develop a design framework for a DRTO system that optimizes process economics based on a closed-loop response prediction. We focus, in particular, on DRTO applied to a continuous process operation regulated under constrained MPC. We follow a two-layer DRTO/MPC configuration due to its close tie to the industrial process automation architecture. We first analyze the effects of optimizing MPC closed-loop response dynamics at the DRTO level. A rigorous DRTO problem structure proposed in this thesis is in the form of a multilevel dynamic optimization problem, as it embeds a sequence of MPC optimization subproblems to be solved in order to generate the closed-loop prediction in the DRTO formulation, denoted here as a closed-loop DRTO (CL-DRTO) strategy. A simultaneous solution approach is applied in which the convex MPC optimization subproblems are replaced by their necessary and sufficient, Karush-Kuhn-Tucker (KKT) optimality conditions, resulting in the reformulation of the original multilevel problem as a single-level mathematical program with complementarity constraints (MPCC) with the complementarities handled using an exact penalty formulation. Performance analysis is carried out, and process conditions under which the CL-DRTO strategy significantly outperforms the traditional open-loop counterpart are identified. The multilevel DRTO problem with a rigorous inclusion of the future MPC calculations significantly increases the size and solution time of the economic optimization problem. Next, we identify and analyze multiple closed-loop approximation techniques, namely, a hybrid formulation, a bilevel programming formulation, and an input clipping formulation applied to an unconstrained MPC algorithm. Performance analysis based on a linear dynamic system shows that the proposed approximation techniques are able to substantially reduce the size and solution time of the rigorous CL-DRTO problem, while largely retaining its original performance. Application to an industrially-based case study of a polystyrene production described by a nonlinear differential-algebraic equation (DAE) system is also presented. Often large-scale industrial systems comprise multi-unit subsystems regulated under multiple local controllers that require systematic coordination between them. Utilization of closed-loop prediction in the CL-DRTO formulation is extended for application as a higher-level, centralized supervisory control strategy for coordination of a distributed MPC system. The advantage of the CL-DRTO coordination formulation is that it naturally considers interaction between the underlying MPC subsystems due to the embedded controller optimization subproblems while optimizing the overall process dynamics. In this case, we take advantage of the bilevel formulation to perform closed-loop prediction in two DRTO coordination schemes, with variations in the coordinator objective function based on dynamic economics and target tracking. Case study simulations demonstrate excellent performance in which the proposed coordination schemes minimize the impact of disturbance propagation originating from the upstream subsystem dynamics, and also reduce the magnitude of constraint violation through appropriate adjustment of the controller set-point trajectories. / Thesis / Doctor of Philosophy (PhD)
5

Uma nova abordagem para resolução de problemas de fluxo de carga com variáveis discretas / A new approach for solving load flow problems with discrete variables

Scheila Valechenski Biehl 07 May 2012 (has links)
Este trabalho apresenta uma nova abordagem para a modelagem e resolução de problemas de fluxo de carga em sistemas elétricos de potência. O modelo proposto é formado simultaneamente pelo conjunto de equações não lineares que representam as restrições de carga do problema e por restrições de complementaridade associadas com as restrições de operação da rede, as quais propiciam o controle implícito das tensões nas barras com controle de geração. Também é proposta uma técnica para a obtenção dos valores discretos dos taps de tranformadores, de maneira que o ajuste dessas variáveis possa ser realizado em passos discretos. A metodologia desenvolvida consiste em tratar o sistema misto de equações e inequações não lineares como um problema de factibilidade não linear e transformá-lo em um problema de mínimos quadrados não lineares, o qual é resolvido por uma sequência de subproblemas linearizados dentro de uma região de confiança. Para a obtenção de soluções aproximadas desse subproblema foi adotado o método do gradiente conjugado de Steihaug, combinando estratégias de região de confiança e filtros multidimensionais para analisar a qualidade das soluções fornecidas. Foram realizados testes numéricos com os sistemas de 14, 30, 57, 118 e 300 barras do IEEE, e com um sistema brasileiro equivalente CESP 53 barras, os quais indicaram boa flexibilidade e robustez do método proposto. / This work presents a new approach to the load flow problem in electrical power systems and develops a methodology for its resolution. The proposed model is simultaneously composed by nonlinear equations and inequations which represent the load and operational restrictions of the system, where a set of complementarity constraints model the relationship between voltage and reactive power generation in controled buses. It is also proposed a new technique to obtaining a discrete solution for the transformer taps, allowing their discrete adjustment. The method developed treats the mixed system of equations and inequations of the load flow problem as a nonlinear feasibility problem and converts it in a nonlinear least squares problem, which is solved by minimizing a sequence of linearized subproblems, whitin a trust region. To obtain approximate solutions at every iteration, we use the Steihaug conjugate gradient method, combining trust region and multidimensional filters techniques to analyse the quality of the provided solution. Numerical results using 14, 30, 57, 118 and 300-bus IEEE power systems, and a real brazilian equivalent system CESP 53-bus, indicate the flexibility and robustness of the proposed method.
6

O fluxo de potência ótimo reativo com variáveis de controle discretas e restrições de atuação de dispositivos de controle de tensão / The reactive optimal power flow with discrete control variables and voltage-control actuation constraints

Guilherme Guimarães Lage 25 March 2013 (has links)
Este trabalho propõe um novo modelo e uma nova abordagem para resolução do problema de fluxo de potência ótimo reativo com variáveis de controle discretas e restrições de atuação de dispositivos de controle de tensão. Matematicamente, esse problema é formulado como um problema de programação não linear com variáveis contínuas e discretas e restrições de complementaridade, cuja abordagem para resolução proposta neste trabalho se baseia na resolução de uma sequência de problemas modificados pelo algoritmo da função Lagrangiana barreira modificada-penalidade-discreto. Nessa abordagem, o problema original é modificado da seguinte forma: 1) as variáveis discretas são tratadas como contínuas por funções senoidais incorporadas na função objetivo do problema original; 2) as restrições de complementaridade são transformadas em restrições de desigualdade equivalentes; e 3) as restrições de desigualdade são transformadas em restrições de igualdade a partir do acréscimo de variáveis de folga não negativas. Para resolver o problema modificado, a condição de não negatividade das variáveis de folga é tratada por uma função barreira modificada com extrapolação quadrática. O problema modificado é transformado em um problema Lagrangiano, cuja solução é determinada a partir da aplicação das condições necessárias de otimalidade. No algoritmo da função Lagrangiana barreira modificada-penalidade-discreto, uma sequência de problemas modificados é resolvida até que todas as variáveis do problema modificado associadas às variáveis discretas do problema original assumam valores discretos. Para demonstrar a eficácia do modelo proposto e a robustez dessa abordagem para resolução de problemas de fluxo de potência ótimo reativo, foram realizados testes com os sistemas elétricos IEEE de 14, 30, 57 e 118 barras e com o sistema equivalente CESP 440 kV de 53 barras. Os resultados mostram que a abordagem para resolução de problemas de programação não linear proposta é eficaz no tratamento de variáveis discretas e restrições de complementaridade. / This work proposes a novel model and a new approach for solving the reactive optimal power flow problem with discrete control variables and voltage-control actuation constraints. Mathematically, such problem is formulated as a nonlinear programming problem with continuous and discrete variables and complementarity constraints, whose proposed resolution approach is based on solving a sequence of modified problems by the discrete penalty-modified barrier Lagrangian function algorithm. In this approach, the original problem is modified in the following way: 1) the discrete variables are treated as continuous by sinusoidal functions incorporated into the objective function of the original problem; 2) the complementarity constraints are transformed into equivalent inequality constraints; and 3) the inequality constraints are transformed into equality constraints by the addition of non-negative slack variables. To solve the modified problem, the non-negativity condition of the slack variables is treated by a modified barrier function with quadratic extrapolation. The modified problem is transformed into a Lagrangian problem, whose solution is determined by the application of the first-order necessary optimality conditions. In the discrete penalty- modified barrier Lagrangian function algorithm, a sequence of modified problems is successively solved until all the variables of the modified problem that are associated with the discrete variables of the original problem assume discrete values. The efectiveness of the proposed model and the robustness of this approach for solving reactive optimal power flow problems were verified with the IEEE 14, 30, 57 and 118-bus test systems and the 440 kV CESP 53-bus equivalent system. The results show that the proposed approach for solving nonlinear programming problems successfully handles discrete variables and complementarity constraints.
7

Uma nova abordagem para resolução de problemas de fluxo de carga com variáveis discretas / A new approach for solving load flow problems with discrete variables

Biehl, Scheila Valechenski 07 May 2012 (has links)
Este trabalho apresenta uma nova abordagem para a modelagem e resolução de problemas de fluxo de carga em sistemas elétricos de potência. O modelo proposto é formado simultaneamente pelo conjunto de equações não lineares que representam as restrições de carga do problema e por restrições de complementaridade associadas com as restrições de operação da rede, as quais propiciam o controle implícito das tensões nas barras com controle de geração. Também é proposta uma técnica para a obtenção dos valores discretos dos taps de tranformadores, de maneira que o ajuste dessas variáveis possa ser realizado em passos discretos. A metodologia desenvolvida consiste em tratar o sistema misto de equações e inequações não lineares como um problema de factibilidade não linear e transformá-lo em um problema de mínimos quadrados não lineares, o qual é resolvido por uma sequência de subproblemas linearizados dentro de uma região de confiança. Para a obtenção de soluções aproximadas desse subproblema foi adotado o método do gradiente conjugado de Steihaug, combinando estratégias de região de confiança e filtros multidimensionais para analisar a qualidade das soluções fornecidas. Foram realizados testes numéricos com os sistemas de 14, 30, 57, 118 e 300 barras do IEEE, e com um sistema brasileiro equivalente CESP 53 barras, os quais indicaram boa flexibilidade e robustez do método proposto. / This work presents a new approach to the load flow problem in electrical power systems and develops a methodology for its resolution. The proposed model is simultaneously composed by nonlinear equations and inequations which represent the load and operational restrictions of the system, where a set of complementarity constraints model the relationship between voltage and reactive power generation in controled buses. It is also proposed a new technique to obtaining a discrete solution for the transformer taps, allowing their discrete adjustment. The method developed treats the mixed system of equations and inequations of the load flow problem as a nonlinear feasibility problem and converts it in a nonlinear least squares problem, which is solved by minimizing a sequence of linearized subproblems, whitin a trust region. To obtain approximate solutions at every iteration, we use the Steihaug conjugate gradient method, combining trust region and multidimensional filters techniques to analyse the quality of the provided solution. Numerical results using 14, 30, 57, 118 and 300-bus IEEE power systems, and a real brazilian equivalent system CESP 53-bus, indicate the flexibility and robustness of the proposed method.
8

O fluxo de potência ótimo reativo com variáveis de controle discretas e restrições de atuação de dispositivos de controle de tensão / The reactive optimal power flow with discrete control variables and voltage-control actuation constraints

Lage, Guilherme Guimarães 25 March 2013 (has links)
Este trabalho propõe um novo modelo e uma nova abordagem para resolução do problema de fluxo de potência ótimo reativo com variáveis de controle discretas e restrições de atuação de dispositivos de controle de tensão. Matematicamente, esse problema é formulado como um problema de programação não linear com variáveis contínuas e discretas e restrições de complementaridade, cuja abordagem para resolução proposta neste trabalho se baseia na resolução de uma sequência de problemas modificados pelo algoritmo da função Lagrangiana barreira modificada-penalidade-discreto. Nessa abordagem, o problema original é modificado da seguinte forma: 1) as variáveis discretas são tratadas como contínuas por funções senoidais incorporadas na função objetivo do problema original; 2) as restrições de complementaridade são transformadas em restrições de desigualdade equivalentes; e 3) as restrições de desigualdade são transformadas em restrições de igualdade a partir do acréscimo de variáveis de folga não negativas. Para resolver o problema modificado, a condição de não negatividade das variáveis de folga é tratada por uma função barreira modificada com extrapolação quadrática. O problema modificado é transformado em um problema Lagrangiano, cuja solução é determinada a partir da aplicação das condições necessárias de otimalidade. No algoritmo da função Lagrangiana barreira modificada-penalidade-discreto, uma sequência de problemas modificados é resolvida até que todas as variáveis do problema modificado associadas às variáveis discretas do problema original assumam valores discretos. Para demonstrar a eficácia do modelo proposto e a robustez dessa abordagem para resolução de problemas de fluxo de potência ótimo reativo, foram realizados testes com os sistemas elétricos IEEE de 14, 30, 57 e 118 barras e com o sistema equivalente CESP 440 kV de 53 barras. Os resultados mostram que a abordagem para resolução de problemas de programação não linear proposta é eficaz no tratamento de variáveis discretas e restrições de complementaridade. / This work proposes a novel model and a new approach for solving the reactive optimal power flow problem with discrete control variables and voltage-control actuation constraints. Mathematically, such problem is formulated as a nonlinear programming problem with continuous and discrete variables and complementarity constraints, whose proposed resolution approach is based on solving a sequence of modified problems by the discrete penalty-modified barrier Lagrangian function algorithm. In this approach, the original problem is modified in the following way: 1) the discrete variables are treated as continuous by sinusoidal functions incorporated into the objective function of the original problem; 2) the complementarity constraints are transformed into equivalent inequality constraints; and 3) the inequality constraints are transformed into equality constraints by the addition of non-negative slack variables. To solve the modified problem, the non-negativity condition of the slack variables is treated by a modified barrier function with quadratic extrapolation. The modified problem is transformed into a Lagrangian problem, whose solution is determined by the application of the first-order necessary optimality conditions. In the discrete penalty- modified barrier Lagrangian function algorithm, a sequence of modified problems is successively solved until all the variables of the modified problem that are associated with the discrete variables of the original problem assume discrete values. The efectiveness of the proposed model and the robustness of this approach for solving reactive optimal power flow problems were verified with the IEEE 14, 30, 57 and 118-bus test systems and the 440 kV CESP 53-bus equivalent system. The results show that the proposed approach for solving nonlinear programming problems successfully handles discrete variables and complementarity constraints.
9

Analysis and Application of Optimization Techniques to Power System Security and Electricity Markets

Avalos Munoz, Jose Rafael January 2008 (has links)
Determining the maximum power system loadability, as well as preventing the system from being operated close to the stability limits is very important in power systems planning and operation. The application of optimization techniques to power systems security and electricity markets is a rather relevant research area in power engineering. The study of optimization models to determine critical operating conditions of a power system to obtain secure power dispatches in an electricity market has gained particular attention. This thesis studies and develops optimization models and techniques to detect or avoid voltage instability points in a power system in the context of a competitive electricity market. A thorough analysis of an optimization model to determine the maximum power loadability points is first presented, demonstrating that a solution of this model corresponds to either Saddle-node Bifurcation (SNB) or Limit-induced Bifurcation (LIB) points of a power flow model. The analysis consists of showing that the transversality conditions that characterize these bifurcations can be derived from the optimality conditions at the solution of the optimization model. The study also includes a numerical comparison between the optimization and a continuation power flow method to show that these techniques converge to the same maximum loading point. It is shown that the optimization method is a very versatile technique to determine the maximum loading point, since it can be readily implemented and solved. Furthermore, this model is very flexible, as it can be reformulated to optimize different system parameters so that the loading margin is maximized. The Optimal Power Flow (OPF) problem with voltage stability (VS) constraints is a highly nonlinear optimization problem which demands robust and efficient solution techniques. Furthermore, the proper formulation of the VS constraints plays a significant role not only from the practical point of view, but also from the market/system perspective. Thus, a novel and practical OPF-based auction model is proposed that includes a VS constraint based on the singular value decomposition (SVD) of the power flow Jacobian. The newly developed model is tested using realistic systems of up to 1211 buses to demonstrate its practical application. The results show that the proposed model better represents power system security in the OPF and yields better market signals. Furthermore, the corresponding solution technique outperforms previous approaches for the same problem. Other solution techniques for this OPF problem are also investigated. One makes use of a cutting planes (CP) technique to handle the VS constraint using a primal-dual Interior-point Method (IPM) scheme. Another tries to reformulate the OPF and VS constraint as a semidefinite programming (SDP) problem, since SDP has proven to work well for certain power system optimization problems; however, it is demonstrated that this technique cannot be used to solve this particular optimization problem.
10

Analysis and Application of Optimization Techniques to Power System Security and Electricity Markets

Avalos Munoz, Jose Rafael January 2008 (has links)
Determining the maximum power system loadability, as well as preventing the system from being operated close to the stability limits is very important in power systems planning and operation. The application of optimization techniques to power systems security and electricity markets is a rather relevant research area in power engineering. The study of optimization models to determine critical operating conditions of a power system to obtain secure power dispatches in an electricity market has gained particular attention. This thesis studies and develops optimization models and techniques to detect or avoid voltage instability points in a power system in the context of a competitive electricity market. A thorough analysis of an optimization model to determine the maximum power loadability points is first presented, demonstrating that a solution of this model corresponds to either Saddle-node Bifurcation (SNB) or Limit-induced Bifurcation (LIB) points of a power flow model. The analysis consists of showing that the transversality conditions that characterize these bifurcations can be derived from the optimality conditions at the solution of the optimization model. The study also includes a numerical comparison between the optimization and a continuation power flow method to show that these techniques converge to the same maximum loading point. It is shown that the optimization method is a very versatile technique to determine the maximum loading point, since it can be readily implemented and solved. Furthermore, this model is very flexible, as it can be reformulated to optimize different system parameters so that the loading margin is maximized. The Optimal Power Flow (OPF) problem with voltage stability (VS) constraints is a highly nonlinear optimization problem which demands robust and efficient solution techniques. Furthermore, the proper formulation of the VS constraints plays a significant role not only from the practical point of view, but also from the market/system perspective. Thus, a novel and practical OPF-based auction model is proposed that includes a VS constraint based on the singular value decomposition (SVD) of the power flow Jacobian. The newly developed model is tested using realistic systems of up to 1211 buses to demonstrate its practical application. The results show that the proposed model better represents power system security in the OPF and yields better market signals. Furthermore, the corresponding solution technique outperforms previous approaches for the same problem. Other solution techniques for this OPF problem are also investigated. One makes use of a cutting planes (CP) technique to handle the VS constraint using a primal-dual Interior-point Method (IPM) scheme. Another tries to reformulate the OPF and VS constraint as a semidefinite programming (SDP) problem, since SDP has proven to work well for certain power system optimization problems; however, it is demonstrated that this technique cannot be used to solve this particular optimization problem.

Page generated in 0.587 seconds