Professional Documents
Culture Documents
Add Maths Folio .Odt
Add Maths Folio .Odt
a)
b)
PART 3
(i) Based on the equation, a table has been constructed where t
represents the number of hours starting from 0 hours to 23
hours and P represents the number of people.
t/hours
P/number of people
241
900
1800
2700
3359
3600
3359
2700
1800
10
900
11
241
12
13
241
(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. .
(iii)
7:30 p.m. is 10 hours after the malls opens. Based on the
graph, the number of people at the mall at 7:30 p.m. is 900
people.
(iv)
By using formula ,
HISTORY
George Dantzig, founder of Linear Programming.
The 1940s was a time of innovation and reformation of how products were made, both
to make things more efficient and to make a better-quality product. The second
world war was going on at the time and the army needed a way to plan expenditures
and returns in order to reduce costs and increase losses for the enemy. George B.
Dantzig is the founder of the simplex method of linear programming, but it was kept
secret and was not published until 1947 since it was being used as a war-time
strategy. But once it was released, many industries also found the method to be
highly valuable. Another person who played a key role in the development of linear
programming is John von Neumann, who developed the theory of the duality and
Leonid Kantorovich, a Russian mathematician who used similar techniques in economics
before Dantzig and won the Nobel prize in 1975 in economics.
Dantzig's original example of finding the best assignment of 70 people to 70 jobs
emphasizes the praticality of linear programming. The computing power required to
test all possible combinations to select the best assignment is quite large. However, it
takes only a moment to find the optimum solution by modeling problem as a linear
program and applying the simplex algorithm. The theory behind linear programming is
to drastically reduce the number of possible optimal solutions that must be checked.
In the years from the time when it was first proposed in 1947 by Dantzig, linear
programming and its many forms have come into wide use worldwide. LP has become
popular in academic circles, for decision scientists (operations researchers and
management scientists), as well as numerical analysts, mathematicians, and
economists who have written hundreds of books and many more papers on the
subject. Though it is so common now, it was unknown to the public prior to 1947.
Actually, several researchers developed the idea in the past. Fourier in 1823 and the
well-known Belgian mathematician de la Valle Poussin in 1911 each wrote a paper
describing today's linear programming methods, but it never made its way into
mainstream use. A paper by Hitchcock in 1941 on a transportation problem was also
overlooked until the late 1940s and early 1950s. It seems the reason linear
programming failed to catch on in the past was lack of interest in optimizing.
"Linear programming can be viewed as part of a great revolutionary development
which has given mankind the ability to state general goals and to lay out a path of
detailed decisions to take in order to 'best' achieve its goals when faced with
practical situations of great complexity. Our tools for doing this are ways to
formulate real-world problems in detailed mathematical terms (models), techniques
for solving the models (algorithms), and engines for executing the steps of algorithms
(computers and software)."
OBJECTIVES
Objectives of this folio :
To apply and adapt a variety of problem-solving strategies to
solve problems
To improve thinking skills
To promote effective mathematical communication
To develop mathematical knowledge through problem solving in
a way that increases students interest and confidence
to use the language of the mathematical to express
mathematical ideas precisely
To provide learning environment that stimulate and enhances
effective learning
To develop positive attitudes towards mathematics.
FOREWARD
First of all, would like to say Alhamdulillah thank to the God, for
giving me strength and heath to do this project work.
PART 1
a) MATHEMATICAL OPTIMIZATION
Mathematical Optimization is a branch of mathematics that focuses
on problems where scarce resources need to be allocated
effectively, in complex, dynamic and uncertain conditions.
You can gain 20 months of paid work experience through our co-op
program, the largest of its kind in the world, or fast track your
degree by choosing the regular system of study.
for all
for all
(0,1).
How can we find global extrema? Unfortunately, not every global
extremum is also a local extremum:
. The only
critical point is x=1. And the first or second derivative test will imply
that x=1 is a local minimum. Looking at the graph (see below) we see that
the right endpoint of the interval [0,3] is the global maximum.
Thus the global minimum occurs at x=0.1, the global maximum occurs
at x=1.
C) LOCAL MAXIMUM/MINIMUM
Functions can have "hills and valleys": places where they reach a minimum
or maximum value.
It may not be the minimum or maximum for the whole function, but locally it is.
Local Maximum
First we need to choose an interval:
Note: f(a) should be inside the interval, not at one end or the other.
Local Minimum
Likewise, a local minimum is:
b)
FURTHER
EXPLORATION
LINEAR PROGRAMMING
(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 linear objective function, subject to linear equality and
linear inequality constraints. Its feasible region is a convex polytope,
which is a set defines as the intersection of infinitely many help
spaces, each of which is defines by a linear inequality. Its objective
function is a real-valued affine function defined on the polyhedron.
A linear programming algorithm finds a point in the polyhedron
where this function has the smallest (or largest) value such a point
exist.
TELECOMUNICATIONS
Call routing: Many telephone calls from New York to Los Angeles,
from Houston to Atlanta, etc. How should these calls be routed
through the telephone network?
Network design: If we need to build extra capacity, which links
should we concentrate on? Should we build new switching stations?
Internet traffic: For example, there was a great deal of
construction of new networks for carrying internet traffic a few
years ago
HOW IT STARTED
(b)
i)
(a) I.
II.
III.
(b) I.
x
12
14
10
12
7.5
4.5
1.5
II.
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 the maximum storage volume is 10 cubic meter.
(iii)
Cabinet x
Cabinet y
1600
1500
1400
1300
1400
1300
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;
INTRODUCTION
What is FUNCTION?
In mathematics, a function is a relation between a set of inputs and a set of
permissible outputs with the property that each input is related to exactly one
output. An example is the function that relates each real number x to its
square x . The output of a function f corresponding to an input x is denoted
by f(x) (read "f of x"). In this example, if the input is 3, then the output is 9,
and we may write f(3) = 9. Likewise, if the input is 3, then the output is also 9,
and we may write f(3) = 9. (The same output may be produced by more than one
input, but each input gives only one output.) The input variable(s) are
sometimes referred to as the argument(s) of the function.
Functions of various kinds are "the central objects of investigation" in most
fields of modern mathematics. There are many ways to describe or represent a
function. Some functions may be defined by a formula or algorithm that tells
how to compute the output for a given input. Others are given by a picture,
called the graph of the function. In science, functions are sometimes defined
by a table that gives the outputs for selected inputs. A function could be
described implicitly, for example as the inverse to another function or as a
solution of a differential equation.
2