ADDITIONAL MATHEMATICS

PROJECT WORK 2015

NAME : MANNAVAN VENTHAN

I/C NO. : 981211-10-6691

CLASS : 5SN1

TEACHER NAME : PN. WAN MASTURA

 CONTENTS

ACKNOWLEGDEMENT 1

OBJECTIVE 2

INTRODUCTION 3

PART 1 4

PART 2 6

PART 3 8

FURTHER EXPLORATION 10

REFLECTION 17
ACKNOWLEDGEMENT

My name is Mannavan Venthan. I am thankful that this Additional Mathematics

Project can be done just in time. For this, I would like to seize the opportunity to
express my sincere gratitude for those who had been helping me during my work.

First and foremost, I would like to say a big thank you to my Additional
Mathematics teacher, Pn. Wan Mastura for giving me information about my project
work. On the other hand, I would also like to thank my dear principle, Yang Mulia
Hajah Raja Rozita binti Raja Hanafi for giving me the permission to carry out this
project.

Also, I would like to thank my parents. They had brought me the things that I
needed during the project work was going on. Not only that, they also provided me
with the nice suggestion on my project work so that I had not meet the dead and
throughout this project.

Lastly, I would like to say thank you to my friends and the modern access in our
daily life. All of my relevant information come from my friends and the internet. I
managed to use all these access in our daily life, such as: computer to finish my
Additional Mathematics project.

1
OBJECTIVE

Additional Mathematics is one of the compulsory subjects for SPM science

stream candidates. All of the students would have to carry out a project work based
on a topic given and must be submitted in three weeks time.

The objective of carrying out this project is:

To apply and adapt a variety of problem-solving strategies that we had learnt

to solve the problems.

Our thinking skills can be improved.

Promotes effective mathematical communication. Our confidence and

interest towards Mathematics will be increase though solving various types of
problems.

To use the language of Mathematics to express Mathematical ideas precisely.

Stimulates and enhances effective earning.

To develop our positive attitude towards Mathematics. This makes the lesson
to be more fun, useful and meaningful.

2
INTRODUCTION

In mathematics, the maximum and minimum of a function, known collectively as

extrema are the largest and smallest value that the function takes at a point either
within a given neighbourhood (local or relative extermum) or on the function
domain in its entirety (global or absolute extermum). 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

3
PART 1
(a)
(i) Mathematical optimization deals with the problem of numerically minimums
(or maximums or zeros) of a function. In this context, the function is called
cost function, or objective function, or energy. More generally, optimization
includes finding "best available" values of some objective function given a
defined domain (or a set of constraints), including a variety of different types
of objective functions and different types of domains.
(ii) In mathematical analysis, the maxima and minima (the plural of maximum
and minimum) of a function, known collectively as extrema (the plural of
extremum), are the largest and smallest value of the function within the
entire domain of a function (the global or absolute extrema).

We say that f(x) has an absolute (or global) maximum at x=c if f(x) f(c) for
every x in the domain we are working on.
We say that f(x) has an absolute (or global) minimum at x=c if f(x) f(c) for
every x in the domain we are working on.
(iii) In mathematical analysis, the maxima and minima (the plural of maximum
and minimum) of a function, known collectively as extrema (the plural of
extremum), are the largest and smallest value of the function, within a given
range (the local or relative extrema)

We say that f(x) has a relative (or local) maximum at x=c if f(x) f(c) for
every x in some open interval around.
We say that f(x) has a relative (or local) minimum at x=c if f(x) f(c) for
every x in some open interval around.

4
(b) Bubble map

By using formula of (c-

b/4a) in the form of
y = ax + bx + c
Eg: a < 0 = maximum value
a > 0 = minimum value
y = 2x + x +1
2 >0
Minimum value = 1- 1/4(2)
= 7/8

Various methods in
finding the
maximum or
minimum value of a
By using differentiation quadratic function
method with the form of By using completing the
y = ax + bx + c square method with the
dy/dx = 2ax + b form of y = a(x-h) +k
dy/dx = 0
x = -b/2a Min/max value = k
Substitute in equation to find Eg: a < 0 = maximum value
max/min value a > 0 = minimum value
Eg: y = 2x + x + 1 y = (x-2) + 2
x = -1/2(2) = -1/4 1>0
y = 2(-1/4) + (-1/4) +1 = 7/8
Minimum value = 7/8
Minimum value = 2

