SlideShare a Scribd company logo
D Nagesh Kumar, IISc Optimization Methods: M2L11
Optimization using Calculus
Stationary Points:
Functions of Single
and Two Variables
D Nagesh Kumar, IISc Optimization Methods: M2L12
Objectives
To define stationary points
Look into the necessary and sufficient conditions for the
relative maximum of a function of a single variable and
for a function of two variables.
To define the global optimum in comparison to the
relative or local optimum
D Nagesh Kumar, IISc Optimization Methods: M2L13
Stationary points
For a continuous and differentiable function f(x) a
stationary point x* is a point at which the function
vanishes, i.e. f ’(x) = 0 at x = x*. x* belongs to its domain
of definition.
A stationary point may be a minimum, maximum or an
inflection point
D Nagesh Kumar, IISc Optimization Methods: M2L14
Stationary points
Figure showing the three types of stationary points (a) inflection point
(b) minimum (c) maximum
D Nagesh Kumar, IISc Optimization Methods: M2L15
Relative and Global Optimum
• A function is said to have a relative or local minimum at x = x* if
for all sufficiently small positive and negative
values of h, i.e. in the near vicinity of the point x.
• Similarly, a point x* is called a relative or local maximum if
for all values of h sufficiently close to zero.
• A function is said to have a global or absolute minimum at x = x* if
for all x in the domain over which f(x) is defined.
• Similarly, a function is said to have a global or absolute maximum at
x = x* if for all x in the domain over which f (x) is
defined.
*
( ) ( )f x f x h≤ +
*
( ) ( )f x f x h≥ +
*
( ) ( )f x f x≤
*
( ) ( )f x f x≥
D Nagesh Kumar, IISc Optimization Methods: M2L16
Relative and Global Optimum …contd.
a b a b
x x
f(x)f(x)
.
.
.
.
.
.
A1
B1
B2
A3
A2
Relative minimum is
also global optimum
A1, A2, A3 = Relative maxima
A2 = Global maximum
B1, B2 = Relative minima
B1 = Global minimum
Fig. 2
D Nagesh Kumar, IISc Optimization Methods: M2L17
Functions of a single variable
Consider the function f(x) defined for
To find the value of x* such that x* maximizes f(x) we need
to solve a single-variable optimization problem.
We have the following theorems to understand the necessary and
sufficient conditions for the relative maximum of a function of a
single variable.
a x b≤ ≤
[ , ]a b∈
D Nagesh Kumar, IISc Optimization Methods: M2L18
Functions of a single variable …contd.
Necessary condition : For a single variable function f(x) defined for x
which has a relative maximum at x = x* , x* if the
derivative f ‘(x) = df(x)/dx exists as a finite number at x = x* then
f ‘(x*) = 0.
We need to keep in mind that the above theorem holds good for
relative minimum as well.
The theorem only considers a domain where the function is
continuous and derivative.
It does not indicate the outcome if a maxima or minima exists at a
point where the derivative fails to exist. This scenario is shown in the
figure below, where the slopes m1 and m2 at the point of a maxima are
unequal, hence cannot be found as depicted by the theorem.
[ , ]a b∈ [ , ]a b∈
D Nagesh Kumar, IISc Optimization Methods: M2L19
Functions of a single variable …contd.
Some Notes:
The theorem does not consider if
the maxima or minima occurs at
the end point of the interval of
definition.
The theorem does not say that the
function will have a maximum or
minimum at every point where
f ’(x) = 0, since this condition
f ’(x) = 0 is for stationary points
which include inflection points
which do not mean a maxima or
a minima.
D Nagesh Kumar, IISc Optimization Methods: M2L110
Sufficient condition
For the same function stated above let f ’(x*) = f ”(x*) = . . .
= f (n-1)(x*) = 0, but f (n)(x*) 0, then it can be said that
f (x*) is
– (a) a minimum value of f (x) if f (n)(x*) > 0 and n is even
– (b) a maximum value of f (x) if f (n)(x*) < 0 and n is even
– (c) neither a maximum or a minimum if n is odd
≠
D Nagesh Kumar, IISc Optimization Methods: M2L111
Example 1
Find the optimum value of the function
and also state if the function attains a maximum or a
minimum.
Solution
for maxima or minima.
or x* = -3/2
which is positive hence the point x* = -3/2 is a point of
minima and the function attains a minimum value of -29/4 at this point.
2
( ) 3 5f x x x= + −
'( ) 2 3 0f x x= + =
''( *) 2f x =
D Nagesh Kumar, IISc Optimization Methods: M2L112
Example 2
Find the optimum value of the function and
also state if the function attains a maximum or a minimum
Solution:
4
( ) ( 2)f x x= −
3
'( ) 4( 2) 0f x x= − = or x = x* = 2 for maxima or minima.
2
''( *) 12( * 2) 0f x x= − = at x* = 2
'''( *) 24( * 2) 0f x x= − = at x* = 2
( ) 24*
=′′′′ xf at x* = 2
Hence fn(x) is positive and n is even hence the point x = x* = 2 is a point of
minimum and the function attains a minimum value of 0 at this point.
D Nagesh Kumar, IISc Optimization Methods: M2L113
Example 3
Analyze the function and
classify the stationary points as maxima, minima and points
of inflection.
Solution:
Consider the point x = x* = 0
at x * = 0
at x * = 0
5 4 3
( ) 12 45 40 5f x x x x= − + +
4 3 2
4 3 2
'( ) 60 180 120 0
3 2 0
or 0,1,2
f x x x x
x x x
x
= − + =
=> − + =
=
'' * * 3 * 2 *
( ) 240( ) 540( ) 240 0f x x x x= − + =
''' * * 2 *
( ) 720( ) 1080 240 240f x x x= − + =
D Nagesh Kumar, IISc Optimization Methods: M2L114
Example 3 …contd.
Since the third derivative is non-zero, x = x* = 0 is neither a point of
maximum or minimum but it is a point of inflection
Consider x = x* = 1
at x* = 1
Since the second derivative is negative the point x = x* = 1 is a point of
local maxima with a maximum value of f(x) = 12 – 45 + 40 + 5 = 12
Consider x = x* = 2
at x* = 2
Since the second derivative is positive, the point x = x* = 2 is a point of
local minima with a minimum value of f(x) = -11
'' * * 3 * 2 *
( ) 240( ) 540( ) 240 60f x x x x= − + = −
'' * * 3 * 2 *
( ) 240( ) 540( ) 240 240f x x x x= − + =
D Nagesh Kumar, IISc Optimization Methods: M2L115
Example 4
The horse power generated by a Pelton wheel is proportional to u(v-u) where
u is the velocity of the wheel, which is variable and v is the velocity of the jet
which is fixed. Show that the efficiency of the Pelton wheel will be maximum
at u = v/2.
Solution:
where K is a proportionality constant (assumed positive).
which is negative. Hence, f is maximum at
K. ( )
0 K 2K 0
or
2
f u v u
f
v u
u
v
u
= −
∂
= => − =
∂
=
2
2
2K
v
u
f
u =
∂
= −
∂
2
2
v
u =
D Nagesh Kumar, IISc Optimization Methods: M2L116
Functions of two variables
The concept discussed for one variable functions
may be easily extended to functions of multiple
variables.
Functions of two variables are best illustrated by
contour maps, analogous to geographical maps.
A contour is a line representing a constant value of f(x)
as shown in the following figure. From this we can
identify maxima, minima and points of inflection.
D Nagesh Kumar, IISc Optimization Methods: M2L117
A contour plot
D Nagesh Kumar, IISc Optimization Methods: M2L118
Necessary conditions
As can be seen in the above contour map, perturbations
from points of local minima in any direction result in an
increase in the response function f(x), i.e.
the slope of the function is zero at this point of local
minima.
Similarly, at maxima and points of inflection as the slope
is zero, the first derivative of the function with respect to
the variables are zero.
D Nagesh Kumar, IISc Optimization Methods: M2L119
Necessary conditions …contd.
Which gives us at the stationary points. i.e. the
gradient vector of f(X), at X = X* = [x1 , x2] defined as follows,
must equal zero:
This is the necessary condition.
1 2
0; 0
f f
x x
∂ ∂
= =
∂ ∂
1
2
( *)
0
( *)
x
f
x
f
f
x
∂⎡ ⎤
Χ⎢ ⎥∂
⎢ ⎥Δ = =
∂⎢ ⎥
Χ⎢ ⎥∂⎣ ⎦
x fΔ
D Nagesh Kumar, IISc Optimization Methods: M2L120
Sufficient conditions
Consider the following second order derivatives:
The Hessian matrix defined by H is made using the above second
order derivatives.
2 2 2
2 2
1 2 1 2
; ;
f f f
x x x x
∂ ∂ ∂
∂ ∂ ∂ ∂
1 2
2 2
2
1 1 2
2 2
2
1 2 2 [ , ]x x
f f
x x x
f f
x x x
⎛ ⎞∂ ∂
⎜ ⎟
∂ ∂ ∂⎜ ⎟=
⎜ ⎟∂ ∂
⎜ ⎟⎜ ⎟∂ ∂ ∂⎝ ⎠
H
D Nagesh Kumar, IISc Optimization Methods: M2L121
Sufficient conditions …contd.
The value of determinant of the H is calculated and
if H is positive definite then the point X = [x1, x2] is a
point of local minima.
if H is negative definite then the point X = [x1, x2] is a
point of local maxima.
if H is neither then the point X = [x1, x2] is neither a
point of maxima nor minima.
D Nagesh Kumar, IISc Optimization Methods: M2L122
Example 5
Locate the stationary points of f(X) and classify them as relative
maxima, relative minima or neither based on the rules discussed in the
lecture.
Solution
3 2
1 1 2 1 2 2( ) 2 /3 2 5 2 4 5f x x x x x x= − − + + +X
D Nagesh Kumar, IISc Optimization Methods: M2L123
Example 5 …contd.
From ,
So the two stationary points are
X1 = [-1,-3/2] and X2 = [3/2,-1/4]
1
(X) 0
f
x
∂
=
∂
2
2 28 14 3 0x x+ + =
2 2(2 3)(4 1) 0x x+ + =
2 23/ 2 or 1/ 4x x= − = −
D Nagesh Kumar, IISc Optimization Methods: M2L124
Example 5 …contd.
The Hessian of f(X) is
At X1 = [-1,-3/2] ,
2 2 2 2
12 2
1 2 1 2 2 1
4 ; 4; 2
f f f f
x
x x x x x x
∂ ∂ ∂ ∂
= = = = −
∂ ∂ ∂ ∂ ∂ ∂
14 2
2 4
x −⎡ ⎤
= ⎢ ⎥−⎣ ⎦
H
14 2
2 4
xλ
λ
λ
−
=
−
I - H
4 2
( 4)( 4) 4 0
2 4
λ
λ λ λ
λ
+
= = + − − =
−
I - H
2
16 4 0λ − − =
1 212 12λ λ= + = −
Since one eigen value is positive
and one negative, X1 is neither
a relative maximum nor a
relative minimum
D Nagesh Kumar, IISc Optimization Methods: M2L125
Example 5 …contd.
At X2 = [3/2,-1/4]
Since both the eigen values are positive, X-2 is a local minimum.
Minimum value of f(x) is -0.375
6 2
( 6)( 4) 4 0
2 4
λ
λ λ λ
λ
−
= = − − − =
−
I - H
1 25 5 5 5λ λ= + = −
D Nagesh Kumar, IISc Optimization Methods: M2L126
Example 6
Maximize f(X) =
;
2 2
1 1 2 220 2 6 3 / 2x x x x+ − + −
1 1
2
2
( *)
2 2 0
6 3 0
( *)
x
f
x x
f
xf
x
∂⎡ ⎤
Χ⎢ ⎥∂ −⎡ ⎤ ⎡ ⎤⎢ ⎥Δ = = =⎢ ⎥ ⎢ ⎥−∂⎢ ⎥ ⎣ ⎦⎣ ⎦Χ⎢ ⎥∂⎣ ⎦
X* = [1,2]
2 2 2
2 2
1 2 1 2
2; 3; 0
f f f
x x x x
∂ ∂ ∂
= − = − =
∂ ∂ ∂ ∂
2 0
0 3
−⎡ ⎤
= ⎢ ⎥−⎣ ⎦
H
D Nagesh Kumar, IISc Optimization Methods: M2L127
Example 6 …contd.
Since both the eigen values are negative, f(X) is concave and
the required ratio x1:x2 = 1:2 with a global maximum strength
of f(X) = 27 MPa
2 0
( 2)( 3) 0
0 3
λ
λ λ λ
λ
+
= = + + =
+
I - H
1 22 3andλ λ= − = −
D Nagesh Kumar, IISc Optimization Methods: M2L128
Thank you

