Optimal provision of implicit and explicit incentives in asset management contracts

This paper investigates the importance of the fiow of funds as an implicit incetive provided by investors to portfolio managers in a two-period relationship. We show that the fiow of funds is a powerful incentive in an asset management contract. We build a binomial moral hazard model to explain the main trade-ofIs in the relationship between fiow, fees and performance. The main assumption is that efIort depend" on the combination of implicit and explicit incentives while the probability distrioutioll function of returns depends on efIort. In the case of full commitment, the investor's relevant trade-ofI is to give up expected return in the second period vis-à-vis to induce efIort in the first período The more concerned the investor is with today's payoff. the more willing he will be to give up expected return in the following periods. That is. in the second period, the investor penalizes observed low returns by withdrawing resources from non-performing portfolio managers. Besides, he pays performance fee when the observed excess return is positive. When commitment is not a plausible hypothesis, we consider that the investor also learns some symmetríc and imperfect information about the ability of the manager to generate positive excess returno In this case, observed returns reveal ability as well as efIort choices exerted by the portfolio manager. We show that implicit incentives can explain the fiow-performance relationship and, conversely, endogenous expected return determines incentives provision and define their optimal leveIs. We provide a numerical solution in Matlab that characterize these results.

A modified Primal-Dual Logarithmic-Barrier Method for solving the Optimal Power Flow problem with discrete and continuous control variables

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Optimal attitude corrections for cylindrical spacecraft

A first order analytical model for optimal small amplitude attitude maneuvers of spacecraft with cylindrical symmetry in an elliptical orbits is presented. The optimization problem is formulated as a Mayer problem with the control torques provided by a power limited propulsion system. The state is defined by Seffet-Andoyer's variables and the control by the components of the propulsive torques. The Pontryagin Maximum Principle is applied to the problem and the optimal torques are given explicitly in Serret-Andoyer's variables and their adjoints. For small amplitude attitude maneuvers, the optimal Hamiltonian function is linearized around a reference attitude. A complete first order analytical solution is obtained by simple quadrature and is expressed through a linear algebraic system involving the initial values of the adjoint variables. A numerical solution is obtained by taking the Euler angles formulation of the problem, solving the two-point boundary problem through the shooting method, and, then, determining the Serret-Andoyer variables through Serret-Andoyer transformation. Numerical results show that the first order solution provides a good approximation to the optimal control law and also that is possible to establish an optimal control law for the artificial satellite's attitude. (C) 2003 COSPAR. Published by Elsevier B.V. Ltd. All rights reserved.

A geometric interpretation for transmission real losses minimization through the optimal power flow and its influence on voltage collapse

This work presents an approach for geometric solution of an optimal power flow (OPF) problem for a two bus system (a slack and a PV busses). Additionally, the geometric relationship between the losses minimization and the increase of the reactive margin and, therefore, the maximum loading point, is shown. The algebraic equations for the calculation of the Lagrange multipliers and for the minimum losses value are obtained. These equations are used to validate the results obtained using an OPF program. (C) 2002 Elsevier B.V. B.V. All rights reserved.

HOW TO EFFICIEN TLY INCORPORATE FACTS DEVICES IN OPTIMAL ACTIVE POWER FLOW MODEL

This paper presents for the first time how to easily incorporate facts devices in an optimal active power flow model such that an efficient interior-point method may be applied. The optimal active power flow model is based on a network flow approach instead of the traditional nodal formulation that allows the use of an efficiently predictor-corrector interior point method speed up by sparsity exploitation. The mathematical equivalence between the network flow and the nodal models is addressed, as well as the computational advantages of the former considering the solution by interior point methods. The adequacy of the network flow model for representing facts devices is presented and illustrated on a small 5-bus system. The model was implemented using Matlab and its performance was evaluated with the 3,397-bus and 4,075-branch Brazilian power system which show the robustness and efficiency of the formulation proposed. The numerical results also indicate an efficient tool for optimal active power flow that is suitable for incorporating facts devices.

Efficient heuristic algorithm used for optimal capacitor placement in distribution systems

An efficient heuristic algorithm is presented in this work in order to solve the optimal capacitor placement problem in radial distribution systems. The proposal uses the solution from the mathematical model after relaxing the integrality of the discrete variables as a strategy to identify the most attractive bus to add capacitors to each step of the heuristic algorithm. The relaxed mathematical model is a nonlinear programming problem and is solved using a specialized interior point method, The algorithm still incorporates an additional strategy of local search that enables the finding of a group of quality solutions after small alterations in the optimization strategy. Proposed solution methodology has been implemented and tested in known electric systems getting a satisfactory outcome compared with metaheuristic methods.The tests carried out in electric systems known in specialized literature reveal the satisfactory outcome of the proposed algorithm compared with metaheuristic methods. (C) 2009 Elsevier Ltd. All rights reserved.

