Calculus-Based Solutions Procedures MT 235.

Slides:



Advertisements
Similar presentations
Chapter 17 Multivariable Calculus.
Advertisements

Nonlinear Programming McCarl and Spreen Chapter 12.
Q. 9 – 3 D G A C E Start Finish B F.
Slide Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Optimization in Engineering Design 1 Lagrange Multipliers.
Optimization using Calculus
Calculus-Based Solutions Procedures
Lecture 2 MGMT © 2011 Houman Younessi Derivatives Derivative of a constant Y X Y=3 Y1 X1X2.
THE MATHEMATICS OF OPTIMIZATION
Partial Differentiation & Application
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
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
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.
Roman Keeney AGEC  In many situations, economic equations are not linear  We are usually relying on the fact that a linear equation.
The mean value theorem and curve sketching
Production and Service Systems Operations
Business and Economic Applications. Summary of Business Terms and Formulas  x is the number of units produced (or sold)  p is the price per unit  R.
1 Slides used in class may be different from slides in student pack Chapter 17 Inventory Control  Inventory System Defined  Inventory Costs  Independent.
Slide 1  2005 South-Western Publishing Appendix 2A Differential Calculus in Management A function with one decision variable, X, can be written as Y =
Managerial Economics Prof. M. El-Sakka CBA. Kuwait University Managerial Economics in a Global Economy Chapter 2 Optimization Techniques and New Management.
Optimization Techniques Lecture Optimization is: a process by which the maximum or minimum values of decision variables are determined.  Examples.
Optimization of Continuous Models
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.
Nonlinear Programming I Li Xiaolei. Introductory concepts A general nonlinear programming problem (NLP) can be expressed as follows: objective function.
Optimization unconstrained and constrained Calculus part II.
© The McGraw-Hill Companies, Inc., Chapter 14 Inventory Control.
Copyright © Cengage Learning. All rights reserved. 3 Applications of the Derivative.
Managerial Economics Lecture: Optimization Technique Date:
Calculus-Based Optimization AGEC 317 Economic Analysis for Agribusiness and Management.
C opyright  2007 by Oxford University Press, Inc. PowerPoint Slides Prepared by Robert F. Brooker, Ph.D.Slide 1 1.
Chapter 17 Inventory Control
Copyright © 2016, 2012 Pearson Education, Inc
Calculating the Derivative
Graphs and the Derivative Chapter 13. Ch. 13 Graphs and the Derivative 13.1 Increasing and Decreasing Functions 13.2 Relative Extrema 13.3 Higher Derivatives,
Applications of the Derivative Chapter 14. Ch. 14 Applications of the Derivative 14.1 Absolute Extrema 14.3 Business Applications of Extrema.
OBJECTIVE Find relative extrema of a function of two variables.
Chapter 14 Partial Derivatives
BUSI 104 Operations Management
deterministic operations research
Linear Programming – Introduction
Calculus-Based Optimization Prepared by Lee Revere and John Large
Chapter 5 Linear Inequalities and Linear Programming
Copyright © Cengage Learning. All rights reserved.
Chapter 11 Optimization with Equality Constraints
Principles and Worldwide Applications, 7th Edition
Maximum-Minimum Problems; Business and Economics Applications
Functions of Several Variables
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Constrained Optimization
Unconstrained and Constrained Optimization
Linear Programming Objectives: Set up a Linear Programming Problem
The Lagrange Multiplier Method
Copyright © Cengage Learning. All rights reserved.
Constrained Optimization
Constrained Optimization – Part 1
PRELIMINARY MATHEMATICS
Outline Unconstrained Optimization Functions of One Variable
Copyright © Cengage Learning. All rights reserved.
Optimization Problems
Chapter 7 Functions of Several Variables
Constrained Optimization – Part 1
Lagrange Multipliers.
Constrained Optimization
Calculus-Based Optimization AGEC 317
Multivariable optimization with no constraints
Presentation transcript:

Calculus-Based Solutions Procedures MT 235

Nonlinear Optimization Review of Derivatives Models with One Decision Variable Unconstrained Models with More Than One Decision Variable Models with Equality Constraints: Lagrange Multipliers Interpretation of Lagrange Multiplier Models Involving Inequality Constraints MT 235

Review of 1st Derivatives Notation: y = f(x), dy/dx = f’(x) f(x) = c f’(x) = 0 f(x) = xn f’(x) = n*x(n-1) f(x) = x f’(x) = 1*x0 = 1 f(x) = x5 f’(x) = 5*x4 f(x) = 1/x3 f(x) = x-3 f’(x) = -3*x-4 f(x) = c*g(x) f’(x) = c*g’(x) f(x) = 10*x2 f’(x) = 20*x f(x) = u(x)+v(x) f’(x) = u’(x)+v’(x) f(x) = x2 - 5x f’(x) = 2x - 5 MT 235

