Basic Concepts, Necessary and Sufficient conditions

Slides:



Advertisements
Similar presentations
The Maximum Principle: Continuous Time Main purpose: to introduce the maximum principle as a necessary condition that must be satisfied by any optimal.
Advertisements

Optimization 4.7. A Classic Problem You have 40 feet of fence to enclose a rectangular garden along the side of a barn. What is the maximum area that.
Empirical Maximum Likelihood and Stochastic Process Lecture VIII.
Optimization.
© 2011 Autodesk Freely licensed for use by educational institutions. Reuse and changes require a note indicating that content has been modified from the.
Calculus of Variations
Constrained Optimization
Theoretical Mechanics - PHY6200 Chapter 6 Introduction to the calculus of variations Prof. Claude A Pruneau, Physics and Astronomy Department Wayne State.
Finding a free maximum Derivatives and extreme points Using second derivatives to identify a maximum/minimum.
MECH 221 FLUID MECHANICS (Fall 06/07) Chapter 3: FLUID IN MOTIONS
Applied Economics for Business Management
Scientific Computing Partial Differential Equations Poisson Equation Calculus of Variations.
Lecture #7. Lecture Outline Review Go over Exam #1 Continue production economic theory.
Lecture 35 Numerical Analysis. Chapter 7 Ordinary Differential Equations.
CHAPTER 3 SECTION 3.7 OPTIMIZATION PROBLEMS. Applying Our Concepts We know about max and min … Now how can we use those principles?
AUTOMATIC CONTROL THEORY II Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Applied Economics for Business Management Lecture #8.
D Nagesh Kumar, IIScOptimization Methods: M2L4 1 Optimization using Calculus Optimization of Functions of Multiple Variables subject to Equality Constraints.
PEM2046 Engineering Mathematics IV PEM2046 Engineering Mathematics IV Final Review Trimester /2002 Session.
Mathe III Lecture 8 Mathe III Lecture 8. 2 Constrained Maximization Lagrange Multipliers At a maximum point of the original problem the derivatives of.
USSC3002 Oscillations and Waves Lecture 10 Calculus of Variations Wayne M. Lawton Department of Mathematics National University of Singapore 2 Science.
(iii) Lagrange Multipliers and Kuhn-tucker Conditions D Nagesh Kumar, IISc Introduction to Optimization Water Resources Systems Planning and Management:
Optimal Path Planning Using the Minimum-Time Criterion by James Bobrow Guha Jayachandran April 29, 2002.
Review of PMP Derivation We want to find control u(t) which minimizes the function: x(t) = x*(t) +  x(t); u(t) = u*(t) +  u(t); (t) = *(t) +  (t);
Copyright © Cengage Learning. All rights reserved. 14 Partial Derivatives.
Section Lagrange Multipliers.
Section 15.3 Constrained Optimization: Lagrange Multipliers.
1 Introduction Optimization: Produce best quality of life with the available resources Engineering design optimization: Find the best system that satisfies.
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.
Chapter 12 Graphs and the Derivative Abbas Masum.
Canonical Quantization
Physics 312: Lecture 2 Calculus of Variations
L6 Optimal Design concepts pt B
deterministic operations research
Modeling of Traffic Flow Problems
Water Resources Planning and Management Daene McKinney
Calculus-Based Solutions Procedures MT 235.
Differential Equations
FIRST ORDER DIFFERENTIAL EQUATIONS
Ch 2.1: Linear Equations; Method of Integrating Factors
Vector Calculus and Quadratic function
Optimal control T. F. Edgar Spring 2012.
Constrained Optimization
Dr. Arslan Ornek IMPROVING SEARCH
Unconstrained and Constrained Optimization
Physics 319 Classical Mechanics
Lesson 4-4: Modeling and Optimization
The Lagrange Multiplier Method
Calculus of Variations
AP Calculus BC September 30, 2016.
RECTILINEAR KINEMATICS: CONTINUOUS MOTION
7.5 – Constrained Optimization: The Method of Lagrange Multipliers
Solving Systems of Equation by Substitution
Stationary Point Notes
RECTILINEAR KINEMATICS: CONTINUOUS MOTION
Differentiation Summary
Application of Differentiation
Unit 5: Introduction to Differential Calculus
Section 9.4 – Solving Differential Equations Symbolically
Calculus I (MAT 145) Dr. Day Wednesday April 10, 2019
Identifying Stationary Points
Optimal Control of Systems
Analysis of Basic PMP Solution
Part 7 Optimization in Functional Space
Constant Jerk Trajectory Generator (TG)
Multivariable optimization with no constraints
Analyzing Multivariable Change: Optimization
Presentation transcript:

Basic Concepts, Necessary and Sufficient conditions Dynamic Optimization Basic Concepts, Necessary and Sufficient conditions Lecture 30

Concept of function and functional … Functional: It is a function of other functions Examples: 𝑓( 𝑓 1 𝑥 , 𝑓 2 𝑥 … 𝑓 𝑛 𝑥 ) 𝑓(𝑥 𝑡 , 𝑥 𝑡 ,𝑡) 𝐽 𝑣 𝑡 = 𝑡 0 𝑡 𝑓 𝑣 𝑡 𝑑𝑡 It represents distance traveled, v(t) is velocity In general 𝐽 𝑥 𝑡 ,𝑡 = 𝑡 0 𝑡 𝑓 𝑣(𝑥 𝑡 ,𝑡)𝑑𝑡

Concept of function and functional … Increment of functional: Consider following functional 𝐽 𝑥 𝑡 ,𝑡 = 𝑡 0 𝑡 𝑓 𝑣(𝑥 𝑡 ,𝑡)𝑑𝑡 ∆𝐽 𝑥 𝑡 ,𝑡 =𝐽 𝑥 𝑡 +𝛿𝑥(𝑡),𝑡 −𝐽 𝑥 𝑡 ,𝑡 ---(1) Do Taylor’s series expansion of 2nd term ∆𝐽 𝑥 𝑡 ,𝑡 =𝐽 𝑥 ∗ 𝑡 ,𝑡 + 1 1! 𝜕𝐽 . 𝜕𝑥 𝑥 𝑡 = 𝑥 ∗ 𝑡 𝛿𝑥 𝑡 + 1 2! 𝜕 2 𝐽 . 𝜕𝑥 2 𝑥 𝑡 = 𝑥 ∗ 𝑡 𝛿𝑥(𝑡) 2 +…−𝐽 𝑥 ∗ 𝑡 ,𝑡 Perturbation

Concept of function and functional … ∆𝐽 𝑥 𝑡 ,𝑡 = 1 1! 𝜕𝐽 . 𝜕𝑥 𝑥 𝑡 = 𝑥 ∗ 𝑡 𝛿𝑥 𝑡 + 1 2! 𝜕 2 𝐽 . 𝜕𝑥 2 𝑥 𝑡 = 𝑥 ∗ 𝑡 𝛿𝑥(𝑡) 2 ∆𝐽=𝛿𝐽 +𝛿 2 𝐽 Necessary condition for a functional to be extremum (min or max) 𝛿𝐽=0 and If 𝛿 2 𝐽>0 functional value is minimum If 𝛿 2 𝐽<0 functional value is maximum 𝛿𝐽 1st variation of functional 𝛿 2 𝐽 2nd variation of functional Neglecting higher order terms

Two point boundary value problem (TPBVP)

is optimized (Extrimum -> maximize or minimize) Assumptions: Problem 1: Our problem is to find out the optimal trajectory x*(t) for which the functional 𝐽 𝑥 𝑡 ,𝑡 = 𝑡 0 𝑡 𝑓 𝑣(𝑥 𝑡 , 𝑥 𝑡 ,𝑡)𝑑𝑡 ---(1) is optimized (Extrimum -> maximize or minimize) Assumptions: V(.) has 1st and 2nd partial derivatives w.r.t all its arguments

