Code.

No: 15010
NR SET-1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III.B.TECH - I SEMESTER SUPPLEMENTARY EXAMINATIONS NOVEMBER, 2009
OPTIMIZATION TECHNIQUES
(ELECTRICAL & ELECTRONICS ENGINEERING)
Time: 3hours Max.Marks:80
Answer any FIVE questions
All questions carry equal marks
---
1. Does the function F ( x1 , x2 ) = x1 − 3ax1 x2 + x2 has global minimization for any value of ‘a’.
3

[16]

2. For the function F ( x1 , x2 ) = x13 + x23 + 2 x12 + 4 x2 2 + 6 have extreme points. What are they?
[16]
3. Solve the following LPP using simplex method.
Max 3x1 + 5 x2
ST x1 + x2 ≥ 100
5 x1 + 10 x2 ≤ 400
6 x1 + 8 x2 ≤ 440
x1 x2 ≥ 0

4. Solve the following transportation problem [16]

A B C D E Supply
X 15 20 13 19 16 40
Y 18 15 18 20 - 60
Z 20 19 14 21 16 70
Demand 30 40 50 40 60

5. Max f ( x) = 20 x − 3x 2 − x 4 in the range (0,1.406) with in 10% accuracy using Fibonacci

method. [16]

6. Min f ( x) = x 2 − 10exp(0.1x) using Powell’s method. Perform two iterations.

[16]
7. Min x1 + x2 − 10 x1 + 4 x2 + 2
2 2

ST x12 + x2 − 6 ≤ 0
x2 ≥ x1
x1 ≥ 0 Using Penalty function method [16]

8. Solve by dynamic programming.

Min Z= x12 + x22 + x32
ST x1 + x2 + x3 ≥ 27
x1 , x2 , x3 ≥ 0

-oOo-
 Code.No: 15010
NR SET-2
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III.B.TECH - I SEMESTER SUPPLEMENTARY EXAMINATIONS NOVEMBER, 2009
OPTIMIZATION TECHNIQUES
(ELECTRICAL & ELECTRONICS ENGINEERING)
Time: 3hours Max.Marks:80
Answer any FIVE questions
All questions carry equal marks
---
1. Solve the following LPP using simplex method.
Max 3x1 + 5 x2
ST x1 + x2 ≥ 100
5 x1 + 10 x2 ≤ 400
6 x1 + 8 x2 ≤ 440
x1 x2 ≥ 0

2. Solve the following transportation problem [16]

A B C D E Supply
X 15 20 13 19 16 40
Y 18 15 18 20 - 60
Z 20 19 14 21 16 70
Demand 30 40 50 40 60

3. Max f ( x) = 20 x − 3x 2 − x 4 in the range (0,1.406) with in 10% accuracy using Fibonacci

method. [16]

4. Min f ( x) = x 2 − 10exp(0.1x) using Powell’s method. Perform two iterations.

[16]
5. Min x12 + x2 2 − 10 x1 + 4 x2 + 2
ST x12 + x2 − 6 ≤ 0
x2 ≥ x1
x1 ≥ 0 Using Penalty function method [16]

6. Solve by dynamic programming.

Min Z= x12 + x22 + x32
ST x1 + x2 + x3 ≥ 27
x1 , x2 , x3 ≥ 0

7. Does the function F ( x1 , x2 ) = x13 − 3ax1 x2 + x2 has global minimization for any value of ‘a’.
[16]

8. For the function F ( x1 , x2 ) = x13 + x23 + 2 x12 + 4 x2 2 + 6 have extreme points. What are they?
[16]
-oOo-
 Code.No: 15010
NR SET-3
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III.B.TECH - I SEMESTER SUPPLEMENTARY EXAMINATIONS NOVEMBER, 2009
OPTIMIZATION TECHNIQUES
(ELECTRICAL & ELECTRONICS ENGINEERING)
Time: 3hours Max.Marks:80
Answer any FIVE questions
All questions carry equal marks
---
1. Max f ( x) = 20 x − 3x − x in the range (0,1.406) with in 10% accuracy using Fibonacci
2 4

method. [16]

2. Min f ( x) = x 2 − 10exp(0.1x) using Powell’s method. Perform two iterations.

[16]
3. Min x1 + x2 − 10 x1 + 4 x2 + 2
2 2

ST x12 + x2 − 6 ≤ 0
x2 ≥ x1
x1 ≥ 0 Using Penalty function method [16]

4. Solve by dynamic programming.

Min Z= x12 + x22 + x32
ST x1 + x2 + x3 ≥ 27
x1 , x2 , x3 ≥ 0

5. Does the function F ( x1 , x2 ) = x13 − 3ax1 x2 + x2 has global minimization for any value of ‘a’.
[16]

6. For the function F ( x1 , x2 ) = x13 + x23 + 2 x12 + 4 x2 2 + 6 have extreme points. What are they?
[16]
7. Solve the following LPP using simplex method.
Max 3x1 + 5 x2
ST x1 + x2 ≥ 100
5 x1 + 10 x2 ≤ 400
6 x1 + 8 x2 ≤ 440
x1 x2 ≥ 0

8. Solve the following transportation problem [16]

A B C D E Supply
X 15 20 13 19 16 40
Y 18 15 18 20 - 60
Z 20 19 14 21 16 70
Demand 30 40 50 40 60

-oOo-
 Code.No: 15010
NR SET-4
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III.B.TECH - I SEMESTER SUPPLEMENTARY EXAMINATIONS NOVEMBER, 2009
OPTIMIZATION TECHNIQUES
(ELECTRICAL & ELECTRONICS ENGINEERING)
Time: 3hours Max.Marks:80
Answer any FIVE questions
All questions carry equal marks
---
1. Min x1 + x2 − 10 x1 + 4 x2 + 2
2 2

ST x12 + x2 − 6 ≤ 0
x2 ≥ x1
x1 ≥ 0 Using Penalty function method [16]

2. Solve by dynamic programming.

Min Z= x12 + x22 + x32
ST x1 + x2 + x3 ≥ 27
x1 , x2 , x3 ≥ 0
3. Does the function F ( x1 , x2 ) = x13 − 3ax1 x2 + x2 has global minimization for any value of ‘a’.
[16]

4. For the function F ( x1 , x2 ) = x13 + x23 + 2 x12 + 4 x2 2 + 6 have extreme points. What are they?
[16]
5. Solve the following LPP using simplex method.
Max 3x1 + 5 x2
ST x1 + x2 ≥ 100
5 x1 + 10 x2 ≤ 400
6 x1 + 8 x2 ≤ 440
x1 x2 ≥ 0
6. Solve the following transportation problem [16]
A B C D E Supply
X 15 20 13 19 16 40
Y 18 15 18 20 - 60
Z 20 19 14 21 16 70
Demand 30 40 50 40 60

7. Max f ( x) = 20 x − 3x 2 − x 4 in the range (0,1.406) with in 10% accuracy using Fibonacci

method. [16]

8. Min f ( x) = x 2 − 10exp(0.1x) using Powell’s method. Perform two iterations.

[16]

-oOo-