Multi Objective Evolutionary Algorithm Applied to the Optimal Power Flow Problem

This work presents the application of a multiobjective evolutionary algorithm (MOEA) for optimal power flow (OPF) solution. The OPF is modeled as a constrained nonlinear optimization problem, non-convex of large-scale, with continuous and discrete variables. The violated inequality constraints are treated as objective function of the problem. This strategy allows attending the physical and operational restrictions without compromise the quality of the found solutions. The developed MOEA is based on the theory of Pareto and employs a diversity-preserving mechanism to overcome the premature convergence of algorithm and local optimal solutions. Fuzzy set theory is employed to extract the best compromises of the Pareto set. Results for the IEEE-30, RTS-96 and IEEE-354 test systems are presents to validate the efficiency of proposed model and solution technique.

Chaos control of a nonlinear oscillator with shape memory alloy using an optimal linear control: Part I: Ideal energy source

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

An Optimal Linear Control Design for Nonlinear Systems

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

An improved tabu-based vector optimal algorithm for design optimizations of electromagnetic devices

This paper introduces an improved tabu-based vector optimal algorithm for multiobjective optimal designs of electromagnetic devices. The improvements include a division of the entire search process, a new method for fitness assignment, a novel scheme for the generation and selection of neighborhood solutions, and so forth. Numerical results on a mathematical function and an engineering multiobjective design problem demonstrate that the proposed method can produce virtually the exact Pareto front, in both parameter and objective spaces, even though the iteration number used by it is only about 70% of that required by its ancestor.

On an optimal control design for Rossler system

In this Letter, an optimal control strategy that directs the chaotic motion of the Rossler system to any desired fixed point is proposed. The chaos control problem is then formulated as being an infinite horizon optimal control nonlinear problem that was reduced to a solution of the associated Hamilton-Jacobi-Bellman equation. We obtained its solution among the correspondent Lyapunov functions of the considered dynamical system. (C) 2004 Elsevier B.V All rights reserved.

On the value function for nonautonomous optimal control problems with infinite horizon

In this paper we consider nonautonomous optimal control problems of infinite horizon type, whose control actions are given by L-1-functions. We verify that the value function is locally Lipschitz. The equivalence between dynamic programming inequalities and Hamilton-Jacobi-Bellman (HJB) inequalities for proximal sub (super) gradients is proven. Using this result we show that the value function is a Dini solution of the HJB equation. We obtain a verification result for the class of Dini sub-solutions of the HJB equation and also prove a minimax property of the value function with respect to the sets of Dini semi-solutions of the HJB equation. We introduce the concept of viscosity solutions of the HJB equation in infinite horizon and prove the equivalence between this and the concept of Dini solutions. In the Appendix we provide an existence theorem. (c) 2006 Elsevier B.V. All rights reserved.

Optimal capacitor placement in radial distribution networks

The capacitor placement (replacement) problem for radial distribution networks determines capacitor types, sizes, locations and control schemes. Optimal capacitor placement is a hard combinatorial problem that can be formulated as a mixed integer nonlinear program. Since this is a NP complete problem (Non Polynomial time) the solution approach uses a combinatorial search algorithm. The paper proposes a hybrid method drawn upon the Tabu Search approach, extended with features taken from other combinatorial approaches such as genetic algorithms and simulated annealing, and from practical heuristic approaches. The proposed method has been tested in a range of networks available in the literature with superior results regarding both quality and cost of solutions.

Optimal control problem for deflection plate with crack

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

On the solution of mathematical programming problems with equilibrium constraints

Mathematical programming problems with equilibrium constraints (MPEC) are nonlinear programming problems where the constraints have a form that is analogous to first-order optimality conditions of constrained optimization. We prove that, under reasonable sufficient conditions, stationary points of the sum of squares of the constraints are feasible points of the MPEC. In usual formulations of MPEC all the feasible points are nonregular in the sense that they do not satisfy the Mangasarian-Fromovitz constraint qualification of nonlinear programming. Therefore, all the feasible points satisfy the classical Fritz-John necessary optimality conditions. In principle, this can cause serious difficulties for nonlinear programming algorithms applied to MPEC. However, we show that most feasible points do not satisfy a recently introduced stronger optimality condition for nonlinear programming. This is the reason why, in general, nonlinear programming algorithms are successful when applied to MPEC.