Advance Optimization Techniques

questions

1. Find the minimum of the function

f (x) = 10x6 − 48x5 + 15x4 + 200x3 − 120x2 − 480x + 100

2. Find the dimensions of a cylindrical tin (with top and bottom) made up of sheet metal to

maximize its volume such that the total surface area is equal to A0 = 24π.

3. A manufacturing firm producing small refrigerators has entered into a contract to supply

50 refrigerators at the end of the first month, 50 at the end of the second month, and 50

at the end of the third. The cost of producing x refrigerators in any month is given by $(x2

+ 1000). The firm can produce more refrigerators in any month and carry them to a

subsequent month. However, it costs $20 per unit for any refrigerator carried over from

one month to the next. Assuming that there is no initial inventory, determine the number

of refrigerators to be produced in each month to minimize the total cost.

4. Find the minimum of the function f(x) = x2 + 54/x in the interval [0,5], using Exhaustive

Search method.

5. Find the minimum of f = x(x − 1.5) in the interval (0.0, 1.00) to within 10% of the exact

value using exhaustive search method.

6. Minimize the function f (x) = 0.65 − [0.75/(1 + x 2 )] − 0.65x tan−1 (1/x) using the golden

section method with n = 6.

7. Minimize f (x) = 0.65 − [0.75/(1 + x2)] − 0.65x tan−1(1/x) in the interval [0,3] by the

Fibonacci method using n = 6.

8. Find the minimum of the function f(x) = x2 + 54/x in the interval [0,5], using Bounding

Phase method.

9. Minimize f(x) = 4x3 + x2 – 7x + 14 in the interval [0,1] using Golden Section Search method.
10. Minimize f(x, y) = 2x + 4y + xy – x2 – y2 using newton’s method. Take initial solution as

(0,0).

11. Use golden section search method to find optimum solution of x2 – 6x + 15 in the interval

[0, 4]. Go up to 3 or 4 iterations.

12. Find the minimum value of f(x) = x(x - 1) in the interval [0, 1] using exhaustive search

method, take n = 5. Go up to 3 or 4 iterations.

13. Minimize f(x) = x2 + 54/x, in the interval [0, 5], take n=3 using interval halving method.

14. Use Fibonacci search method to find minimum of the function f = 2πr 2 + 8/r in the

interval (0.5, 3.5), take n = 3.

15. Minimize f(x, y) = x – y + 2x2 + 2xy + y2 by taking initial solution as (0, 0) using Netwon’s

method

16. Apply steepest descent to the function f(x, y) = 4x2 – 4xy + 2y2 .

17. write all KKT conditions for minimizing the function f = x2 + 2y2 +3z2 subjected to

constraints g1 = x – y – 2z <= 12, g2 = x +2y – 3z <= 8.

18. Use interval halving method to find the minimum of x2 + 54/x in the interval [0, 5] till

length of interval is <= 0.8.

19. Use the steepest descent direction to search for the minimum of

f(x1,x2)=25x12+x22 , starting at x = [1, 3] with step size of 0.5.

20. f(x) = x2 + 2x -200, find the minimum of f(x) between (13, 14), take ε = 0.125, use Bisection

method.

21. Optimization the following objective function using GA for two generation No of

individual 6 (each individual coded for total 2*5=8 bit string length). Population

selection method: revolute wheel method, single point crossover with probability .95

and bit wise mutation with probability 0.09. min f(x1,x2)=(x12+x2-11)2+ (x1+x22-7)2 with

0≤x1,x2≤6