More Related Content

What's hot

Goal Programming
Goal ProgrammingGoal Programming
Goal Programming
Evren E
 
Graphical Method
Graphical MethodGraphical Method
Graphical Method
Sachin MK
 
Mcq differential and ordinary differential equation
Mcq differential and ordinary differential equationMcq differential and ordinary differential equation
Mcq differential and ordinary differential equation
Sayyad Shafi
 
Simplex method concept,
Simplex method concept,Simplex method concept,
Simplex method concept,
Dronak Sahu
 
3.1 Extreme Values of Functions
3.1 Extreme Values of Functions3.1 Extreme Values of Functions
3.1 Extreme Values of Functions
Sharon Henry
 
X2 T05 04 reduction formula (2010)
X2 T05 04 reduction formula (2010)X2 T05 04 reduction formula (2010)
X2 T05 04 reduction formula (2010)
Nigel Simmons
 
APPLICATION OF LINEAR ALGEBRA IN ECONOMICS
APPLICATION OF LINEAR ALGEBRA IN ECONOMICSAPPLICATION OF LINEAR ALGEBRA IN ECONOMICS
APPLICATION OF LINEAR ALGEBRA IN ECONOMICS
Amit Garg
 

What's hot (20)

03 convexfunctions
03 convexfunctions03 convexfunctions
03 convexfunctions
 
