Lesson 11. Lagrange's Multiplier Rule / Constrained Optimization

Size: px
Start display at page:

Download "Lesson 11. Lagrange's Multiplier Rule / Constrained Optimization"

Transcription

1 Module 1: Differential Calculus Lesson 11 Lagrange's Multiplier Rule / Constrained Optimization 11.1 Introduction We presents an introduction to optimization problems that involve finding a maximum or a minimum value of an objective function subject to a constraint of the form. Maximum and Minimum. Finding optimum values of the function without a constraint is a well known problem in calculus. One would normally use the gradient to find critical points (gradient ( ) vanishes). Then check all stationary and boundary points to find optimum values. Example 1. has a critical/ stationary point at (0,0).

2 The Hessian: A common method of determining whether or not a function has an extreme value at a stationary point is to evaluate the hessian of the function of variables at that point. where the hessian is defined as A square matrix of order n n is said to be positive definite if its leading principal minors are all positive. For =2, we have Second Derivative Test: The Second derivative test determines the optimality of stationary point according to the following rules: Let f f f f f = A, = B, = C, and = = x xy y x y at the point ( xy,, ) then

3 1. If A > 0 and ( xy, ), then f has a local minimum at ( xy, ). 2. If A < 0 and ( xy, ), then f has a local maximum at ( xy, ). 3. If saddle point of f. 4. If required. In the above Example 1, AC AC AC AC 2 B < 0 at (, ) 2 B > 0 at the point 2 B > 0 at the point xy, then ( xy, ) is a 2 B = 0, further investigation is Therefore has a minimum at (0,0) as and determinant of the matrix is Constrained Maximum and Minimum When finding the extreme values of subject to a constraint, the stationary points found above will not work. This new problem can be thought of as finding extreme values of when the point is restricted to lie on the

4 surface. The value of is maximized (minimized) when the surfaces touch each other,i.e, they have a common tangent for line. This means that the surfaces, gradient vectors at that point are parallel, hence, The number in the equation is known as the Lagrange multiplier Lagrange multiplier method The Lagrange multiplier methods solves the constrained optimization problem by transforming it into a non-constrained optimization problem of the form: )) or. Then finding the gradient and Hessian as was done above will determine any optimum values of. Suppose we want to find optimum values for the following: Example 11.2: subject to. Then the Lagrangian method will result in a non-constrained function.

5 . The gradient for this new function is Solving, we obtain, and. The Hessian matrix at the stationary point Since the solution, minimizes subject to with Example 11.3: Find the rectangle of parameter l which has maximum area i.e., Maximize subject to

6 Solution: i.e., i.e.,., so that the rectangule of maximum area is a square. Example 11.4 Find the shortest distance from the point (1,0) to the parabola, i.e., Minimize subject to.

7 Now If then, from Hence Hence i.e., Hence the only solution is and the required distance is unity. Questions: Answer the following question 1. Determine the maximum value of the -th root of a product of numbers provided that their sum is equal to a given number. Thus the problem is stated as follows: it is required to find the maximum of the function subject to,, for all.

8 References W. Thomas, Finny (1998). Calculus and Analytic Geometry, 6 th Edition, Publishers, Narsa, India. Jain, R. K. and Iyengar, SRK. (2010). Advanced Engineering Mathematics, 3 rd Edition Publishers, Narsa, India. Widder, D.V. (2002). Advance Calculus 2 nd Edition, Publishers, PHI, India. Piskunov, N. (1996). Differential and Integral Calculus Vol I, & II, Publishers, CBS, India. Suggested Readings Tom M. Apostol (2003). Calculus, Volume II Second Editions, Publishers,John Willey & Sons, Singapore.

Lesson 10. Maximum and Minimum of function of two variables

Lesson 10. Maximum and Minimum of function of two variables Module 1: Differential Calculus Lesson 10 Maximum and Minimum of function of two variables 10.1 Introduction We say that a function has a maximum (local) at a point if for all points sufficiently close

More information

Lesson 5. Partial and Total Derivatives

Lesson 5. Partial and Total Derivatives Module 1: Differential Calculus Lesson 5 Partial and Total Derivatives 5.1 Introduction Let, we denote as the partial derivative of with respect to and define as and similarly Example 5.1: Given, find

