Inequality Constraints Lecture 7. Inequality Contraints (I) n A Review of Lagrange Multipliers –As we discussed last time, the first order necessary conditions.

Slides:



Advertisements
Similar presentations
Fin500J: Mathematical Foundations in Finance
Advertisements

Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Linear Programming Sensitivity Analysis How will a change in a coefficient of the objective function affect the optimal solution? How will a change in.
Nonlinear Programming McCarl and Spreen Chapter 12.
Introducción a la Optimización de procesos químicos. Curso 2005/2006 BASIC CONCEPTS IN OPTIMIZATION: PART II: Continuous & Unconstrained Important concepts.
Engineering Optimization
Lecture 8 – Nonlinear Programming Models Topics General formulations Local vs. global solutions Solution characteristics Convexity and convex programming.
Empirical Maximum Likelihood and Stochastic Process Lecture VIII.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
1. 2 Local maximum Local minimum 3 Saddle point.
Operation Research Chapter 3 Simplex Method.
Optimization in Engineering Design 1 Lagrange Multipliers.
Numerical Optimization
Engineering Optimization
Economics 214 Lecture 37 Constrained Optimization.
Constrained Optimization
Constrained Optimization Rong Jin. Outline  Equality constraints  Inequality constraints  Linear Programming  Quadratic Programming.
Lecture 35 Constrained Optimization
Constrained Optimization Economics 214 Lecture 41.
MAE 552 – Heuristic Optimization Lecture 1 January 23, 2002.
Minimal Neural Networks Support vector machines and Bayesian learning for neural networks Peter Andras
Tutorial 10 Iterative Methods and Matrix Norms. 2 In an iterative process, the k+1 step is defined via: Iterative processes Eigenvector decomposition.
D Nagesh Kumar, IIScOptimization Methods: M2L3 1 Optimization using Calculus Optimization of Functions of Multiple Variables: Unconstrained Optimization.
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.
Definition and Properties of the Cost Function
Tier I: Mathematical Methods of Optimization
Introduction to Optimization (Part 1)
KKT Practice and Second Order Conditions from Nash and Sofer
LINEAR PROGRAMMING SIMPLEX METHOD.
1. Problem Formulation. General Structure Objective Function: The objective function is usually formulated on the basis of economic criterion, e.g. profit,
Mathematics Numbers: Exponents Science and Mathematics Education Research Group Supported by UBC Teaching and Learning Enhancement Fund Department.
Mathematics Relations and Functions: Factoring Polynomials Science and Mathematics Education Research Group Supported by UBC Teaching and Learning Enhancement.
CS Statistical Machine learning Lecture 18 Yuan (Alan) Qi Purdue CS Oct
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus.
Comparative Statics and Duality of the Cost Function Lecture VII.
Machine Learning Weak 4 Lecture 2. Hand in Data It is online Only around 6000 images!!! Deadline is one week. Next Thursday lecture will be only one hour.
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.
Lecture 26 Molecular orbital theory II
Optimization unconstrained and constrained Calculus part II.
Part 4 Nonlinear Programming 4.1 Introduction. Standard Form.
Mathe III Lecture 7 Mathe III Lecture 7. 2 Second Order Differential Equations The simplest possible equation of this type is:
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:
Introduction to Optimization
Calculus-Based Optimization AGEC 317 Economic Analysis for Agribusiness and Management.
Economics 2301 Lecture 37 Constrained Optimization.
1 Teaching Innovation - Entrepreneurial - Global The Centre for Technology enabled Teaching & Learning, N Y S S, India DTEL DTEL (Department for Technology.
Linear Programming Interior-Point Methods D. Eiland.
1 Introduction Optimization: Produce best quality of life with the available resources Engineering design optimization: Find the best system that satisfies.
1 Unconstrained and Constrained Optimization. 2 Agenda General Ideas of Optimization Interpreting the First Derivative Interpreting the Second Derivative.
Mathe III Lecture 8 Mathe III Lecture 8. 2 Constrained Maximization Lagrange Multipliers At a maximum point of the original problem the derivatives of.
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.
Optimal Control.
deterministic operations research
Part 4 Nonlinear Programming
Chapter 11 Optimization with Equality Constraints
Flow diagrams (i) (ii) (iii) x – Example
CS5321 Numerical Optimization
The Lagrange Multiplier Method
Part 4 Nonlinear Programming
Outline Unconstrained Optimization Functions of One Variable
Notes Over 1.7 Solving Inequalities
Notes Over 1.7 Solving Inequalities
CS5321 Numerical Optimization
Calculus-Based Optimization AGEC 317
Multivariable optimization with no constraints
Constraints.
Presentation transcript:

Inequality Constraints Lecture 7

Inequality Contraints (I) n A Review of Lagrange Multipliers –As we discussed last time, the first order necessary conditions for a constrained optimum include that the projected gradient has to equal to zero

Inequality Contraints (II) –An alternative condition based on lagrange multipliers is

Inequality Contraints (III) –Linking the lagrange and the null space

Inequality Contraints (IV) –A numerical example: »In the constrained optimization problem which we discussed in the last lecture, we derived an optimal solution of

Inequality Contraints (V) »The constraint matrix for the problem was

Inequality Contraints (V) »The Lagrangian multiplier condition for this problem then becomes

Inequality Contraints (VI) »Solving for 1 and 2 then involves solving for the reduced form of the linear system:

Inequality Contraints (VII) »Which yields a solution of

Inequality Contraints (VIII) –In a maximization problem: »If the constraint cuts the frontier below the global maximum the lagrange multiplier will take on a positive value implying that an increase in the right hand side of the constraint will increase the objective function value. »Similarly, if the constraint cuts the frontier above the global maximum the lagrange multiplier will take on a negative value implying that an increase in the right hand side of the constraint will cause the objective function to decline.

Inequality Contraints (IX) –Thus, in the portfolio problem, income is being constrained below its optimum. n In general, the optimality conditions for a inequality contrained optimum are little different than the conditions for an equality constrained optimum. The primary difference involves restricting the sign of the Lagrange multipliers.

Inequality Contraints (IX) –Conditions for an inequality constrained maximum or is negative semidefinite

Inequality Contraints (IX) –Given the same conditions, we see that the solution to the previous problem is not optimum since 2 = (the conditions for a greater than constraint under minimization are the same as the conditions for less than constraints under maximization except that under minimization the projected Hessian must be positive definite.

Inequality Contraints (X) –Taking a new problem from the Constrained2.ma notebook, assume that we want to maximize utility defined as

Inequality Contraints (XI) –We see that the unconstrained problem has a global maximum in the positive quadrant. The exact maximum The income required to reach this optimum vector is 33.06

Inequality Contraints (XII) –Thus, we want to evaluate two scenarios. Under the first scenario the level of income is set at 40.0 which is beyond the level required for the global maximum. »Under this scenario we solve

Inequality Contraints (XIII) which yields an optimum of and an optimal of which does not satisfy the condition for an optimum that  > 0.

Inequality Contraints (XIV) –The second scenario then involves constraining y to be less than 30. »Under this scenario, the optimal solution becomes With a of Thus, the Lagrange multiplier condition is met