Goal Programming
Goal ProgrammingGoal Programming
Goal Programming
 
Limit & continuity, B.Sc . 1 calculus , Unit - 1
Limit & continuity, B.Sc . 1 calculus , Unit - 1Limit & continuity, B.Sc . 1 calculus , Unit - 1
Limit & continuity, B.Sc . 1 calculus , Unit - 1
 
INTEGRATION BY PARTS PPT
INTEGRATION BY PARTS PPT INTEGRATION BY PARTS PPT
INTEGRATION BY PARTS PPT
 
Duality
DualityDuality
Duality
 
Application of linear programming technique for staff training of register se...
Application of linear programming technique for staff training of register se...Application of linear programming technique for staff training of register se...
Application of linear programming technique for staff training of register se...
 
Graphical Method
Graphical MethodGraphical Method
Graphical Method
 
Chapter 17 - Multivariable Calculus
Chapter 17 - Multivariable CalculusChapter 17 - Multivariable Calculus
Chapter 17 - Multivariable Calculus
 
Mcq differential and ordinary differential equation
Mcq differential and ordinary differential equationMcq differential and ordinary differential equation
Mcq differential and ordinary differential equation
 
Lesson 11: Limits and Continuity
Lesson 11: Limits and ContinuityLesson 11: Limits and Continuity
Lesson 11: Limits and Continuity
 
PRIMAL & DUAL PROBLEMS
PRIMAL & DUAL PROBLEMSPRIMAL & DUAL PROBLEMS
PRIMAL & DUAL PROBLEMS
 
Big M method
Big M methodBig M method
Big M method
 
Simplex method concept,
Simplex method concept,Simplex method concept,
Simplex method concept,
 
3.1 Extreme Values of Functions
3.1 Extreme Values of Functions3.1 Extreme Values of Functions
3.1 Extreme Values of Functions
 
X2 T05 04 reduction formula (2010)
X2 T05 04 reduction formula (2010)X2 T05 04 reduction formula (2010)
X2 T05 04 reduction formula (2010)
 
APPLICATION OF LINEAR ALGEBRA IN ECONOMICS
APPLICATION OF LINEAR ALGEBRA IN ECONOMICSAPPLICATION OF LINEAR ALGEBRA IN ECONOMICS
APPLICATION OF LINEAR ALGEBRA IN ECONOMICS
 
Operations Research - The Dual Simplex Method
Operations Research - The Dual Simplex MethodOperations Research - The Dual Simplex Method
Operations Research - The Dual Simplex Method
 
Duality in Linear Programming Problem
Duality in Linear Programming ProblemDuality in Linear Programming Problem
Duality in Linear Programming Problem
 
Big-M Method Presentation
Big-M Method PresentationBig-M Method Presentation
Big-M Method Presentation
 
primal and dual problem
primal and dual problemprimal and dual problem
primal and dual problem
 

Viewers also liked

Stationary Points Handout
Stationary Points HandoutStationary Points Handout
Stationary Points Handout
coburgmaths
 
IB Maths. Turning points. First derivative test
IB Maths. Turning points. First derivative testIB Maths. Turning points. First derivative test
IB Maths. Turning points. First derivative test
estelav
 
IB Maths.Turning points. Second derivative test
IB Maths.Turning points. Second derivative testIB Maths.Turning points. Second derivative test
IB Maths.Turning points. Second derivative test
estelav
 

Viewers also liked (20)

Stationary Points Handout
Stationary Points HandoutStationary Points Handout
Stationary Points Handout
 
IB Maths. Turning points. First derivative test
IB Maths. Turning points. First derivative testIB Maths. Turning points. First derivative test
IB Maths. Turning points. First derivative test
 
Stationary points
Stationary pointsStationary points
Stationary points
 
IB Maths.Turning points. Second derivative test
IB Maths.Turning points. Second derivative testIB Maths.Turning points. Second derivative test
IB Maths.Turning points. Second derivative test
 
Belief in allah
Belief in allahBelief in allah
Belief in allah
 
Numerical analysis m3 l6slides
Numerical analysis m3 l6slidesNumerical analysis m3 l6slides
Numerical analysis m3 l6slides
 
