Basic models: Intertemporal optimization and resource extraction


 Alicia Hines
 1 years ago
 Views:
Transcription
1 Basic models: Intertemporal optimization and resource extraction Anton Bondarev Department of Economics, Basel University
2 Plan of the lecture Idea of intergenerational optimization: Ramsey leads to Hotelling; theory; Optimal extraction without regeneration: Hotellingtype problems;
3 Introductory remarks Birth of dynamics in Economics In early XX century vast majority of economic models were static; They rested upon the concepts of Walras and Marshall of efficient market allocations; Even the justborn Keynesian Economics operated mainly in static terms; The question of intergenerational efficiency or optimization have not been discussed; Ramsey (1927) was the first to draw attention to this problem.
4 Introductory remarks Ramsey Idea of optimization of consumption over infinite time; Introduction of discount rates; Dynamic choice between consumption c and accumulation k; Goal of maximizing utility over time: max c e ρt U(c); (1) t=0 While consumption is taken from output: c t = Y t k t ; (2) Output grows through investments which are necessary for growth: k t+1 = Y t (1 c t ) δk t. (3)
5 Introductory remarks Modern formulation: Ramseytype problems J := 0 e rt U(c)dt max c s.t. k = f (k) c (n + δ)k; k(0) = k 0 ; 0 c f (k). (4) This is an optimal control problem with one state variable and one control variable.
6 Introductory remarks From Ramsey to Hotelling: why we need optimal control We need to optimize investments and consumption over many time periods; Exhaustible resources enter production function, and not only capital; Dynamic problem of optimal rate of resource exploitation; Sustainability concept has been born; Hotelling (1931) was the first to apply Ramseytype analysis to exhaustible resources management.
7 Main features Multistage decisionmaking; Optimization of a dynamic process in time; Optimization is carried over functions, not variables; The planning horizon of an optimizing agent is taken into account (finite or infinite); The problem includes objective and the dynamical system; Some initial and/or terminal conditions are given.
8 Continuoustime problems Assume there is continuous number of stages (real time); State is described by continuous time function, x(t); Initial and terminal states are fixed, x(0) = x 0, x(t ) = x T ; Find a function x(t), minimizing the cost of going from x 0 to x T ; What gives the costs? Concept of objective functional: T { min x(t) + u 2 (t) } dt (5) 0
9 Ingredients of dynamic optimization problem Every dynamic optimization problem should include: Some set of boundary conditions: fixed starting and/or terminal points; A set of admissible paths from initial point to the terminal one; A set of costs, associated with different paths; An objective: what to maximize or minimize.
10 Functionals Definition A functional J is a mapping from the set of paths x(t) into real numbers (value of a functional). J := J(x(t)). Functional is NOT a function of t; x(t) is the unknown function, which have to be found; This is defined in some functional space H; Hence formally J : H R.
11 Types of boundary conditions Fixedtime problem: x(0) = x 0, time length is fixed to t [0,.., T ], terminal state is not fixed; Example: optimal price setting over fixed planning horizon; Fixed endpoint problem: x(0) = x 0, x(t ) = x T, but terminal time is not fixed; Example: production cost minimization without time constraints; Timeoptimal problem: x(0) = x 0, x(t ) = x T, T min; Example: producing a product as soon as possible regardless of the costs; Terminal surface problem: x(0) = x 0, and at terminal time f (T ) = x(t ).
12 Transversality In variable endpoint problems as above given boundary conditions are not sufficient to find the optimal path; Additional condition on trajectories is called transversality condition; It defines, how the trajectory crosses the boundary line; The vast majority of economic problems use this type of conditions; Example: shadow costs of investments at the terminal time should be zero.
13 Problem The subject of optimal control is: Maximize (minimize) some objective functional T J = F (x(t), u, t)dt 0 with conditions on: Initial, terminal states and time; x(0) = x 0 ; x(t ) = x T, t [0..T ] Dynamic constraints (define the dynamics of states); ẋ(t) = f (x, u, t) Static constraints on states (nonnegativity, etc.) x(t) 0, u(t) 0.
14 Hamiltonian To solve an optimal control problem one need Hamiltonian function; This is an analog of Lagrangian for static problems; It includes the objective and dynamic constraints; If static constraints are present, the augmented Hamiltonian is used; First order conditions on Hamiltonian provide optimality criteria.
15 Construction Let the optimal control problem be: J := T 0 F (x, u, t)dt max u ; Then the associated Hamiltonian is given by: s.t. ẋ = f (x, u, t). (6) H(λ, x, u, t) = F (x, u, t) + λ(t) f (x, u, t). (7)
16 Comments In the Hamiltonian λ(t) is called costate variable; It usually represents shadow costs of investments; Investments are the control, u(t); This has to be only piecewisecontinuous and not continuous; Hamiltonian includes that many costate variables as many dynamic constraints the system has; Unlike lagrange multipliers, costate variable changes in time; The optimal dynamics is defined by the pair of ODE then: for state, x(t) and costate, λ(t).
17 Example Consider the problem: max u( ) T 0 e rt [ x(t) α 2 u(t)2 ]dt s.t. x(t) = β(t) u(t) x(t), u(t) 0, x(0) = x 0. (8) where β(t) is arbitrary positivevalued function and α, r, T are constants.
18 The Hamiltonian of the problem (8) should be: H CV (λ, x, u, t) = x α 2 u2 + λ CV [β(t) u x]. (9) Where the admissible set of controls include all nonnegative values (u(t) 0). QUESTION: where is the discount term e rt? Transformation e rt λ(t) = λ CV (t) yields current value Hamiltonian. It is used throughout all the economic problems.
19 Optimality To obtain firstorder conditions of optimality the Pontryagin s Maximum Principle is used. Let J := s.t. T 0 ẋ = f (x, u, t); be the optimal control problem and F (x, u, t)dt max u ; u(t) 0, x(0) = x 0. (10) H(λ, x, u, t) = F (x, u, t) + λ(t) f (x, u, t). (11) the associated Hamiltonian.
20 Optimality conditions The optimal control u(t) is such that it maximizes the Hamiltonian, (11), and must hold for almost all t. This is maximum condition. Along optimal trajectory u H(λ, x, u, t) : = 0; u H(λ, x, u, t) = H (λ, x, t) (12) λ(t) = rλ(t) H x(λ, x, t). (13) which is the adjoint or costate equation. is transversality condition. λ(t ) = 0 (14)
21 Theorem (Pontryagin s Maximum Principle) Consider the optimal control problem (10) with Hamiltonian (11) and maximized Hamiltonian as above. Assume the state space X is a convex set and there are no scrap value. Let u( ) be a feasible control path with associated state trajectory x(t). If there exists and absolutely continuous function λ : [0, T ] R n such that the maximum condition (12), the adjoint equation (13) and transversality condition (14) are satisfied, and such that the function x H (λ, x, t) is concave and continuously differentiable, then u( ) is an optimal control.
22 Sufficiency The theorem provides only necessary, but not sufficient criteria of optimality; The sufficient condition is given by the concavity of a maximized Hamiltonian H w. r. t. x(t); In our example the Hamiltonian is linear in state and quadratic in control, and hence concave in state; Sufficient condition is satisfied; This is always true for linearquadratic problems.
23 Main points on optimal control To solve an optimal control problem is: Right down the Hamiltonian of the problem; Derive firstorder condition on the control; Derive costate equation; Substitute optimal control candidate into state and costate equations; Solve the canonical system of equations; Define optimal control candidate as a function of time; Determine the concavity of a maximized Hamiltonian.
24 Hotelling model Social optimum Assume the utility depends on resource only; Social planner maximizes utility subject to finiteness of the resource: T max e rt { U(R(t)) br(t) } dt (15) R( ) 0 s. t. T 0 R(t)dt = S 0. (16) After some manipulation this constitutes the standard optimal control problem.
25 Hotelling model Canonical form We set S(t) the new artificial state variable: Ṡ = R(t) (17) Adjoining the new dynamic constraint to the optimization problem; Transformation from rates to stocks.
26 Hotelling model Hotelling in optimal control form Transformation above yields: T max e rt { U(R(t)) br(t) } dt (18) R( ) 0 s. t. Giving the Hotelling s rule: OR Ṡ = R(t). (19) U (R(t)) b = λ(t)e rt (20) ṗ(t) p(t) = λ(t) λ(t) = r (21)
27 Hotelling model Competitive problem There exist n identical resourceextracting firms; The optimization problem is then: { T } nr(t) max e rt p(x)dx nb(r(t), S(t)) dt R( ) 0 0 s.t. nṡ = nr(t), S(0) = S, S(T ) = S T (= 0). (22)
28 Hotelling model Monopolistic problem There exists a monopoly on the resource; Objective is profit maximization: T { } max e rt p(r)r(t) b MONO (R(t), S(t)) dt R( ) 0 s.t. Ṡ = R(t). (23)
29 Hotelling model Time to resource depletion Parameter T above is free; It is defined as an additional choice variable in optimal control problem; The condition for that is zero optimized Hamiltonian value: H(R (T ), S (T ), λ (T ), T ) = 0. (24)
30 Hotelling model Conclusion Resource optimization is essentially intertemporal, i. e. dynamic; Finite resource requires social planning in most cases; With some parameters market can follow optimal path (less frequent than not); Intertemporal discount rate influences heavily the outcome; Optimal control is a versatile tool for solving intertemporal resource extraction problems.
31 Hotelling model Next time Application of Hotelling s rule; Paper: Ludwig (2014) Hotelling rent, national oil companies and oil supply in the long run.
CHAPTER 7 APPLICATIONS TO MARKETING. Chapter 7 p. 1/54
CHAPTER 7 APPLICATIONS TO MARKETING Chapter 7 p. 1/54 APPLICATIONS TO MARKETING State Equation: Rate of sales expressed in terms of advertising, which is a control variable Objective: Profit maximization
More informationEXHAUSTIBLE RESOURCES
T O U L O U S E S C H O O L O F E C O N O M I C S NATURAL RESOURCES ECONOMICS CHAPTER III EXHAUSTIBLE RESOURCES CHAPTER THREE : EXHAUSTIBLE RESOURCES Natural resources economics M1 TSE INTRODUCTION The
More informationUniversidad de Montevideo Macroeconomia II. The RamseyCassKoopmans Model
Universidad de Montevideo Macroeconomia II Danilo R. Trupkin Class Notes (very preliminar) The RamseyCassKoopmans Model 1 Introduction One shortcoming of the Solow model is that the saving rate is exogenous
More informationCHAPTER 11 APPLICATIONS TO ECONOMICS. Chapter 11 p. 1/49
CHAPTER 11 APPLICATIONS TO ECONOMICS Chapter 11 p. 1/49 APPLICATIONS TO ECONOMICS Optimal control theory has been extensively applied to the solution of economics problems since the early papers that appeared
More informationLecture 11. 3.3.2 Cost functional
Lecture 11 3.3.2 Cost functional Consider functions L(t, x, u) and K(t, x). Here L : R R n R m R, K : R R n R sufficiently regular. (To be consistent with calculus of variations we would have to take L(t,
More informationGraphical method. plane. (for max) and down (for min) until it touches the set of feasible solutions. Graphical method
The graphical method of solving linear programming problems can be applied to models with two decision variables. This method consists of two steps (see also the first lecture): 1 Draw the set of feasible
More informationIncreasing for all. Convex for all. ( ) Increasing for all (remember that the log function is only defined for ). ( ) Concave for all.
1. Differentiation The first derivative of a function measures by how much changes in reaction to an infinitesimal shift in its argument. The largest the derivative (in absolute value), the faster is evolving.
More information14.451 Lecture Notes 10
14.451 Lecture Notes 1 Guido Lorenzoni Fall 29 1 Continuous time: nite horizon Time goes from to T. Instantaneous payo : f (t; x (t) ; y (t)) ; (the time dependence includes discounting), where x (t) 2
More information15 Kuhn Tucker conditions
5 Kuhn Tucker conditions Consider a version of the consumer problem in which quasilinear utility x 2 + 4 x 2 is maximised subject to x +x 2 =. Mechanically applying the Lagrange multiplier/common slopes
More informationTHEORY OF SIMPLEX METHOD
Chapter THEORY OF SIMPLEX METHOD Mathematical Programming Problems A mathematical programming problem is an optimization problem of finding the values of the unknown variables x, x,, x n that maximize
More informationLecture 4 Linear Programming Models: Standard Form. August 31, 2009
Linear Programming Models: Standard Form August 31, 2009 Outline: Lecture 4 Standard form LP Transforming the LP problem to standard form Basic solutions of standard LP problem Operations Research Methods
More informationDynamic optimization: A tool kit
Dynamic optimization: A tool kit Manuel Wälti This draft: September 2002 Contents 1 Introduction 1 2 Optimal control 3 2.1 Discrete time... 3 2.1.1 Finite horizon... 3 2.1.2 Infinite horizon... 5 2.2 Continuous
More informationDeterministic Problems
Chapter 2 Deterministic Problems 1 In this chapter, we focus on deterministic control problems (with perfect information), i.e, there is no disturbance w k in the dynamics equation. For such problems there
More informationThis is a simple guide to optimal control theory. In what follows, I borrow freely from Kamien and Shwartz (1981) and King (1986).
ECON72: MACROECONOMIC THEORY I Martin Boileau A CHILD'S GUIDE TO OPTIMAL CONTROL THEORY 1. Introduction This is a simple guide to optimal control theory. In what follows, I borrow freely from Kamien and
More informationLecture 12 Basic Lyapunov theory
EE363 Winter 200809 Lecture 12 Basic Lyapunov theory stability positive definite functions global Lyapunov stability theorems Lasalle s theorem converse Lyapunov theorems finding Lyapunov functions 12
More informationEcon674 Economics of Natural Resources and the Environment
Econ674 Economics of Natural Resources and the Environment Session 5 Static Static Optimization Optimization means the best use of a given stock of resources to achieve a given end. Best use generally
More informationChapter 3 LINEAR PROGRAMMING GRAPHICAL SOLUTION 3.1 SOLUTION METHODS 3.2 TERMINOLOGY
Chapter 3 LINEAR PROGRAMMING GRAPHICAL SOLUTION 3.1 SOLUTION METHODS Once the problem is formulated by setting appropriate objective function and constraints, the next step is to solve it. Solving LPP
More informationBy W.E. Diewert. July, Linear programming problems are important for a number of reasons:
APPLIED ECONOMICS By W.E. Diewert. July, 3. Chapter : Linear Programming. Introduction The theory of linear programming provides a good introduction to the study of constrained maximization (and minimization)
More informationControl Systems Design
ELEC4410 Control Systems Design Lecture 17: State Feedback Julio H Braslavsky julio@eenewcastleeduau School of Electrical Engineering and Computer Science Lecture 17: State Feedback p1/23 Outline Overview
More informationReadings. D Chapter 1. Lecture 2: Constrained Optimization. Cecilia Fieler. Example: Input Demand Functions. Consumer Problem
Economics 245 January 17, 2012 : Example Readings D Chapter 1 : Example The FOCs are max p ( x 1 + x 2 ) w 1 x 1 w 2 x 2. x 1,x 2 0 p 2 x i w i = 0 for i = 1, 2. These are two equations in two unknowns,
More informationFunctional Optimization Models for Active Queue Management
Functional Optimization Models for Active Queue Management Yixin Chen Department of Computer Science and Engineering Washington University in St Louis 1 Brookings Drive St Louis, MO 63130, USA chen@cse.wustl.edu
More informationMaths for Economics. Geoff Renshaw with contributions from Norman Ireland OXPORD UNIVERSITY PRESS. Second Edition
Maths for Economics Second Edition Geoff Renshaw with contributions from Norman Ireland OXPORD UNIVERSITY PRESS Brief contents Detailed contents About the author About the book How to use the book Chapter
More informationGraduate Introductory Macroeconomics: Exam 1
Graduate Introductory Macroeconomics: Exam Name: Student ID: You have 60 minutes. Answer in English or Japanese.. Consumption tax in a oneperiod model 0 points) The household determines the consumption
More informationA Detailed Price Discrimination Example
A Detailed Price Discrimination Example Suppose that there are two different types of customers for a monopolist s product. Customers of type 1 have demand curves as follows. These demand curves include
More informationDynamic optimization. Chapter 7
Chapter 7 Dynamic optimization Chapter 5 deals essentially with static optimization, that is optimal choice at a single point of time. Many economic models involve optimization over time. While the same
More informationEndogenous Growth Theory
Chapter 3 Endogenous Growth Theory 3.1 OneSector Endogenous Growth Models 3.2 Twosector Endogenous Growth Model 3.3 Technological Change: Horizontal Innovations References: Aghion, P./ Howitt, P. (1992),
More informationMath 407A: Linear Optimization
Math 407A: Linear Optimization Lecture 4: LP Standard Form 1 1 Author: James Burke, University of Washington LPs in Standard Form Minimization maximization Linear equations to linear inequalities Lower
More informationSection Notes 3. The Simplex Algorithm. Applied Math 121. Week of February 14, 2011
Section Notes 3 The Simplex Algorithm Applied Math 121 Week of February 14, 2011 Goals for the week understand how to get from an LP to a simplex tableau. be familiar with reduced costs, optimal solutions,
More informationValuation and Optimal Decision for Perpetual American Employee Stock Options under a Constrained Viscosity Solution Framework
Valuation and Optimal Decision for Perpetual American Employee Stock Options under a Constrained Viscosity Solution Framework Quan Yuan Joint work with Shuntai Hu, Baojun Bian Email: candy5191@163.com
More informationIn this section, we will consider techniques for solving problems of this type.
Constrained optimisation roblems in economics typically involve maximising some quantity, such as utility or profit, subject to a constraint for example income. We shall therefore need techniques for solving
More informationGaussMarkov Theorem. The GaussMarkov Theorem is given in the following regression model and assumptions:
GaussMarkov Theorem The GaussMarkov Theorem is given in the following regression model and assumptions: The regression model y i = β 1 + β x i + u i, i = 1,, n (1) Assumptions (A) or Assumptions (B):
More informationLecture 3: Growth with Overlapping Generations (Acemoglu 2009, Chapter 9, adapted from Zilibotti)
Lecture 3: Growth with Overlapping Generations (Acemoglu 2009, Chapter 9, adapted from Zilibotti) Kjetil Storesletten September 10, 2013 Kjetil Storesletten () Lecture 3 September 10, 2013 1 / 44 Growth
More informationECONOMIC THEORY AND OPERATIONS ANALYSIS
WILLIAM J. BAUMOL Professor of Economics Princeton University ECONOMIC THEORY AND OPERATIONS ANALYSIS Second Edition PrenticeHall, I Inc. Engkwood Cliffs, New Jersey CONTENTS PART 7 ANALYTIC TOOLS OF
More informationf x. Some important rules of taking derivatives (differentiation) are: y = k (constant) then dy dx = 0. y = x n then dy dx = nx n 1.
Econ 406: Math Supplement (Derivatives and Optimization) In this supplement, we very briefly review the mathematical techniques and methods used in this course. Denote a function of one variable: y = f
More informationEconomics 702 Macroeconomic Theory Practice Examination #1 October 2008
Economics 702 Macroeconomic Theory Practice Examination #1 October 2008 Instructions: There are a total of 60 points on this examination and you will have 60 minutes to complete it. The rst 10 minutes
More informationDetermination of Optimum Fair Premiums in PropertyLiability Insurance: An Optimal Control Theoretic Approach
Determination of Optimum Fair Premiums in PropertyLiability Insurance: An Optimal Control Theoretic Approach by Amin Ussif and Gregory Jones ABSTRACT Dynamic valuation models for the computation of optimum
More informationHamiltonian trajectories and saddle points in mathematical economics
Control and Cybernetics vol. 38 (29) No. 4B Hamiltonian trajectories and saddle points in mathematical economics by R. Tyrrell Rockafellar University of Washington, Seattle, USA Abstract: Infinitehorizon
More informationFirstOrder Condition
Expected Utility Let u(w t ) denote expected lifetime utility at time t. The value is the optimum expected utility, derived from expectations about the future and optimizing behavior. Expected utility
More informationUnit 1. Basic economic concepts
Unit 1. Basic economic concepts Learning objectives to understand the principle of marginal analysis; to understand that the existence of limited resources along with unlimited wants results in the need
More informationMathematics Notes for Class 12 chapter 12. Linear Programming
1 P a g e Mathematics Notes for Class 12 chapter 12. Linear Programming Linear Programming It is an important optimization (maximization or minimization) technique used in decision making is business and
More informationExpenditure Minimisation Problem
Expenditure Minimisation Problem This Version: September 20, 2009 First Version: October, 2008. The expenditure minimisation problem (EMP) looks at the reverse side of the utility maximisation problem
More informationECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE
ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE YUAN TIAN This synopsis is designed merely for keep a record of the materials covered in lectures. Please refer to your own lecture notes for all proofs.
More informationMathematical Economics  Part I  Optimization. Filomena Garcia. Fall Optimization. Filomena Garcia. Optimization. Existence of Solutions
of Mathematical Economics  Part I  Fall 2009 of 1 in R n Problems in Problems: Some of 2 3 4 5 6 7 in 8 Continuity: The Maximum Theorem 9 Supermodularity and Monotonicity of An optimization problem in
More informationECONOMIC THEORY OF DEPLETABLE RESOURCES: AN INTRODUCTION
ECONOMIC THEORY OF DEPLETABLE RESOURCES: AN INTRODUCTION James L. Sweeney 1 Stanford University October 15, 1992 To Appear as Chapter 17 in Handbook of Natural Resource and Energy Economics, Volume 3 Editors
More informationEconomic Growth: Lecture 9, Neoclassical Endogenous Growth
14.452 Economic Growth: Lecture 9, Neoclassical Endogenous Growth Daron Acemoglu MIT November 29, 2011. Daron Acemoglu (MIT) Economic Growth Lecture 9 November 29, 2011. 1 / 41 FirstGeneration Models
More informationThe Method of Lagrange Multipliers
The Method of Lagrange Multipliers S. Sawyer October 25, 2002 1. Lagrange s Theorem. Suppose that we want to maximize (or imize a function of n variables f(x = f(x 1, x 2,..., x n for x = (x 1, x 2,...,
More informationProblem Set 6  Solutions
ECO573 Financial Economics Problem Set 6  Solutions 1. Debt Restructuring CAPM. a Before refinancing the stoc the asset have the same beta: β a = β e = 1.2. After restructuring the company has the same
More informationSUPPLEMENT TO CHAPTER
SUPPLEMENT TO CHAPTER 6 Linear Programming SUPPLEMENT OUTLINE Introduction and Linear Programming Model, 2 Graphical Solution Method, 5 Computer Solutions, 14 Sensitivity Analysis, 17 Key Terms, 22 Solved
More informationLesson 3: Graphical method for solving LPP. Graphical Method of solving Linear Programming Problems
Unit Lesson 3: Graphical method for solving LPP. Learning outcome.finding the graphical solution to the linear programming model Graphical Method of solving Linear Programming Problems Introduction Dear
More informationmax cx s.t. Ax c where the matrix A, cost vector c and right hand side b are given and x is a vector of variables. For this example we have x
Linear Programming Linear programming refers to problems stated as maximization or minimization of a linear function subject to constraints that are linear equalities and inequalities. Although the study
More informationLecture 6: Price discrimination II (Nonlinear Pricing)
Lecture 6: Price discrimination II (Nonlinear Pricing) EC 105. Industrial Organization. Fall 2011 Matt Shum HSS, California Institute of Technology November 14, 2012 EC 105. Industrial Organization. Fall
More informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
More informationMidterm Exam Solutions
14.06 Macroeconomics Spring 2003 Part A (True, false or uncertain) Midterm Exam Solutions 1. An economy that increases its saving rate will experience faster growth. Uncertain. In the Solow model an economy
More informationMathematical tools for Economic Dynamics: Dynamic Optimization. Fausto Gozzi. Discussion Paper No.19 Novembre 2012 ISSN:
Mathematical tools for Economic Dynamics: Dynamic Optimization Fausto Gozzi Discussion Paper No.19 Novembre 2012 ISSN: 22809767 Università degli Studi di Napoli Parthenope CRISEI Fausto Gozzi Dipartimento
More informationThe Canonical and Dictionary Forms of Linear Programs
The Canonical and Dictionary Forms of Linear Programs Recall the general optimization problem: Minimize f(x) subect to x D (1) The real valued function f is called the obective function, and D the constraint
More informationOPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN. E.V. Grigorieva. E.N. Khailov
DISCRETE AND CONTINUOUS Website: http://aimsciences.org DYNAMICAL SYSTEMS Supplement Volume 2005 pp. 345 354 OPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN E.V. Grigorieva Department of Mathematics
More informationThe MarketClearing Model
Chapter 5 The MarketClearing Model Most of the models that we use in this book build on two common assumptions. First, we assume that there exist markets for all goods present in the economy, and that
More informationLecture 3: Convex Sets and Functions
EE 227A: Convex Optimization and Applications January 24, 2012 Lecture 3: Convex Sets and Functions Lecturer: Laurent El Ghaoui Reading assignment: Chapters 2 (except 2.6) and sections 3.1, 3.2, 3.3 of
More informationINTERMEDIATE MICROECONOMICS MATH REVIEW
INTERMEDIATE MICROECONOMICS MATH REVIEW August 31, 2008 OUTLINE 1. Functions Definition Inverse functions Convex and Concave functions 2. Derivative of Functions of One variable Definition Rules for finding
More informationHello, my name is Olga Michasova and I present the work The generalized model of economic growth with human capital accumulation.
Hello, my name is Olga Michasova and I present the work The generalized model of economic growth with human capital accumulation. 1 Without any doubts human capital is a key factor of economic growth because
More informationdr Bartłomiej Rokicki Chair of Macroeconomics and International Trade Theory Faculty of Economic Sciences, University of Warsaw
Chair of Macroeconomics and International Trade Theory Faculty of Economic Sciences, University of Warsaw Intertemporal trade and consumption Intertemporal trade  occurs when resources are transferable
More informationEquilibrium with Complete Markets
Equilibrium with Complete Markets Jesús FernándezVillaverde University of Pennsylvania February 12, 2016 Jesús FernándezVillaverde (PENN) Equilibrium with Complete Markets February 12, 2016 1 / 24 ArrowDebreu
More information4. Optimization Methods
4. Optimization Methods 1. Introduction 81. Comparing Time Streams of Economic Benefits and Costs 81.1. Interest Rates 8.. Equivalent Present Value 8.. Equivalent Annual Value 8. NonLinear Optimization
More informationAn Introduction to Optimal Control
An Introduction to Optimal Control Ugo Boscain Benetto Piccoli The aim of these notes is to give an introduction to the Theory of Optimal Control for finite dimensional systems and in particular to the
More informationThe Optimal Growth Problem
LECTURE NOTES ON ECONOMIC GROWTH The Optimal Growth Problem Todd Keister Centro de Investigación Económica, ITAM keister@itam.mx January 2005 These notes provide an introduction to the study of optimal
More informationChapter 21: The Discounted Utility Model
Chapter 21: The Discounted Utility Model 21.1: Introduction This is an important chapter in that it introduces, and explores the implications of, an empirically relevant utility function representing intertemporal
More informationProblem 1 (10 pts) Find the radius of convergence and interval of convergence of the series
1 Problem 1 (10 pts) Find the radius of convergence and interval of convergence of the series a n n=1 n(x + 2) n 5 n 1. n(x + 2)n Solution: Do the ratio test for the absolute convergence. Let a n =. Then,
More information19 LINEAR QUADRATIC REGULATOR
19 LINEAR QUADRATIC REGULATOR 19.1 Introduction The simple form of loopshaping in scalar systems does not extend directly to multivariable (MIMO) plants, which are characterized by transfer matrices instead
More informationEconomics 121b: Intermediate Microeconomics Problem Set 2 1/20/10
Dirk Bergemann Department of Economics Yale University s by Olga Timoshenko Economics 121b: Intermediate Microeconomics Problem Set 2 1/20/10 This problem set is due on Wednesday, 1/27/10. Preliminary
More informationLecture 7: Finding Lyapunov Functions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1
More informationEnvelope Theorem. Kevin Wainwright. Mar 22, 2004
Envelope Theorem Kevin Wainwright Mar 22, 2004 1 Maximum Value Functions A maximum (or minimum) value function is an objective function where the choice variables have been assigned their optimal values.
More informationDuality in General Programs. Ryan Tibshirani Convex Optimization 10725/36725
Duality in General Programs Ryan Tibshirani Convex Optimization 10725/36725 1 Last time: duality in linear programs Given c R n, A R m n, b R m, G R r n, h R r : min x R n c T x max u R m, v R r b T
More informationECON 301: General Equilibrium I (Exchange) 1. Intermediate Microeconomics II, ECON 301. General Equilibrium I: Exchange
ECON 301: General Equilibrium I (Exchange) 1 Intermediate Microeconomics II, ECON 301 General Equilibrium I: Exchange The equilibrium concepts you have used till now in your Introduction to Economics,
More informationThe revenue function, R(x), is the total revenue realized from the sale of x units of the product.
Linear Cost, Revenue and Profit Functions: If x is the number of units of a product manufactured or sold at a firm then, The cost function, C(x), is the total cost of manufacturing x units of the product.
More informationPrice Discrimination: Case of Monopoly
Price Discrimination: Case of Monopoly The firm charges different prices to different consumers, or different prices for different units purchased. Prevelent in reality. Examples: 1. tickets (airline,
More informationPolitecnico di Torino, Short Course on: Optimal Control Problems: the Dynamic Programming Approach
Politecnico di Torino, Short Course on: Optimal Control Problems: the Dynamic Programming Approach Fausto Gozzi Dipartimento di Economia e Finanza Università Luiss  Guido Carli, viale Romania 32, 00197
More informationPROBLEM SET. Practice Problems for Exam #2. Math 2350, Fall Nov. 7, 2004 Corrected Nov. 10 ANSWERS
PROBLEM SET Practice Problems for Exam #2 Math 2350, Fall 2004 Nov. 7, 2004 Corrected Nov. 10 ANSWERS i Problem 1. Consider the function f(x, y) = xy 2 sin(x 2 y). Find the partial derivatives f x, f y,
More informationOptimal Paternalism: Sin Taxes and Health Subsidies
Optimal Paternalism: Sin Taxes and Health Subsidies Thomas Aronsson and Linda Thunström Department of Economics, Umeå University SE  901 87 Umeå, Sweden April 2005 Abstract The starting point for this
More informationSOLUTIONS TO HOMEWORK ASSIGNMENT #5, Math 253
SOLUTIONS TO HOMEWORK ASSIGNMENT #5, Math 53. For what values of the constant k does the function f(x, y) =kx 3 + x +y 4x 4y have (a) no critical points; (b) exactly one critical point; (c) exactly two
More informationInsurance. Michael Peters. December 27, 2013
Insurance Michael Peters December 27, 2013 1 Introduction In this chapter, we study a very simple model of insurance using the ideas and concepts developed in the chapter on risk aversion. You may recall
More informationSensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS
Sensitivity Analysis 3 We have already been introduced to sensitivity analysis in Chapter via the geometry of a simple example. We saw that the values of the decision variables and those of the slack and
More informationNonlinear Programming Methods.S2 Quadratic Programming
Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective
More informationSolving Linear Programs in Excel
Notes for AGEC 622 Bruce McCarl Regents Professor of Agricultural Economics Texas A&M University Thanks to Michael Lau for his efforts to prepare the earlier copies of this. 1 http://ageco.tamu.edu/faculty/mccarl/622class/
More information1. (16 pts) D = 5000/yr, C = 600/unit, 1 year = 300 days, i = 0.06, A = 300 Current ordering amount Q = 200
HW 2 Solution 1. (16 pts) D = 5000/yr, C = 600/unit, 1 year = 300 days, i = 0.06, A = 300 Current ordering amount Q = 200 (a) T * = (b) Total(Holding + Setup) cost would be (c) The optimum cost would be
More informationChapter 15 Introduction to Linear Programming
Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2014 WeiTa Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of
More informationEconomics 2020a / HBS 4010 / HKS API111 FALL 2010 Solutions to Practice Problems for Lectures 1 to 4
Economics 00a / HBS 4010 / HKS API111 FALL 010 Solutions to Practice Problems for Lectures 1 to 4 1.1. Quantity Discounts and the Budget Constraint (a) The only distinction between the budget line with
More informationSolutions Of Some NonLinear Programming Problems BIJAN KUMAR PATEL. Master of Science in Mathematics. Prof. ANIL KUMAR
Solutions Of Some NonLinear Programming Problems A PROJECT REPORT submitted by BIJAN KUMAR PATEL for the partial fulfilment for the award of the degree of Master of Science in Mathematics under the supervision
More informationAdvanced Topics in Machine Learning (Part II)
Advanced Topics in Machine Learning (Part II) 3. Convexity and Optimisation February 6, 2009 Andreas Argyriou 1 Today s Plan Convex sets and functions Types of convex programs Algorithms Convex learning
More informationGeneral Equilibrium Theory: Examples
General Equilibrium Theory: Examples 3 examples of GE: pure exchange (Edgeworth box) 1 producer  1 consumer several producers and an example illustrating the limits of the partial equilibrium approach
More informationDynamic Strategic Pricing and Speed of Diffusion 1
journal of optimization theory and applications: Vol. 123, No. 2, pp. 331 348, November 2004 ( 2004) Dynamic Strategic Pricing and Speed of Diffusion 1 E. J. Dockner 2 and G. E. Fruchter 3 Communicated
More informationCurrent Accounts in Open Economies Obstfeld and Rogoff, Chapter 2
Current Accounts in Open Economies Obstfeld and Rogoff, Chapter 2 1 Consumption with many periods 1.1 Finite horizon of T Optimization problem maximize U t = u (c t ) + β (c t+1 ) + β 2 u (c t+2 ) +...
More informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationConstrained optimization.
ams/econ 11b supplementary notes ucsc Constrained optimization. c 2010, Yonatan Katznelson 1. Constraints In many of the optimization problems that arise in economics, there are restrictions on the values
More information6. Budget Deficits and Fiscal Policy
Prof. Dr. Thomas Steger Advanced Macroeconomics II Lecture SS 2012 6. Budget Deficits and Fiscal Policy Introduction Ricardian equivalence Distorting taxes Debt crises Introduction (1) Ricardian equivalence
More informationChap 4 The Simplex Method
The Essence of the Simplex Method Recall the Wyndor problem Max Z = 3x 1 + 5x 2 S.T. x 1 4 2x 2 12 3x 1 + 2x 2 18 x 1, x 2 0 Chap 4 The Simplex Method 8 corner point solutions. 5 out of them are CPF solutions.
More informationThe integrating factor method (Sect. 2.1).
The integrating factor method (Sect. 2.1). Overview of differential equations. Linear Ordinary Differential Equations. The integrating factor method. Constant coefficients. The Initial Value Problem. Variable
More informationChapter 4. Saving and Investment. 4.1 The Model Structure
Chapter 4 Saving and Investment The models I have discussed so far are missing a central component of the General Theory; the idea that investment is the driving force of business cycles. Chapter 4 introduces
More informationHigher Order Linear Differential Equations with Constant Coefficients
Higher Order Linear Differential Equations with Constant Coefficients Part I. Homogeneous Equations: Characteristic Roots Objectives: Solve nth order homogeneous linear equations where a n,, a 1, a 0
More informationThe Simplex Method. yyye
Yinyu Ye, MS&E, Stanford MS&E310 Lecture Note #05 1 The Simplex Method Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/
More informationHOMEWORK 4 SOLUTIONS. All questions are from Vector Calculus, by Marsden and Tromba
HOMEWORK SOLUTIONS All questions are from Vector Calculus, by Marsden and Tromba Question :..6 Let w = f(x, y) be a function of two variables, and let x = u + v, y = u v. Show that Solution. By the chain
More information