Professional Documents
Culture Documents
Project 2015
Prepared by;
Muhamad Amirul Rasyid bin Norzairy
5 Bestari
Guided by;
Pn. Kartini Jamal
Contents
A Word of Gratitude
I would like to say thank you to Allah for guiding me and giving me
strength, ideas and patience to complete this additional mathematics project.
Without His blessings and guidance, this project could not be completed.
Lastly, I would like to thank all the teachers and friends for helping me in
completing this project. Thank you to those who involved directly or indirectly
in making this project.
Objective
Every form 5 student taking additional mathematics is required to carry out a
project work. Upon completion of the project, it is hoped that students will gain
some valuable experiences and able to:
What is FUNCTION?
The GRAPH of the function f(x) = x3 9x2 + 23x 15. The interval A =
[3.5, 4.25] is a subset of the domain, thus it is shown as part of the x-axis
(green). The image of A is (approximately) the interval [3.08, 1.88]. It is
obtained by projecting to the y-axis (along the blue arrows) the intersection of
the graph with the light green area consisting of all points whose x-coordinate
is between 3.5 and 4.25. The part of the (vertical) y-axis shown in blue. The
preimage of B = [1, 2.5] consists of three intervals. They are obtained by
projecting the intersection of the light red area with the graph to the x-axis.
Type of FUNCTION
Extrema of FUNCTION
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, either within a
given range (the local or relative extrema) or on the entire domain of a
function (the global or absolute extrema). Pierre de Fermat was one of the
first mathematicians to propose a general technique, ADEQUALITY, for
finding the maxima and minima of functions As defined in set theory, the
maximum and minimum of a set the greatest and least elements in the set.
Unbounded infinite sets, such as the set of real numbers, have no minimum or
maximum.
Extrema of FUNCTION
The function x3 has no global minima or maxima. Although the first derivative
(3x2) is 0 at x = 0, this is an ininflection point.
The function x-x has a unique global maximum over the positive real
numbers at x = 1/e.
The function x3/3 x has first derivative x2 1 and second derivative 2x.
Setting the rst derivative to 0 and solving for x gives stationary points at 1
and +1. From the sign of the second derivative we can see that 1 is a local
maximum and +1 is a local minimum. Note that this function has no global
maximum or minimum.
The function |x| has a global minimum at x = 0 that cannot be found by taking
derivatives, because the derivative does not exist at x = 0.
The function cos(3x)/x with 0.1 x 1.1 has a global maximum at x = 0.1
(a boundary), a global minimum near x = 0.3, a local maximum near x = 0.6,
and a local minimum near x = 1.0.
Fermat used adequality first tofi nd maxima of functions, and then adapted it
to find tangent lines to curves. To find the maximum of a term p(x), Fermat
equated (or more precisely adequated) p(x) and p(x+e) and after doing
algebra he could cancel out a factor of e, and then discard any remaining
terms involving e. To illustrate the method by Fermat's own example, consider
the problem of fi nding the maximum of p(x)=bx-x^2. Fermat adequated bx-x^2
with b(x+e)-(x+e)^2=bx-x^2+be-2ex-e^2.
Part One
Mathematical Optimization
In both the global and local cases, the concept of a strict extremum can be
defined. For example, x is a strict global maximum point if, for all x in X with x*
_ x, we have f(x*) > f(x), and x is a strict local maximum point if there exists
some _ > 0 such that, for all x in X within distance _ of x with x* _ x, we have
f(x*) > f(x). Note that a point is a strict global maximum point if and only if it
is the unique global maximum point, and similarly for minimum points.
Methods to find
Extrema
I-think Map
Part Two
En Shahs Sheep Pen
Rezas Box
Part
Three
The Mall
The Mall
Based on the graph, the mall reaches its PEAK HOUR at 3.30 pm which is 6
hours after the mall opens. The number of people in the mall at that time is
3600.
At 7.30 pm which is 10 hours after the mall opens, the number of people
would be 900.
Portfolio Optimization
Many investment companies are now using optimization and linear
programming extensively to decide how to allocate assets. The increase in the
speed of computers has enabled the solution of far larger problems, taking
some of the guesswork out of the allocation of assets.
How it started?
LEONID KANTOROVICH
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 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.
Further Exploration
Reflection
Ive found a lot of information while conducting this Additional
Mathematics project. Ive learnt the uses of function in our daily life.
Apart from that, Ive learnt some moral values that can be applied
in our daily life. This project has taught me to be responsible and punctual as I
need to complete this project in a week. This project has also helped in
building my confidence level. We should not give up easily when we cannot
find the solution for the question.
Then, this project encourages students to work together and share their
knowledge. This project also encourages students to gather information from
the internet, improve their thinking skills and promote effective mathematical
communication.
Lastly, I think this project teaches a lot of moral values, and also tests
the students understanding in Additional Mathematics. Let me end this project
with a poem;