5
PART 2
(a)

x x x x 200m fences

P1 P2

P1 & P2 are partitions

Let length be x
Let width be y

Total amount of fencing required

x + x + x + x +y + y = 4x +2y = 200 (1)

6
 Area of the pen = xy (length x width)
A = xy (2)

y = 100 2x (3)

Substitute (3) into (2) When x = 25

A = x(100 2x) y = 100 2(25)
A = 100x 2x y = 50

Differentiate the equation The dimension :

dA/dx = 100 4x
100 4x = 0
4(25 x) = 0 50m
25 x = 0
x = 25
25m 25 25 25

Maximum area = 50m x 25 m

= 1250m

(b)

Let the side of the square to be cut off be hcm

h
h

30 cm 30 -2h cm

30 -2h cm

30 -2h cm

(1)
The volume of open box is
V = h (30 2h)
V = h(900 120h + 4h)

7
V = 900h 120h + 4h

Domain of V = 0 < x < 15

(2)
To find the maximum value

dV/dh = 900 240h + 12h

= 12(75 20h + h)
= 12(h 15)(h 5 )
h 15 = 0 , h 5 = 0
h = 15 h=5
(x = 15 is rejected, not belongs to domain of V)
Thus the maximum volume / Largest possible volume
V = h (30 2h) , substitute h = 5
V = 2000 cm

PART 3
(i) Based on the equation of P(t) = -1800cos [(/6)t] + 1800, a table has been
constructed where t represent the number of hours starting from 0 hours to
13 hours and P represent the number of people.

t / hours P / number of people

0 0
1 241
2 900
3 1800
4 2700
5 3359
6 3600
7 3359
8 2700
9 1800
10 900
11 241
12 0
13 241

8
Based on table above, graph is generated using Microsoft Excel application.

9
(ii) The peak hours with 3600 people in the mall is after 6 hours the mall opens
9:30 a.m. + 6 hours = 3.30 p.m.

10
(iii) 7.30 p.m. is 10 hours after the mall open s. based on the graph, the number
of people at the mall at 7.30 p.m. is 900 people.

(iv) By using the formula, P(t) = -1800cos [(/6)t] + 1800

2570 = -1800cos [(/6)t] + 1800

cos [(/6)t] = (2570 1800)/ -1800
[(/6)t] = cos ^-1 0.428
t = 3.84 hours
t = 3 hours 50 minutes
Thus, 9:30 a.m. + 3 hours 50 minutes = 1:20 p.m.

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. Linear programming is a special case of mathematical
programming (mathematical optimization).

More formally, linear programming is a technique for the optimization of

a linear objective function, subject to linear equality and linear
inequality constraints. Its feasible region is a convex polytope, which is a set
defined as the intersection of finitely many half spaces, each of which is defined
by a linear inequality. Its objective function is a real-valued affine
function defined on this polyhedron. A linear programming algorithm finds a
point in the polyhedron where this function has the smallest (or largest) value
if such a point exists.

Linear programming can be applied to various fields of study. It is used in

business and economics, but can also be utilized for some engineering
problems. Industries that use linear programming models include
transportation, energy, telecommunications, and manufacturing. It has proved
useful in modeling diverse types of problems in planning, routing,
scheduling, assignment, and design.

Historical aspects of linear programming:

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.

The first linear programming formulation of a problem that is equivalent to

the general linear programming problem was given by Leonid Kantorovich in
1939, who also proposed a method for solving it. He developed it during World
War II as a way to plan expenditures and returns so as to reduce costs to the

11
army and increase losses incurred by the enemy. About the same time as
Kantorovich, the Dutch-American economist T. C. Koopmans formulated
classical economic problems as linear programs. Kantorovich and Koopmans
later shared the 1975 Nobel prize in economics. In 1941, Frank Lauren
Hitchcock also formulated transportation problems as linear programs and
gave a solution very similar to the later Simplex method. Hitchcock had died in
1957 and the Nobel prize is not awarded posthumously.

During 1946-1947, George B. Dantzig independently developed general linear

