Demographic demand systems with application to equivalence scales estimation and inequality analysis : the Australian evidence

This paper proposes and applies an alternative demographic procedure for extending a demand system to allow for the effect of household size and composition changes, along with price changes, on expenditure allocation. The demographic procedure is applied to two recent demand functional forms to obtain their estimable demographic extensions. The estimation on pooled time series of Australian Household Expenditure Surveys yields sensible and robust estimates of the equivalence scale, and of its variation with relative prices. Further evidence on the usefulness of this procedure is provided by using it to evaluate the nature and magnitude of the inequality bias of relative price changes in Australia over a period from the late 1980s to the early part of the new millennium.

PERIODIC PERTURBATION of QUADRATIC SYSTEMS WITH TWO INFINITE HETEROCLINIC CYCLES

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

On the existence of infinite heteroclinic cycles in polynomial systems and its dynamic consequences

In this work we consider the dynamic consequences of the existence of infinite heteroclinic cycle in planar polynomial vector fields, which is a trajectory connecting two saddle points at infinity. It is stated that, although the saddles which form the cycle belong to infinity, for certain types of nonautonomous perturbations the perturbed system may present a complex dynamic behavior of the solutions in a finite part of the phase plane, due to the existence of tangencies and transversal intersections of their stable and unstable manifolds. This phenomenon might be called the chaos arising from infinity. The global study at infinity is made via the Poincare Compactification and the argument used to prove the statement is the Birkhoff-Smale Theorem. (c) 2004 WILEY-NCH Verlag GmbH & Co. KGaA, Weinheim.

A maximum principle for infinite time asymptotically stable impulsive dynamic control systems

We consider an infinite horizon optimal impulsive control problems for which a given cost function is minimized by choosing control strategies driving the state to a point in a given closed set C ∞. We present necessary conditions of optimality in the form of a maximum principle for which the boundary condition of the adjoint variable is such that non-degeneracy due to the fact that the time horizon is infinite is ensured. These conditions are given for conventional systems in a first instance and then for impulsive control problems. They are proved by considering a family of approximating auxiliary interval conventional (without impulses) optimal control problems defined on an increasing sequence of finite time intervals. As far as we know, results of this kind have not been derived previously. © 2010 IFAC.

A maximum principle for constrained infinite horizon dynamic control systems

This article presents and discusses a maximum principle for infinite horizon constrained optimal control problems with a cost functional depending on the state at the final time. The main feature of these optimality conditions is that, under reasonably weak assumptions, the multiplier is shown to satisfy a novel transversality condition at infinite time. It is also shown that these conditions can also be obtained for impulsive control problems whose dynamics are given by measure driven differential equations. © 2011 IFAC.

Linear matrix inequality-based robust model predictive control for time-delayed systems

This work addresses the solution to the problem of robust model predictive control (MPC) of systems with model uncertainty. The case of zone control of multi-variable stable systems with multiple time delays is considered. The usual approach of dealing with this kind of problem is through the inclusion of non-linear cost constraint in the control problem. The control action is then obtained at each sampling time as the solution to a non-linear programming (NLP) problem that for high-order systems can be computationally expensive. Here, the robust MPC problem is formulated as a linear matrix inequality problem that can be solved in real time with a fraction of the computer effort. The proposed approach is compared with the conventional robust MPC and tested through the simulation of a reactor system of the process industry.

Robust linear semi-infinite programming duality under uncertainty

In this paper, we propose a duality theory for semi-infinite linear programming problems under uncertainty in the constraint functions, the objective function, or both, within the framework of robust optimization. We present robust duality by establishing strong duality between the robust counterpart of an uncertain semi-infinite linear program and the optimistic counterpart of its uncertain Lagrangian dual. We show that robust duality holds whenever a robust moment cone is closed and convex. We then establish that the closed-convex robust moment cone condition in the case of constraint-wise uncertainty is in fact necessary and sufficient for robust duality. In other words, the robust moment cone is closed and convex if and only if robust duality holds for every linear objective function of the program. In the case of uncertain problems with affinely parameterized data uncertainty, we establish that robust duality is easily satisfied under a Slater type constraint qualification. Consequently, we derive robust forms of the Farkas lemma for systems of uncertain semi-infinite linear inequalities.

Comparative study of RPSALG algorithm for convex semi-infinite programming

