SMK PEREMPUAN KAPAR

ADDITIONAL MATHEMATICS
PROJECT WORK 2015
MATHEMATICAL
OPTIMIZATION
NAME
CLASS

: YUvanitha ganesh
: 5 Akaun 1

NO.IC

: 981025-10-6196

TEACHER

: mr.TEE TIAN SI

CONTENTS
TITLE

PAGE

ACKNOWLEDGE

OBJECTIVE

INTRODUCTION

3-6

PART 1

7-12

PART 2

12-19

PART 3

20-23

FURTHER EXPLORATION

24-28

REFLECTION

29

CONCLUSION

30

Acknowledgement
First and foremost, I would like to thank God that finally, I have succeeded in
finishing this project work. I would like to thank my beloved Additional Mathematical
teacher, Mr. Tee Tian Si for all the guidance he had provided me during the process in
finishing this project work. I also appreciate his patience in guiding me completing this
project work. I would like to give a thousand thanks to my father and mother for giving
me their full support in this project work financially and mentally. They give me moral
support when I needed it. I would also like to give my thanks to my fellow friends who
had helped me in finding the information that I am clueless of, and the time we spent
together in study groups on finishing this project work. Last but not least, I would like to
express my highest gratitude to all those who give me the possibility to complete this
coursework. I really appreciate all the help I got. Again, thank you very much.

OBJECTIVE
i.

To apply and adapt a variety of problem

solving strategies to solve problems.
ii. To improve think skill.
iii. To promote effective mathematical
communication.
iv. To develop mathematical knowledge
through problem solving in a way that
increase students interest and confidence.
v. To use the language of mathematics to
express mathematical ideas precisely.
vi. To provide learning environment that
stimulates and enhances effective learning.
vii. To develop positive attitude towards
mathematics.

INTRODUCTION
In mathematical analysis, the maxima and minima (the
plural of maximum andminimum) 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.

Pierre de Fermat
Pierre de Fermat (French: [pjdfma]; 17[2] August 1601 12 January 1665) was
a French lawyer at the Parlement of Toulouse, France, and amathematician who is given credit
for early developments that led toinfinitesimal calculus, including his technique of adequality. In
particular, he is recognized for his discovery of an original method of finding the greatest and the
smallest ordinates of curved lines, which is analogous to that of thedifferential calculus, then
unknown, and his research into number theory. He made notable contributions to analytic
geometry, probability, and optics. He is best known for Fermat's Last Theorem, which he
described in a note at the margin of a copy of Diophantus' Arithmetica.
Life and work
Fermat was born in the first decade of the 17th century in Beaumont-de-Lomagne (presentday Tarn-et-Garonne), France; the late 15th-century mansion where Fermat was born is now a
museum. He was from Gascony, where his father, Dominique Fermat, was a wealthy leather
merchant, and served three one-year terms as one of the four consuls of Beaumont-de-Lomagne.
His mother was either Franoise Cazeneuve or Claire de Long. Pierre had a brother and two
sisters and was almost certainly brought up in the town of his birth. There is little evidence
concerning his school education, but it was probably at the Collge de Navarre in Montauban.
He attended the University of Orlans from 1623 and received a bachelor in civil law in 1626,
before moving to Bordeaux. In Bordeaux he began his first serious mathematical researches and
in 1629 he gave a copy of his restoration ofApollonius's De LocisPlanis to one of the
mathematicians there. Certainly in Bordeaux he was in contact with Beaugrand and during this
time he produced important work on maxima and minima which he gave to tienne d'Espagnet
who clearly shared mathematical interests with Fermat. There he became much influenced by the
work of Franois Vite.
In 1630 he bought the office of a councillor at the Parlement de Toulouse, one of the High Courts
of Judicature in France, and was sworn in by the Grand Chambre in May 1631. He held this office
for the rest of his life. Fermat thereby became entitled to change his name from Pierre Fermat to
Pierre de Fermat. Fluent in six languages: French, Latin, Occitan, classical Greek, Italian, and
Spanish, Fermat was praised for his written verse in several languages, and his advice was
eagerly sought regarding the emendation of Greek texts.
He communicated most of his work in letters to friends, often with little or no proof of his
theorems. Secrecy was common in European mathematical circles at the time. This naturally led
to priority disputes with contemporaries such as Descartes andWallis.[3]
Anders Hald writes that, "The basis of Fermat's mathematics was the classical Greek treatises
combined with Vieta's new algebraic methods."[4]