programming formulation to use for planning problems in US Air Force. In
1947, Dantzig also invented the simplex method that for the first time
efficiently tackled the linear programming problem in most cases. When
Dantzig arranged meeting with John von Neumann to discuss his Simplex
method, Neumann immediately conjectured the theory of duality by realizing
that the problem he had been working in game theory was equivalent. Dantzig
provided formal proof in an unpublished report "A Theorem on Linear
Inequalities" on January 5, 1948.Postwar, many industries found its use in
their daily planning.

Dantzig's original example was to find the best assignment of 70 people to 70

jobs. The computing power required to test all the permutations to select the
best assignment is vast; the number of possible configurations exceeds the
number of particles in the observable universe. However, it takes only a
moment to find the optimum solution by posing the problem as a linear
program and applying the simplex algorithm. The theory behind linear
programming drastically reduces the number of possible solutions that must be
checked.

The linear-programming problem was first shown to be solvable in polynomial

time by Leonid Khachiyan in 1979, but a larger theoretical and practical
breakthrough in the field came in 1984 when Narendra Karmarkar introduced
a new interior-point method for solving linear-programming problems

Importance of linear programming to real life:

Linear programming is a considerable field of optimization for several reasons.
Many practical problems in operations research can be expressed as linear
programming problems. Certain special cases of linear programming, such
as network flow problems and multicommodity flow problems are considered
important enough to have generated much research on specialized algorithms
for their solution. A number of algorithms for other types of optimization
problems work by solving LP problems as sub-problems. Historically, ideas
from linear programming have inspired many of the central concepts of
optimization theory, such as duality, decomposition, and the importance
of convexity and its generalizations. Likewise, linear programming is heavily
used in microeconomics and company management, such as planning,
production, transportation, technology and other issues. Although the modern
management issues are ever-changing, most companies would like to maximize

12
 profits or minimize costs with limited resources. Therefore, many issues can be
characterized as linear programming problems.

Examples on how linear programming is being applied in various field of

study:
(i) Suppose that a farmer has a piece of farm land, say L km2, to be planted
with either wheat or barley or some combination of the two. The farmer has a
limited amount of fertilizer, F kilograms, and insecticide, P kilograms. Every
square kilometer of wheat requires F1 kilograms of fertilizer and P1 kilograms
of insecticide, while every square kilometer of barley requires F2 kilograms of
fertilizer and P2 kilograms of insecticide. Let S1 be the selling price of wheat
per square kilometer, and S2 be the selling price of barley. If we denote the area
of land planted with wheat and barley by x1 and x2 respectively, then profit can
be maximized by choosing optimal values for x1 and x2. This problem can be
expressed with the following linear programming problem in the standard
form:

(maximize the revenuerevenue

Maximize: is the "objective function")
Subject
(limit on total area)
to:
(limit on fertilizer)
(limit on insecticide)
(cannot plant a negative area).
Which in matrix form becomes:

maximize

subject to

(ii) At a certain refinery, the refining process requires the production of at least
two gallons of gasoline for each gallon of fuel oil. To meet the anticipated
demands of winter, at least three million gallons of fuel oil a day will need to be
produced. The demand for gasoline, on the other hand, is not more
than 6.4 million gallons a day.

If gasoline is selling for $1.90 per gallon and fuel oil sells for $1.50/gal, how
much of each should be produced in order to maximize revenue?

The question asks for the number of gallons which should be produced, so I
should let my variables stand for "gallons produced"

13
x: gallons of gasoline produced
y: gallons of fuel oil produced
Since this is a "real world" problem, I know that I can't have negative
production levels, so the variables can't be negative. This gives me my first two
constraints: namely, x > 0 and y > 0.

Since I have to have at least two gallons of gas for every gallon of oil, then
x > 2y.

For graphing, of course, I'll use the more manageable form "y < ( 1/2 )x".

The winter demand says that y > 3,000,000; note that this constraint eliminates
the need for the "y > 0" constraint. The gas demand says that x < 6,400,000.

I need to maximize revenue R, so the optimization equation is R = 1.9x + 1.5y.

Then the model for this word problem is as follows:

R = 1.9x + 1.5y, subject to:

x>0
x < 6,400,000
y > 3,000,000
y < ( 1/2 )x