More information

Lesson 1. Rolle s Theorem, Lagrange s Mean Value Theorem, Cauchy s Mean Value Theorem

Lesson 1. Rolle s Theorem, Lagrange s Mean Value Theorem, Cauchy s Mean Value Theorem Module 1: Differential Calculus Lesson 1 Rolle s Theorem, Lagrange s Mean Value Theorem, Cauchy s Mean Value Theorem 1.1 Introduction In this lesson first we will state the Rolle s theorems, mean value

More information

School of Business. Blank Page

School of Business. Blank Page Maxima and Minima 9 This unit is designed to introduce the learners to the basic concepts associated with Optimization. The readers will learn about different types of functions that are closely related

More information

Sufficient Conditions for Finite-variable Constrained Minimization

Sufficient 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 information

Generalization to inequality constrained problem. Maximize

Generalization 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 information

Math Maximum and Minimum Values, I

Math Maximum and Minimum Values, I Math 213 - Maximum and Minimum Values, I Peter A. Perry University of Kentucky October 8, 218 Homework Re-read section 14.7, pp. 959 965; read carefully pp. 965 967 Begin homework on section 14.7, problems

More information

Math 10C - Fall Final Exam

Math 10C - Fall Final Exam Math 1C - Fall 217 - Final Exam Problem 1. Consider the function f(x, y) = 1 x 2 (y 1) 2. (i) Draw the level curve through the point P (1, 2). Find the gradient of f at the point P and draw the gradient

More information

In 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

In 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 information

Review of Optimization Methods

Review 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 information

September Math Course: First Order Derivative

September 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 information

Math 2204 Multivariable Calculus Chapter 14: Partial Derivatives Sec. 14.7: Maximum and Minimum Values

Math 2204 Multivariable Calculus Chapter 14: Partial Derivatives Sec. 14.7: Maximum and Minimum Values Math 2204 Multivariable Calculus Chapter 14: Partial Derivatives Sec. 14.7: Maximum and Minimum Values I. Review from 1225 A. Definitions 1. Local Extreme Values (Relative) a. A function f has a local

More information

Computation. For QDA we need to calculate: Lets first consider the case that

Computation. For QDA we need to calculate: Lets first consider the case that Computation For QDA we need to calculate: δ (x) = 1 2 log( Σ ) 1 2 (x µ ) Σ 1 (x µ ) + log(π ) Lets first consider the case that Σ = I,. This is the case where each distribution is spherical, around the

More information

Optimization Methods: Optimization using Calculus - Equality constraints 1. Module 2 Lecture Notes 4

Optimization Methods: Optimization using Calculus - Equality constraints 1. Module 2 Lecture Notes 4 Optimization Methods: Optimization using Calculus - Equality constraints Module Lecture Notes 4 Optimization of Functions of Multiple Variables subect to Equality Constraints Introduction In the previous

More information

Modern Optimization Theory: Concave Programming

Modern Optimization Theory: Concave Programming Modern Optimization Theory: Concave Programming 1. Preliminaries 1 We will present below the elements of modern optimization theory as formulated by Kuhn and Tucker, and a number of authors who have followed

More information

Tutorial Letter 204/1/2016 DSC2606. Semester 2. Nonlinear mathematical programming. Department of Decision Sciences. Solutions: Assignment 04

Tutorial Letter 204/1/2016 DSC2606. Semester 2. Nonlinear mathematical programming. Department of Decision Sciences. Solutions: Assignment 04 DSC2606/204//206 Tutorial Letter 204//206 Nonlinear mathematical programming DSC2606 Semester 2 Department of Decision Sciences Solutions: Assignment 04 This tutorial letter contains solutions to the questions

More information

Paul Schrimpf. October 17, UBC Economics 526. Constrained optimization. Paul Schrimpf. First order conditions. Second order conditions

Paul Schrimpf. October 17, UBC Economics 526. Constrained optimization. Paul Schrimpf. First order conditions. Second order conditions UBC Economics 526 October 17, 2012 .1.2.3.4 Section 1 . max f (x) s.t. h(x) = c f : R n R, h : R n R m Draw picture of n = 2 and m = 1 At optimum, constraint tangent to level curve of function Rewrite