Work
Fermat's pioneering work in analytic geometry was circulated in manuscript form in 1636,
predating the publication of Descartes' famous La gomtrie. This manuscript was published
posthumously in 1679 in "Varia opera mathematica", as Ad Locos PlanosetSolidosIsagoge,
("Introduction to Plane and Solid Loci").[5]
In Methodusaddisquirendammaximamet minima and in De tangentibuslinearumcurvarum, Fermat
developed a method (adequality) for determining maxima, minima, and tangents to various
curves that was equivalent to differential calculus.[6][7]In these works, Fermat obtained a technique
for finding the centers of gravity of various plane and solid figures, which led to his further work
in quadrature.

Pierre de Fermat
Fermat was the first person known to have evaluated the integral of general power functions.
Using an ingenious trick, he was able to reduce this evaluation to the sum ofgeometric series.
[8]
The resulting formula was helpful to Newton, and then Leibniz, when they independently
developed the fundamental theorem of calculus.[citation needed]
In number theory, Fermat studied Pell's equation, perfect numbers, amicable numbers and what
would later become Fermat numbers. It was while researching perfect numbers that he
discovered the little theorem. He invented a factorization methodFermat's factorization method
as well as the proof technique of infinite descent, which he used to prove Fermat's right triangle
theorem which includes as a corollary Fermat's Last Theorem for the case n = 4. Fermat
developed the two-square theorem, and the polygonal number theorem, which states that each
number is a sum of three triangular numbers, four square numbers, fivepentagonal numbers, and
so on.
Although Fermat claimed to have proved all his arithmetic theorems, few records of his proofs
have survived. Many mathematicians, including Gauss, doubted several of his claims, especially
given the difficulty of some of the problems and the limited mathematical methods available to
Fermat. His famous Last Theorem was first discovered by his son in the margin on his father's
copy of an edition of Diophantus, and included the statement that the margin was too small to
include the proof. He had not bothered to inform even Marin Mersenne of it. It was not proved
until 1994 by Sir Andrew Wiles, using techniques unavailable to Fermat.

Although he carefully studied, and drew inspiration from Diophantus, Fermat began a different
tradition. Diophantus was content to find a single solution to his equations, even if it were an
undesired fractional one. Fermat was interested only in integer solutions to his Diophantine
equations, and he looked for all possible general solutions. He often proved that certain equations
had no solution, which usually baffled his contemporaries.[citation needed]
Through their correspondence in 1654, Fermat and Blaise Pascal helped lay the fundamental
groundwork for the theory of probability. From this brief but productive collaboration on
the problem of points, they are now regarded as joint founders ofprobability theory.[9] Fermat is
credited with carrying out the first ever rigorous probability calculation. In it, he was asked by a
professional gambler why if he bet on rolling at least one six in four throws of a die he won in the
long term, whereas betting on throwing at least one double-six in 24 throws of two dice resulted in
his losing. Fermat subsequently proved why this was the case mathematically.[10]
Fermat's principle of least time (which he used to derive Snell's law in 1657) was the
first variational principle[11] enunciated in physics since Hero of Alexandria described a principle of
least distance in the first century CE. In this way, Fermat is recognized as a key figure in the
historical development of the fundamental principle of least action in physics. The termsFermat's
principle and Fermat functional were named in recognition of this role.[12]
Assessment of his work

