Finding the Minimum Using Newton’s Method Lecture I.

Slides:



Advertisements
Similar presentations
Lecture 5 Newton-Raphson Method
Advertisements

Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Chapter 2 Functions and Graphs Section 3 Quadratic Functions.
1 Curve-Fitting Spline Interpolation. 2 Curve Fitting Regression Linear Regression Polynomial Regression Multiple Linear Regression Non-linear Regression.
 Econometrics and Programming approaches › Historically these approaches have been at odds, but recent advances have started to close this gap  Advantages.
Finance 30210: Managerial Economics Optimization.
PHYS2020 NUMERICAL ALGORITHM NOTES ROOTS OF EQUATIONS.
Optimization using Calculus
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 99 Chapter 4 The Simplex Method.
Economics 214 Lecture 34 Multivariate Optimization.
Managerial Economics & Business Strategy Chapter 1 The Fundamentals of Managerial Economics.
Further Optimization of Economic Functions
Why Function Optimization ?
THE MATHEMATICS OF OPTIMIZATION
Definition and Properties of the Cost Function
Applied Economics for Business Management
Introduction to Optimization (Part 1)
Learning Objectives for Section 2.1 Functions
Lecture #7. Lecture Outline Review Go over Exam #1 Continue production economic theory.
Optimization Techniques Methods for maximizing or minimizing an objective function Examples –Consumers maximize utility by purchasing an optimal combination.
Managerial Economics Managerial Economics = economic theory + mathematical eco + statistical analysis.
MATH 685/ CSI 700/ OR 682 Lecture Notes Lecture 8. Nonlinear equations.
Section 3.2 Beginning on page 104
1 Cost Minimization and Cost Curves Beattie, Taylor, and Watts Sections: 3.1a, 3.2a-b, 4.1.
Subadditivity of Cost Functions Lecture XX. Concepts of Subadditivity Evans, D. S. and J. J. Heckman. “A Test for Subadditivity of the Cost Function with.
Derivatives to Business and Economics. Our textbook tells us that business analysts and economists have increasingly turned to mathematical models to.
STDM - Linear Programming 1 By Isuru Manawadu B.Sc in Accounting Sp. (USJP), ACA, AFM
Cost Functions and the Estimation of Flexible Functional Forms Lecture XVIII.
Block 4 Nonlinear Systems Lesson 14 – The Methods of Differential Calculus The world is not only nonlinear but is changing as well 1 Narrator: Charles.
Linear Programming Terminology. Contents 1.What is a Mathematical Model? 2.Illustration of LPP: Maximization Case 3.What.
Discriminant Functions
Solving Linear Programming Problems: The Simplex Method
Expected Utility Lecture I. Basic Utility A typical economic axiom is that economic agents (consumers, producers, etc.) behave in a way that maximizes.
PowerPoint Slides by Robert F. BrookerHarcourt, Inc. items and derived items copyright © 2001 by Harcourt, Inc. Managerial Economics in a Global Economy.
Efficiency Measurement William Greene Stern School of Business New York University.
Comparative Statics and Duality of the Cost Function Lecture VII.
Example: 3x 2 + 9x + 6. Solving Quadratic Equations.
1 Technology Beattie, Taylor, and Watts Sections: , b.
Applied Economics for Business Management Lecture #8.
Managerial Economics Managerial Economics = economic theory + mathematical eco + statistical analysis.
D Nagesh Kumar, IIScOptimization Methods: M2L4 1 Optimization using Calculus Optimization of Functions of Multiple Variables subject to Equality Constraints.
Optimization unconstrained and constrained Calculus part II.
Overview of Optimization in Ag Economics Lecture 2.
Lecture 5 - Single Variable Problems CVEN 302 June 12, 2002.
SOLVING QUADRATIC EQUATIONS Factoring Method. Warm Up Factor the following. 1. x 2 – 4x – x 2 + 2x – x 2 -28x + 48.
Managerial Economics Lecture: Optimization Technique Date:
2.1 – Linear and Quadratic Equations Linear Equations.
Beattie, Taylor, and Watts Sections: 3.1b-c, 3.2c, , 5.2a-d
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Calculus-Based Optimization AGEC 317 Economic Analysis for Agribusiness and Management.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
C opyright  2007 by Oxford University Press, Inc. PowerPoint Slides Prepared by Robert F. Brooker, Ph.D.Slide 1 1.
Linear Programming Department of Business Administration FALL by Asst. Prof. Sami Fethi.
Inequality Constraints Lecture 7. Inequality Contraints (I) n A Review of Lagrange Multipliers –As we discussed last time, the first order necessary conditions.
Searching a Linear Subspace Lecture VI. Deriving Subspaces There are several ways to derive the nullspace matrix (or kernel matrix). ◦ The methodology.
D Nagesh Kumar, IISc Water Resources Systems Planning and Management: M2L2 Introduction to Optimization (ii) Constrained and Unconstrained Optimization.
The analytics of constrained optimal decisions microeco nomics spring 2016 the oligopoly model(II): competition in prices ………….1price competition: introduction.
Section 7.6 Functions Math in Our World. Learning Objectives  Identify functions.  Write functions in function notation.  Evaluate functions.  Find.
MTH 253 Calculus (Other Topics) Chapter 11 – Infinite Sequences and Series Section 11.8 –Taylor and Maclaurin Series Copyright © 2009 by Ron Wallace, all.
Principles and Worldwide Applications, 7th Edition
8-6 Solving Quadratic Equations using Factoring
Ch 11.1: The Occurrence of Two-Point Boundary Value Problems
SECTION 9-3 : SOLVING QUADRATIC EQUATIONS
Optimization Problems
Optimization Part II G.Anuradha.
Quadratics Lesson 2 Objective: Vertex Form of a Quadratic.
Solving simultaneous linear and quadratic equations
Half Test Review! Day 6.
Calculus-Based Optimization AGEC 317
Linear Programming.
Presentation transcript:

Finding the Minimum Using Newton’s Method Lecture I

n Many problems encountered in agricultural and applied economics are posed as optimization problems. –The basic economic problem implies optimization: Economics is the study of the allocation of scarce resources across unlimited and competing human wants and desires.

–We generally assume that individuals allocate their income to maximize utility while firms allocate inputs to produce output in a way that maximized profit. –At a somewhat more applied level most of our econometric tools also imply some form of optimization of parameters based on an objective function

Closed-Form Solutions n In the classroom many of our optimization problems yield closed-form solutions. –If the primal production function can be expressed as a quadratic function of inputs, the optimizing behavior can be determined as linear functions of the relative input prices.

Closed Form Solution of the Primal Production Problem

n However, the set of all functions with closed form solutions is a subset of feasible functions. –Thus, limiting the set of functions to those functions with closed form solutions may unduly limit the production functions considered.

Fourier Production Function

–My contention is that a simple closed form as presented in Equation 1 no longer exists. –The question then becomes: Can we use this specification to derive useful information about economic optimizing behavior? –The answer is obviously yes (you are leading the witness).

n Let us start by positing that a series of steps could be used to solve the general optimization problem

OutputCorn Price NitrogenPhosphorousPotash

Finding a Univariate Minimum n Finding the Univariate Minimum (Algorithm1.ma) –Finding a minimum of a simple univariate quadratic is trivial given the conditions we developed in the previous section

–In addition, straightforward transformations add little additional complexity

–One possibility for a more complex function is

–Thus, these functions have discontinuities at some points in their range. If we restrict the search to points where x is greater than -10.0, then the function is defined at all points

–The method of bisection involves shrinking an interval known to contain the zero of the derivative. »Starting with an interval of [-8, 20]. The bisection of that interval is 6. At 6 the value of the derivative is »Thus, the subinterval [6,20] can be excluded from the search and the new interval becomes [-8,6].

Solving Using Bisection

Newton’s Method –Newton’s Method »The theoretical foundation of Newton’s method involves inscribing triangles inside the function. Mathematically

f(x) x

Finding Multivariate Maximum n Finding the Multivariate Maximum (Algorithm2.ma) –The basic difference between univariate and multivariate optimization is that we want to solve for the x that simultaneously make a system of equations equal to zero.

–Appealing again to the second order Taylor series expansion

–A simple problem with a Cobb-Douglas utility function

–Starting with x=(1,1,1)