Allah’s wonderful creations by Ishtyag Al-Subhi
Allah’s wonderful creations by Ishtyag Al-SubhiAllah’s wonderful creations by Ishtyag Al-Subhi
Allah’s wonderful creations by Ishtyag Al-Subhi
 
Reciting Suratul Kahf on Jumuah
Reciting Suratul Kahf on JumuahReciting Suratul Kahf on Jumuah
Reciting Suratul Kahf on Jumuah
 
ISM Mathapadashala - NEAT group project 2008
ISM Mathapadashala - NEAT group project 2008ISM Mathapadashala - NEAT group project 2008
ISM Mathapadashala - NEAT group project 2008
 
Ahkaam wa aadaab eidul adha
Ahkaam wa aadaab eidul adhaAhkaam wa aadaab eidul adha
Ahkaam wa aadaab eidul adha
 
A home in heaven - സ്വര്‍ഗത്തില്‍ ഒരു വീട് ലഭിക്കാന്‍
A home in heaven - സ്വര്‍ഗത്തില്‍ ഒരു വീട് ലഭിക്കാന്‍A home in heaven - സ്വര്‍ഗത്തില്‍ ഒരു വീട് ലഭിക്കാന്‍
A home in heaven - സ്വര്‍ഗത്തില്‍ ഒരു വീട് ലഭിക്കാന്‍
 
Ormappedutthalukal sorry booklet to all
Ormappedutthalukal   sorry booklet to allOrmappedutthalukal   sorry booklet to all
Ormappedutthalukal sorry booklet to all
 
Traces of islamic history - MSM balavedi
Traces of islamic history - MSM balavediTraces of islamic history - MSM balavedi
Traces of islamic history - MSM balavedi
 
ISM mathapadashala PDF
ISM mathapadashala PDF ISM mathapadashala PDF
ISM mathapadashala PDF
 
Juzu one study notes
Juzu one study notesJuzu one study notes
Juzu one study notes
 
IT: pits and falls - MSM Residential moral school
IT: pits and falls - MSM Residential moral school IT: pits and falls - MSM Residential moral school
IT: pits and falls - MSM Residential moral school
 
Signs of Allah in Nature
Signs of Allah in NatureSigns of Allah in Nature
Signs of Allah in Nature
 
The Heart of the muslim community
The Heart of the muslim communityThe Heart of the muslim community
The Heart of the muslim community
 
Surat Al fathiha - Study notes (Malayalam)
Surat Al fathiha - Study notes (Malayalam)Surat Al fathiha - Study notes (Malayalam)
Surat Al fathiha - Study notes (Malayalam)
 
Where is Allah?
Where is Allah?Where is Allah?
Where is Allah?
 

Similar to Numerical analysis stationary variables

AOT2 Single Variable Optimization Algorithms.pdf
AOT2 Single Variable Optimization Algorithms.pdfAOT2 Single Variable Optimization Algorithms.pdf
AOT2 Single Variable Optimization Algorithms.pdf
SandipBarik8
 
OR Linear Programming
OR Linear ProgrammingOR Linear Programming
OR Linear Programming
chaitu87
 

Similar to Numerical analysis stationary variables (20)

Numerical analysis m2 l4slides
Numerical analysis  m2 l4slidesNumerical analysis  m2 l4slides
Numerical analysis m2 l4slides
 
Numerical analysis simplex method 2
Numerical analysis  simplex method 2Numerical analysis  simplex method 2
Numerical analysis simplex method 2
 
Numerical analysis simplex method 1
Numerical analysis  simplex method 1Numerical analysis  simplex method 1
Numerical analysis simplex method 1
 
AOT2 Single Variable Optimization Algorithms.pdf
AOT2 Single Variable Optimization Algorithms.pdfAOT2 Single Variable Optimization Algorithms.pdf
AOT2 Single Variable Optimization Algorithms.pdf
 
Chapter 2-1.pdf
Chapter 2-1.pdfChapter 2-1.pdf
Chapter 2-1.pdf
 
Graphical method
Graphical methodGraphical method
Graphical method
 
STA003_WK4_L.pptx
STA003_WK4_L.pptxSTA003_WK4_L.pptx
STA003_WK4_L.pptx
 
AEM.pptx
AEM.pptxAEM.pptx
AEM.pptx
 
9 Multi criteria Operation Decision Making - Nov 16 2020. pptx (ver2).pptx
9 Multi criteria Operation Decision Making - Nov 16 2020. pptx (ver2).pptx9 Multi criteria Operation Decision Making - Nov 16 2020. pptx (ver2).pptx
9 Multi criteria Operation Decision Making - Nov 16 2020. pptx (ver2).pptx
 
Evaluating Functions
Evaluating FunctionsEvaluating Functions
Evaluating Functions
 
M3L4.ppt
M3L4.pptM3L4.ppt
M3L4.ppt
 
Management Science
Management ScienceManagement Science
Management Science
 
OR Linear Programming
OR Linear ProgrammingOR Linear Programming
OR Linear Programming
 
L4 one sided limits limits at infinity
L4 one sided limits limits at infinityL4 one sided limits limits at infinity
L4 one sided limits limits at infinity
 
Doubly Accelerated Stochastic Variance Reduced Gradient Methods for Regulariz...
Doubly Accelerated Stochastic Variance Reduced Gradient Methods for Regulariz...Doubly Accelerated Stochastic Variance Reduced Gradient Methods for Regulariz...
Doubly Accelerated Stochastic Variance Reduced Gradient Methods for Regulariz...
 
Fractional programming (A tool for optimization)
Fractional programming (A tool for optimization)Fractional programming (A tool for optimization)
Fractional programming (A tool for optimization)
 
Determination of Optimal Product Mix for Profit Maximization using Linear Pro...
Determination of Optimal Product Mix for Profit Maximization using Linear Pro...Determination of Optimal Product Mix for Profit Maximization using Linear Pro...
Determination of Optimal Product Mix for Profit Maximization using Linear Pro...
 
Determination of Optimal Product Mix for Profit Maximization using Linear Pro...
Determination of Optimal Product Mix for Profit Maximization using Linear Pro...Determination of Optimal Product Mix for Profit Maximization using Linear Pro...
Determination of Optimal Product Mix for Profit Maximization using Linear Pro...
 