Necessary Conditions: 𝜕𝑉 . 𝜕𝑥 𝑡 − 𝑑 𝑑𝑡 𝜕𝑉 . 𝜕 𝑥 𝑡 = 0 𝑛×1 ---(1) 𝑣 . − 𝜕𝑉 . 𝜕 𝑥 𝑡 𝑇 𝑥 (𝑡) 𝑡= 𝑡 𝑓 =0 ---(2) if 𝑡 𝑓 is free, ⇒𝛿 𝑡 𝑓 ≠0 𝜕𝑉 . 𝜕 𝑥 𝑡 𝑡= 𝑡 𝑓 =0 ---(3) if 𝑥(𝑡 𝑓 ) is free, ⇒𝛿 𝑥 𝑓 ≠0 (1) Euler’s Lagrange equation(E.L equation). (2) & (3) Transversality conditions

Necessary Conditions:… Case 1: when both end are fixed i.e 𝑡 𝑓 and 𝑥(𝑡 𝑓 ) are fixed We need to solve equation (1) to get optimum trajectory 𝑥 ∗ (𝑡)

Necessary Conditions:… A(t0, x(t0)) B(tf , x(tf)) t0 tf x(t0)=x0 x(tf)=xf t Say this is optimal path 𝑥 𝑎 𝑡 = 𝑥 ∗ 𝑡 +𝛿𝑥(𝑡) 𝑥 ∗ 𝑡 𝑥(𝑡) This is suboptimal path very close to x*(t) 𝛿𝑥(𝑡)

Necessary Conditions:… Case 2: when 𝑡 𝑓 and 𝑥(𝑡 𝑓 ) are free We need to solve equations (1), (2) & (3) to get optimum trajectory 𝑥 ∗ (𝑡) A t0 tf t 𝑥(𝑡) 𝑡 𝑓 +𝛿 𝑡 𝑓 D C 𝑥 ∗ (𝑡) 𝑥 𝑎 𝑡 = 𝑥 ∗ 𝑡 +𝛿𝑥(𝑡)

Necessary Conditions:… Case 3: when 𝑡 𝑓 is fixed but 𝑥(𝑡 𝑓 ) is free We need to solve equations (1) & (2) to get optimum trajectory 𝑥 ∗ (𝑡) t0 tf t 𝑥(𝑡) 𝑡 𝑓 +𝛿 𝑡 𝑓 𝑥 ∗ (𝑡) 𝑥 𝑎 𝑡 = 𝑥 ∗ 𝑡 +𝛿𝑥(𝑡) 𝑥(𝑡 𝑓 )

Necessary Conditions:… Case 4: when 𝑡 𝑓 is free but 𝑥(𝑡 𝑓 ) is fixed We need to solve equations (1) & (3) to get optimum trajectory 𝑥 ∗ (𝑡) t0 t 𝑥(𝑡) 𝑡 𝑓 𝑥 ∗ (𝑡) 𝑥 𝑎 𝑡 = 𝑥 ∗ 𝑡 +𝛿𝑥(𝑡)

Necessary Conditions:… Case 5: When end point B restricted to a curve g(t) t0 t 𝑥(𝑡) 𝑡 𝑓 𝑥 ∗ (𝑡) 𝑥 𝑎 𝑡 = 𝑥 ∗ 𝑡 +𝛿𝑥(𝑡) g(t) D C 𝛿𝑥 𝑓 =𝛿𝑥( 𝑡 𝑓 +𝛿 𝑡 𝑓 ) B A 𝑡 𝑓 +𝛿 𝑡 𝑓