More information

Lagrange Multipliers

Lagrange Multipliers Lagrange Multipliers (Com S 477/577 Notes) Yan-Bin Jia Nov 9, 2017 1 Introduction We turn now to the study of minimization with constraints. More specifically, we will tackle the following problem: minimize

More information

3. Minimization with constraints Problem III. Minimize f(x) in R n given that x satisfies the equality constraints. g j (x) = c j, j = 1,...

3. Minimization with constraints Problem III. Minimize f(x) in R n given that x satisfies the equality constraints. g j (x) = c j, j = 1,... 3. Minimization with constraints Problem III. Minimize f(x) in R n given that x satisfies the equality constraints g j (x) = c j, j = 1,..., m < n, where c 1,..., c m are given numbers. Theorem 3.1. Let

More information

x +3y 2t = 1 2x +y +z +t = 2 3x y +z t = 7 2x +6y +z +t = a

x +3y 2t = 1 2x +y +z +t = 2 3x y +z t = 7 2x +6y +z +t = a UCM Final Exam, 05/8/014 Solutions 1 Given the parameter a R, consider the following linear system x +y t = 1 x +y +z +t = x y +z t = 7 x +6y +z +t = a (a (6 points Discuss the system depending on the

More information

Introduction to Optimization Techniques. Nonlinear Optimization in Function Spaces

Introduction to Optimization Techniques. Nonlinear Optimization in Function Spaces Introduction to Optimization Techniques Nonlinear Optimization in Function Spaces X : T : Gateaux and Fréchet Differentials Gateaux and Fréchet Differentials a vector space, Y : a normed space transformation

More information

Optimality conditions for Equality Constrained Optimization Problems

Optimality conditions for Equality Constrained Optimization Problems International Journal of Mathematics and Statistics Invention (IJMSI) E-ISSN: 2321 4767 P-ISSN: 2321-4759 Volume 4 Issue 4 April. 2016 PP-28-33 Optimality conditions for Equality Constrained Optimization

More information

Introduction to Machine Learning Prof. Sudeshna Sarkar Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Introduction to Machine Learning Prof. Sudeshna Sarkar Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Introduction to Machine Learning Prof. Sudeshna Sarkar Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module - 5 Lecture - 22 SVM: The Dual Formulation Good morning.

More information

Solutions to Homework 7

Solutions to Homework 7 Solutions to Homework 7 Exercise #3 in section 5.2: A rectangular box is inscribed in a hemisphere of radius r. Find the dimensions of the box of maximum volume. Solution: The base of the rectangular box

More information

Appendix A Taylor Approximations and Definite Matrices

Appendix A Taylor Approximations and Definite Matrices Appendix A Taylor Approximations and Definite Matrices Taylor approximations provide an easy way to approximate a function as a polynomial, using the derivatives of the function. We know, from elementary

More information

Department: Course Description: Course Competencies: MAT 201 Calculus III Prerequisite: MAT Credit Hours (Lecture) Mathematics

Department: Course Description: Course Competencies: MAT 201 Calculus III Prerequisite: MAT Credit Hours (Lecture) Mathematics Department: Mathematics Course Description: Calculus III is the final course in the three-semester sequence of calculus courses. This course is designed to prepare students to be successful in Differential

More information

Optimization: Problem Set Solutions

Optimization: Problem Set Solutions Optimization: Problem Set Solutions Annalisa Molino University of Rome Tor Vergata annalisa.molino@uniroma2.it Fall 20 Compute the maxima minima or saddle points of the following functions a. f(x y) =

More information

OR MSc Maths Revision Course

OR MSc Maths Revision Course OR MSc Maths Revision Course Tom Byrne School of Mathematics University of Edinburgh t.m.byrne@sms.ed.ac.uk 15 September 2017 General Information Today JCMB Lecture Theatre A, 09:30-12:30 Mathematics revision

More information

Lecture 4: Optimization. Maximizing a function of a single variable

Lecture 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 information

Optimality Conditions

Optimality 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 information

g(x,y) = c. For instance (see Figure 1 on the right), consider the optimization problem maximize subject to

g(x,y) = c. For instance (see Figure 1 on the right), consider the optimization problem maximize subject to 1 of 11 11/29/2010 10:39 AM From Wikipedia, the free encyclopedia In mathematical optimization, the method of Lagrange multipliers (named after Joseph Louis Lagrange) provides a strategy for finding the

More information

BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, Pilani Pilani Campus

BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, Pilani Pilani Campus FIRST SEMESTER 2017-2018 Course Handout (Part II) Date: 02/08/2017 In addition to part-i (General Handout for all courses appended to the timetable) this portion gives further specific details regarding

More information

Review of Optimization Basics

Review of Optimization Basics Review of Optimization Basics. Introduction Electricity markets throughout the US are said to have a two-settlement structure. The reason for this is that the structure includes two different markets:

More information

ECON 186 Class Notes: Optimization Part 2

ECON 186 Class Notes: Optimization Part 2 ECON 186 Class Notes: Optimization Part 2 Jijian Fan Jijian Fan ECON 186 1 / 26 Hessians The Hessian matrix is a matrix of all partial derivatives of a function. Given the function f (x 1,x 2,...,x n ),

More information

Mathematical Analysis II, 2018/19 First semester

Mathematical Analysis II, 2018/19 First semester Mathematical Analysis II, 208/9 First semester Yoh Tanimoto Dipartimento di Matematica, Università di Roma Tor Vergata Via della Ricerca Scientifica, I-0033 Roma, Italy email: hoyt@mat.uniroma2.it We basically

More information

Math 5311 Constrained Optimization Notes

Math 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 information

II. An Application of Derivatives: Optimization

II. An Application of Derivatives: Optimization Anne Sibert Autumn 2013 II. An Application of Derivatives: Optimization In this section we consider an important application of derivatives: finding the minimum and maximum points. This has important applications

More information

1. For each function, find all of its critical points and then classify each point as a local extremum or saddle point.

1. For each function, find all of its critical points and then classify each point as a local extremum or saddle point. Solutions Review for Exam # Math 6. For each function, find all of its critical points and then classify each point as a local extremum or saddle point. a fx, y x + 6xy + y Solution.The gradient of f is

More information

MA1032-Numerical Analysis-Analysis Part-14S2- 1 of 8

MA1032-Numerical Analysis-Analysis Part-14S2-  1 of 8 MA1032-Numerical Analysis-Analysis Part-14S2-www.math.mrt.ac.lk/UCJ-20151221-Page 1 of 8 RIEMANN INTEGRAL Example: Use equal partitions of [0,1] to estimate the area under the curve = using 1. left corner

More information

Constrained optimization BUSINESS MATHEMATICS

Constrained optimization BUSINESS MATHEMATICS Constrained optimization BUSINESS MATHEMATICS 1 CONTENTS Unconstrained optimization Constrained optimization Lagrange method Old exam question Further study 2 UNCONSTRAINED OPTIMIZATION Recall extreme

More information

Link lecture - Lagrange Multipliers

Link lecture - Lagrange Multipliers Link lecture - Lagrange Multipliers Lagrange multipliers provide a method for finding a stationary point of a function, say f(x, y) when the variables are subject to constraints, say of the form g(x, y)

More information

MATH H53 : Final exam

MATH H53 : Final exam MATH H53 : Final exam 11 May, 18 Name: You have 18 minutes to answer the questions. Use of calculators or any electronic items is not permitted. Answer the questions in the space provided. If you run out

More information

STUDY MATERIALS. (The content of the study material is the same as that of Chapter I of Mathematics for Economic Analysis II of 2011 Admn.

STUDY MATERIALS. (The content of the study material is the same as that of Chapter I of Mathematics for Economic Analysis II of 2011 Admn. STUDY MATERIALS MATHEMATICAL TOOLS FOR ECONOMICS III (The content of the study material is the same as that of Chapter I of Mathematics for Economic Analysis II of 2011 Admn.) & MATHEMATICAL TOOLS FOR

More information

Lecture 18: Optimization Programming

Lecture 18: Optimization Programming Fall, 2016 Outline Unconstrained Optimization 1 Unconstrained Optimization 2 Equality-constrained Optimization Inequality-constrained Optimization Mixture-constrained Optimization 3 Quadratic Programming

More information

Performance Surfaces and Optimum Points

Performance Surfaces and Optimum Points CSC 302 1.5 Neural Networks Performance Surfaces and Optimum Points 1 Entrance Performance learning is another important class of learning law. Network parameters are adjusted to optimize the performance

More information

Tribhuvan University Institute of Science and Technology 2065

Tribhuvan University Institute of Science and Technology 2065 1CSc. MTH 104-2065 Tribhuvan University Institute of Science and Technology 2065 Bachelor Level/First Year/ First Semester/ Science Full Marks: 80 Computer Science and Information Technology (MTH. 104)

More information

Tangent spaces, normals and extrema

Tangent spaces, normals and extrema Chapter 3 Tangent spaces, normals and extrema If S is a surface in 3-space, with a point a S where S looks smooth, i.e., without any fold or cusp or self-crossing, we can intuitively define the tangent

More information

39.1 Absolute maxima/minima

39.1 Absolute maxima/minima Module 13 : Maxima, Minima Saddle Points, Constrained maxima minima Lecture 39 : Absolute maxima / minima [Section 39.1] Objectives In this section you will learn the following : The notion of absolute

More information

Review: critical point or equivalently f a,

Review: critical point or equivalently f a, Review: a b f f a b f a b critical point or equivalentl f a, b A point, is called a of if,, 0 A local ma or local min must be a critical point (but not conversel) 0 D iscriminant (or Hessian) f f D f f

More information

MATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018

MATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018 MATH 57: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 18 1 Global and Local Optima Let a function f : S R be defined on a set S R n Definition 1 (minimizers and maximizers) (i) x S

More information

Unit #24 - Lagrange Multipliers Section 15.3

Unit #24 - Lagrange Multipliers Section 15.3 Unit #24 - Lagrange Multipliers Section 1.3 Some material from Calculus, Single and MultiVariable by Hughes-Hallett, Gleason, McCallum et. al. Copyright 200 by John Wiley & Sons, Inc. This material is

More information

Lecture 4 September 15

Lecture 4 September 15 IFT 6269: Probabilistic Graphical Models Fall 2017 Lecture 4 September 15 Lecturer: Simon Lacoste-Julien Scribe: Philippe Brouillard & Tristan Deleu 4.1 Maximum Likelihood principle Given a parametric

More information

Intro to Nonlinear Optimization

Intro to Nonlinear Optimization Intro to Nonlinear Optimization We now rela the proportionality and additivity assumptions of LP What are the challenges of nonlinear programs NLP s? Objectives and constraints can use any function: ma

More information

Optimization. Sherif Khalifa. Sherif Khalifa () Optimization 1 / 50

Optimization. Sherif Khalifa. Sherif Khalifa () Optimization 1 / 50 Sherif Khalifa Sherif Khalifa () Optimization 1 / 50 Y f(x 0 ) Y=f(X) X 0 X Sherif Khalifa () Optimization 2 / 50 Y Y=f(X) f(x 0 ) X 0 X Sherif Khalifa () Optimization 3 / 50 A necessary condition for

More information

Numerical optimization

Numerical optimization Numerical optimization Lecture 4 Alexander & Michael Bronstein tosca.cs.technion.ac.il/book Numerical geometry of non-rigid shapes Stanford University, Winter 2009 2 Longest Slowest Shortest Minimal Maximal

More information

A2 HW Imaginary Numbers

A2 HW Imaginary Numbers Name: A2 HW Imaginary Numbers Rewrite the following in terms of i and in simplest form: 1) 100 2) 289 3) 15 4) 4 81 5) 5 12 6) -8 72 Rewrite the following as a radical: 7) 12i 8) 20i Solve for x in simplest