Holographic willhandwritten by Fermat on 4 March 1660 kept at the Departmental Archives

ofHaute-Garonne, in Toulouse
Together with Ren Descartes, Fermat was one of the two leading mathematicians of the first half
of the 17th century. According to Peter L. Bernstein, in his book Against the Gods, Fermat "was a
mathematician of rare power. He was an independent inventor of analytic geometry, he
contributed to the early development of calculus, he did research on the weight of the earth, and
he worked on light refraction and optics. In the course of what turned out to be an extended
correspondence with Pascal, he made a significant contribution to the theory of probability. But
Fermat's crowning achievement was in the theory of numbers." [14]
Regarding Fermat's work in analysis, Isaac Newtonwrote that his own early ideas about calculus
came directly from "Fermat's way of drawing tangents." [15]

Of Fermat's number theoretic work, the 20th-century mathematician Andr Weil wrote that "...
what we possess of his methods for dealing with curves of genus 1 is remarkably coherent; it is
still the foundation for the modern theory of such curves. It naturally falls into two parts; the first
one ... may conveniently be termed a method of ascent, in contrast with thedescent which is
rightly regarded as Fermat's own."[16] Regarding Fermat's use of ascent, Weil continued "The
novelty consisted in the vastly extended use which Fermat made of it, giving him at least a partial
equivalent of what we would obtain by the systematic use of the group theoretical properties of
the rational points on a standard cubic."[17] With his gift for number relations and his ability to find
proofs for many of his theorems, Fermat essentially created the modern theory of numbers.

PART 1
a)Describe briefly

Mathematical Optimization

."Optimization" and "Optimum" redirect here. For other uses, see Optimization
(disambiguation) and Optimum (disambiguation).
"Mathematical programming" redirects here. For the peer-reviewed journal,
see Mathematical Programming.
In mathematics, computer science, operations research, mathematical
optimization (alternatively, optimization or mathematical programming) is the selection of
a best element (with regard to some criteria) from some set of available alternatives. [1]
In the simplest case, an optimization problem consists of maximizing or minimizing areal
function by systematically choosing input values from within an allowed set and computing

the value of the function. The generalization of optimization theory and techniques to other
formulations comprises a large area of applied mathematics. 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

Graph of a paraboloid given by f(x, y) = (x + y) + 4. The global maximum at (0, 0, 4) is

indicated by a red dot.

Global Maximum/Minimum

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 are the greatest and least
elements in the set, respectively. Unbounded infinite sets, such as the set of real numbers,
have no minimum or maximum.

Local and global maxima and minima for cos(3x)/x, 0.1 x 1.1

Local Maximum/Minimum

Function can have hill 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:

Then we can say that a local maximum is the point where:

The height of the function at "a" is greater than (or equal to) the height
anywhere else in that interval.

Or, more briefly:

f(a) f(x) for all x in the interval

In other words, there is no height greater than f(a).

Local Minimum
Likewise, a local minimum is:
f(a) f(x) for all x in the interval
The plural of Maximum is Maxima
The plural of Minimum is Minima
Maxima and Minima are collectively called Extrema

Global (or Absolute) Maximum and Minimum

The maximum or minimum over the entire function is called an "Absolute" or "Global"
maximum or minimum.
There is only one global maximum (and one global minimum) but there can be more than
one local maximum or minimum.

Assuming this function continues downwards to left or right:

The Global Maximum is about 3.7

The Global Minimum is Infinity

Part 2
a)Encik Shah has been involved in a sheep farming business
for several years and he supplies meat and milk products to
the communities. He wished to build a rectangular sheep
pen with two parallel partitions using 200 meters fence.
Hence state the maximum area of the pen.
y

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

When x = 25,

2y= 200 4x
y = 100 2x

y = 100 2(25)
= 50

Area of the pen = xy

A = x (100 2x)
= 100x- 2x2
dA
dx = 100 4x
dA
= 0, 0 = 100 4x
dx
4x = 100
x = 25

