MAXIMUMS, MINIMUMS WITHOUT CALCULUS

AE-310 Engineering Design Optimization

Capsule-1

Example problem
Predict the maximum value of the function : y(x) = 3cos(4 x-1.3)+5cos(2x+0.5)

4 x 1.3 = 2n
2 x + 0.5 = 2k, let n,k are integers. =
2.3 2(2)

23 20(2)

As is a irrational number, so there are no integers n,k. So ymax(x) < 8 And ymax(x) = 5.7811
AE-310 Engineering Design Optimization Capsule-1

Using Algebra to find Minimums

To enclose a rectangular plot of land with a fixed length of fencing, what should be the length and breadth of the plot to cover maximum area ? y x

All rectangle with given perimeter, SQUARE has the largest area. Or, All rectangle with given area, SQUARE has the smallest perimeter.
AE-310 Engineering Design Optimization Capsule-1

Example
Two points (A and B) not on a line. Where should be the point C be located on the line so that the sum of the squares of the distances from C to A and C to B, (AC)2 + (BC)2 is maximum ? B

A
c

a
C x

b
AE-310 Engineering Design Optimization Capsule-1

A Civil Engineering problem

There are two towns A and B opposite side of a river with constant width w. As shown in the fig. A is distance a from the river, B is distance b, and the lateral separation of the two towns is d. Where should we build a bridge over the river (perpendicular to the rivers banks) so as to make the journey between A and B as short as possible ?
B

River

x
a b

AE-310 Engineering Design Optimization

Capsule-1

Solution
Total distance from A to B : = (2 + 2 + + 2 + Using Triangle inequality.. That is a+b>c for a triangle. + + + is a constant. Here w is a constant, + + + | + + | As, = , Or, =
+
B

w River

x
a

AE-310 Engineering Design Optimization

Capsule-1

The AM-GM Inequality

In the year 1954 famous mathematician G.Ehlers came out with the great proof of AM-GM inequality using only simple algebra and induction, but no

calculus.

What is AM-GM inequality ? If x1,x2, ..,xn are any n positive numbers, 1, And if =
1

1 +2 +3 . . + is the arithmetic mean of the of the xs

1

And if = 1 2 3 . .

is the geometric mean of s,

Then with equality iff 1 = 2 = 3 = . . = .

AE-310 Engineering Design Optimization Capsule-1

Triangle Problem
Of all triangles with a given area, show that it is the equilateral that has the smallest perimeter. A
= + + = = 2 2 + + + + = = >0 2 2 B

c C

b
^(1/3)

We know for a triangle "b+c>a"

= 3 3 1 = = = =
AE-310 Engineering Design Optimization

Capsule-1

Cylinder
A food can (both end sealed) with a given volume V is to have the of a right circular cylinder. What are the dimensions of the can (radius r and height h) so that the surface area is minimum ?
= 2 2 + 2
= 2 = 2 2 +

1 = ( 2 + + ) 6 3 2 2
AE-310 Engineering Design Optimization Capsule-1

From AM-GM inequality,

1 2 2 + + + + 3 2 2 2 2
1 3

2 4 2

1 3

2 4 2

1 3

Or, 6

2 42

1 3 1 3

Thus the surface area is never less than value when 2 =

2 42

, and equal to the minimum

i.e. , when =

= 2 2 2 3 .

AE-310 Engineering Design Optimization

Capsule-1

A Problem from Physics

When a cannon pointing straight up, directly away from the center of the earth, fires a shell at initial velocity v0 . The shell rises upwards, slows down due to gravity, halts and again falls down. But for a certain value of v0 the shell will never return to earth, i.e. Escape velocity. Calculate Escape velocity. Only considering gravitational force in action, then Acceleration of the shell
2 2 1 2 2

Shell

Cannon

Earth

If, R is the radius of Earth M is mass of earth G is universal gravity constant Capsule-1

AE-310 Engineering Design Optimization

Minimizing with a computer

A man can walk n times faster than he can swim (n>=1). He wants to travel from A, on the of a circular lake with radius R (centered on point O) to C, also on the edge of the lake. Cs location is specified by the given angle (measured from the diameter AOD), as shown in figure. His general strategy is to first swim along the chord AB, and then to walk the rest of the way along the lakes edge from B to C. if his total travel time is T, then where should be B to minimize T? 2 + = = ( + )/2 + = 2 + 2 + = 2 cos + 2 =central angle subtended by the mans walk -2=central angle subtended by the mans swim Mens swimming distances Mens walking distances total travel time = = = 2 T
+ 2

AE-310 Engineering Design Optimization

Capsule-1

Total travel time across the lake when beta=0

total travel time across the lake, beta=0 3.5

n=1.0 3

2.5

n=1.5

T/R

n=2.0 2 n=2.5

n=3.0 1.5

20

40

60

80 theta(in degrees)

100

120

140

160

180

AE-310 Engineering Design Optimization

Capsule-1

Total time travel across the lake when beta=90 degree

total time across the lake, beta=90 degrees

1.6

n=1.0

1.4

1.2
T/R

n=1.5

n=2.0

n=2.5 0.8 n=3.0

0.6

0.4

10

20

30

40 50 theta (in degrees)

60

70

80

90

AE-310 Engineering Design Optimization

Capsule-1

There would be a critical value of n for which either of the pure walk-only and swim-only strategies would give a minimum travel time What is that critical value of n? As n increases from unity the strategy for minimizing the total travel time begins as the pure strategy of swimming all the way and then switches to the pure strategy of walking all the way. Is that true for any value of ?

AE-310 Engineering Design Optimization

Capsule-1

AE-310 Engineering Design Optimization

Capsule-1