More information

Deep Learning. Authors: I. Goodfellow, Y. Bengio, A. Courville. Chapter 4: Numerical Computation. Lecture slides edited by C. Yim. C.

Deep Learning. Authors: I. Goodfellow, Y. Bengio, A. Courville. Chapter 4: Numerical Computation. Lecture slides edited by C. Yim. C. Chapter 4: Numerical Computation Deep Learning Authors: I. Goodfellow, Y. Bengio, A. Courville Lecture slides edited by 1 Chapter 4: Numerical Computation 4.1 Overflow and Underflow 4.2 Poor Conditioning

More information

Lecture 11: Differential Geometry

Lecture 11: Differential Geometry Lecture 11: Differential Geometry c Bryan S. Morse, Brigham Young University, 1998 2000 Last modified on February 28, 2000 at 8:45 PM Contents 11.1 Introduction..............................................

More information

Optimization 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 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 information

Numerical optimization. Numerical optimization. Longest Shortest where Maximal Minimal. Fastest. Largest. Optimization problems

Numerical optimization. Numerical optimization. Longest Shortest where Maximal Minimal. Fastest. Largest. Optimization problems 1 Numerical optimization Alexander & Michael Bronstein, 2006-2009 Michael Bronstein, 2010 tosca.cs.technion.ac.il/book Numerical optimization 048921 Advanced topics in vision Processing and Analysis of

