Periodicity in a delayed version of the kaldor trade cycle model

We are concerned with the Kaldor's trade cycle model under the effect of a delay which represents a gestation lag between a decision of investment and its effect on the capital stock. Taking the adjustment coefficient in the goods market as a bifurcation parameter, we achieve global branches of periodic solutions. In our setting the delay is a constant inherent to the specific economy. Copyright © 2013 Watam Press.

Transmission system expansion planning by a branch-and-bound algorithm

A branch and bound (B& B) algorithm using the DC model, to solve the power system transmission expansion planning by incorporating the electrical losses in network modelling problem is presented. This is a mixed integer nonlinear programming (MINLP) problem, and in this approach, the so-called fathoming tests in the B&B algorithm were redefined and a nonlinear programming (NLP) problem is solved in each node of the B& B tree, using an interior-point method. Pseudocosts were used to manage the development of the B&B tree and to decrease its size and the processing time. There is no guarantee of convergence towards global optimisation for the MINLP problem. However, preliminary tests show that the algorithm easily converges towards the best-known solutions or to the optimal solutions for all the tested systems neglecting the electrical losses. When the electrical losses are taken into account, the solution obtained using the Garver system is better than the best one known in the literature.

Global optimization approach for the H2-norm model reduction problem

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem for continuous-time linear systems, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through Linear Matrix Inequalities formulations. Examples illustrate the results.

Otimização global para os problemas de redução H2 de modelos e redução H2 da ordem do controlador

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem and the H2-norm controller reduction problem, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through linear matrix inequalities formulations. Examples illustrate the results.

Global optimization for the ℋ∞-norm model reduction problem

A branch and bound algorithm is proposed to solve the [image omitted]-norm model reduction problem for continuous and discrete-time linear systems, with convergence to the global optimum in a finite time. The lower and upper bounds in the optimization procedure are described by linear matrix inequalities (LMI). Also proposed are two methods with which to reduce the convergence time of the branch and bound algorithm: the first one uses the Hankel singular values as a sufficient condition to stop the algorithm, providing to the method a fast convergence to the global optimum. The second one assumes that the reduced model is in the controllable or observable canonical form. The [image omitted]-norm of the error between the original model and the reduced model is considered. Examples illustrate the application of the proposed method.

Assessment of branch outage contingencies using the continuation method

This paper provides a contribution to the contingency analysis of electric power systems under steady state conditions. An alternative methodology is presented for static contingency analyses that only use continuation methods and thus provides an accurate determination of the loading margin. Rather than starting from the base case operating point, the proposed continuation power flow obtains the post-contingency loading margins starting from the maximum loading and using a bus voltage magnitude as a parameter. The branch selected for the contingency evaluation is parameterised using a scaling factor, which allows its gradual removal and assures the continuation power flow convergence for the cases where the method would diverge for the complete transmission line or transformer removal. The applicability and effectiveness of the proposed methodology have been investigated on IEEE test systems (14, 57 and 118 buses) and compared with the continuation power flow, which obtains the post-contingency loading margin starting from the base case solution. In general, for most of the analysed contingencies, few iterations are necessary to determine the post-contingency maximum loading point. Thus, a significant reduction in the global number of iterations is achieved. Therefore, the proposed methodology can be used as an alternative technique to verify and even to obtain the list of critical contingencies supplied by the electric power systems security analysis function. © 2013 Elsevier Ltd. All rights reserved.