Professional Documents
Culture Documents
NAME
: 5 SN2
FORM
IC NUMBER : 990824-01-5797
TEACHER : PUAN ZUBAIDAH BINTI OSMAN
ACKNOWLEDGEMENT
This is a pleasure to know that my project had
been completed on time. For that, I would like to
Part1
INTRODUCTION
PART 2
MARKS
(%)
MEAN
STANDARD
DEVIATION
71
70
58
46
41
26
24
21
21
20
19
16
15
14
13
11
9
5
3
3
3
3
=
=
20665
= 512
- 541.4929
22
=
(i)
22
23.27
77
19.95
x-
= 20 23.27
19.95
= - 0.164
Probability = 0.4348
Number of students scored
= ( 1 0.4348 ) x
2763
(ii)
f(x)
0.3
0
z
z = 0.525
0.525 = k 23.27
K =33.74
19.9
5
REFLECTION
REFLECTION
ADDITIONAL MATHEMATICS
Add Maths
You start from
Addition, subtraction, multiplication and division
Then you expand to
Squares, cubes, square roots, and cube roots
And now your are in
Logarithms, differentiation and integration.
REFLECTION
REFLECTION
TABLE OF CONTENT
N
O
1.
TITLE
2.
PART 1
-HISTORY OF PROBABILITY
-THEORY OF DISCRETE PROBABILITY
DISTRIBUTION
-THEORY OF CONTINUOUS PROBABILITY
DISTRIBUTION
PART 2
3.
PART 3
4.
PART 4
5.
FURTHER EXPLORATION
PAGE
6.
REFLECTION
7.
CONCLUSION
CONCLUSION
To put it in a nutshell, it is crystal that I had acquired a lot of beneficial
knowledges and advantages by doing this project. I had learn a lot about
probability, trigonometry , linear programming and progression. These will
knowledge definitely be very useful for my future. I had learn on how to do
accurate estimations, the basic calculations used in banks for interest and many
more.
Not only that, through this project work, I learnt the value of being
rational and to think wisely before making any decisions. I also managed to skill
in by using new and various methods to solve problems involving calculations.
In contradiction with the above statements, I also learnt that I must
always be careful and vigilant when I am into calculations especially calculation
that involves big numbers.
Part 4
i.
ii.
DEPOSIT YEAR
(RM)
1000
201
MONTH
INTEREST
BANK BALANCE
(RM)
4.17
1004.17
500
500
201
7
201
8
2
3
4
5
6
7
8
9
10
11
12
13
4.18
4.20
4.22
4.24
4.25
4.27
4.29
4.31
4.33
4.34
4.36
6.46
1008.35
1012.55
1016.77
1021.01
1025.26
1029.53
1033.82
1038.13
1042.46
1046.80
1051.16
1557.63
14
15
16
17
18
19
20
21
22
23
24
25
6.49
6.52
6.54
6.57
6.60
6.63
6.65
6.68
6.71
6.74
6.77
8.88
1564.12
1570.63
1577.18
1583.75
1590.35
1596.97
1603.63
1610.31
1617.02
1623.76
1630.52
2139.40
26
27
28
29
30
31
32
33
34
8.91
8.95
8.99
9.03
9.06
9.10
9.14
9.18
9.22
2148.31
2157.26
2166.25
2175.28
2184.34
2193.44
2202.58
2211.76
2220.98
35
36
9.25
9.29
r
k
nt
( )
1+
1000 1+
0.05
12
( 12 ) (1)
= RM 1051.16
Second Year ( 2017 )
2230.98
2239.52
A=
(1051.16+500) 1+
0.05
12
( 12 ) (1 )
= RM 1630.52
Third Year ( 2018 )
A=
(1630.52+500) 1+
0.05
12
( 12 ) (1)
= RM 2239.52
FINAL ANSWER : RM2239.52
PART 5
HISTORY OF LINEAR PROGRAMMING
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 19461947, 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
Solve the business problems :With linear programming we can easily solve business problem. It is very
benefited for increase the profit or decrease the cost of business.
Easy work of manager under limitations and condition :Linear programming solve problem under different limitations and conditions , so
It is easy for manager to work under limitations and conditions . It helps manager
to decide in different limitations.
Use in solving staffing problems:With linear programming , we can calculate the number of staff needed in
hospitals ,mines , hotels and other type of business.
Helpful in profit planning :Today linear programming is used for good profit planning and to select best
advertising media
With linear programming we can select best advertising media among a numbers
of media.
Solve the diet problems :With linear programming you can solve the diet problems with minimum cost. It is
very useful for hospitals .There are different elements like vitamins, proteins,
carbohydrates and so on. You can select best quantity of them with minimum cost.
Transportation Problem
A company has a stock of goods allocated in m storehouses. The goods are to be
delivered to customers, each of which is requesting a certain quantity of the goods.
(It is supposed that the quantity of the goods in the storehouses is sufficient to
cover the customers requests.) The transportation cost of one unit of the goods
from the storehouse no. i to the customer no. j is c ij for
i = 1, 2, , m and j = 1, 2, , n. The goal is to make up a transportation plan so
that the requests of the customers are met and the total transportation costs are
minimal.
Minimization of production costs
A company produces n different kinds of goods. It has received orders from
customers to supply certain quantity of each kind of the goods. The company
produces the goods by m activities (processes). Each of the activities
no. 1, 2, , m produces all the kinds of the goods no. 1, 2, , n in a certain ratio.
(For example, the distillation of crude oil yields petrol, oil, paraffin oil, asphalt,
The production of iron in the blast furnace yields iron as well as slag, which can be
used in building industry. And so forth.) The unit production costs of the i-the
activity are c i. The goal is to make up an optimal production programme, i.e., to
determine the production level of the activities, so that the orders of the customers
are met and the total production costs are minimal.
Maximization of profit
A company performs n activities. It produces n kinds of goods, provides n kinds of
services, and so forth. The company sells its activities (products, services). Each
unit of the j-th activity sold yields a profit of c j for j = 1, 2, , n. The company
needs m kinds of resources to run its activities. Each of the resources (in the given
period of time) is available only in a certain amount. The goal is to make up an
optimal programme of the activities so that the resources are not overdrawn and
the total profit is maximized.
Equations
1.
2.
3.
4.
3x + y 12
x + y 10
3x + 2y 18
x + y < 10
3x + y = 12
x
12
x + 2y = 10
x
y
0
5
2
4
6
0
3x + 2y = 18
x
y
0
9
6
0
2
6
x + y = 10
x
y
3
7
0
10
10
0
3(2) + 5(6) =
3(1) + 5(9) =
t
F(t
)
0
0
1
2
3
241 900 180
0
4
270
0
5
6
7
335 3600 335
9
9
PART 3
8
270
0
9
10 11 12
180 900 241 0
0
(i)