Necessary Conditions:… 𝑣 . − 𝜕𝑉 . 𝜕 𝑥 𝑡 𝑇 𝑥 𝑡 − 𝑔 (𝑡) 𝑡= 𝑡 𝑓 =0 ---(4) Equ (4) is also known as Transversality conditions for the case when the end point B is restricted on a curve g(t). We need to solve equations (1) & (4) to get optimum trajectory 𝑥 ∗ (𝑡)

Sufficient condition Condition to check whether the given functional is maximum or minimum Similar to sufficient condition of static optimization problem

Sufficient condition… ⇒ 𝛻 2 𝐽= 1 2! 𝑡 0 𝑡 𝑓 𝛿𝑥(𝑡) 𝛿 𝑥 (𝑡) 𝜕 2 𝑉 . 𝜕 𝑥 2 𝑡 𝜕𝑉 . 𝜕𝑥 𝑡 𝜕 𝑥 𝑡 𝜕𝑉 . 𝜕𝑥 𝑡 𝜕 𝑥 𝑡 𝜕 2 𝑉 . 𝜕 𝑥 2 𝑡 ∗ 𝛿𝑥(𝑡) 𝛿 𝑥 (𝑡) 𝑑𝑡 Say P which is a 2nx2n matrix as each 2nd derivative of V(.) is nxn matrix

Sufficient condition… If 𝛻 2 𝐽>0⇒𝑃>0 (+𝑑𝑒𝑓𝑖𝑛𝑒𝑖𝑡𝑒) => functional value will be minimum =>J*(.) will be the minimum value along with the optimum trajectory x*(t) If 𝛻 2 𝐽<0⇒𝑃<0 (−𝑑𝑒𝑓𝑖𝑛𝑒𝑖𝑡𝑒) => functional value will be maximum =>J*(.) will be the maximum value along with the optimum trajectory x*(t)

Example: (Using calculus of variation) Example 1: Find the extremal for the functional 𝐽= 𝑡 0 =0 𝑡 𝑓 2 𝑥 2 𝑡 +24𝑡𝑥 𝑡 𝑑𝑡 Where the left hand point (A) is fixed i.e. t0 =0 & x(t0) =0 And in right hand point (B) tf is free but x(tf) = 2

Example:… Solution: This is following problem 𝑉 . =2 𝑥 2 𝑡 +24𝑡𝑥 𝑡 𝑉 . =2 𝑥 2 𝑡 +24𝑡𝑥 𝑡 t0 tf t 𝑥(𝑡) 𝑡 𝑓 +𝛿 𝑡 𝑓 𝑥 ∗ (𝑡) 𝑥 𝑎 𝑡 = 𝑥 ∗ 𝑡 +𝛿𝑥(𝑡) 𝑥(𝑡 𝑓 )=2

Example:… E.L equation 𝜕𝑉 . 𝜕𝑥 𝑡 − 𝑑 𝑑𝑡 𝜕𝑉 . 𝜕 𝑥 𝑡 = 0 1×1 (x is scalar variable) ⇒24𝑡− 𝑑 𝑑𝑡 4 𝑥 (𝑡) =0 ⇒24𝑡−4 𝑥 (𝑡)=0 ⇒ 𝑥 (𝑡)=6𝑡 ---(1) Solving above equation, Integrating equ(1) 𝑥 𝑡 𝑑𝑡= 6𝑡𝑑𝑡 ⇒ 𝑥 𝑡 =3 𝑡 2 + 𝑐 1 ---(2) again integrating ⇒ 𝑥 𝑡 𝑑𝑡= 3 𝑡 2 + 𝑐 1 𝑑𝑡 ⇒𝑥 𝑡 = 𝑡 3 + 𝑐 1 𝑡+ 𝑐 2 ---(3)