Numerical analysis m3 l2slides
Numerical analysis  m3 l2slidesNumerical analysis  m3 l2slides
Numerical analysis m3 l2slides
 
Numerical analysis kuhn tucker eqn
Numerical analysis  kuhn tucker eqnNumerical analysis  kuhn tucker eqn
Numerical analysis kuhn tucker eqn
 

More from SHAMJITH KM

നബി(സ)യുടെ നമസ്കാരം - രൂപവും പ്രാര്ത്ഥനകളും
നബി(സ)യുടെ നമസ്കാരം -  രൂപവും പ്രാര്ത്ഥനകളുംനബി(സ)യുടെ നമസ്കാരം -  രൂപവും പ്രാര്ത്ഥനകളും
നബി(സ)യുടെ നമസ്കാരം - രൂപവും പ്രാര്ത്ഥനകളും
SHAMJITH KM
 
Surveying - Module iii-levelling only note
Surveying - Module  iii-levelling only noteSurveying - Module  iii-levelling only note
Surveying - Module iii-levelling only note
SHAMJITH KM
 

More from SHAMJITH KM (20)

Salah of the Prophet (ﷺ).pdf
Salah of the Prophet (ﷺ).pdfSalah of the Prophet (ﷺ).pdf
Salah of the Prophet (ﷺ).pdf
 
Construction Materials and Engineering - Module IV - Lecture Notes
Construction Materials and Engineering - Module IV - Lecture NotesConstruction Materials and Engineering - Module IV - Lecture Notes
Construction Materials and Engineering - Module IV - Lecture Notes
 
Construction Materials and Engineering - Module III - Lecture Notes
Construction Materials and Engineering - Module III - Lecture NotesConstruction Materials and Engineering - Module III - Lecture Notes
Construction Materials and Engineering - Module III - Lecture Notes
 
Construction Materials and Engineering - Module II - Lecture Notes
Construction Materials and Engineering - Module II - Lecture NotesConstruction Materials and Engineering - Module II - Lecture Notes
Construction Materials and Engineering - Module II - Lecture Notes
 
Construction Materials and Engineering - Module I - Lecture Notes
Construction Materials and Engineering - Module I - Lecture NotesConstruction Materials and Engineering - Module I - Lecture Notes
Construction Materials and Engineering - Module I - Lecture Notes
 
Computing fundamentals lab record - Polytechnics
Computing fundamentals lab record - PolytechnicsComputing fundamentals lab record - Polytechnics
Computing fundamentals lab record - Polytechnics
 
Concrete lab manual - Polytechnics
Concrete lab manual - PolytechnicsConcrete lab manual - Polytechnics
Concrete lab manual - Polytechnics
 
Concrete Technology Study Notes
Concrete Technology Study NotesConcrete Technology Study Notes
Concrete Technology Study Notes
 
നബി(സ)യുടെ നമസ്കാരം - രൂപവും പ്രാര്ത്ഥനകളും
നബി(സ)യുടെ നമസ്കാരം -  രൂപവും പ്രാര്ത്ഥനകളുംനബി(സ)യുടെ നമസ്കാരം -  രൂപവും പ്രാര്ത്ഥനകളും
നബി(സ)യുടെ നമസ്കാരം - രൂപവും പ്രാര്ത്ഥനകളും
 
Design of simple beam using staad pro - doc file
Design of simple beam using staad pro - doc fileDesign of simple beam using staad pro - doc file
Design of simple beam using staad pro - doc file
 
Design of simple beam using staad pro
Design of simple beam using staad proDesign of simple beam using staad pro
Design of simple beam using staad pro
 
Python programs - PPT file (Polytechnics)
Python programs - PPT file (Polytechnics)Python programs - PPT file (Polytechnics)
Python programs - PPT file (Polytechnics)
 
Python programs - first semester computer lab manual (polytechnics)
Python programs - first semester computer lab manual (polytechnics)Python programs - first semester computer lab manual (polytechnics)
Python programs - first semester computer lab manual (polytechnics)
 
Python programming Workshop SITTTR - Kalamassery
Python programming Workshop SITTTR - KalamasseryPython programming Workshop SITTTR - Kalamassery
Python programming Workshop SITTTR - Kalamassery
 
Analysis of simple beam using STAAD Pro (Exp No 1)
Analysis of simple beam using STAAD Pro (Exp No 1)Analysis of simple beam using STAAD Pro (Exp No 1)
Analysis of simple beam using STAAD Pro (Exp No 1)
 
Theory of structures I - STUDENT NOTE BOOK (Polytechnics Revision 2015)
Theory of structures I - STUDENT NOTE BOOK (Polytechnics Revision 2015)Theory of structures I - STUDENT NOTE BOOK (Polytechnics Revision 2015)
Theory of structures I - STUDENT NOTE BOOK (Polytechnics Revision 2015)
 
Theory of structures II - STUDENT NOTE BOOK (Polytechnics Revision 2015)
Theory of structures II - STUDENT NOTE BOOK (Polytechnics Revision 2015)Theory of structures II - STUDENT NOTE BOOK (Polytechnics Revision 2015)
Theory of structures II - STUDENT NOTE BOOK (Polytechnics Revision 2015)
 
CAD Lab model viva questions
CAD Lab model viva questions CAD Lab model viva questions
CAD Lab model viva questions
 
Brain Computer Interface (BCI) - seminar PPT
Brain Computer Interface (BCI) -  seminar PPTBrain Computer Interface (BCI) -  seminar PPT
Brain Computer Interface (BCI) - seminar PPT
 
Surveying - Module iii-levelling only note
Surveying - Module  iii-levelling only noteSurveying - Module  iii-levelling only note
Surveying - Module iii-levelling only note
 

Recently uploaded

Automobile Management System Project Report.pdf
Automobile Management System Project Report.pdfAutomobile Management System Project Report.pdf
Automobile Management System Project Report.pdf
Kamal Acharya
 
Laundry management system project report.pdf
Laundry management system project report.pdfLaundry management system project report.pdf
Laundry management system project report.pdf
Kamal Acharya
 
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptx
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxCFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptx
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptx
R&R Consult
 