Using a scale that counts by millions (so "y = 3" on the graph means "y is three
million"), the above system graphs as follows:

When you test the corner points at (6.4m, 3.2m), (6.4m, 3m), and (6m, 3m), you
should get a maximal solution of R = $16.96m at (x, y) = (6.4m, 3.2m).

14
b)
(i) (a)I. Cost : 100x + 200y 1400
II. Space : 0.6x + 0.8y 7.2
III. Volume = 0.8x + 1.2y

(b)I. y = - 1/2x + 7

x 0 2 4 6 8 12 14
y 7 6 5 4 3 1 0

II. y = - 3/4x + 9

x 0 2 4 6 8 10 12
y 9 7.5 6 4.5 3 1.5 0

Based on table above, graph is generated using Microsoft Excel application.

15
(ii) Maximum storage volume

16
 Method 1 Test using corner point of Linear Programming Graph (8,3),
(0,7), and (12,0)
Volume = 0.8x + 1.2y

Coordinate 1 - (8,3)
Volume = 0.8(8) + 1.2(3)
Volume = 10 cubic meter

Coordinate 2 - (0,7)
Volume = 0.8(0) + 1.2(7)
Volume = 8.4 cubic meter

Coordinate 3 - (12,0)
Volume = 0.8(12) + 1.2(0)
Volume = 9.6 cubic meter

Thus maximum storage volume is 10 cubic meter.

Method 2 Using simultaneous equation

y = - 1/2x + 7 ------ 1

y = - 3/4x + 9 ------ 2

Substitute Equation 2 into 1

- 3/4x + 9 = - 1/2x + 7
x=8
y=3

Applying the value of x and y in formula, Volume = 0.8x + 1.2y

Thus, the maximum storage volume is 10 cubic meter.

(iii)
Cabinet x Cabinet y Total cost (RM)

17
 4 6 1600
5 5 1500
6 4 1400
7 3 1300
8 3 1400
9 2 1300

(iv) Aaron should buy the combination of 8 cabinet x and 3 cabinet y. This
combination suits his allocation of RM1400 as other combination can be
too much. This combination has the largest volume of 10 m compare to
the other combination which has less volume generated. It also fulfill the
ratio of cabinet x to cabinet y more than 2:3.

REFLECTION

About mathematical optimization;

My poetic chapter-endings mostly play with the picture of optimization as a
geographical search. The steepest descent method can be understood by
imagining ourselves walking on a hillside in thick mist. We can only see the
ground at our feet; and to find the bottom of the valley we must make controlled
moves down lines of greatest slope:

Still the fog persists.

Let the incline have its way
and set your compass.

Keep taking footsteps

until that first suspicion
of an uphill slope

then turn left or right,

just one of many zig-zags.
Will it ever end?

The need to comply with several simultaneous constraints suggests a zen-like

observation:

To walk a tightrope
is hard. So how much harder
to walk several.

Spiders manage it
spinning sticky contour plots
which arent safety nets.
A particularly trying difficulty is that we can rarely be certain whether an
optimization search has located Everest or Snowdon that is, the overall peak

18
(global solution) rather than merely a local high point. We can say of a global
solution that

Its the only place

to be if you can find it.
(If not, you wont know.)

By Michael Bartholomew-Biggs

About linear programming;

Serendipity by Anonymous

The three princes of Serendip

Went on a little trip.
They could not carry too much weight;
More than 300 pounds made them hesitate.
They planned to the ounce. When they returned to Ceylon
They discovered that their supplies were just about gone
When, what to their joy, Prince William found
A pile of coconuts on the ground.
Each will bring 60 rupees, said Prince Richard with a grin
As he almost tripped over a lion skin.
Look out! cried Prince Robert with glee
As he spied more lion skins under a tree.
These are worth even more 300 rupees each
If we can just carry them all down the beach.
Each skin weighed fifteen pounds and each coconut, five,
But they carried them all and made it alive.
The boat back to the island was very small
15 cubic feet capacity that was all.
Each lion skin took up one cubic foot
While eight coconuts the same space took.
While everything was stowed they headed to the sea
And on the way calculated what their new wealth might be.
Eureka! cried Prince Robert, Our wealth is so great
That theres no other way we could return in this state.
And any other skins or nut which we might have brought
Would now have us poorer. And now I know what
Ill write my friend Horace in England, for surely
Only he can appreciate our serendipity.

19