Example:… Put t=t0=0 in equation (3) 𝑥 𝑡 =0= 0 3 + 𝑐 1 ×0+ 𝑐 2 ⇒𝑐 2 =0 put in equation (3) ⇒𝑥 𝑡 = 𝑡 3 + 𝑐 1 𝑡 ---(4) Put t=tf & 𝑥 𝑡 𝑓 =2 in equation (4) 𝑥 𝑡 𝑓 =2= 𝑡 𝑓 3 + 𝑐 1 𝑡 𝑓 ⇒𝑐 1 = 2− 𝑡 𝑓 3 𝑡 𝑓 ---(5)

Example:… Transversality condition: Here 𝑡 𝑓 is free, so 𝑣 . − 𝜕𝑉 . 𝜕 𝑥 𝑡 𝑇 𝑥 (𝑡) 𝑡= 𝑡 𝑓 =0 2 𝑥 2 𝑡 +24𝑡𝑥 𝑡 −(4 𝑥 (𝑡)) 𝑥 (𝑡) 𝑡= 𝑡 𝑓 =0 dividing by 2 ⇒ 𝑥 2 𝑡 𝑓 +12 𝑡 𝑓 𝑥 𝑡 𝑓 −2 𝑥 2 ( 𝑡 𝑓 ) ⇒ 𝑥 2 𝑡 𝑓 −12 𝑡 𝑓 𝑥 𝑡 𝑓 =0 put value of 𝑥 (𝑡) from equ(2) ⇒ 3 𝑡 𝑓 2 + 𝑐 1 2 −12 𝑡 𝑓 𝑥 𝑡 𝑓 =0 put 𝑥 𝑡 𝑓 =2 ⇒9 𝑡 𝑓 4 + 𝑐 1 2 +6 𝑡 𝑓 2 𝑐 1 −24 𝑡 𝑓 =0

Example:… Put the value of 𝑐 1 = 2− 𝑡 𝑓 3 𝑡 𝑓 from equ (5) in previous equ ⇒9 𝑡 𝑓 4 + 2− 𝑡 𝑓 3 𝑡 𝑓 2 +6 𝑡 𝑓 2 2− 𝑡 𝑓 3 𝑡 𝑓 −24 𝑡 𝑓 =0 ⇒𝑡 𝑓 6 −4 𝑡 𝑓 3 +1=0 Put 𝑡 𝑓 3 =𝑧 𝑧 2 −4𝑧+1=0 ⇒𝑧=2± 3 =3.732, 0.2679 ⇒ 𝑡 𝑓 = 3 3.732 & 3 0.2679 ⇒ 𝑡 𝑓 =1.551 & 0.6446

Example:… For 𝑡 𝑓 =1.551 , 𝑐 1 = 2− 𝑡 𝑓 3 𝑡 𝑓 =−1.117 so 𝑥 ∗ 𝑡 = 𝑡 3 + 𝑐 1 𝑡= 𝑡 3 −1.117𝑡 ---(6) For 𝑡 𝑓 =0.6446 , 𝑐 1 = 2− 𝑡 𝑓 3 𝑡 𝑓 =2.6871so 𝑥 ∗ 𝑡 = 𝑡 3 + 𝑐 1 𝑡= 𝑡 3 +2.6871𝑡 --(7) There are two optimal trajectory given by (6) & (7), one will give minimum value other will give maximum value. For this apply sufficient condition

Example:… sufficient condition 𝑃= 𝜕 2 𝑉 . 𝜕 𝑥 2 𝑡 𝜕𝑉 . 𝜕𝑥 𝑡 𝜕 𝑥 𝑡 𝜕𝑉 . 𝜕𝑥 𝑡 𝜕 𝑥 𝑡 𝜕 2 𝑉 . 𝜕 𝑥 2 𝑡 ∗ If 𝑃>0 (+𝑑𝑒𝑓𝑖𝑛𝑒𝑖𝑡𝑒) => functional J*(.) value will be minimum If 𝑃<0 (−𝑑𝑒𝑓𝑖𝑛𝑒𝑖𝑡𝑒) => functional J*(.) value will be maximum