More information

ENGI Partial Differentiation Page y f x

ENGI Partial Differentiation Page y f x ENGI 3424 4 Partial Differentiation Page 4-01 4. Partial Differentiation For functions of one variable, be found unambiguously by differentiation: y f x, the rate of change of the dependent variable can

More information

AM 205: lecture 18. Last time: optimization methods Today: conditions for optimality

AM 205: lecture 18. Last time: optimization methods Today: conditions for optimality AM 205: lecture 18 Last time: optimization methods Today: conditions for optimality Existence of Global Minimum For example: f (x, y) = x 2 + y 2 is coercive on R 2 (global min. at (0, 0)) f (x) = x 3

More information

EC /11. Math for Microeconomics September Course, Part II Problem Set 1 with Solutions. a11 a 12. x 2

EC /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 information

BEEM103 UNIVERSITY OF EXETER. BUSINESS School. January 2009 Mock Exam, Part A. OPTIMIZATION TECHNIQUES FOR ECONOMISTS solutions

BEEM103 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 information

Robotics. Islam S. M. Khalil. November 15, German University in Cairo

Robotics. Islam S. M. Khalil. November 15, German University in Cairo Robotics German University in Cairo November 15, 2016 Fundamental concepts In optimal control problems the objective is to determine a function that minimizes a specified functional, i.e., the performance