The Remez penalty and smoothing algorithm (RPSALG) is a unified framework for penalty and smoothing methods for solving min-max convex semi-infinite programing problems, whose convergence was analyzed in a previous paper of three of the authors. In this paper we consider a partial implementation of RPSALG for solving ordinary convex semi-infinite programming problems. Each iteration of RPSALG involves two types of auxiliary optimization problems: the first one consists of obtaining an approximate solution of some discretized convex problem, while the second one requires to solve a non-convex optimization problem involving the parametric constraints as objective function with the parameter as variable. In this paper we tackle the latter problem with a variant of the cutting angle method called ECAM, a global optimization procedure for solving Lipschitz programming problems. We implement different variants of RPSALG which are compared with the unique publicly available SIP solver, NSIPS, on a battery of test problems.

Constraint qualifications in convex vector semi-infinite optimization

Convex vector (or multi-objective) semi-infinite optimization deals with the simultaneous minimization of finitely many convex scalar functions subject to infinitely many convex constraints. This paper provides characterizations of the weakly efficient, efficient and properly efficient points in terms of cones involving the data and Karush–Kuhn–Tucker conditions. The latter characterizations rely on different local and global constraint qualifications. The results in this paper generalize those obtained by the same authors on linear vector semi-infinite optimization problems.

Stochastic stability of nonlinear discrete-time Markovian jump systems with time-varying delay and partially unknown transition rates

This paper is concerned with stochastic stability of a class of nonlinear discrete-time Markovian jump systems with interval time-varying delay and partially unknown transition probabilities. A new weighted summation inequality is first derived. We then employ the newly derived inequality to establish delay-dependent conditions which guarantee the stochastic stability of the system. These conditions are derived in terms of tractable matrix inequalities which can be computationally solved by various convex optimized algorithms. Numerical examples are provided to illustrate the effectiveness of the obtained results.

Static output feedback frequency stabilization of time-delay power systems with coordinated electric vehicles state of charge control

In this paper, for the first time, electric vehicles are used for both the primary and secondary frequency controls to support power plants to rapidly suppress fluctuations in the system frequency due to load disturbances. Via networked control and wide-area communication infrastructures, multiple interval time-varying delays exist in the communication channels between the control center, power plant, and an aggregation of electric vehicles. By coordinating batteries’ state of charge control, the behaviors of the vehicle owners and the uncertainties imposed by the changes of the batteries’ state of charge are taken intoconsideration. A power system model incorporating multiple time-varying delays and uncertainties is first proposed. Then, a robust static output feedback frequency controller is designed to guarantee the resulting closed-loop system stable with an H∞ attenuation level. By utilizing a novel integral inequality, namely refined-Jensen inequality, and an improved reciprocally convex combination, the design conditions are formulated in terms of tractable linear matrix inequalities which can be efficiently solved by various computational tools. The effectiveness of the proposed control scheme is verified by extensive simulations.

Critical Systems Theory: A Political Economy of Language, Thought, and Technology

An emergent form of political economy, facilitated by information and communication technologies (ICTs), is widely propagated as the apotheosis of unmitigated social, economic, and technological progress. Meanwhile, throughout the world, social degradation and economic inequality are increasing logarithmically. Valued categories of thought are, axiomatically, the basic commodities of the “knowledge economy”. Language is its means of exchange. This paper proposes a sociolinguistic method with which to critically engage the hyperbole of the “Information Age”. The method is grounded in a systemic social theory that synthesises aspects of autopoiesis and Marxist political economy. A trade policy statement is analysed to exemplify the sociolinguistically created aberrations that are today most often construed as social and political determinants.

Design Optimisation of UAVs Systems achieved on a Framework Environment via Evolution and Game Theory

Over recent years, Unmanned Air Vehicles or UAVs have become a powerful tool for reconnaissance and surveillance tasks. These vehicles are now available in a broad size and capability range and are intended to fly in regions where the presence of onboard human pilots is either too risky or unnecessary. This paper describes the formulation and application of a design framework that supports the complex task of multidisciplinary design optimisation of UAVs systems via evolutionary computation. The framework includes a Graphical User Interface (GUI), a robust Evolutionary Algorithm optimiser named HAPEA, several design modules, mesh generators and post-processing capabilities in an integrated platform. These population –based algorithms such as EAs are good for cases problems where the search space can be multi-modal, non-convex or discontinuous, with multiple local minima and with noise, and also problems where we look for multiple solutions via Game Theory, namely a Nash equilibrium point or a Pareto set of non-dominated solutions. The application of the methodology is illustrated on conceptual and detailed multi-criteria and multidisciplinary shape design problems. Results indicate the practicality and robustness of the framework to find optimal shapes and trade—offs between the disciplinary analyses and to produce a set of non dominated solutions of an optimal Pareto front to the designer.