Rr410210 Optimization Techniques

Code No: RR410210 Set No.
1
IV B.Tech I Semester Supplementary Examinations, February 2007
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) State and explain the standard form of LPP. [8]

(b) Explain the significance of slack, surplus and artificial variables of LPP. [8]
4. By simplex method maximize Z = 2x1 + 2x2

subject to x1 + 2x2 ≤ 10
x1 + x2 ≤ 6
x1 − x2 ≤ 2
x1 − 2x2 ≤ 1
x1 , x2 ≥ 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. Minimize f(x1 , x
2 ) =x1 −x2 +2x21 +2x1 x2 +x22 using Fletcher and Reeves method start-
0
ing from X1 = . [16]
0
7. (a) Define the constrained optimization problem. What are the methods used to
get the solution. [8]
(b) Derive the necessary conditions of optimality and find the solution for the
following problem:
Minimize f(X) = 5x1 x2
Subject to 25 - x21 − x22 ≥ 0 [8]
1 of 2
Code No: RR410210 Set No. 1
8. Use dynamic programming technique to solve the following problem. [16]
MaxZ = X1 .X2 .X3 .X4
Subject to X1 + X2 + X3 + X4 = 12
X1 , X2 , X3 , X4 ≥ 0.
⋆⋆⋆⋆⋆
2 of 2
⋆⋆⋆⋆⋆
1. (a) Define optimization and discuss its scope. Also explain how different terms
are used in the optimization problem. [8]
(b) Find the maxima and minima, if any of [8]
2
f(x) = 4x3 - 1 8x + 27x + - 7
4. Find all the alternate optimal basic solutions of the following problems and then
write the general expressions for all the non basic optimal solution.
Maximize Z = x1 + 2x2 + 3x3
subject to x1 + 2x2 + 3x3 ≤ 10
x1 + x2 ≤ 5
x1 ≤ 1
xi ≥ 0 [16]
5. Describe a method to obtain an initial feasible for a transportation problem by
(a) Least cost method [6]
(b) Vogel?s approximation method [6]
Compare both the values and comment [4]
6. Define [8+8=16]
(a) Gradient of a function
(b) Steepest descent direction using contour representation.
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
8. State Bellman’s principle optimality and explain by an illustrative example how it
can be used to solve multistage decision problem. [16]
⋆⋆⋆⋆⋆
2 of 2
⋆⋆⋆⋆⋆
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]

4. Show that the following LPP has unbounded solution [16]

maximize Z = 3x1 + 2x2
subject to x1 − x2 ≤ 1
3x1 − 2x2 ≤ 6
x1 , x2 ≥ 0
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. Draw the flow chart for the univariate method, explain about each block in the flow
chart. [16]
7. Construct the φK function according to the exterior penalty function approach and
complete the minimization φK of for the following problem. [16]
Minimize f(x) = (x - 1)2
Subject to g1 (x) = 2 − x ≤ 0,
g2 (x) = x − 4 ≤ 0.
1 of 2
8. Solve the following problem by the dynamic programming approach: [16]
Max Z = 3x1 + 5x2 ,
Subject to x1 ≤ 4
x2 ≤ 6
3x1 + 2x2 ≤ 18
x1 , x2 ≥ 0.
⋆⋆⋆⋆⋆
2 of 2
⋆⋆⋆⋆⋆
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) By Lagrangian multiplier method maximize Z = πx1 2 x2
subject to x1 2 + x1 x2 − 12 = 0
[8]
(b) Using Kuhn-Tucker conditions minimise [8]
f = x1 2 + x2 2 + 20(x1 + x2 − 100) + 20(x1 − 50)
Subject to x1 ≥ 50
x1 + x2 ≥ 100
3. (a) With respect to graphical method explain. [3+3=6]
i. Bound points
ii. Free points
(b) Use graphical method, to solve [10]
Max Z = 5x1 + 3x2
Subject to 4x1 + 5x2 ≤ 10
5x1 + 2x2 ≤ 10
3x1 + 3x2 ≤ 12 and x1 , x2 ≥ 0
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) When do you get degeneracy in transportation problem . [6]
(b) Solve the following transportation problem.
Availability
7 4 0 5
6 8 0 15
3 9 0 9
Requirement 15 6 8 [10]
1 of 2
6. Draw the flowchart of Powell’s method. Explain about each block. [16]
7. Classify the constrained optimization techniques and briefly explain each technique.
[16]
8. Solve the following LPP by dynamic programming approach: [16]

Min Z = 3x1 + 5x2 ,
Subject to −3x1 + 4x2 ≤ 12
−2x1 + x2 ≤ 2
2x1 + 3x2 ≥ 12
0 ≤ x1 ≤ 4,
x2 ≥ 2.
⋆⋆⋆⋆⋆
2 of 2

Rr410210 Optimization Techniques

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Rr410210 Optimization Techniques

Uploaded by

Copyright:

Available Formats

Code No: RR410210 Set No.

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

4. By simplex method maximize Z = 2x1 + 2x2

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

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

4. Show that the following LPP has unbounded solution [16]

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

8. Solve the following LPP by dynamic programming approach: [16]

You might also like