More information

( ) ( ) ( ) ( ) Given that and its derivative are continuous when, find th values of and. ( ) ( )

( ) ( ) ( ) ( ) Given that and its derivative are continuous when, find th values of and. ( ) ( ) 1. The piecewise function is defined by where and are constants. Given that and its derivative are continuous when, find th values of and. When When of of Substitute into ; 2. Using the substitution, evaluate

More information

f(x, y) = 1 2 x y2 xy 3

f(x, y) = 1 2 x y2 xy 3 Problem. Find the critical points of the function and determine their nature. We have We find the critical points We calculate f(x, y) = 2 x2 + 3 2 y2 xy 3 f x = x y 3 = 0 = x = y 3 f y = 3y 3xy 2 = 0

More information

Chapter 7. Extremal Problems. 7.1 Extrema and Local Extrema

Chapter 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 information

Gradient Descent. Dr. Xiaowei Huang

Gradient Descent. Dr. Xiaowei Huang Gradient Descent Dr. Xiaowei Huang https://cgi.csc.liv.ac.uk/~xiaowei/ Up to now, Three machine learning algorithms: decision tree learning k-nn linear regression only optimization objectives are discussed,

More information

Optimization. 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 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 information

446 CHAP. 8 NUMERICAL OPTIMIZATION. Newton's Search for a Minimum of f(x,y) Newton s Method

446 CHAP. 8 NUMERICAL OPTIMIZATION. Newton's Search for a Minimum of f(x,y) Newton s Method 446 CHAP. 8 NUMERICAL OPTIMIZATION Newton's Search for a Minimum of f(xy) Newton s Method The quadratic approximation method of Section 8.1 generated a sequence of seconddegree Lagrange polynomials. It

More information

Constrained optimization: direct methods (cont.)