Review of 2nd Derivatives Notation: y = f(x), d(f’(x))/dx = d2y/dx2 = f’’(x) f(x) = -x2 f’(x) = -2x f’’(x) = -2 f(x) = x-3 f’(x) = -3x-4 f’’(x) = 12x-5 MT 235

Nonlinear Optimization Review of Derivatives Models with One Decision Variable Unconstrained Models with More Than One Decision Variable Models with Equality Constraints: Lagrange Multipliers Interpretation of Lagrange Multiplier Models Involving Inequality Constraints MT 235

Models with One Decision Variable Require 1st & 2nd derivative tests Rule 1 (Necessary Condition): df/dx = 0 Rule 2 (Sufficient Condition): d2f/dx2 > 0 Minimum d2f/dx2 < 0 Maximum MT 235

Maximum Example Rule 1: Rule 2: f(x) = y = -50 + 100x – 5x2 dy/dx = 100 – 10x = 0, x = 10 Rule 2: d2y/dx2 = -10 Therefore, since d2y/dx2 < 0: f(x) has a maximum at x = 10 MT 235

Maximum Example – Graph Solution MT 235

Minimum Example Rule 1: Rule 2: f(x) = y = x2 – 6x + 9 dy/dx = 2x - 6 = 0, x = 3 Rule 2: d2y/dx2 = 2 Therefore, since d2y/dx2 > 0: f(x) has a minimum at x = 3. MT 235

Minimum Example – Graph Solution 3 MT 235

Max & Min Example Rule 1: Rule 2: f(x) = y = x3/3 – x2 dy/dx = f’(x) = x2 – 2x = 0; x = 0, 2 Rule 2: d2y/dx2 = f’’(x) = 2x – 2 = 0 2(0) – 2 = -2, f’’(x=0) = -2 Therefore, d2y/dx2 < 0: Maximum of f(x) at x = 0 2(2) – 2 = 2, f’’(x=2) = 2 Therefore, d2y/dx2 > 0: Minimum of f(x) at x = 2 MT 235

Max & Min Example – Graph Solution 2 MT 235

Example: Cubic Cost Function Resulting in Quadratic 1st Derivative Rule 1: f(x) = C = 10x3 – 200x2 – 30x + 15,000 dC/dx = f’(x)= 30x2 – 400x – 30 = 0 Quadratic Form: ax2 + bx + c MT 235

Example: Cubic Cost Function Resulting in Quadratic 1st Derivative Rule 2: d2y/dx2 = f’’(x) = 60x – 400 60(13.4) – 400 = 404 > 0 Therefore, d2y/dx2 > 0: Minimum of f(x) at x = 13.4 60(-.07) – 400 = -404.2 < 0 Therefore, d2y/dx2 < 0: Maximum of f(x) at x = -.07 MT 235

Cubic Cost Function – Graph Solution 5000 10000 15000 20000 25000 30000 35000 40000 45000 50000 1 4 -.07 10 13 16 13.4 22 25 28 31 34 37 x = Units Produced Cost $ (C) = f(x) -.07 13.4 MT 235

Economic Order Quantity – EOQ Assumptions: Demand for a particular item is known and constant Reorder time (time from when the order is placed until the shipment arrives) is also known The order is filled all at once, i.e., when the shipment arrives, it arrives all at once and in the quantity requested Annual cost of carrying the item in inventory is proportional to the value of the items in inventory Ordering (or setup) cost is fixed and constant, regardless of the size of the order MT 235

Economic Order Quantity – EOQ Variable Definitions: Let Q represent the optimal order quantity, or the EOQ Ch represent the annual carrying (or holding) cost per unit of inventory Co represent the fixed ordering costs per order D represent the number of units demanded annually MT 235

EOQ – Inventory Position At time = 0 after the initial delivery, the inventory level would be Q. The inventory level would then decline, following the straight line since demand is constant. When the inventory just reaches zero, the next delivery would occur (since delivery time is known and constant) and the inventory would instantaneously return to Q. This pattern would repeat throughout the year. (See graph on next slide.) MT 235

EOQ – Inventory Position Note: Assumes all the previous assumptions are satisfied. EOQ Model Q Time MT 235

Economic Order Quantity – EOQ Under these assumptions: Average Inventory Level = Q/2 Annual Carrying (or Holding) Cost = (Q/2)*Ch The annual ordering cost would be the number of orders times the ordering cost: (D/Q)* Co Total Annual Cost = TC = (Q/2)*Ch + (D/Q)* Co MT 235