RS Khurmi Machine Design Clutch and Brake Exercise Numerical Solutions
RS Khurmi Machine Design Clutch and Brake Exercise Numerical SolutionsRS Khurmi Machine Design Clutch and Brake Exercise Numerical Solutions
RS Khurmi Machine Design Clutch and Brake Exercise Numerical Solutions
Atif Razi
 
ONLINE VEHICLE RENTAL SYSTEM PROJECT REPORT.pdf
ONLINE VEHICLE RENTAL SYSTEM PROJECT REPORT.pdfONLINE VEHICLE RENTAL SYSTEM PROJECT REPORT.pdf
ONLINE VEHICLE RENTAL SYSTEM PROJECT REPORT.pdf
Kamal Acharya
 

Recently uploaded (20)

Automobile Management System Project Report.pdf
Automobile Management System Project Report.pdfAutomobile Management System Project Report.pdf
Automobile Management System Project Report.pdf
 
2024 DevOps Pro Europe - Growing at the edge
2024 DevOps Pro Europe - Growing at the edge2024 DevOps Pro Europe - Growing at the edge
2024 DevOps Pro Europe - Growing at the edge
 
IT-601 Lecture Notes-UNIT-2.pdf Data Analysis
IT-601 Lecture Notes-UNIT-2.pdf Data AnalysisIT-601 Lecture Notes-UNIT-2.pdf Data Analysis
IT-601 Lecture Notes-UNIT-2.pdf Data Analysis
 
Laundry management system project report.pdf
Laundry management system project report.pdfLaundry management system project report.pdf
Laundry management system project report.pdf
 
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptx
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxCFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptx
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptx
 
RESORT MANAGEMENT AND RESERVATION SYSTEM PROJECT REPORT.pdf
RESORT MANAGEMENT AND RESERVATION SYSTEM PROJECT REPORT.pdfRESORT MANAGEMENT AND RESERVATION SYSTEM PROJECT REPORT.pdf
RESORT MANAGEMENT AND RESERVATION SYSTEM PROJECT REPORT.pdf
 
RS Khurmi Machine Design Clutch and Brake Exercise Numerical Solutions
RS Khurmi Machine Design Clutch and Brake Exercise Numerical SolutionsRS Khurmi Machine Design Clutch and Brake Exercise Numerical Solutions
RS Khurmi Machine Design Clutch and Brake Exercise Numerical Solutions
 
fundamentals of drawing and isometric and orthographic projection
fundamentals of drawing and isometric and orthographic projectionfundamentals of drawing and isometric and orthographic projection
fundamentals of drawing and isometric and orthographic projection
 
ONLINE VEHICLE RENTAL SYSTEM PROJECT REPORT.pdf
ONLINE VEHICLE RENTAL SYSTEM PROJECT REPORT.pdfONLINE VEHICLE RENTAL SYSTEM PROJECT REPORT.pdf
ONLINE VEHICLE RENTAL SYSTEM PROJECT REPORT.pdf
 
KIT-601 Lecture Notes-UNIT-3.pdf Mining Data Stream
KIT-601 Lecture Notes-UNIT-3.pdf Mining Data StreamKIT-601 Lecture Notes-UNIT-3.pdf Mining Data Stream
KIT-601 Lecture Notes-UNIT-3.pdf Mining Data Stream
 
A case study of cinema management system project report..pdf
A case study of cinema management system project report..pdfA case study of cinema management system project report..pdf
A case study of cinema management system project report..pdf
 
Furniture showroom management system project.pdf
Furniture showroom management system project.pdfFurniture showroom management system project.pdf
Furniture showroom management system project.pdf
 
Quality defects in TMT Bars, Possible causes and Potential Solutions.
Quality defects in TMT Bars, Possible causes and Potential Solutions.Quality defects in TMT Bars, Possible causes and Potential Solutions.
Quality defects in TMT Bars, Possible causes and Potential Solutions.
 
Introduction to Machine Learning Unit-4 Notes for II-II Mechanical Engineering
Introduction to Machine Learning Unit-4 Notes for II-II Mechanical EngineeringIntroduction to Machine Learning Unit-4 Notes for II-II Mechanical Engineering
Introduction to Machine Learning Unit-4 Notes for II-II Mechanical Engineering
 
Toll tax management system project report..pdf
Toll tax management system project report..pdfToll tax management system project report..pdf
Toll tax management system project report..pdf
 
KIT-601 Lecture Notes-UNIT-4.pdf Frequent Itemsets and Clustering
KIT-601 Lecture Notes-UNIT-4.pdf Frequent Itemsets and ClusteringKIT-601 Lecture Notes-UNIT-4.pdf Frequent Itemsets and Clustering
KIT-601 Lecture Notes-UNIT-4.pdf Frequent Itemsets and Clustering
 
Peek implant persentation - Copy (1).pdf
Peek implant persentation - Copy (1).pdfPeek implant persentation - Copy (1).pdf
Peek implant persentation - Copy (1).pdf
 
Scaling in conventional MOSFET for constant electric field and constant voltage
Scaling in conventional MOSFET for constant electric field and constant voltageScaling in conventional MOSFET for constant electric field and constant voltage
Scaling in conventional MOSFET for constant electric field and constant voltage
 
Explosives Industry manufacturing process.pdf
Explosives Industry manufacturing process.pdfExplosives Industry manufacturing process.pdf
Explosives Industry manufacturing process.pdf
 
Construction method of steel structure space frame .pptx
Construction method of steel structure space frame .pptxConstruction method of steel structure space frame .pptx
Construction method of steel structure space frame .pptx
 