Method 2 (Completing The Square)

A = 100x 2x2
= -2x2 + 100x
= -2(x2 - 50x)
= -2[(x -25)2 625]
= -2(x 25)2 +1250

Maximum area of the pen

= 50m x25m
= 1250m2

Since a>0, f(x) has a maximum value. The maximum value of A is 1250. A is maximum
when x 25=0,that is x=25.
xy=1250
25y = 1250
y = 50
Maximum value of the pen is 1250m2

Method 3 (Graph of maximum and minimum solve)

4x + 2y = 200
2y = 200 4x
y = 100 2x
A = xy
= x(100 2x)

= 100x 2x2
x
y
A

0
0
0

5
90
450

10
80
800

15
70
1050

20
60
1200

25
50
1250

30
40
1200

35
30
1050

40
20
800

45
10
450

50
0
0

1400
1200
1000
800
Area (m2)

600
400
200
0
0

10

20

30

40

50

60

Length(m)

b)Reza is helping En Shah to make a box without the top. The box is made by cutting
away four squares from the corners of a 30cm piece of cupboard as shown in Figure 1
and bending
h up the resulting cupboard to form the walls of the box.

Figure 1
30 2h

Find the largest possible volume of the box.

Method 1 (Differentiation)
V = (30 2h)(30 2h)h
= (900 120h + 4h2)h
= 900h 120h2 + 4h3
dV
dh

= 12h2 240h + 900

dV
dh

= 0, 0 = 12h2 240h + 900

0 = (h 5)(h 15)
h= 5, 15

When h =5, V= 4(5)3 120(5)2 +900(5)

= 2000cm3

(5, 2000)

When h =15, V = 4(15)3 120(15)2 +900(15)

=0, rejected

dV
dh

=24h-240
2

(5, 2000)

d V
2
dh

= 24(5) 240

= -120 ,<0
(5, 2000) is a maximum point,
Maximum volume of the box = 4(5)3 120(5)2 +900(5)
= 2000cm3

Method 2(Graph)

V = (30 2h)(30 2h) h

= (900 120h + 4h2) h

(5, 2000)

= 900h 120h2 + 4h3

h

10

11

12

13

V 0

78
4

135
2

172
8

193
6

200
0

194
4

179
2

156
8

129
6

100
0

70
4

43
2

20
8

2500

2000

1500

1000

500

0
0

Part 3

10

12

14

16

1
4
5
6

1
5
0

A market research company finds that traffic in a local mall over the course of a day
could be estimated by the function

P (t )=1800 cos

( 6 t )+ 1800

where P, is the

number of people going to the mall, and t is the time, in hours, after the mall opens. The
mall opens at 9.30am.
i.

Sketch the graph of function P(t)

ii.

When does the mall reach its peak hours and state the number of people.

iii.

Estimate the number of people in the mall at 7.30pm.

iv.

Determine the time when the number of people in rhe mall reaches 2570

i.

4000
3500
3000
2500
p(t)

2000
1500
1000
500
0
0

10

12

14

t(time)

ii.

The mall reaches its peak hours 6 hours after opening at 9.30am.,which is at
3.30pm. The number of people are 3600.

iii.

7.30 = 10
Based on the graph,
when t = 10, p(t) = 900
The number of people in the mall at 7.30pm.is 900 people.

iv.

Based on the graph,

when p(t) is 2570, t =3.9 , 8.1
3.9 = 3 hours 54 minutes
9.30pm. +3 hrs 54 minutes=1.24pm
8.1 = 8 hours 6 minutes
9.30pm. + 8hrs 6 minutes = 5.36pm.
The mall reaches 2570 people when 1.54 pm. and 5.36pm.

4000

3500

3000

2500

Axis Title

2000

1500

1000

500

0
0

6
Axis Title

10

12