Economic Order Quantity – EOQ To find the Optimal Order Quantity, Q take the first derivative of TC with respect to Q: (dTC/dQ) = (Ch/2) – DCoQ-2 = 0 Solving this for Q, we find: Q* = (2DCo/Ch)^(1/2) Which is the Optimal Order Quaintly Checking the second-order conditions (Rule 2 in our text), we have: (d2TC/dQ2)= (2DCo/Q3) Which is always > 0, since all the quantities in the expression are positive. Therefore, Q* gives a minimum value for total cost (TC) MT 235

a. Write the equation for cost per patient day. Nation’s Healthcare Inc (NHI) has collected historical data on the cost of operating a large hospital. The operating cost turns out to be a nonlinear function of the number of patient days per year, approximated by the function: where C is the total annual cost and x is the number of patient days per year. a. Write the equation for cost per patient day. b. Find the value of x (patient days) which minimizes cost per patient day. c. Find the minimum cost per patient day. MT 235

where p is the price and x is the number of units sold. Orion Outfitters is trying to price a new pair of ski goggles. They have estimates of the relationship between price and the number of units sold as below: where p is the price and x is the number of units sold. a. Write the equation for total revenue. b. Find the number of units to sell in order to maximize revenue. c. Find the revenue-maximizing price. d. Find the maximum revenue. MT 235

b. What is the minimum cost per unit? SouthStar Inc. (SSI) produces lawn tractors at a single factory. Based on a number of years of data, SSI has estimated a nonlinear cost function for the factory as below: where C is the total annual cost in dollars and x is the number of units produced in a year. a. Find the number of units to produce in order to minimize cost per unit. b. What is the minimum cost per unit? MT 235

Nonlinear optimization, one variable, restricted interval Find the minimum for the cost function: where x is the production level in thousands of units and C is the total cost in millions of dollars. Suppose that, due to other factors, the production level must be no lower than 1 thousand units and no more than 10 thousand units. MT 235

Nonlinear optimization, one variable, restricted interval Consider the cost function: where x is the production level in thousands of units and C is the total cost in millions of dollars. Find the production level which yields the minimum cost. Assume that production must be no lower than 1 thousand units and no higher than 5 thousand units. MT 235

Restricted Interval Problems Step 1: Find all the points that satisfy rules 1 & 2. These are candidates for yielding the optimal solution to the problem. Step 2: If the optimal solution is restricted to a specified interval, evaluate the function at the end points of the interval. Step 3: Compare the values of the function at all the points found in steps 1 and 2. The largest of these is the global maximum solution; the smallest is the global minimum solution. MT 235

Nonlinear Optimization Review of Derivatives Models with One Decision Variable Unconstrained Models with More Than One Decision Variable Models with Equality Constraints: Lagrange Multipliers Interpretation of Lagrange Multiplier Models Involving Inequality Constraints MT 235

General Form – Relative Min. and Max MT 235

General Form – Saddle Point MT 235

Unconstrained Models with More Than One Decision Variable Requires partial derivatives If z = 3x2y3 ∂z/∂x = 6xy3 ∂z/∂y = 9y2x2 If z = 5x3 – 3x2y2 + 7y5 ∂z/∂x = 15x2 – 6xy2 ∂z/∂y = -6x2y + 35y4 MT 235

2nd Partial Derivatives 2nd Partials Notation (∂/∂x)*(∂z/∂x) = ∂2z/∂x2 (∂/dy)*(∂z/∂y) = ∂2z/∂y2 Mixed Partials Notation (∂/∂x)*(∂z/∂y) = ∂2z/(∂x∂y) (∂/∂y)*(∂z/∂x) = ∂2z/(∂y∂x) MT 235

Example 2nd Partial Derivatives If z = 7x3 + 9xy2 + 2y5 ∂z/∂x = 21x2 + 9y2 ∂z/∂y = 18xy + 10y4 ∂2z/(∂y∂x) = 18y ∂2z/(∂x∂y) = 18y ∂2z/∂x2 = 42x ∂2z/∂y2 = 18x + 40y3 MT 235

Partial Derivative Tests Rule 3 (Necessary Condition): ∂f/∂x1 = 0, ∂f/∂x2 = 0, Solve Simultaneously Rule 4 (Sufficient Condition): If ∂2f/∂x12 > 0 And (∂2f/∂x12)*(∂2f/∂x22) – (∂2f/(∂x1∂x2))2 > 0 Then Minimum If ∂2f/∂x12 < 0 Then Maximum MT 235

