Code No: RR410210 Set No.

1
IV B.Tech I Semester Supplimentary Examinations, February 2008
OPTIMIZATION TECHNIQUES
(Electrical & Electronic Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Explain a single variable optimization technique. [8]

(b) Find the maxima and minima of
x4
f (x) = (x−1)(x−3) 3

[8]

2. Find the optimum solution of the following constrained multivariable problem: [16]
Maximise Z = 9 − x1 − 6x2 − 4x3 + 2x21 + 2x22 + x23 + 2x1 x2 + 2x1 x3
subject to x1 + x2 + 2x3 = 3

3. A TV manufacturing company has 3 major departments for its manufacture of two

methods A and B. Monthly capacities are given as follows:
Per unit time requirement Total machine hrs available in a
(hour) math
A B
Department 1 4 2 1600
Department 2 2.5 1 1200
Department 3 4.5 1.5 1600
The marginal profit of A is Rs 400/-each and that of model B is Rs 100/-. Assuming
that the company sells any quantity of either product due to favorable market con-
ditions, determine the optimum output for both models for higher possible profit
for a month. Use graphical method. [16]

4. (a) Explain the significance of artificial variable in simplex method. [6]

(b) State and discuss the condition for an LPP to end at unbounded solution. [10]

Sources Destinations Amount

1 2 3 Availability
5.
A1 C11 C12 C13 a1
A2 C21 C22 C23 a2
Amount b1 b2 b3 G
Required

Where
P P
(a) G = ai − bj [6]
(b) Cij = unit cost transportation from ith source to jth destination [10]

1 of 2
Code No: RR410210 Set No. 1
6. Use the method of steepest descent to go two steps towards the maximum of [16]
f (x) = −2x1 2 − x2 2 − x3 2 − 4x4 2 starting at the point (-1,1,0,-1).

7. Consider the problem:

Minimize f = x21 + x22 − 6x1 − 8x2 + 15
Subject to
4x21 + x22 ≥ 16
3x1 + 5x2 ≤ 15
Normalize the constraints and find a suitable value of r1 for use in the interior
penalty function method at the starting point (x1 , x2 ) = (0, 0). [16]

8. Solve the following problem by the dynamic programming:

Max Z = y12 + y22 + y32
Subject to constraint y1 .y2 .y3 ≤ 4 and y1 , y2 , y3 ≥ 0 and integers.
[16]

⋆⋆⋆⋆⋆

2 of 2
Code No: RR410210 Set No. 2
IV B.Tech I Semester Supplimentary Examinations, February 2008
OPTIMIZATION TECHNIQUES
(Electrical & Electronic Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Explain a single variable optimization technique. [8]

(b) Find the maxima and minima of
x4
f (x) = (x−1)(x−3) 3

[8]

2. (a) State and explain the necessary conditions for existence of relative optima in
case of multivariable objective functions without constraints. [8]
(b) Obtain the set of necessary conditions for the non-linear programming prob-
lem: [8]
2 2 2
Maximize Z = x1 + 3x2 + 5x3
subject to the constraints x1 + x2 +3x3 = 2,
5x1 + 2x2 + x3 = 5,
x1 , x2 , x3 > = 0.

3. (a) State and explain the standard form of LPP. [8]

(b) Explain the significance of slack, surplus and artificial variables of LPP. [8]

4. (a) Reduce the following system of equations into a canonical form with x1 , x2
and x3 as basic variables [10]
2x1 + 3x2 − 2x3 − 7x4 = 1
x1 + x2 + x3 + 3x4 = 6
x1 − x2 + x3 + 5x4 = 4
(b) Make the modifications in the above system of equations if x1 , x2 and x4 as
the basic variables. [6]

5. (a) P
If all thePsources are emptied and all the destinations are filled, show that
ai = bj is a necessary and sufficient condition for the existence of a
feasible solution to a transportation problem [8]
(b) Prove that there are only m+n-1 independent equations in a transportation
problem, m and n being the no. of origins and destinations and that any one
equation can be dropped as the redundant equation. [8]

6. Starting from (0,0) , carry out at the most five iterations for the following problem
using the method of steepest descent : [16]
2 2 2
Minimize f (x) = (x1 − x2 ) + (1 − x2 ).

7. Classify the constrained optimization techniques and briefly explain each technique.
[16]

1 of 2
Code No: RR410210 Set No. 2
8. Solve the following problem by using the dynamic programming: [16]
Min Z = y1 + y2 + ..... + yn
Subject to constraint
y1 .y2 .....yn = d
and yj ≥ 0; j = 1, 2, ......, n.

⋆⋆⋆⋆⋆

2 of 2
Code No: RR410210 Set No. 3
IV B.Tech I Semester Supplimentary Examinations, February 2008
OPTIMIZATION TECHNIQUES
(Electrical & Electronic Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) List out the various applications of optimization problems. [8]

(b) Find the extreme points of the functions. [8]
f (x1 , x2 ) = x1 3 + x2 3 + 2x1 2 + 4x2 2 + 6
2. (a) Discuss Hessain Matrix concept for deciding the sufficient condition in case of
Multivariable optimization with equality constraints. [8]
(b) Solve the non-linear problem optimize z = 4x1 2 + 2x2 2 + x3 2 − 4x1 x2
subject to the constraints x1 + x2 + x3 = 15,
2x1 − x2 + 2x3 = 20 and x1 , x2 , x3 >= 0. [8]
3. (a) State and explain the standard form of LPP. [8]
(b) Explain the significance of slack, surplus and artificial variables of LPP. [8]
4. Use simplex method to maximize Z = 3x1 − x2
subject to 2x1 + x2 ≥ 2
x1 + 3x2 ≤ 3
x2 ≤ 4
x1 ≥ 0

[16]
5. (a) P
If all thePsources are emptied and all the destinations are filled, show that
ai = bj is a necessary and sufficient condition for the existence of a
feasible solution to a transportation problem [8]
(b) Prove that there are only m+n-1 independent equations in a transportation
problem, m and n being the no. of origins and destinations and that any one
equation can be dropped as the redundant equation. [8]
6. Write down the step wise procedure for implementing quadratic interpolation method.
[16]
7. Consider the problem:
Minimize f = x21 + x22 − 6x1 − 8x2 + 15
Subject to
4x21 + x22 ≥ 16
3x1 + 5x2 ≤ 15
Normalize the constraints and find a suitable value of r1 for use in the interior
penalty function method at the starting point (x1 , x2 ) = (0, 0). [16]

1 of 2
Code No: RR410210 Set No. 3
8. Find the minimum value of
Z = y12 + y22 + ........ + yn2
Subject to constraint, y1 .y2 .......yn = c(c 6= 0)
And yj ≥ 0; j − 1, 2, ......, n.
[16]

⋆⋆⋆⋆⋆

2 of 2
Code No: RR410210 Set No. 4
IV B.Tech I Semester Supplimentary Examinations, February 2008
OPTIMIZATION TECHNIQUES
(Electrical & Electronic Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Determine the maximum and minimum values of the function: [8]
12x5 -45x4 +40x3 +5
(b) A d.c. generator has internal resistance of R ohms and develops an open
circuit voltage of ‘V’ volts. Find the value of load resistance ‘r’ for which the
power developed by the generator will be maximum. [8]

2. Find the optimum solution of the following constrained multivariable problem: [16]
Maximise Z = 9 − x1 − 6x2 − 4x3 + 2x21 + 2x22 + x23 + 2x1 x2 + 2x1 x3
subject to x1 + x2 + 2x3 = 3

3. (a) The set of feasible solutions of a LPP must have only a finite number of
vertices. True/False? Discuss. [6]
(b) Solve the following LPP graphically
Min Z = x1 − 2x2
Subject to −x1 + x2 ≤ 1
2x1 + x2 ≤ 12 and x1 , x2 ≥ 0 [10]

4. (a) Explain the significance of artificial variable in simplex method. [6]

(b) State and discuss the condition for an LPP to end at unbounded solution. [10]

5. (a) Compare transportation problem with simplex method [6]

(b) Solve the following transportation problem [10]
Availability
9 16 15 9 15
2 1 3 5 25
6 4 7 3 20
Requirement 10 15 25 10

6. Show that the function f(x)=x2 , 0 ≤ x ≤ 1 , f(x)=2-x, 0 ≤ x ≤ 1 , is unimodel

in (0,2).Use the Fibonacci method to find its maximal point with in an interval of
uncertainty 0.1. [16]

7. Consider the problem:

Minimize f = x21 + x22 − 6x1 − 8x2 + 15
Subject to
4x21 + x22 ≥ 16

1 of 2
Code No: RR410210 Set No. 4
3x1 + 5x2 ≤ 15
Normalize the constraints and find a suitable value of r1 for use in the interior
penalty function method at the starting point (x1 , x2 ) = (0, 0). [16]

8. Solve the following problem by using the dynamic programming: [16]

Min Z = y1 + y2 + ..... + yn
Subject to constraint
y1 .y2 .....yn = d
and yj ≥ 0; j = 1, 2, ......, n.

⋆⋆⋆⋆⋆

2 of 2