Futher Exploration
b) Aaron owns a shipping company. He plans to move into his new office which is near to
the city centre. He needs some filing cabinets to organize his file. Cabinets x which cost
RM100 per unit, requires 0.6 square meters of the floor space and can hold 0.8 cubic
meters of files. Cabinet y which cost RM 200 per unit, requires 0.8 square meters of the
floor space and can hold 1.2 cubic meters of files. The ratio of the number of cabinet x to
the number of cabinet y is not less than 2:3. Aaron has an allocation of RM 1400 for the
cabinets and the office has room for no more than 7.2 square meters.
i.

Using the given information,

(a) Write the inequalities which satisfy all the above constraints,
(b) Construct and shade the region that satisfies all the above constraints

ii.

Using two different method, find the maximum storage volume.

iii.

Aaron plans to buy cabinet x in a range of 4 to 9 units. Tabulate all the possible
combinations of the cabinets that he can purchase. Calculate the cost of each
combination.

iv.

If you were Aaron which combination would you choose? Justify your answer and
give your reasons.

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 modelwhose
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 linearobjective
function, subject to linear equality and linear inequality constraints. Itsfeasible 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 programs are problems that can be expressed in canonical form:

where x represents the vector of variables (to be determined), c and b are vectorsof
(known) coefficients, A is a (known) matrix of coefficients, and

is the matrix

transpose. The expression to be maximized or minimized is called the objective

function (cTx in this case). The inequalities Ax b and x 0 are the constraints which
specify a convex polytope over which the objective function is to be optimized. In this
context, two vectors are comparable when they have the same dimensions. If every
entry in the first is less-than or equal-to the corresponding entry in the second then we
can say the first vector is less-than or equal-to the second vector.
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.

History

Leonid Kantorovich

The problem of solving a system of linear inequalities dates back at least as far
asFourier, who in 1827 published a method for solving them,[1] 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.[2] 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.[1] In 1941, Frank Lauren
Hitchcock also formulated transportation problems as linear programs and gave a
solution very similar to the later Simplex method;[2] 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 methodthat for the first time efficiently tackled the linear
programming problem in most cases. When Dantzig arranged meeting withJohn 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.[3] 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 NarendraKarmarkar introduced a new interior-point method for
solving linear-programming problems.

Uses
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 profits or minimize costs with limited resources.
Therefore, many issues can be characterized as linear programming problems
In "real life", linear programming is part of a very important area of mathematics called
"optimization techniques". This field of study (or at least the applied results of it) are used
every day in the organization and allocation of resources. These "real life" systems can
have dozens or hundreds of variables, or more. In algebra, though, you'll only work with
the simple (and graphable) two-variable linear case.
The general process for solving linear-programming exercises is to graph the inequalities
(called the "constraints") to form a walled-off area on the x,y-plane (called the "feasibility
region"). Then you figure out the coordinates of the corners of this feasibility region (that
is, you find the intersection points of the various pairs of lines), and test these corner

points in the formula (called the "optimization equation") for which you're trying to
find the highest or lowest value.

FUTHER EXPLORATION
a)Linear Programming (LP)
Method to achieve the best outcome (such as maximum profit or lower cost) in a
mathematical model whose requirements are represented by linear relationships.
It is a special case of mathematical programming.
A technique for the optimization of a linear objective function, subject to linear
equality and linear inequality constraints.
Can be applied to various field of study. It is used in business and economies, but
can also be utilized for some engineering problems. Industries that us linear
programming models include transportation, energy, telecommunication, and
manufacturing. It has proved useful in diverse type of problems in planning,
routing, scheduling, assignment and design.
Many practical problems in operations research can be expresses 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. Historically, ideas from linear programming have inspired many of
the central concept of optimization theory, such as duality, decomposition and the
importance of convexity and its generalizations.

Examples:

i.

ii.

A manufacturer produces two products, x and y, with two machines, Aand B.