Numerical analysis stationary variables

  • 1. D Nagesh Kumar, IISc Optimization Methods: M2L11 Optimization using Calculus Stationary Points: Functions of Single and Two Variables
  • 2. D Nagesh Kumar, IISc Optimization Methods: M2L12 Objectives To define stationary points Look into the necessary and sufficient conditions for the relative maximum of a function of a single variable and for a function of two variables. To define the global optimum in comparison to the relative or local optimum
  • 3. D Nagesh Kumar, IISc Optimization Methods: M2L13 Stationary points For a continuous and differentiable function f(x) a stationary point x* is a point at which the function vanishes, i.e. f ’(x) = 0 at x = x*. x* belongs to its domain of definition. A stationary point may be a minimum, maximum or an inflection point
  • 4. D Nagesh Kumar, IISc Optimization Methods: M2L14 Stationary points Figure showing the three types of stationary points (a) inflection point (b) minimum (c) maximum
  • 5. D Nagesh Kumar, IISc Optimization Methods: M2L15 Relative and Global Optimum • A function is said to have a relative or local minimum at x = x* if for all sufficiently small positive and negative values of h, i.e. in the near vicinity of the point x. • Similarly, a point x* is called a relative or local maximum if for all values of h sufficiently close to zero. • A function is said to have a global or absolute minimum at x = x* if for all x in the domain over which f(x) is defined. • Similarly, a function is said to have a global or absolute maximum at x = x* if for all x in the domain over which f (x) is defined. * ( ) ( )f x f x h≤ + * ( ) ( )f x f x h≥ + * ( ) ( )f x f x≤ * ( ) ( )f x f x≥
  • 6. D Nagesh Kumar, IISc Optimization Methods: M2L16 Relative and Global Optimum …contd. a b a b x x f(x)f(x) . . . . . . A1 B1 B2 A3 A2 Relative minimum is also global optimum A1, A2, A3 = Relative maxima A2 = Global maximum B1, B2 = Relative minima B1 = Global minimum Fig. 2
  • 7. D Nagesh Kumar, IISc Optimization Methods: M2L17 Functions of a single variable Consider the function f(x) defined for To find the value of x* such that x* maximizes f(x) we need to solve a single-variable optimization problem. We have the following theorems to understand the necessary and sufficient conditions for the relative maximum of a function of a single variable. a x b≤ ≤ [ , ]a b∈
  • 8. D Nagesh Kumar, IISc Optimization Methods: M2L18 Functions of a single variable …contd. Necessary condition : For a single variable function f(x) defined for x which has a relative maximum at x = x* , x* if the derivative f ‘(x) = df(x)/dx exists as a finite number at x = x* then f ‘(x*) = 0. We need to keep in mind that the above theorem holds good for relative minimum as well. The theorem only considers a domain where the function is continuous and derivative. It does not indicate the outcome if a maxima or minima exists at a point where the derivative fails to exist. This scenario is shown in the figure below, where the slopes m1 and m2 at the point of a maxima are unequal, hence cannot be found as depicted by the theorem. [ , ]a b∈ [ , ]a b∈
  • 9. D Nagesh Kumar, IISc Optimization Methods: M2L19 Functions of a single variable …contd. Some Notes: The theorem does not consider if the maxima or minima occurs at the end point of the interval of definition. The theorem does not say that the function will have a maximum or minimum at every point where f ’(x) = 0, since this condition f ’(x) = 0 is for stationary points which include inflection points which do not mean a maxima or a minima.
  • 10. D Nagesh Kumar, IISc Optimization Methods: M2L110 Sufficient condition For the same function stated above let f ’(x*) = f ”(x*) = . . . = f (n-1)(x*) = 0, but f (n)(x*) 0, then it can be said that f (x*) is – (a) a minimum value of f (x) if f (n)(x*) > 0 and n is even – (b) a maximum value of f (x) if f (n)(x*) < 0 and n is even – (c) neither a maximum or a minimum if n is odd ≠
  • 11. D Nagesh Kumar, IISc Optimization Methods: M2L111 Example 1 Find the optimum value of the function and also state if the function attains a maximum or a minimum. Solution for maxima or minima. or x* = -3/2 which is positive hence the point x* = -3/2 is a point of minima and the function attains a minimum value of -29/4 at this point. 2 ( ) 3 5f x x x= + − '( ) 2 3 0f x x= + = ''( *) 2f x =
  • 12. D Nagesh Kumar, IISc Optimization Methods: M2L112 Example 2 Find the optimum value of the function and also state if the function attains a maximum or a minimum Solution: 4 ( ) ( 2)f x x= − 3 '( ) 4( 2) 0f x x= − = or x = x* = 2 for maxima or minima. 2 ''( *) 12( * 2) 0f x x= − = at x* = 2 '''( *) 24( * 2) 0f x x= − = at x* = 2 ( ) 24* =′′′′ xf at x* = 2 Hence fn(x) is positive and n is even hence the point x = x* = 2 is a point of minimum and the function attains a minimum value of 0 at this point.
  • 13. D Nagesh Kumar, IISc Optimization Methods: M2L113 Example 3 Analyze the function and classify the stationary points as maxima, minima and points of inflection. Solution: Consider the point x = x* = 0 at x * = 0 at x * = 0 5 4 3 ( ) 12 45 40 5f x x x x= − + + 4 3 2 4 3 2 '( ) 60 180 120 0 3 2 0 or 0,1,2 f x x x x x x x x = − + = => − + = = '' * * 3 * 2 * ( ) 240( ) 540( ) 240 0f x x x x= − + = ''' * * 2 * ( ) 720( ) 1080 240 240f x x x= − + =
  • 14. D Nagesh Kumar, IISc Optimization Methods: M2L114 Example 3 …contd. Since the third derivative is non-zero, x = x* = 0 is neither a point of maximum or minimum but it is a point of inflection Consider x = x* = 1 at x* = 1 Since the second derivative is negative the point x = x* = 1 is a point of local maxima with a maximum value of f(x) = 12 – 45 + 40 + 5 = 12 Consider x = x* = 2 at x* = 2 Since the second derivative is positive, the point x = x* = 2 is a point of local minima with a minimum value of f(x) = -11 '' * * 3 * 2 * ( ) 240( ) 540( ) 240 60f x x x x= − + = − '' * * 3 * 2 * ( ) 240( ) 540( ) 240 240f x x x x= − + =
  • 15. D Nagesh Kumar, IISc Optimization Methods: M2L115 Example 4 The horse power generated by a Pelton wheel is proportional to u(v-u) where u is the velocity of the wheel, which is variable and v is the velocity of the jet which is fixed. Show that the efficiency of the Pelton wheel will be maximum at u = v/2. Solution: where K is a proportionality constant (assumed positive). which is negative. Hence, f is maximum at K. ( ) 0 K 2K 0 or 2 f u v u f v u u v u = − ∂ = => − = ∂ = 2 2 2K v u f u = ∂ = − ∂ 2 2 v u =
  • 16. D Nagesh Kumar, IISc Optimization Methods: M2L116 Functions of two variables The concept discussed for one variable functions may be easily extended to functions of multiple variables. Functions of two variables are best illustrated by contour maps, analogous to geographical maps. A contour is a line representing a constant value of f(x) as shown in the following figure. From this we can identify maxima, minima and points of inflection.
  • 17. D Nagesh Kumar, IISc Optimization Methods: M2L117 A contour plot
  • 18. D Nagesh Kumar, IISc Optimization Methods: M2L118 Necessary conditions As can be seen in the above contour map, perturbations from points of local minima in any direction result in an increase in the response function f(x), i.e. the slope of the function is zero at this point of local minima. Similarly, at maxima and points of inflection as the slope is zero, the first derivative of the function with respect to the variables are zero.
  • 19. D Nagesh Kumar, IISc Optimization Methods: M2L119 Necessary conditions …contd. Which gives us at the stationary points. i.e. the gradient vector of f(X), at X = X* = [x1 , x2] defined as follows, must equal zero: This is the necessary condition. 1 2 0; 0 f f x x ∂ ∂ = = ∂ ∂ 1 2 ( *) 0 ( *) x f x f f x ∂⎡ ⎤ Χ⎢ ⎥∂ ⎢ ⎥Δ = = ∂⎢ ⎥ Χ⎢ ⎥∂⎣ ⎦ x fΔ
  • 20. D Nagesh Kumar, IISc Optimization Methods: M2L120 Sufficient conditions Consider the following second order derivatives: The Hessian matrix defined by H is made using the above second order derivatives. 2 2 2 2 2 1 2 1 2 ; ; f f f x x x x ∂ ∂ ∂ ∂ ∂ ∂ ∂ 1 2 2 2 2 1 1 2 2 2 2 1 2 2 [ , ]x x f f x x x f f x x x ⎛ ⎞∂ ∂ ⎜ ⎟ ∂ ∂ ∂⎜ ⎟= ⎜ ⎟∂ ∂ ⎜ ⎟⎜ ⎟∂ ∂ ∂⎝ ⎠ H
  • 21. D Nagesh Kumar, IISc Optimization Methods: M2L121 Sufficient conditions …contd. The value of determinant of the H is calculated and if H is positive definite then the point X = [x1, x2] is a point of local minima. if H is negative definite then the point X = [x1, x2] is a point of local maxima. if H is neither then the point X = [x1, x2] is neither a point of maxima nor minima.
  • 22. D Nagesh Kumar, IISc Optimization Methods: M2L122 Example 5 Locate the stationary points of f(X) and classify them as relative maxima, relative minima or neither based on the rules discussed in the lecture. Solution 3 2 1 1 2 1 2 2( ) 2 /3 2 5 2 4 5f x x x x x x= − − + + +X
  • 23. D Nagesh Kumar, IISc Optimization Methods: M2L123 Example 5 …contd. From , So the two stationary points are X1 = [-1,-3/2] and X2 = [3/2,-1/4] 1 (X) 0 f x ∂ = ∂ 2 2 28 14 3 0x x+ + = 2 2(2 3)(4 1) 0x x+ + = 2 23/ 2 or 1/ 4x x= − = −
  • 24. D Nagesh Kumar, IISc Optimization Methods: M2L124 Example 5 …contd. The Hessian of f(X) is At X1 = [-1,-3/2] , 2 2 2 2 12 2 1 2 1 2 2 1 4 ; 4; 2 f f f f x x x x x x x ∂ ∂ ∂ ∂ = = = = − ∂ ∂ ∂ ∂ ∂ ∂ 14 2 2 4 x −⎡ ⎤ = ⎢ ⎥−⎣ ⎦ H 14 2 2 4 xλ λ λ − = − I - H 4 2 ( 4)( 4) 4 0 2 4 λ λ λ λ λ + = = + − − = − I - H 2 16 4 0λ − − = 1 212 12λ λ= + = − Since one eigen value is positive and one negative, X1 is neither a relative maximum nor a relative minimum
  • 25. D Nagesh Kumar, IISc Optimization Methods: M2L125 Example 5 …contd. At X2 = [3/2,-1/4] Since both the eigen values are positive, X-2 is a local minimum. Minimum value of f(x) is -0.375 6 2 ( 6)( 4) 4 0 2 4 λ λ λ λ λ − = = − − − = − I - H 1 25 5 5 5λ λ= + = −
  • 26. D Nagesh Kumar, IISc Optimization Methods: M2L126 Example 6 Maximize f(X) = ; 2 2 1 1 2 220 2 6 3 / 2x x x x+ − + − 1 1 2 2 ( *) 2 2 0 6 3 0 ( *) x f x x f xf x ∂⎡ ⎤ Χ⎢ ⎥∂ −⎡ ⎤ ⎡ ⎤⎢ ⎥Δ = = =⎢ ⎥ ⎢ ⎥−∂⎢ ⎥ ⎣ ⎦⎣ ⎦Χ⎢ ⎥∂⎣ ⎦ X* = [1,2] 2 2 2 2 2 1 2 1 2 2; 3; 0 f f f x x x x ∂ ∂ ∂ = − = − = ∂ ∂ ∂ ∂ 2 0 0 3 −⎡ ⎤ = ⎢ ⎥−⎣ ⎦ H
  • 27. D Nagesh Kumar, IISc Optimization Methods: M2L127 Example 6 …contd. Since both the eigen values are negative, f(X) is concave and the required ratio x1:x2 = 1:2 with a global maximum strength of f(X) = 27 MPa 2 0 ( 2)( 3) 0 0 3 λ λ λ λ λ + = = + + = + I - H 1 22 3andλ λ= − = −
  • 28. D Nagesh Kumar, IISc Optimization Methods: M2L128 Thank you