Partial Derivative Tests Rule 4, continued: If (∂2f/∂x12)*(∂2f/∂x22) – (∂2f/(∂x1∂x2))2 < 0 Then Saddle Point – Neither Maximum nor Minimum If (∂2f/∂x12)*(∂2f/∂x22) – (∂2f/(∂x1∂x2))2 = 0 Then no conclusion MT 235

Optimization with two variables (bivariate optimization), no constraints A company is trying to construct an advertising plan. They can choose between TV advertising and radio advertising. From previous experience they have found that the following equation approximates the relationship between sales and advertising expenditures: Where f(x,y) is unit sales, x is dollars spent on TV ads. And y is dollars spent on radio ads. Find the advertising plan which will result in maximum sales. MT 235

A manufacturer sells two products A manufacturer sells two products. The demand functions for these two products are as given below: where q1 is the number of units of product 1 sold, q2 is the number of units of product 2 sold, p1 is the price of product 1 in dollars and p2 is the price of product 2 in dollars. Find the prices that the manufacturer should charge in order to maximize revenue. MT 235

A service company sells two products A service company sells two products. Below is given the profit function of the company as a function of the number of units of each product produced. where f(x,y) is profit, x is the number of units of product one sold, and y is the number of units of product two sold. Find the number of units of each product that should be sold in order to maximize profit. MT 235

Nonlinear Optimization Review of Derivatives Models with One Decision Variable Unconstrained Models with More Than One Decision Variable Models with Equality Constraints: Lagrange Multipliers Interpretation of Lagrange Multiplier Models Involving Inequality Constraints MT 235

Lagrange Multipliers Nonlinear Optimization with an equality constraint Max or Min f(x1, x2) ST: g(x1, x2) = b Form the Lagrangian Function: L = f(x1, x2) + λ[g(x1, x2) – b] MT 235

Lagrange Multipliers Rule 6 (Necessary Condition): Optimization of an equality constrained function, 1st order conditions: ∂L/∂x1 = 0 ∂L/∂x2 = 0 ∂L/∂λ = 0 MT 235

Lagrange Multipliers Rule 7 (Sufficient Condition): If rule 6 is satisfied at a point (x*1, x*2, λ*) apply conditions (a) and (b) of rule 4 to the Lagrangian function with λ fixed at a value of λ* to determine if the point (x*1, x*2) is a local maximum or a local minimum. MT 235

Interpretation of Lagrange Multipliers The value of the Lagrange multiplier associated with the general model above is the negative of the rate of change of the objective function with respect to a change in b. More formally, it is negative of the partial derivative of f(x1, x2) with respect to b; that is, λ = - ∂f/∂b or ∂f/∂b = - λ MT 235

b. What is the minimum cost? A company has a requirement to produce 34 units of a new product. The order can be filled by either product 1 or product 2 or a combination of the two. The company’s cost function is: a. How many units of each product should be produced in order to minimize total cost? b. What is the minimum cost? c. What would be the effect on cost of a one unit increase in the total production requirement? d. Now solve this problem using Excel. MT 235

Nonlinear Optimization, Two Variables with a Constraint Itech Cycle Company (ICC) has an order to produce 200 bicycles. ICC produces this particular bicycle at two plants. The cost function for production at these two plants is: Where f(x1,x2) is the production cost in dollars, x1 is the number of bicycles produced at Plant 1 and x2 is the number of bicycles produced at Plant 2. The company wants to split the production between the two plants in such a way as to minimize production cost. a. How many bicycles should ICC produce at each plant in order to meet the order at minimum cost? b. What is the minimum cost? c. What would be the effect on cost of a one unit increase in the total production requirement? d. Now solve this problem using Excel. MT 235

Nonlinear Optimization Review of Derivatives Models with One Decision Variable Unconstrained Models with More Than One Decision Variable Models with Equality Constraints: Lagrange Multipliers Interpretation of Lagrange Multiplier Models Involving Inequality Constraints MT 235

Models Involving Inequality Constraints Step 1: Assume the constraint is not binding, and apply the procedures of “Unconstrained Models with More Than One Decision Variable” to find the global maximum of the function, if it exists. (Functions that go to infinity do not have a global maximum). If this global maximum satisfies the constraint, stop. This is the global maximum for the inequality-constrained problem. If not, the constraint may be binding at the optimum. Record the value of any local maximum that satisfies the inequality constraint, and go on to Step 2. Step 2: Assume the constraint is binding, and apply the procedures of “Models with Equality Constraints” to find all the local maxima of the resulting equality-constrained problem. Compare these values with any feasible local maxima found in Step 1. The largest of these is the global maximum. MT 235