Final Exam - Answer key
|
|
- Roy Harrington
- 5 years ago
- Views:
Transcription
1 Fall4 Final Exam - Answer key ARE Problem (Analysis) [7 points]: A) [ points] Let A = (,) R be endowed with the Euclidean metric. Consider the set O = {( n,) : n N}. Does the open cover O of A have a finite open subcover? If so, provide it. If not, prove that one does not exist. Ans: This open cover does not have a finite open subcover. Want to show that if we take any finite subset of O we will no longer be able to cover A. Let F be an aribitrary, finite set of natural numbers and consider O F = {( n,) : n F}. Since F is finite there must be a largest element of the set. Denote this as ˆn. Hence O F = ( ˆn,). Now consider the point a = ˆn. Clearly a A, but a / O F. Hence O F does not cover A.
2 a): det(a) a): det([a(:,)),b]..4.6 a): det([b,a(:,))] b): det(a) b): det([a(:,)),b] b): det([b,a(:,))] c): det(a) c): det([a(:,)),b] c): det([b,a(:,))] Problem (Linear Algebra) [5 points]: Figure. Figure for problem A) [ points] Suppose that X is a vector space and that A is a subset of X. Prove that if A is a vector subspace then X/A is not a vector subspace. Ans: All vector spaces (and subspaces) must be closed under vector addition and scalar multiplication. A consequence of this is that all vector spaces must contain the zero vector. If A is a vector subspace then we must have A, hence / X\A. Therefore X\A cannot be a vector subspace of X. B) [5 points] For each of panels a), b) and c) of figure, write down your best guess for the solution of the equation Ax = b, where A = [v v ]. (Note: full marks will be awarded if the maximum element-wise distance between your answer and the true answer is <.. Otherwise the further your answer is from the correct answer, the fewer marks you will recieve. For full marks use only the graphical approach to Cramer s rule (no algebra). Hint: be careful about the sign of your solution.) Ans: See 4th Linear Algebra Notes for full discussion of the graphical interpretation of Cramer s rule. a) x =.8; x =. b) x = ; x = c) x = ; x =
3 Problem 3 (Calculus) [5 points]: Let f(x) = x 3 +x 3x. A) [9 points] Use a first order Taylor expansion around x = to estimate the change in the function when x is increased by, i.e. dx =. What is the estimated sign of the change? Ans: Note that for f(x) = x 3 +x 3x, f (x) = 3x +4x 3, f (x) = 6x+4, and f (x) = 6. The first order approximation of the change in the function is given by f(x + dx) f(x ) = f (x )dx = 3dx. For dx = the estimated change is 6 and the sign of the estimated change is negative. B) [9 points] Now use a second order Taylor expansion around x = to estimate the change in the function when x is increased by, i.e. dx =. What is the estimated sign of the change? Ans: The second order approximation of the change in the function is given by f(x + dx) f(x ) = f (x )dx+ f (x ) dx = 3dx+dx. For dx = the estimated change is and the sign of the estimated change is positive. C) [7 points] Evaluate the original function at x =. Discuss how the actual sign of the change compares to your answers in the previous two parts. Ans: The orignal function evaluated at x = is f() =, hence the actual change in function, f() f() =, which is positive. This is an example of the importance of the condition in the Taylor-Young theorem that the sign of the estimated change is equal to the sign of the actual change for a sufficiently small dx. Here the dx is too large for the first order approximation to yield the correct sign, but the dx is sufficiently small for the second order approximation to give the correct result. 3
4 4 s s s s s s Figure. Figure for problem 4b Problem 4 (Constrained Optimization) [5 points]: After working hard all semester you decide to take a vacation by the seaside. Each day you can either spend your time sunbaking, s, or jetboating, j. Consuming one unit of either takes a day. Your vacation is 5 days long. Additionally sunbaking costs $ per day and jetboating costs $4 per day. You have allocated a budget of 4 dollars for your vacation. Your utility from sunbaking and jetboating is given by f(s,j) = sj. A) [3 points] Set up your optimization problem so you have the best time possible on vacation (please ignore non-negativity constraints). Ans: The vacation-fun maximization problem is given by maxsj subject to g : s+4j 4 g : s+j 5 (Strictly speaking this problem should have non-negativity constraints on s and j. We omit them in this problem since it increases the number of cases unnecessarily. We will only consider (s,j) R ++ R ++ to avoid the discontinuity of f at (,).) B) [3 points] Sketch the constraint set and draw a level set of the utility function. Ans: C) [3 points] Write down the Lagrange and the KKT conditions. Ans: The Lagrangian is given by L = sj +λ (4 s 4j)+λ (5 s j)
5 5 The KKT conditions are: () L s = j λ λ = () L j = s 4λ λ = (3) L λ = 4 s 4j (6)λ (4 s 4j) = (9)λ (4) L λ = 5 s j (7)λ (5 s j) = ()λ D) [8 points] Find the solution to the problem. Show all your work for maximum credit. Ans: The constraints are linear so the constraint qualification holds globally. Case : Interior solution, λ =,λ = f = (j,s) The gradient is never vanishing on R ++ R ++. No interior solution. Case : λ >,λ > g s+4j = 4 g s+j = 5 3j = 9 j = 3 There is one candidate point here (,3). () 3 λ λ = () 4λ λ = 9 = 3λ λ = 3 λ = Contradiction. Case 3: λ =,λ > () j = λ () s = λ j = s (4) 5 s j = 5 s = s = j = 5 (3) = 3.5(< ) Contradiction. Case 4: λ >,λ = () j = λ () s = 4λ = 4j (3) 4 4j 4j = j = 3 s = λ = 3 (4) 5 3 = ( ) Solution. (s,j ) = (,3),f(,3) = 36 E) [8 points] What will be the approximate increase in your utility if: (a) Your holiday is extended for a day? (b) You find a dollar on the beach? Ans: The Lagrangian multiplier represents the first order approximation of the increase in the value function if the corresponding constraint is relaxed by unit. (a) TheLagrangemultipliercorrespondingtothetimeconstraint, λ, is(satisfiedwithequality, but not binding). Hence extending your holiday by a day will not increase your utility, nor will it change your choice of s and j.
6 6 (b) The Lagrange multiplier corresponding to the time budget constraint, λ, is 3. Hence, to a first order approximation, your utility will increase by 3 utils if you find a dollar on the beach.
7 7 s t Figure 3. Figure for problem 5 Problem 5 (Comparative Statics) [5 points]: Consider the following constrained maximization problem. maxx+α subject to x 3 x α A) [5 points] In α x space, draw the feasible set and a level set of the objective function. Ans: Note, the way the question was posed in the exam (with the α = condition) did not make sense. Everyone got full points for this question. B) [ points] Use the implicit function theorem to calculate dx dα. Ans: The Lagrangian of this problem is give by L(x,λ;α) = x+α+λ(α x 3 x) The first order conditions are: L x = λ(3x ) = L λ = (α x3 x) = Let [ λ(3x f = ] ) α x 3 x The implicit function theorem gives us that [ x ] [ f λ = Jf(x,λ) f ]
8 8 Jf(x,λ) = [ f x f x f λ f λ ]=[ 6λx 3x ] 3x Notice that det(jf) = (3x +), which is always negative, hence we can apply the implicit function everywhere Using Cramer s rule which is always positive. x = [ 3x det(jf) ] = 3x + C) [ points] Use the envelope theorem to estimate the maximized value of the objective function when α =.9. Ans: The maximized value can be approximated by f(x (α))+ df(x (α)) dα dα when α = and dα =.. x (α = ) =, λ (α = ) = 4 from the first order conditions. From the envelope theorem, df(x (α)) dα = f(x (α)) = +λ (α) = 3 4 The maximized objective function is then f(x (α))+ df(x (α)) dα = +()+ 5 dα 4 +λ (α) g(x (α)) ( ) = = 3 8 =.875
Final Exam - Answer key
Fall2015 Final Exam - Answer key ARE211 Problem 1 (True/False) [36 points]: Answer whether each of the following is true (T), or false (IF). Each part is worth 4 points. Not much more than a small amount
More information2015 Math Camp Calculus Exam Solution
015 Math Camp Calculus Exam Solution Problem 1: x = x x +5 4+5 = 9 = 3 1. lim We also accepted ±3, even though it is not according to the prevailing convention 1. x x 4 x+4 =. lim 4 4+4 = 4 0 = 4 0 = We
More informationEC /11. Math for Microeconomics September Course, Part II Problem Set 1 with Solutions. a11 a 12. x 2
LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC400 2010/11 Math for Microeconomics September Course, Part II Problem Set 1 with Solutions 1. Show that the general
More informationEC /11. Math for Microeconomics September Course, Part II Lecture Notes. Course Outline
LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC400 20010/11 Math for Microeconomics September Course, Part II Lecture Notes Course Outline Lecture 1: Tools for
More informationOptimization using Calculus. Optimization of Functions of Multiple Variables subject to Equality Constraints
Optimization using Calculus Optimization of Functions of Multiple Variables subject to Equality Constraints 1 Objectives Optimization of functions of multiple variables subjected to equality constraints
More informationMath 313 (Linear Algebra) Exam 2 - Practice Exam
Name: Student ID: Section: Instructor: Math 313 (Linear Algebra) Exam 2 - Practice Exam Instructions: For questions which require a written answer, show all your work. Full credit will be given only if
More informationSufficient Conditions for Finite-variable Constrained Minimization
Lecture 4 It is a small de tour but it is important to understand this before we move to calculus of variations. Sufficient Conditions for Finite-variable Constrained Minimization ME 256, Indian Institute
More informationSECTION C: CONTINUOUS OPTIMISATION LECTURE 11: THE METHOD OF LAGRANGE MULTIPLIERS
SECTION C: CONTINUOUS OPTIMISATION LECTURE : THE METHOD OF LAGRANGE MULTIPLIERS HONOUR SCHOOL OF MATHEMATICS OXFORD UNIVERSITY HILARY TERM 005 DR RAPHAEL HAUSER. Examples. In this lecture we will take
More informationGeneralization to inequality constrained problem. Maximize
Lecture 11. 26 September 2006 Review of Lecture #10: Second order optimality conditions necessary condition, sufficient condition. If the necessary condition is violated the point cannot be a local minimum
More informationOptimization. A first course on mathematics for economists
Optimization. A first course on mathematics for economists Xavier Martinez-Giralt Universitat Autònoma de Barcelona xavier.martinez.giralt@uab.eu II.3 Static optimization - Non-Linear programming OPT p.1/45
More informationARE211 FINAL EXAM DECEMBER 12, 2003
ARE2 FINAL EXAM DECEMBER 2, 23 This is the final exam for ARE2. As announced earlier, this is an open-book exam. Try to allocate your 8 minutes in this exam wisely, and keep in mind that leaving any questions
More informationMath 164-1: Optimization Instructor: Alpár R. Mészáros
Math 164-1: Optimization Instructor: Alpár R. Mészáros First Midterm, April 20, 2016 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By writing
More informationSignature. Printed Name. Math 312 Hour Exam 1 Jerry L. Kazdan March 5, :00 1:20
Signature Printed Name Math 312 Hour Exam 1 Jerry L. Kazdan March 5, 1998 12:00 1:20 Directions: This exam has three parts. Part A has 4 True-False questions, Part B has 3 short answer questions, and Part
More informationECE580 Solution to Problem Set 6
ECE580 Fall 2015 Solution to Problem Set 6 December 23 2015 1 ECE580 Solution to Problem Set 6 These problems are from the textbook by Chong and Zak 4th edition which is the textbook for the ECE580 Fall
More informationExtreme Abridgment of Boyd and Vandenberghe s Convex Optimization
Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Compiled by David Rosenberg Abstract Boyd and Vandenberghe s Convex Optimization book is very well-written and a pleasure to read. The
More informationminimize x subject to (x 2)(x 4) u,
Math 6366/6367: Optimization and Variational Methods Sample Preliminary Exam Questions 1. Suppose that f : [, L] R is a C 2 -function with f () on (, L) and that you have explicit formulae for
More informationEconomics 205, Fall 2002: Final Examination, Possible Answers
Economics 05, Fall 00: Final Examination, Possible Answers Comments on the Exam Grades: 43 possible; high: 413; median: 34; low: 36 I was generally happy with the answers to questions 3-8, satisfied with
More informationFinal Exam - Math Camp August 27, 2014
Final Exam - Math Camp August 27, 2014 You will have three hours to complete this exam. Please write your solution to question one in blue book 1 and your solutions to the subsequent questions in blue
More informationIn view of (31), the second of these is equal to the identity I on E m, while this, in view of (30), implies that the first can be written
11.8 Inequality Constraints 341 Because by assumption x is a regular point and L x is positive definite on M, it follows that this matrix is nonsingular (see Exercise 11). Thus, by the Implicit Function
More informationQuiz Discussion. IE417: Nonlinear Programming: Lecture 12. Motivation. Why do we care? Jeff Linderoth. 16th March 2006
Quiz Discussion IE417: Nonlinear Programming: Lecture 12 Jeff Linderoth Department of Industrial and Systems Engineering Lehigh University 16th March 2006 Motivation Why do we care? We are interested in
More information2.3. VECTOR SPACES 25
2.3. VECTOR SPACES 25 2.3 Vector Spaces MATH 294 FALL 982 PRELIM # 3a 2.3. Let C[, ] denote the space of continuous functions defined on the interval [,] (i.e. f(x) is a member of C[, ] if f(x) is continuous
More informationExamination paper for TMA4180 Optimization I
Department of Mathematical Sciences Examination paper for TMA4180 Optimization I Academic contact during examination: Phone: Examination date: 26th May 2016 Examination time (from to): 09:00 13:00 Permitted
More informationE 600 Chapter 4: Optimization
E 600 Chapter 4: Optimization Simona Helmsmueller August 8, 2018 Goals of this lecture: Every theorem in these slides is important! You should understand, remember and be able to apply each and every one
More information5 Handling Constraints
5 Handling Constraints Engineering design optimization problems are very rarely unconstrained. Moreover, the constraints that appear in these problems are typically nonlinear. This motivates our interest
More informationMATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003
MATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003 1. True or False (28 points, 2 each) T or F If V is a vector space
More informationMATH 225 Summer 2005 Linear Algebra II Solutions to Assignment 1 Due: Wednesday July 13, 2005
MATH 225 Summer 25 Linear Algebra II Solutions to Assignment 1 Due: Wednesday July 13, 25 Department of Mathematical and Statistical Sciences University of Alberta Question 1. [p 224. #2] The set of all
More informationIE 5531 Midterm #2 Solutions
IE 5531 Midterm #2 s Prof. John Gunnar Carlsson November 9, 2011 Before you begin: This exam has 9 pages and a total of 5 problems. Make sure that all pages are present. To obtain credit for a problem,
More informationMidterm 1. Every element of the set of functions is continuous
Econ 200 Mathematics for Economists Midterm Question.- Consider the set of functions F C(0, ) dened by { } F = f C(0, ) f(x) = ax b, a A R and b B R That is, F is a subset of the set of continuous functions
More informationSeminars on Mathematics for Economics and Finance Topic 5: Optimization Kuhn-Tucker conditions for problems with inequality constraints 1
Seminars on Mathematics for Economics and Finance Topic 5: Optimization Kuhn-Tucker conditions for problems with inequality constraints 1 Session: 15 Aug 2015 (Mon), 10:00am 1:00pm I. Optimization with
More informationECON 4117/5111 Mathematical Economics Fall 2005
Test 1 September 30, 2005 Read Me: Please write your answers on the answer book provided. Use the rightside pages for formal answers and the left-side pages for your rough work. Do not forget to put your
More information2018 Fall 2210Q Section 013 Midterm Exam II Solution
08 Fall 0Q Section 0 Midterm Exam II Solution True or False questions points 0 0 points) ) Let A be an n n matrix. If the equation Ax b has at least one solution for each b R n, then the solution is unique
More informationOutline. Roadmap for the NPP segment: 1 Preliminaries: role of convexity. 2 Existence of a solution
Outline Roadmap for the NPP segment: 1 Preliminaries: role of convexity 2 Existence of a solution 3 Necessary conditions for a solution: inequality constraints 4 The constraint qualification 5 The Lagrangian
More informationMATHEMATICAL ECONOMICS: OPTIMIZATION. Contents
MATHEMATICAL ECONOMICS: OPTIMIZATION JOÃO LOPES DIAS Contents 1. Introduction 2 1.1. Preliminaries 2 1.2. Optimal points and values 2 1.3. The optimization problems 3 1.4. Existence of optimal points 4
More informationConstrained Optimization Theory
Constrained Optimization Theory Stephen J. Wright 1 2 Computer Sciences Department, University of Wisconsin-Madison. IMA, August 2016 Stephen Wright (UW-Madison) Constrained Optimization Theory IMA, August
More informationIn class midterm Exam - Answer key
Fall 2013 In class midterm Exam - Answer key ARE211 Problem 1 (20 points). Metrics: Let B be the set of all sequences x = (x 1,x 2,...). Define d(x,y) = sup{ x i y i : i = 1,2,...}. a) Prove that d is
More informationMath 115 Second Midterm March 25, 2010
Math 115 Second Midterm March 25, 2010 Name: EXAM SOLUTIONS Instructor: Section: 1. Do not open this exam until you are told to do so. 2. This exam has 9 pages including this cover. There are 8 problems.
More informationThe Fundamental Welfare Theorems
The Fundamental Welfare Theorems The so-called Fundamental Welfare Theorems of Economics tell us about the relation between market equilibrium and Pareto efficiency. The First Welfare Theorem: Every Walrasian
More informationBEEM103 UNIVERSITY OF EXETER. BUSINESS School. January 2009 Mock Exam, Part A. OPTIMIZATION TECHNIQUES FOR ECONOMISTS solutions
BEEM03 UNIVERSITY OF EXETER BUSINESS School January 009 Mock Exam, Part A OPTIMIZATION TECHNIQUES FOR ECONOMISTS solutions Duration : TWO HOURS The paper has 3 parts. Your marks on the rst part will be
More informationLAGRANGE MULTIPLIERS
LAGRANGE MULTIPLIERS MATH 195, SECTION 59 (VIPUL NAIK) Corresponding material in the book: Section 14.8 What students should definitely get: The Lagrange multiplier condition (one constraint, two constraints
More informationNonlinear Programming and the Kuhn-Tucker Conditions
Nonlinear Programming and the Kuhn-Tucker Conditions The Kuhn-Tucker (KT) conditions are first-order conditions for constrained optimization problems, a generalization of the first-order conditions we
More informationNATIONAL BOARD FOR HIGHER MATHEMATICS. M. A. and M.Sc. Scholarship Test. September 22, Time Allowed: 150 Minutes Maximum Marks: 30
NATIONAL BOARD FOR HIGHER MATHEMATICS M A and MSc Scholarship Test September 22, 2018 Time Allowed: 150 Minutes Maximum Marks: 30 Please read, carefully, the instructions that follow INSTRUCTIONS TO CANDIDATES
More informationLinear Algebra: Sample Questions for Exam 2
Linear Algebra: Sample Questions for Exam 2 Instructions: This is not a comprehensive review: there are concepts you need to know that are not included. Be sure you study all the sections of the book and
More informationWe are now going to move on to a discussion of Inequality constraints. Our canonical problem now looks as ( ) = 0 ( ) 0
4 Lecture 4 4.1 Constrained Optimization with Inequality Constraints We are now going to move on to a discussion of Inequality constraints. Our canonical problem now looks as Problem 11 (Constrained Optimization
More informationConstrained optimization.
ams/econ 11b supplementary notes ucsc Constrained optimization. c 2016, Yonatan Katznelson 1. Constraints In many of the optimization problems that arise in economics, there are restrictions on the values
More informationStructural and Multidisciplinary Optimization. P. Duysinx and P. Tossings
Structural and Multidisciplinary Optimization P. Duysinx and P. Tossings 2018-2019 CONTACTS Pierre Duysinx Institut de Mécanique et du Génie Civil (B52/3) Phone number: 04/366.91.94 Email: P.Duysinx@uliege.be
More informationMATH529 Fundamentals of Optimization Constrained Optimization I
MATH529 Fundamentals of Optimization Constrained Optimization I Marco A. Montes de Oca Mathematical Sciences, University of Delaware, USA 1 / 26 Motivating Example 2 / 26 Motivating Example min cost(b)
More informationMathematics For Economists
Mathematics For Economists Mark Dean Final 2010 Tuesday 7th December Question 1 (15 Points) Let be a continuously differentiable function on an interval in R. Show that is concave if and only if () ()
More informationEconomics 101. Lecture 2 - The Walrasian Model and Consumer Choice
Economics 101 Lecture 2 - The Walrasian Model and Consumer Choice 1 Uncle Léon The canonical model of exchange in economics is sometimes referred to as the Walrasian Model, after the early economist Léon
More informationFinite Dimensional Optimization Part III: Convex Optimization 1
John Nachbar Washington University March 21, 2017 Finite Dimensional Optimization Part III: Convex Optimization 1 1 Saddle points and KKT. These notes cover another important approach to optimization,
More informationECON 255 Introduction to Mathematical Economics
Page 1 of 5 FINAL EXAMINATION Winter 2017 Introduction to Mathematical Economics April 20, 2017 TIME ALLOWED: 3 HOURS NUMBER IN THE LIST: STUDENT NUMBER: NAME: SIGNATURE: INSTRUCTIONS 1. This examination
More informationPre-Calculus: Functions and Their Properties (Solving equations algebraically and graphically, matching graphs, tables, and equations, and
Pre-Calculus: 1.1 1.2 Functions and Their Properties (Solving equations algebraically and graphically, matching graphs, tables, and equations, and finding the domain, range, VA, HA, etc.). Name: Date:
More informationTwo hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. xx xxxx 2017 xx:xx xx.
Two hours To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER CONVEX OPTIMIZATION - SOLUTIONS xx xxxx 27 xx:xx xx.xx Answer THREE of the FOUR questions. If
More informationReplacing the a in the definition of the derivative of the function f at a with a variable x, gives the derivative function f (x).
Definition of The Derivative Function Definition (The Derivative Function) Replacing the a in the definition of the derivative of the function f at a with a variable x, gives the derivative function f
More informationThe general programming problem is the nonlinear programming problem where a given function is maximized subject to a set of inequality constraints.
1 Optimization Mathematical programming refers to the basic mathematical problem of finding a maximum to a function, f, subject to some constraints. 1 In other words, the objective is to find a point,
More informationFaculty of Engineering, Mathematics and Science School of Mathematics
Faculty of Engineering, Mathematics and Science School of Mathematics GROUPS Trinity Term 06 MA3: Advanced Calculus SAMPLE EXAM, Solutions DAY PLACE TIME Prof. Larry Rolen Instructions to Candidates: Attempt
More information0.1 Tangent Spaces and Lagrange Multipliers
01 TANGENT SPACES AND LAGRANGE MULTIPLIERS 1 01 Tangent Spaces and Lagrange Multipliers If a differentiable function G = (G 1,, G k ) : E n+k E k then the surface S defined by S = { x G( x) = v} is called
More informationOptimization. Escuela de Ingeniería Informática de Oviedo. (Dpto. de Matemáticas-UniOvi) Numerical Computation Optimization 1 / 30
Optimization Escuela de Ingeniería Informática de Oviedo (Dpto. de Matemáticas-UniOvi) Numerical Computation Optimization 1 / 30 Unconstrained optimization Outline 1 Unconstrained optimization 2 Constrained
More informationFinal Exam Advanced Mathematics for Economics and Finance
Final Exam Advanced Mathematics for Economics and Finance Dr. Stefanie Flotho Winter Term /5 March 5 General Remarks: ˆ There are four questions in total. ˆ All problems are equally weighed. ˆ This is
More informationOptimality Conditions
Chapter 2 Optimality Conditions 2.1 Global and Local Minima for Unconstrained Problems When a minimization problem does not have any constraints, the problem is to find the minimum of the objective function.
More informationConstrained Optimization
Constrained Optimization Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 13, 2013 1 General Problem Consider the following general constrained optimization problem:
More informationB553 Lecture 3: Multivariate Calculus and Linear Algebra Review
B553 Lecture 3: Multivariate Calculus and Linear Algebra Review Kris Hauser December 30, 2011 We now move from the univariate setting to the multivariate setting, where we will spend the rest of the class.
More informationMath Linear Algebra Final Exam Review Sheet
Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of
More informationNumerical Optimization
Constrained Optimization Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Constrained Optimization Constrained Optimization Problem: min h j (x) 0,
More informationChapter 7. Extremal Problems. 7.1 Extrema and Local Extrema
Chapter 7 Extremal Problems No matter in theoretical context or in applications many problems can be formulated as problems of finding the maximum or minimum of a function. Whenever this is the case, advanced
More informationPreliminary draft only: please check for final version
ARE211, Fall2012 CALCULUS4: THU, OCT 11, 2012 PRINTED: AUGUST 22, 2012 (LEC# 15) Contents 3. Univariate and Multivariate Differentiation (cont) 1 3.6. Taylor s Theorem (cont) 2 3.7. Applying Taylor theory:
More informationMAT137 Calculus! Lecture 48
official website http://uoft.me/mat137 MAT137 Calculus! Lecture 48 Today: Taylor Series Applications Next: Final Exams Important Taylor Series and their Radii of Convergence 1 1 x = e x = n=0 n=0 x n n!
More informationMath 164 (Lec 1): Optimization Instructor: Alpár R. Mészáros
Math 164 (Lec 1): Optimization Instructor: Alpár R. Mészáros Midterm, October 6, 016 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By writing
More informationMath 212-Lecture Interior critical points of functions of two variables
Math 212-Lecture 24 13.10. Interior critical points of functions of two variables Previously, we have concluded that if f has derivatives, all interior local min or local max should be critical points.
More informationOptimization Theory. Lectures 4-6
Optimization Theory Lectures 4-6 Unconstrained Maximization Problem: Maximize a function f:ú n 6 ú within a set A f ú n. Typically, A is ú n, or the non-negative orthant {x0ú n x$0} Existence of a maximum:
More informationExam in TMA4180 Optimization Theory
Norwegian University of Science and Technology Department of Mathematical Sciences Page 1 of 11 Contact during exam: Anne Kværnø: 966384 Exam in TMA418 Optimization Theory Wednesday May 9, 13 Tid: 9. 13.
More informationHOMEWORK 7 SOLUTIONS
HOMEWORK 7 SOLUTIONS MA11: ADVANCED CALCULUS, HILARY 17 (1) Using the method of Lagrange multipliers, find the largest and smallest values of the function f(x, y) xy on the ellipse x + y 1. Solution: The
More informationSeptember Math Course: First Order Derivative
September Math Course: First Order Derivative Arina Nikandrova Functions Function y = f (x), where x is either be a scalar or a vector of several variables (x,..., x n ), can be thought of as a rule which
More informationProblem Set #06- Answer key First CompStat Problem Set
Fall 2015 Problem Set #06- Answer key First CompStat Problem Set ARE211 (1) Inproblem 3 on your last problem set, you foundthemaximum and minimumdistance from the origin to the ellipse x 2 1 +x 1x 2 +x
More information8. Constrained Optimization
8. Constrained Optimization Daisuke Oyama Mathematics II May 11, 2018 Unconstrained Maximization Problem Let X R N be a nonempty set. Definition 8.1 For a function f : X R, x X is a (strict) local maximizer
More informationLecture 4: Optimization. Maximizing a function of a single variable
Lecture 4: Optimization Maximizing or Minimizing a Function of a Single Variable Maximizing or Minimizing a Function of Many Variables Constrained Optimization Maximizing a function of a single variable
More informationThe Derivative Function. Differentiation
The Derivative Function If we replace a in the in the definition of the derivative the function f at the point x = a with a variable x, we get the derivative function f (x). Using Formula 2 gives f (x)
More informationNotions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy
Banach Spaces These notes provide an introduction to Banach spaces, which are complete normed vector spaces. For the purposes of these notes, all vector spaces are assumed to be over the real numbers.
More informationImplicit Functions, Curves and Surfaces
Chapter 11 Implicit Functions, Curves and Surfaces 11.1 Implicit Function Theorem Motivation. In many problems, objects or quantities of interest can only be described indirectly or implicitly. It is then
More informationLagrange Multipliers
Lagrange Multipliers 3-15-2018 The method of Lagrange multipliers deals with the problem of finding the maxima and minima of a function subject to a side condition, or constraint. Example. Find graphically
More informationMATH 104 : Final Exam
MATH 104 : Final Exam 10 May, 2017 Name: You have 3 hours to answer the questions. You are allowed one page (front and back) worth of notes. The page should not be larger than a standard US letter size.
More informationLecture 9: Implicit function theorem, constrained extrema and Lagrange multipliers
Lecture 9: Implicit function theorem, constrained extrema and Lagrange multipliers Rafikul Alam Department of Mathematics IIT Guwahati What does the Implicit function theorem say? Let F : R 2 R be C 1.
More informationSECTION C: CONTINUOUS OPTIMISATION LECTURE 9: FIRST ORDER OPTIMALITY CONDITIONS FOR CONSTRAINED NONLINEAR PROGRAMMING
Nf SECTION C: CONTINUOUS OPTIMISATION LECTURE 9: FIRST ORDER OPTIMALITY CONDITIONS FOR CONSTRAINED NONLINEAR PROGRAMMING f(x R m g HONOUR SCHOOL OF MATHEMATICS, OXFORD UNIVERSITY HILARY TERM 5, DR RAPHAEL
More informationCHAPTER 1-2: SHADOW PRICES
Essential Microeconomics -- CHAPTER -: SHADOW PRICES An intuitive approach: profit maimizing firm with a fied supply of an input Shadow prices 5 Concave maimization problem 7 Constraint qualifications
More informationEconomics 101A (Lecture 3) Stefano DellaVigna
Economics 101A (Lecture 3) Stefano DellaVigna January 24, 2017 Outline 1. Implicit Function Theorem 2. Envelope Theorem 3. Convexity and concavity 4. Constrained Maximization 1 Implicit function theorem
More informationFINANCIAL OPTIMIZATION
FINANCIAL OPTIMIZATION Lecture 1: General Principles and Analytic Optimization Philip H. Dybvig Washington University Saint Louis, Missouri Copyright c Philip H. Dybvig 2008 Choose x R N to minimize f(x)
More informationLecture 1: Introduction. Outline. B9824 Foundations of Optimization. Fall Administrative matters. 2. Introduction. 3. Existence of optima
B9824 Foundations of Optimization Lecture 1: Introduction Fall 2009 Copyright 2009 Ciamac Moallemi Outline 1. Administrative matters 2. Introduction 3. Existence of optima 4. Local theory of unconstrained
More informationOptimization Problems with Constraints - introduction to theory, numerical Methods and applications
Optimization Problems with Constraints - introduction to theory, numerical Methods and applications Dr. Abebe Geletu Ilmenau University of Technology Department of Simulation and Optimal Processes (SOP)
More information10-725/ Optimization Midterm Exam
10-725/36-725 Optimization Midterm Exam November 6, 2012 NAME: ANDREW ID: Instructions: This exam is 1hr 20mins long Except for a single two-sided sheet of notes, no other material or discussion is permitted
More informationMath 5311 Constrained Optimization Notes
ath 5311 Constrained Optimization otes February 5, 2009 1 Equality-constrained optimization Real-world optimization problems frequently have constraints on their variables. Constraints may be equality
More informationNonlinear Programming (NLP)
Natalia Lazzati Mathematics for Economics (Part I) Note 6: Nonlinear Programming - Unconstrained Optimization Note 6 is based on de la Fuente (2000, Ch. 7), Madden (1986, Ch. 3 and 5) and Simon and Blume
More informationMATH2070 Optimisation
MATH2070 Optimisation Nonlinear optimisation with constraints Semester 2, 2012 Lecturer: I.W. Guo Lecture slides courtesy of J.R. Wishart Review The full nonlinear optimisation problem with equality constraints
More informationLecture 1: Introduction. Outline. B9824 Foundations of Optimization. Fall Administrative matters. 2. Introduction. 3. Existence of optima
B9824 Foundations of Optimization Lecture 1: Introduction Fall 2010 Copyright 2010 Ciamac Moallemi Outline 1. Administrative matters 2. Introduction 3. Existence of optima 4. Local theory of unconstrained
More informationReview of Optimization Methods
Review of Optimization Methods Prof. Manuela Pedio 20550 Quantitative Methods for Finance August 2018 Outline of the Course Lectures 1 and 2 (3 hours, in class): Linear and non-linear functions on Limits,
More informationMath 115 Practice for Exam 2
Math 115 Practice for Exam Generated October 30, 017 Name: SOLUTIONS Instructor: Section Number: 1. This exam has 5 questions. Note that the problems are not of equal difficulty, so you may want to skip
More informationMathematical Economics. Lecture Notes (in extracts)
Prof. Dr. Frank Werner Faculty of Mathematics Institute of Mathematical Optimization (IMO) http://math.uni-magdeburg.de/ werner/math-ec-new.html Mathematical Economics Lecture Notes (in extracts) Winter
More informationMAS3706 Topology. Revision Lectures, May I do not answer enquiries as to what material will be in the exam.
MAS3706 Topology Revision Lectures, May 208 Z.A.Lykova It is essential that you read and try to understand the lecture notes from the beginning to the end. Many questions from the exam paper will be similar
More informationFinal Suggested Solutions 1
Econ 2010 Mathematics for Economists 1 Final 2011 - Suggested Solutions 1 Question 1 See question 2 Homework 4 Question 2.- Dene the binary operations + 1 and + 2 on R 2 by x + 1 y = (x 1 + y 1, x 2 +
More informationMath Camp Notes: Everything Else
Math Camp Notes: Everything Else Systems of Dierential Equations Consider the general two-equation system of dierential equations: Steady States ẋ = f(x, y ẏ = g(x, y Just as before, we can nd the steady
More informationMATH Midterm 1 Sample 4
1. (15 marks) (a) (4 marks) Given the function: f(x, y) = arcsin x 2 + y, find its first order partial derivatives at the point (0, 3). Simplify your answers. Solution: Compute the first order partial
More informationAY Term 1 Examination November 2013 ECON205 INTERMEDIATE MATHEMATICS FOR ECONOMICS
AY203-4 Term Examination November 203 ECON205 INTERMEDIATE MATHEMATICS FOR ECONOMICS INSTRUCTIONS TO CANDIDATES The time allowed for this examination paper is TWO hours 2 This examination paper contains
More information