Optimization unconstrained and constrained Calculus part II.

Slides:



Advertisements
Similar presentations
Topic 03: Optimal Decision Making
Advertisements

Linear Programming Problem
Nonlinear Programming McCarl and Spreen Chapter 12.
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Ch 2. 6 – Solving Systems of Linear Inequalities & Ch 2
Optimization in Engineering Design 1 Lagrange Multipliers.
Optimization using Calculus
THE MATHEMATICS OF OPTIMIZATION
Maximization without Calculus Not all economic maximization problems can be solved using calculus –If a manager does not know the profit function, but.
Constrained Maximization
Rules for Differentiating Univariate Functions Given a univariate function that is both continuous and smooth throughout, it is possible to determine its.
Economics 214 Lecture 37 Constrained Optimization.
Constrained Optimization Rong Jin. Outline  Equality constraints  Inequality constraints  Linear Programming  Quadratic Programming.
Lecture 35 Constrained Optimization
Multivariable Optimization
D Nagesh Kumar, IIScOptimization Methods: M2L5 1 Optimization using Calculus Kuhn-Tucker Conditions.
Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.
Constrained Optimization Rong Jin. Outline  Equality constraints  Inequality constraints  Linear Programming  Quadratic Programming.
Nonlinear Optimization Review of Derivatives Models with One Decision Variable Unconstrained Models with More Than One Decision Variable Models with Equality.
THE MATHEMATICS OF OPTIMIZATION
Linear-Programming Applications
Introduction to Optimization (Part 1)
THE MATHEMATICS OF OPTIMIZATION
Optimization Techniques Lecture 2 (Appendix C). 1. Optimization is: a process by which the maximum or minimum values of decision variables are determined.
Econ 533 Econometrics and Quantitative Methods One Variable Calculus and Applications to Economics.
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.
4.1 The Theory of Optimization  Optimizing Theory deals with the task of finding the “best” outcome or alternative –Maximums and –Minimums  What output.
Nonlinear Programming (NLP) Operation Research December 29, 2014 RS and GISc, IST, Karachi.
Systems of Inequalities in Two Variables Sec. 7.5a.
Managerial Economics Prof. M. El-Sakka CBA. Kuwait University Managerial Economics in a Global Economy Chapter 2 Optimization Techniques and New Management.
Theoretical Tools of Public Economics Math Review.
1 THE MATHEMATICS OF OPTIMIZATION Copyright ©2005 by South-Western, a division of Thomson Learning. All rights reserved. Walter Nicholson, Microeconomic.
Optimization Techniques Lecture Optimization is: a process by which the maximum or minimum values of decision variables are determined.  Examples.
Slide 1  2002 South-Western Publishing Web Chapter A Optimization Techniques Overview Unconstrained & Constrained Optimization Calculus of one variable.
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.
Using Mathematics to Learn Economics Short-hand skills Equilibrium (static) analysis Comparative statics analysis –Differentiation –Partial derivatives.
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
Part 4 Nonlinear Programming 4.1 Introduction. Standard Form.
3.4: Linear Programming Objectives: Students will be able to… Use linear inequalities to optimize the value of some quantity To solve linear programming.
Managerial Economics Lecture: Optimization Technique Date:
Optimization and Lagrangian. Partial Derivative Concept Consider a demand function dependent of both price and advertising Q = f(P,A) Analyzing a multivariate.
Calculus-Based Optimization AGEC 317 Economic Analysis for Agribusiness and Management.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
C opyright  2007 by Oxford University Press, Inc. PowerPoint Slides Prepared by Robert F. Brooker, Ph.D.Slide 1 1.
Economics 2301 Lecture 37 Constrained Optimization.
Inequality Constraints Lecture 7. Inequality Contraints (I) n A Review of Lagrange Multipliers –As we discussed last time, the first order necessary conditions.
1 Unconstrained and Constrained Optimization. 2 Agenda General Ideas of Optimization Interpreting the First Derivative Interpreting the Second Derivative.
3-5: Linear Programming. Learning Target I can solve linear programing problem.
D Nagesh Kumar, IISc Water Resources Systems Planning and Management: M2L2 Introduction to Optimization (ii) Constrained and Unconstrained Optimization.
Solver Feature Excel’s KY San Jose State University Engineering 10.
Solver Feature Excel’s KY San Jose State University Engineering 10.
Chapter 11 Optimization with Equality Constraints
Systems of Equations and Inequalities
Principles and Worldwide Applications, 7th Edition
Constrained Optimization
3-3 Optimization with Linear Programming
Linear Programming Objectives: Set up a Linear Programming Problem
The Lagrange Multiplier Method
Operational Research (OR)
Constrained Optimization
Constrained Optimization – Part 1
Outline Unconstrained Optimization Functions of One Variable
Linear Programming Problem
Constrained Optimization – Part 1
1.6 Linear Programming Pg. 30.
Constrained Optimization
Linear Programming.
Calculus-Based Optimization AGEC 317
Presentation transcript:

Optimization unconstrained and constrained Calculus part II

Setting-Up Optimization Problems Define the agent’s goal: objective function and identify the agent’s choice (control) variables Identify restrictions (if any) on the agent’s choices (constraints). If no constraints exist, then we have unconstrained minimization or maximization problems. If constraints exist, what type? Equality Constraints (Lagrangian) Inequality Constraints (Linear Programming)

Mathematically, Optimize y = f(x 1, x 2,...,x n ) subject to (s.t.) g j (x 1, x 2,...,x n ) ≤ b j or = b j j = 1, 2,..., m. or ≥ b j y =f(x 1, x 2,...,x n ) → objective function x 1, x 2,...,x n → set of decision variables (n) optimize → either maximize or minimize g i (x 1, x 2,...,x n ) → constraints (m)

Constraints refer to restrictions on resources legal constraints environmental constraints behavioral constraints

Review of Derivatives y=f(x): First-order condition: Second-order condition: Constant function: Power function: Sum of functions: Product rule: Quotient rule: Chain rule:

Unconstrainted Univariate Maximization Problems: max f(x) Solution: Derive First Order Condition (FOC): f’(x)=0 Check Second Order Condition (SOC): f’’(x)<0 Local vs. global: If more than one point satisfy both FOC and SOC, evaluate the objective function at each point to identify the maximum.

Example PROFIT = Q – 10Q 2 Find Q that maximizes profit

Example PROFIT = Q – 10Q 2 Find Q that maximizes profit 140 – 20Q = set 0 Q = < 0 max profit occurs at Q = 7 max profit = (7) – 10(7) 2 max profit = $450

Minimization Problems: Min f(x) Solution: Derive First Order Condition (FOC): f’(x)=0 Check Second Order Condition (SOC): f’’(x)>0 Local vs. global: If more than one point satisfy both FOC and SOC, evaluate the objective function at each point to identify the minimum.

Example COST = Q Q 2 Find Q that minimizes cost

Example COST = Q Q 2 Find Q that minimizes cost Q = set 0 Q = > 0 Minimize cost at Q = 250 min cost = $10

Unconstrained Multivariate Optimization Max FOC: SOC:

Example Find Q1 and Q2 that maximize Profit

Example PROFIT is a function of the output of two products (e.g.heating oil and gasoline) Q 1 Q 2 Solve Simultaneously Q 1 = 5.77 units Q 2 = 4.08 units

Second-Order Conditions (-20)(-16) – (-6) 2 > – 36 > 0 we have maximized profit.

Constrained Optimization Solution: Lagrangian Multiplier Method Maximize y = f(x 1, x 2, x 3, …, x n ) s.t. g(x 1, x 2, x 3, …, x n ) = b Solution: Set up Lagrangian: FOC:

Lagrangian Multiplier Interpretation of Lagrangian Multiplier λ: the shadow value of the constrained resource. o If the constrained resource increases by 1 unit, the objective function will change by λ units.

Example Maximize Profit = subject to (s.t.) 20Q Q 2 = 200 Could solve by direct substitution Note that 20Q 1 = 200 – 40Q 2 → Q 1 = 10 – 2Q 2 Maximize Profit =

Lagrangian Multiplier Method