Constrained optimization: direct methods (cont.) Constrained optimization: direct methods (cont.) Jussi Hakanen Post-doctoral researcher jussi.hakanen@jyu.fi Direct methods Also known as methods of feasible directions Idea in a point x h, generate a

More information

Chapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27

Chapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 Chapter 11 Taylor Series Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 First-Order Approximation We want to approximate function f by some simple function. Best possible approximation

More information

Christmas Calculated Colouring - C1

Christmas Calculated Colouring - C1 Christmas Calculated Colouring - C Tom Bennison December 20, 205 Introduction Each question identifies a region or regions on the picture Work out the answer and use the key to work out which colour to

More information

Method of Lagrange Multipliers

Method of Lagrange Multipliers Method of Lagrange Multipliers A. Salih Department of Aerospace Engineering Indian Institute of Space Science and Technology, Thiruvananthapuram September 2013 Lagrange multiplier method is a technique

More information

12.1 Taylor Polynomials In Two-Dimensions: Nonlinear Approximations of F(x,y) Polynomials in Two-Variables. Taylor Polynomials and Approximations.

12.1 Taylor Polynomials In Two-Dimensions: Nonlinear Approximations of F(x,y) Polynomials in Two-Variables. Taylor Polynomials and Approximations. Week 12 Lecture Overheads Math2080 Week 12 Page 1 12.1 Taylor Polynomials In Two-Dimensions: Nonlinear Approximations of F(x,y) Polynomials in Two-Variables. Taylor Polynomials and Approximations. 12.2

More information

MATH2070 Optimisation

MATH2070 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 information

Constrained optimization

Constrained optimization Constrained optimization In general, the formulation of constrained optimization is as follows minj(w), subject to H i (w) = 0, i = 1,..., k. where J is the cost function and H i are the constraints. Lagrange

More information

Nonlinear Optimization: What s important?

Nonlinear Optimization: What s important? Nonlinear Optimization: What s important? Julian Hall 10th May 2012 Convexity: convex problems A local minimizer is a global minimizer A solution of f (x) = 0 (stationary point) is a minimizer A global

More information

MATH529 Fundamentals of Optimization Constrained Optimization I

MATH529 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 information

Semester 3 MULTIVARIATE CALCULUS AND INTEGRAL TRANSFORMS

Semester 3 MULTIVARIATE CALCULUS AND INTEGRAL TRANSFORMS PC 11 Semester 3 MT03C11 MULTIVARIATE CALCULUS AND INTEGRAL TRANSFORMS Text 1: Tom APOSTOL, Mathematical Analysis, Second edition, Narosa Publishing House. Text 2: WALTER RUDIN, Principles of Mathematical

More information

Mathematical Economics: Lecture 16

Mathematical Economics: Lecture 16 Mathematical Economics: Lecture 16 Yu Ren WISE, Xiamen University November 26, 2012 Outline 1 Chapter 21: Concave and Quasiconcave Functions New Section Chapter 21: Concave and Quasiconcave Functions Concave

More information

Taylor Series and stationary points

Taylor Series and stationary points Chapter 5 Taylor Series and stationary points 5.1 Taylor Series The surface z = f(x, y) and its derivatives can give a series approximation for f(x, y) about some point (x 0, y 0 ) as illustrated in Figure

More information

(iii) converting between scalar product and parametric forms. (ii) vector perpendicular to two given (3D) vectors

(iii) converting between scalar product and parametric forms. (ii) vector perpendicular to two given (3D) vectors Vector Theory (15/3/2014) www.alevelmathsng.co.uk Contents (1) Equation of a line (i) parametric form (ii) relation to Cartesian form (iii) vector product form (2) Equation of a plane (i) scalar product

More information

Analysis/Calculus Review Day 3

Analysis/Calculus Review Day 3 Analysis/Calculus Review Day 3 Arvind Saibaba arvindks@stanford.edu Institute of Computational and Mathematical Engineering Stanford University September 15, 2010 Big- Oh and Little- Oh Notation We write

More information

Tutorial 3: Optimisation

Tutorial 3: Optimisation Tutorial : Optimisation ECO411F 011 1. Find and classify the extrema of the cubic cost function C = C (Q) = Q 5Q +.. Find and classify the extreme values of the following functions (a) y = x 1 + x x 1x

