Scribd
Upload
420 views

Module 7

1) Maxima and minima problems involve finding the maximum or minimum value of a function. 2) The procedure is to define variables, express the quantity to be maximized/minimized as a function, take the derivative and set it equal to zero to find critical points. 3) The first example finds the depth of a gutter that yields the greatest carrying capacity, which is 7.5cm. The second example finds the dimensions of a cylindrical tank that requires the least material, where the height equals the diameter.

Uploaded by

Gerwin Montevirgen
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
420 views

Module 7

1) Maxima and minima problems involve finding the maximum or minimum value of a function. 2) The procedure is to define variables, express the quantity to be maximized/minimized as a function, take the derivative and set it equal to zero to find critical points. 3) The first example finds the depth of a gutter that yields the greatest carrying capacity, which is 7.5cm. The second example finds the dimensions of a cylindrical tank that requires the least material, where the height equals the diameter.

Uploaded by

Gerwin Montevirgen
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Module 7

Maxima and Minima


- Maxima and minima is the application of maximum and minimum
values of a function to real life situation problems.
Procedure:
1.) Draw a figure whenever is necessary and denote the variable quantities by x,y,z,
etc. Define each variables used to have a basis for the resulting answers.
2.) Identify the quantity to be maximized or minimized and express it in terms of other
variable quantities. If possible, express this quantity in terms of one independent
variable.
3.) Find the first derivative of the function and set it to zero (since the roots of the
resulting equation are the critical numbers which will give the maximum or minimum
value of the function).

Keywords:

Maximum: greatest, most, biggest, largest, longest, etc.

Minimum: least, smallest, shortest, etc.


Example 1: A long strip of tin 30cm wide is to be made into a gutter with rectangular cross-section
by turning up equal widths along the edges. Find the depth of the gutter which yields the
greatest carrying capacity.
Let: x x
A
x = depth of the gutter (unknown) x x
y = base of the rectangular cross-section y
A = area of the rectangular cross-section 30cm
(maximized)
Solution: Other Solution:
𝐴 = 𝑥𝑦 → 𝐸𝑞. 1 𝐴 = 𝑥𝑦 → 𝐸𝑞. 1
2𝑥 + 𝑦 = 30 “differentiate” substitute Eq.2 & Eq.2a in Eq.1a
y = 30 − 2𝑥 → 𝐸𝑞. 2 =𝑥 +𝑦 0 = 𝑥 −2 + 30 − 2𝑥
substitute Eq.2 in Eq.1
optimize =0 4𝑥 = 30
𝐴 = 𝑥(30 − 2𝑥)
𝐴 = 30𝑥 − 2𝑥 0 = 𝑥 + 𝑦 → 𝐸𝑞. 1a 𝑥 = 7.5𝑐𝑚
“differentiate” find a second EQ’N → depth of the gutter
= 30 − 4𝑥 2𝑥 + 𝑦 = 30 that will yield the
𝑦 = 30 − 2𝑥 → 𝐸𝑞. 2 greatest carrying
optimize =0
“differentiate” capacity
0 = 30 − 4𝑥
= −2 → 𝐸𝑞. 2𝑎
4𝑥 = 30
→ depth of the gutter that will yield
𝑥 = 7.5𝑐𝑚 the greatest carrying capacity
Example 2: A closed cylindrical tank is to be made with a fixed volume. Find the relative
dimensions of the tank which will require the least amount of material in making.

Let: r C=2πr
r = radius of the cylinder base +
h = height of the cylinder
Ab = area of the circular base = πr2
h →2 Ab + As
As = area of the side = 2πrh
At = total surface area (minimized)
At = 2(πr2)+2πrh = 2π(r2+rh)
V = volume of cylinder (constant) = πr2h
Solution: “differentiate”
surface area (amount of material in making)
= 2𝜋 2𝑟 − 𝑟
𝐴𝑡 = 2𝜋 𝑟2 + 𝑟ℎ → 𝐸𝑞. 1
volume (constant) optimize =0
𝑉 = 𝜋𝑟2ℎ
0 = 2𝜋 2𝑟 −
h= → 𝐸𝑞. 2
= 2𝑟
substitute Eq.2 in Eq.1
𝑉 = 2𝜋𝑟
𝐴𝑡 = 2𝜋 𝑟2 + 𝑟
but: 𝑉 = 𝜋𝑟 ℎ
2
height should be equal to the
𝐴𝑡 = 2𝜋 𝑟2 + 𝑟 𝜋𝑟2ℎ = 2𝜋𝑟
diameter to have the least
ℎ = 2𝑟 = 𝑑 →
amount of material
Practice Problem
A rectangular field is to be enclosed
and divided into four equal lots by
fences parallel to one of the sides. A
total of 10,000 meters of fences are
available. Find the area of the largest
field that can be enclosed.

You might also like