Lagrange Multipliers Erasmus Mobility Program (24Apr2012) Pollack Mihály Engineering Faculty (PMMK) University of Pécs João Miranda

Slides:



Advertisements
Similar presentations
Chapter 17 Multivariable Calculus.
Advertisements

Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
Lesson 08 Linear Programming
 Introduction  Simple Framework: The Margin Rule  Model with Product Differentiation, Variable Proportions and Bypass  Model with multiple inputs.
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ Linear Programming in two dimensions:
Learning Objectives for Section 5.3

1 Topic 9 Constrained Optimization Jacques 5.5 and 5.6.
Optimization in Engineering Design 1 Lagrange Multipliers.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 7-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 7 Linear.
Optimization using Calculus
Calculus-Based Solutions Procedures
Maximization without Calculus Not all economic maximization problems can be solved using calculus –If a manager does not know the profit function, but.
Economics 214 Lecture 37 Constrained Optimization.
Lecture 38 Constrained Optimization
Constrained Optimization Economics 214 Lecture 41.
Economics 214 Lecture 39 Constrained Optimization.
D Nagesh Kumar, IIScOptimization Methods: M2L5 1 Optimization using Calculus Kuhn-Tucker Conditions.
5.6 Maximization and Minimization with Mixed Problem Constraints
Nonlinear Optimization Review of Derivatives Models with One Decision Variable Unconstrained Models with More Than One Decision Variable Models with Equality.
Linear programming. Linear programming… …is a quantitative management tool to obtain optimal solutions to problems that involve restrictions and limitations.
Linear Programming Models: Graphical and Computer Methods
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
Optimization Techniques Lecture 2 (Appendix C). 1. Optimization is: a process by which the maximum or minimum values of decision variables are determined.
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.
Presentation: H. Sarper
Lecture # 2 Review Go over Homework Sets #1 & #2 Consumer Behavior APPLIED ECONOMICS FOR BUSINESS MANAGEMENT.
4.1 The Theory of Optimization  Optimizing Theory deals with the task of finding the “best” outcome or alternative –Maximums and –Minimums  What output.
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.
Introductory Linear Algebra Erasmus Mobility Program (24Apr2012) Pollack Mihály Engineering Faculty (PMMK) University of Pécs João Miranda
Linear Programming Erasmus Mobility Program (24Apr2012) Pollack Mihály Engineering Faculty (PMMK) University of Pécs João Miranda
EASTERN MEDITERRANEAN UNIVERSITY Department of Industrial Engineering Non linear Optimization Spring Instructor: Prof.Dr.Sahand Daneshvar Submited.
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.
Faculty of Economics Optimization Lecture 3 Marco Haan February 28, 2005.
Linear Programming Solving Systems of Equations with 3 Variables Inverses & Determinants of Matrices Cramer’s Rule.
Optimization unconstrained and constrained Calculus part II.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Mathe III Lecture 8 Mathe III Lecture 8. 2 Constrained Maximization Lagrange Multipliers At a maximum point of the original problem the derivatives of.
(iii) Lagrange Multipliers and Kuhn-tucker Conditions D Nagesh Kumar, IISc Introduction to Optimization Water Resources Systems Planning and Management:
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.
Copyright © Cengage Learning. All rights reserved. 14 Partial Derivatives.
Section Lagrange Multipliers.
Section 15.3 Constrained Optimization: Lagrange Multipliers.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
Inequality Constraints Lecture 7. Inequality Contraints (I) n A Review of Lagrange Multipliers –As we discussed last time, the first order necessary conditions.
Mathe III Lecture 8 Mathe III Lecture 8. 2 Constrained Maximization Lagrange Multipliers At a maximum point of the original problem the derivatives of.
D Nagesh Kumar, IISc Water Resources Systems Planning and Management: M2L2 Introduction to Optimization (ii) Constrained and Unconstrained Optimization.
Elimination Method - Systems. Elimination Method  With the elimination method, you create like terms that add to zero.
OBJECTIVES Students will able to Students will able to 1. define differential equation 1. define differential equation 2. identify types, order & degree.
Another sufficient condition of local minima/maxima
Systems of Equations and Inequalities
Principles and Worldwide Applications, 7th Edition
Calculus-Based Solutions Procedures MT 235.
Copyright © Cengage Learning. All rights reserved.
7.5 – Constrained Optimization: The Method of Lagrange Multipliers
Outline Unconstrained Optimization Functions of One Variable
Copyright © Cengage Learning. All rights reserved.
Linear Programming Problem
Nature does nothing uselessly.
Lecture 38 Constrained Optimization
Calculus-Based Optimization AGEC 317
Section 4.2 Solving a System of Equations in Two Variables by the Substitution Method.
Presentation transcript:

Lagrange Multipliers Erasmus Mobility Program (24Apr2012) Pollack Mihály Engineering Faculty (PMMK) University of Pécs João Miranda ;

24-Apr-12Lagrange Multipliers2 Introduction: maximization of 2-variable function subject to one restriction; Generalization: maximization of n-variable function subject to m restrictions Tables & Chairs problem.

24-Apr-12Lagrange Multipliers3 Optima of multi-variable functions when submitted to several constraints. Problem: –Obtain the maxima/minima of the function, –But the variables x and y have to satisfy the equation:

24-Apr-12Lagrange Multipliers4 Assuming y(x) as implicit function of x, the derivative of the composite function u(x,y), (necessary condition) Or, Lagrange Multipliers

24-Apr-12Lagrange Multipliers5 The derivation of the implicit function, y(x): then, Lagrange Multipliers

24-Apr-12Lagrange Multipliers6 Conjugating the two zero equations: where is known as Lagrange multiplier ( ). ( Re-allocating terms, Lagrange Multipliers

24-Apr-12Lagrange Multipliers7 The multiplier is selected in conformity with, and it is also necessary that: ( Lagrange Multipliers

24-Apr-12Lagrange Multipliers8 Thus, in optimal points, the three following equations are simultaneously verified (necessary conditions to the existence of constrained optima) : Notice that they represent the three partial derivatives in (x, y, ) of the function: Verify it! Lagrange Multipliers

24-Apr-12Lagrange Multipliers9 Procedure: 1.Build the Lagrangean function, L(x,y, ) ; 2.Set to zero the related first order partial derivatives; 3.Obtain the values (x, y, ) that are satisfying the system of equations. Lagrange Multipliers

24-Apr-12Lagrange Multipliers10 Problem (general): –Obtain the maxima/minima of the function, –But the n variables have to simultaneously satisfy the set of m (m<n) equations: Lagrange Multipliers

24-Apr-12Lagrange Multipliers11 Procedure: 1.Build the Lagrangean function, ; Lagrange Multipliers

24-Apr-12Lagrange Multipliers12 (...) Procedure: 2.Set to zero the n first order partial derivatives in the n variables, and... Lagrange Multipliers

24-Apr-12Lagrange Multipliers13 (...) Procedure: Notice that the first order partial derivatives in order to the m multipliers is driving the m constraints, Lagrange Multipliers

24-Apr-12Lagrange Multipliers14 (...) Procedure: 3.Obtain the values set that simultaneously satisfy the group of (n + m) equations. That is, Lagrange Multipliers

24-Apr-12Lagrange Multipliers15 A furniture factory builds Tables ( t ) at a profit of 4 Euros per Table, and Chairs ( c ) at a profit of 3 Euros per Chair). Suppose that only 8 short ( s ) pieces and 6 large ( l ) pieces are available for building purposes, what combination of Tables and Chairs do you need to build to make the most profit?. If the availability of the short pieces is 8008 and the availability of the large pieces is 6007, how many Tables and Chairs do you need to build to make the most profit? Tables & Chairs (T&C)

24-Apr-12Lagrange Multipliers16 Note: modeling is based in the proportionality, aditivity and divisibility between the produced quantities of t and c and profit and utilization of l and s components.. Tables & Chairs (T&C)

24-Apr-12Lagrange Multipliers17 Note: modeling is based in the proportionality, aditivity and divisibility between the produced quantities of t and c and profit and utilization of l and s components. Tables & Chairs (T&C)

24-Apr-12Lagrange Multipliers18 T&C: Lagrange Multipliers Maximize the profit function, Luc(t,c), satisfying the conditions concerning the availability of the l and s components.. Problem: –Obtain the maximum value of profit function, –But the variables t and c shall satisfy the availability of l and s:

24-Apr-12Lagrange Multipliers19 Procedure: 1.Build the Lagrangean function, L(t, c, 1, 2 ) ; 2.Set to zero the 4 first order partial derivatives; 3.Obtain the values (t, c, 1, 2 ) that are satisfying the system of equations. T&C: Lagrange Multipliers

24-Apr-12Lagrange Multipliers20 Procedure: 1.Build the Lagrangean function, L(t, c, 1, 2 ) ; T&C: Lagrange Multipliers

24-Apr-12Lagrange Multipliers21 (...) Procedure: 2.Set to zero the 4 first order partial derivatives, and notice that those related to the multipliers ( 1, 2 ) are driving the original constraints: and... T&C: Lagrange Multipliers

24-Apr-12Lagrange Multipliers22 (...) Procedure: 3.Obtain the values (t, c, 1, 2 ) that are simultaneously satisfying the 4 equations: Re-allocating the terms of the system of equations, T&C: Lagrange Multipliers

24-Apr-12Lagrange Multipliers23 (...) Procedure: 3.Obtain the values (t, c, 1, 2 ) that are simultaneously satisfying the 4 equations: Applying the Cramer’s Rule to the 1. st subsystem, T&C: Lagrange Multipliers

24-Apr-12Lagrange Multipliers24 (...) Procedure: 3.Obtain the values (t, c, 1, 2 ) that are simultaneously satisfying the 4 equations: Applying the Cramer’s Rule to the 2. nd subsystem, T&C: Lagrange Multipliers

24-Apr-12Lagrange Multipliers25 (...) Procedure: 3.Obtain the values (t, c, 1, 2 ) that are simultaneously satisfying the 4 equations : Then, Optimal Solution! T&C: Lagrange Multipliers Edit LINDO: max 4t + 3c subject to l1) 2t + 1c <= 6007 l2) 2t + 2c <= 8008 END

24-Apr-12Lagrange Multipliers26 Lagrange Multipliers (synthesis) Introduction: maximization of 2-variable function subject to one restriction; Generalization: maximization of n-variable function subject to m restrictions Tables & Chairs problem.