Professional Documents
Culture Documents
Add Math f5 Project
Add Math f5 Project
a) Terangkan secara
ringkas ,
i) pengoptimuman matematik ,
INTRODUCTION
PART I
a) Describe briefly ,
i) mathematical optimization ,
Answers:
Finding global maxima and minima is the goal of optimization. If the function is defined over a
closed domain, then by the extreme value theorem global maxima and minima exist.
Furthermore, a global maximum (or minimum) must be either a local maximum (or minimum) in
the interior of the domain, or it must lie on the boundary of the domain. So a method of finding a
global maximum (or minimum) is to look at all the local maxima (or minima) in the interior, and
also look at the maxima (or minima) of the points on the boundary; and take the biggest (or
smallest) one.
For twice-differentiable functions in one variable, a simple technique for finding local maxima
and minima is to look for stationary points, which are points where the first derivative is zero. If
the second derivative at a stationary point is positive, the point is a local minimum; if it is
negative, the point is a local maximum; if it is zero, further investigation is required.
For any function that is defined piecewise, you can find maxima (or minima) by finding the
maxima (or minima) of each piece separately; and then seeing which one is biggest (or smallest).
Examples
The function x3 has no global or local minima or maxima. Although the first
derivative (3x2) is 0 at x = 0, the second derivative (6x) is also 0.
The function x3/ 3 - x has first derivative x2 1 and second derivative 2x.
Setting the first 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
maxima or minima.
The function cos(x) has infinitely many global maxima at 0, 2, 4, ..., and
infinitely many global minima at , 3, ... .
The function 2cos(x) - x has infinitely many local maxima and minima, but no
global maxima or minima.
PENEROKAAN LANJUT
Answer
History 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.
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.
Airlines
Airlines also need to consider plane routes, pilot schedules, direct and in-
direct flights, and layovers. There are certain standards that require pilots to
sleep for so many hours and to have so many days rest before flying.
Airlines want to maximize the amount of time that their pilots are in the air,
as well. Pilots have certain specializations, as not all pilots are able to fly the
same planes, so this also becomes a factor. The most controllable factor an
airline has is its pilots salary, so it is important that airlines use their
optimization teams to keep this expense as low as possible. Because all of
these constraints must be considered when making economic decisions
about the airline, linear programming becomes a crucial job.
Capital budgeting
Designing diets
Conservation of resources
Factory manufacturing