The cost of producting
The cost of producting
each unit of x is:
each unit of y is
For machine A :50 minutes
For machine A :RM24
For machine B :30 minutes
For machine B :RM33
A manufacturer produces two products, x and y, with two machines, Aand B.
The cost of producting
The cost of producting
each unit of x is:
each unit of y is
For machine A :50 minutes
For machine A :RM24
For machine B :30 minutes
For machine B :RM33
Working plans for a particular week are: The week starts with:
40 hours of work on machine A A stock of 30 units of x and 90 units of y
35 hours of work on machine B A demand of 75 units of x and 95 unit of y

Price (RM)/unit

Area(m2)

Volme(m3)

100

0.6

0.8

200

0.8

1.2

i.

Cabinet type

(a) x:y 2:3

x
y

100x + 200y 1400

2
3

0.6x + 0.8y 7.2

x + 2y 14

2y 3x

ii.

Method 1
Volume = 0.8x + 1.2y
Equation : 0.8x + 1.2y = 1.92
When x = 0,
0.8(0) + 1.2y = 1.92
1.2y = 1.92
1.92
y = 1.2
y = 1.6 So, (0, 1.6)
when y = 0,
0.8x + 1.2(0) = 1.92
0.8x = 1.92
X = 2.4 So, (2.4, 0)
From the graph, the maximum storage volume
= 8(0.8) + 3(1.2)
= 10m3

Method 2

6x +8y 72
3x +4y 36

Point
Cabinet x
Cabinet y
Total volume=0.8x + 1.2y
(4, 5)
4
5
9.2
(5, 4)
5
4
8.8
(6, 4)
6
4
9.6
(7, 3)
7
3
9.2
10
(8, 3)
8
3
(9, 2)
9
2
9.6
(10, 1)
10
1
9.2
From the table above, the maximum storage volume is
0.8(8) + 1.2(3)
3
= 10m
iii.
Point
Cabinet x
Cabinet y
Total cost(RM)=100x + 200y
(4, 1)
4
1
600
(4, 2)
4
2
800
(4, 3)
4
3
1000
(4, 4)
4
4
1200
(4, 5)
4
5
1400
(5, 1)
5
1
700
(5, 2)
5
2
900
(5, 3)
5
3
1100
(5, 4)
5
4
1300
(6, 1)
6
1
800
(6, 2)
6
2
1000
(6, 3)
6
3
1200
(6, 4)
6
4
1400
(7, 1)
7
1
900
(7, 2)
7
2
1100
(7, 3)
7
3
1300
(8, 1)
8
1
1000
(8, 2)
8
2
1200
(8, 3)
8
3
1400
(9, 1)
9
1
1100
(9, 2)
9
2
1300
The table above shows all the possible combination of the cabinets that Aaron plans to
buy and the cost of each combination.
iv.

If I were Aaron, I would choose cabinet (8, 3) because the cost is exactly RM 1400
and it is also maximize the area 7.2m2 and volume 10m3.

10
9
8
7
6
Axis Title

5
4
3
2
1
0
0

10

Axis Title

12

14

16

18

Additional Mathematics,
Are you as easy as a click,
Do you become easier as we speak,
You are the one I seek,
You are the one I need,
Since I ever heard of you,
I become afraid of you,
But when I know you,
You attract me out of the blue.
With you, although it hard to be right,
I try my best not to be out of sight,
With Mr. Tee Tian Si to show the light,
And practices at night,
Now I shall see the light,
And it is so bright

After doing research, answering

question,drawing graph, making conjecture,
conclusion and some problem solving, I realize
that Additional Mathematics is very important
indaily life. About this project, overall, is quite
joyfuland interesting because I need to plan it
carefully and systematic because it is about my
future. In fact, the further exploration is a good
session because it can open my mind about
linear law. In a nutshell, I can apply the concept
and skills that I had in solving problems in
Additional Mathematics, I think this project is
very beneficial for all students.

PART 1

PART 2

PART 3

FURTHER
EXPLORATION