More information

CALCULUS: Math 21C, Fall 2010 Final Exam: Solutions. 1. [25 pts] Do the following series converge or diverge? State clearly which test you use.

CALCULUS: Math 21C, Fall 2010 Final Exam: Solutions. 1. [25 pts] Do the following series converge or diverge? State clearly which test you use. CALCULUS: Math 2C, Fall 200 Final Exam: Solutions. [25 pts] Do the following series converge or diverge? State clearly which test you use. (a) (d) n(n + ) ( ) cos n n= n= (e) (b) n= n= [ cos ( ) n n (c)

More information

Calculus of Variations Summer Term 2014

Calculus of Variations Summer Term 2014 Calculus of Variations Summer Term 2014 Lecture 12 26. Juni 2014 c Daria Apushkinskaya 2014 () Calculus of variations lecture 12 26. Juni 2014 1 / 25 Purpose of Lesson Purpose of Lesson: To discuss numerical

More information

Computing Maximum Entropy Densities: A Hybrid Approach

Computing Maximum Entropy Densities: A Hybrid Approach Computing Maximum Entropy Densities: A Hybrid Approach Badong Chen Department of Precision Instruments and Mechanology Tsinghua University Beijing, 84, P. R. China Jinchun Hu Department of Precision Instruments

More information

8. Diagonalization.

8. Diagonalization. 8. Diagonalization 8.1. Matrix Representations of Linear Transformations Matrix of A Linear Operator with Respect to A Basis We know that every linear transformation T: R n R m has an associated standard

More information

STATIC LECTURE 4: CONSTRAINED OPTIMIZATION II - KUHN TUCKER THEORY

STATIC LECTURE 4: CONSTRAINED OPTIMIZATION II - KUHN TUCKER THEORY STATIC LECTURE 4: CONSTRAINED OPTIMIZATION II - KUHN TUCKER THEORY UNIVERSITY OF MARYLAND: ECON 600 1. Some Eamples 1 A general problem that arises countless times in economics takes the form: (Verbally):

More information

0.1 Tangent Spaces and Lagrange Multipliers

0.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 information

3 Applications of partial differentiation

3 Applications of partial differentiation Advanced Calculus Chapter 3 Applications of partial differentiation 37 3 Applications of partial differentiation 3.1 Stationary points Higher derivatives Let U R 2 and f : U R. The partial derivatives

More information

Constrained Optimization

Constrained Optimization 1 / 22 Constrained Optimization ME598/494 Lecture Max Yi Ren Department of Mechanical Engineering, Arizona State University March 30, 2015 2 / 22 1. Equality constraints only 1.1 Reduced gradient 1.2 Lagrange

More information

Course Outline. 2. Vectors in V 3.

Course Outline. 2. Vectors in V 3. 1. Vectors in V 2. Course Outline a. Vectors and scalars. The magnitude and direction of a vector. The zero vector. b. Graphical vector algebra. c. Vectors in component form. Vector algebra with components.

More information

Introduction to Machine Learning Lecture 7. Mehryar Mohri Courant Institute and Google Research

Introduction to Machine Learning Lecture 7. Mehryar Mohri Courant Institute and Google Research Introduction to Machine Learning Lecture 7 Mehryar Mohri Courant Institute and Google Research mohri@cims.nyu.edu Convex Optimization Differentiation Definition: let f : X R N R be a differentiable function,

More information

Basics of Calculus and Algebra

Basics of Calculus and Algebra Monika Department of Economics ISCTE-IUL September 2012 Basics of linear algebra Real valued Functions Differential Calculus Integral Calculus Optimization Introduction I A matrix is a rectangular array

More information

Numerical Optimization

Numerical 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 information

Examination paper for TMA4180 Optimization I

Examination 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 information

A Project Report Submitted by. Devendar Mittal 410MA5096. A thesis presented for the degree of Master of Science

A Project Report Submitted by. Devendar Mittal 410MA5096. A thesis presented for the degree of Master of Science PARTICULARS OF NON-LINEAR OPTIMIZATION A Project Report Submitted by Devendar Mittal 410MA5096 A thesis presented for the degree of Master of Science Department of Mathematics National Institute of Technology,

More information