( )

( )
1 2
2
2
2 2
2 2 2
2
2
2
2
2
2 2
2 2
2 2
2 2
2 2 2
2
=

=
=
+ =
+ =
+ = +
=
=
ab a
ab a
ab a
ab a
ab a ab a
ab a ab a
ab ab a ab a
ab a a
ab a a a
ab a
b a
Then
Let
Optimisation achieved through differentiation
Why maximise or minimise?
Some mathematically solvable problems involve optimisation.
When a problem needs to be optimised, an algebraic analysis is required that can show where a favoured situation occurs.
Maximisation and minimisation utilises first- and sometimes second-order differentiation to find these optimal situations
based on the turning points of the governing functions.
Terminology
Roots Turning Points Point of Inflection
Local Maximum
Local Minimum
Example 1
We are given a sheet of paper, dimensions 80 units by 60 units, with which we wish to construct an open-topped box. At
what measurement should we set the height so as to maximise the volume of the box?
Example 1 - Diagram
80 units x units
x units
60 units
Example 1 continued
( )( )
2
4 280 4800
2 60 2 80
x x
x x A
+ =
=
We can express the base of the box as length x breadth and thus the volume as length x breadth x height. Putting this
algebraically gives us:
( )
x x x
x x x
x x x
x x x
x A V
1200 70
70 1200
4 280 4800
4 280 4800
2 3
3 2
3 2
2
+ =
+ =
+ =
+ =
=
Example 1 continued
Since calculus is the branch of algebra used to study variables that are in flux, we can use differentiation to study how the
volume of the box will change based on the value of x.
Let us differentiate V:
( )
( )
( ) 140 6 ' '
1200 140 3 '
1200 70
2
2 3
=
+ =
+ =
x x V
x x x V
x x x x V
Using our skills of first- and second-order differentiation, let us study these functions
Example 1 continued
From curve sketching, we know that a turning point occurs in V(x) at each root of V(x). Thus we must factorise V(x):
( )
( )( )
315 , 11 352 , 35
6
5200 140
6
14400 19600 140
6
1200 3 4 19600 140
2
4
1200 140 3 0
1200 140 3 '
2
2
2
= =

=

=

=

=
+ =
+ =
x x
a
ac b b
x
x x
x x x V
or
Example 1 continued
From these results we can determine the volume of the box at each x-value:
( ) ( ) ( )
( ) ( ) ( )
893 , 88362
352 , 35 1200 352 , 35 140 352 , 35 352 , 35
614 , 15014
315 , 11 1200 315 , 11 140 315 , 11 315 , 11
2
3
2
3
=
+ =
=
+ =
V
V
Of course, in reality a volume cannot be negative so we would disregard this answer. Yet, in this scenario we do not need to
since it is the maximum value for which we seek which occurs at the concave down turning point (at x=11,315).
We thus know that the optimal value for x is 11,315 units.
A Graphic Representation
Example 2
There are 50 apple trees in an orchard. Each tree produces 800 apples. For each additional tree planted in the orchard, the
output per tree drops by 10 apples. How many trees should be added to the existing orchard in order to maximize the total
output of trees ?
Example 2 continued
Let x be the additional trees planted in the existing orchard. We wish to maximise the total production of apples.
( ) ( )( )
( )( )
40000 300 10
10 300 40000
10 800 50
2
2
+ + =
+ =
+ =
=
x x
x x
x x
x P tree per output apple trees of number
( )
15
15 0
300 20 '
=
+ =
+ =
x
x
x x P
Example 2 continued
Thus at x=15 is the local maximum for P(x) and so is our optimised point.
We can test this answer by checking apple output for x=14 and x=16:
( ) ( ) ( )
( ) ( ) ( )
( ) ( ) ( )
42240
16 10 16 300 40000 16
42250
15 10 15 300 40000 15
42240
14 10 14 300 40000 14
2
2
2
=
+ =
=
+ =
=
+ =
P
P
P
Example 2 - Graph
Theorem
Suppose that f(x) is a continuous function detailing some optimisation problem. Suppose further that f(x) has a local
maximum or local minimum at x=x
0
then f(x
0
)=0.