INTRODUCTION

In mathematics, the maximum and minimum of a function,

known collectively as extrema are the largest and smallest value
that a function takes at a point either within a given
neighbourhood (local or relative extremum) or on the function
domain in its entirely (global or absolute extremum).
Pierre de Fermat was one of the first mathematicians to
propose a general technique called adequality) for finding
maxima and minima. To locate extreme values is the basic
objective of optimization.

PART 1

a) i) Mathematical optimization
An act, process or methodology of making something
( as a design, system or decision) as a fully perfect,
functional or effective as possible using mathematical
theory or concept, specifically the mathematically
procedures (finding the maximum of a function).
ii) Global maximum
A global maximum is also known as absolute
maximum, the largest overall value of a set, function
and more over its entire range.
Global minimum
A global minimum is also known as absolute
minimum, the smallest overall value of a set, function
and more over its entire range.
iii) Local maximum
It can be also expressed as Relative Maximum. It is
the greatest value in a sets of points but not the
highest when compared to all values in a set. The sets
of points can be global maximum.

iv) Local Minimum

Its the least value that locates within a sets of points
which may or may not be global minimum and it is
not the lowest value in the entire set. It can be also
termed as Relative Minimum

Example:

b) Example 1:

y=x 2 + x+ 1

y=x 22 x + 4

dy
=2 x +1
dx

dy
=
dx

2 x2

At turning point,
turning point,

dy
dx

dy
dx

Hence, 2 x+ 1=0

Hence,

2 x2=0

2 x=1

2 x=2
x=

x=1
d2 y
d x2
d2 y
d x2

2>0

2< 0

At

1
2

1
2

y is minimum when

x=

y is maximum when

x=1

Example 2:
Value of quadratic equation

a 0

a 0
2

y min =

y max =

4 acb
4a

4 acb2
4a

y=x 23 x+ 4

y=2 x 2+5 x12

a=1, b=3,c=4

Since a<0 ,

y is minimum

4 (1 ) ( 4 )(3 )2
y min =
4 (1 )
y min =

25
4

Example 3:

a=2,b=5 , c=12

Since a> 0, y is maximum

4 ( 2 )(12 )(5)2
y max =
4 (2)
y

max =

121
8

PART 3

Tim 9.3 10.

e
0
30
a. a.m
m
t
0
1
h

p(t)

11. 12. 1.3

30
30
0
a.m p.m p.
m
2
3
4

241 900 180

0

27
00

2.3
0
p.
m
5

3.3
0
p.
m
6

4.3
0
p.
m
7

5.3
0
p.
m
8

6.3
0
p.
m
9

7.3
0
p.
m
10

8.3
0
p.
m
11

9.3
0
p.
m
12

33
59

36
00

33
59

27
00

18
00

90
0

24
1

(i.)

*Refer to graph

(ii.)

Peak hours is at 3.30 p.m

p ( 6 )=3600 people

(iii.)

At 7.30 p.m, t=10

p (10 )=900 people

(iv.)

6
2570 (t )+1800
1800 cos

cos ( 30 t )=

25701800
1800

( 30 t ) =cos1 (

77
)
180

t=3842=3.84 hours

Time 3 hour ( 0.84 60 ) min

3 hours 15 min
3 hours 15 min+9 hours 30 min

time=1.20 p . m

P(t)

Visitors versus time

4000
3500
3000
2500

Y-Values

2000
1500
1000
500
0
-1

11

13

15

FURTHER EXPLORATION
(a)

Linear programming (LP; also called linear optimization) is a

method to achieve the best outcome (such as maximum profit or
lowest cost) in a mathematical model whose requirements are
represented by linear relationships.
The problem of solving a system of linear inequalities dates back
at least as far as Fourier, who in 1827 published a method for
solving them, and after whom the method of FourierMotzkin
elimination is named.
One of the examples on how the Linear Programming is being
applied in various field of study is maximization of profit.
In economics, profit maximization is the short run or long
run process by which a firm determines the price and output level
that returns the greatest profit. There are several approaches to
this problem. The total revenue total cost perspective relies on
the fact that profit equals revenue minus cost and focuses on
maximizing this difference, and the marginal revenue marginal
cost perspective is based on the fact that total profit reaches its
maximum point where marginal revenue equals marginal cost.
Another example is transportation problem. In mathematics and
economics, transportation theory is a name given to the study of
optimal transportation and allocation of resources.The problem
was formalized by the French mathematician Gaspard Monge in
1781. In the 1920s A.N. Tolstoi was one of the first to study the
transportation problem mathematically. In 1930, in the
collection Transportation Planning Volume I for the National
Commissariat of Transportation of the Soviet Union, he published
a paper "Methods of Finding the Minimal Kilometrage in Cargotransportation in space". Major advances were made in the field
during World War II by the Soviet/Russian mathematician and
economist Leonid Kantorovich. Consequently, the problem as it is
stated is sometimes known as the Monge Kantorovich
transportation problem. The linear programming formulation of

the transportation problem is also known as theHitchcock

Koopmans transportation problem.
(b) (i)
Type of cabinet

Cost per unit

Floor space

100

0.6

Volume of tiles
hold
0.8

200

0.8

1.2

(iii) Area 0.6 x+ 0.8 y

Cost 100 x +200 y
Volume 0.8 x+1.2 y

Combinati
ons

A
B
C
D
E
F

4
5
6
7
8
9

5
4
4
3
3
2

Area (

Volume

(m )

6.4
6.8
6.2
6.6
7.2
7.0

9.2
8.8
9.6
9.2
10.0
9.6

Cost(RM)

1400
1300
1400
1300
1400
1300

(IV) If I was Aron would choose combination E (x=8, y=3) because

2
te cost is exactly RM 1400 and it also maximize the area 7.2 m
3
and volume 10 ( m ) with high number of combination of cabinet

11.

REFLECTION
I AM HARDWORKING
I AM AN EXPLORER
I AM A PROBLEM SOLVER
I AM A CRICTICAL THINKER
I AM A INFO SEEKER
I AM A GENIUS
MATHEMATICS IS MY LIFE

REFERENCE

1. https://en.wikipedia.org/wiki/Transportation_theory_(mathem
atics)
2. https://en.wikipedia.org/?title=Profit_maximization
3. https://en.wikipedia.org/wiki/Linear_programming