Rr410210 Optimization Techniques

Code No: RR410210 Set No.
1
IV B.Tech I Semester Regular Examinations, November 2007
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) In graphical method, when do you get [3+3=6]

i. infinite number of solutions
ii. No solutions.
(b) Solve the following LPP by graphical metgod [10]
Min Z = 5x1 − 2x2
Subject to 2x1 + 3x2 ≥ 1 and x1 , x2 ≥ 0
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. (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. 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. Classify the constrained optimization techniques and briefly explain each technique.
[16]
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) Find the Maxima and minima if any, of F(X) = 4x3 -18x2 + 27x - 7. [8]
(b) State and prove the necessary conditions for existence of relative optima in
case of single variable optimization. [8]
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) Develop the flowchart for simplex method [6]

(b) Use the above flowchart/algorithm to solve
minimize Z = −6x1 − 4x2
subject to 2x1 + 3x2 ≤ 30
3x1 + 2x2 ≤ 24
x1 + x2 ≥ 3
x 1 , x2 ≤ 0 [10]
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. 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).
1 of 2
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. 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) What are the different types of optimization problems? Explain each with the
help of suitable objective function and constraints. [8]
(b) If f(x) is optimal at x=x*, show that the first maximum varying even derivative
f(x) at x=x* must be positive for f(x*) to be minimum. [8]
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. Reduce the following system of equations

2x1 + 3x2 − 3x3 − 7x4 = 2
x1 + x2 − x3 + 3x4 = 12
x1 − x2 + x3 + 5x4 = 8
into a canonical form with x1 , x2 and x3 as basic variables. From this derive all
other canonical forms. [16]
5. (a) Explain why BFS of transportion problem has (m+n-1) allocations. Where m
are no. of rows and n are no. of columns. [10]
(b) Explain different methods of obtaining BFS in transportion problem. [6]
6. Minimize f = 4x1 2 + 3x2 2 − 5x1 x2 − 8x1 starting from the point (0,0) using Powell’s
method. [16]
7. Classify the constrained optimization techniques and briefly explain each technique.
[16]
1 of 2
8. Solve the following L.P.P. by dynamic programming approach:
Max Z = 3x1 + 4x2 ,
Subject to 2x1 + x2 ≤ 40
2x1 + 5x2 ≤ 180
x1 , x2 ≥ 0. [16]
⋆⋆⋆⋆⋆
2 of 2
⋆⋆⋆⋆⋆
1. (a) What is meant by statement of an optimization problem? Explain. [8]

(b) What is meant by non-linear programming problem? Explain. [8]
2. (a) State and explain the necessary and sufficient conditions for existence of rel-
ative optima in case of multivariable optimization with constraints. [8]
(b) Find the dimensions of a rectangular parallelepiped with largest volume whose
sides are parallel to the coordinate planes, to be inscribed in the ellipsoid. [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. By simplex method maximize Z = 2x1 + 2x2

subject to x1 + 2x2 ≤ 10
x1 + x2 ≤ 6
x1 − x2 ≤ 2
x1 − 2x2 ≤ 1
x 1 , x2 ≥ 0 [16]
5. (a) Explain with an example the various methods of finding BFS in transportation
problem
(b) Solve the following transportation problem [6]
Availability
4 5 7 25
7 7 3 20
7 3 5 40
Requirement 20 25 20 [10]
6. Draw the flow chart for the univariate method, explain about each block in the flow
chart. [16]
7. Determine whether the following optimization problem is convex, concave, or nei-

ther type: [16]
Minimize f = -4x1 + x21 − 2x1 x2 + 2x22
Subject to x1 + 12 x2 ≤ 3,
1
x
2 1
− 2x2 ≤ 0, andxi ≤ 0, i = 1, 2
1 of 2
8. Solve the following L.P.P. by dynamic programming approach:
Max Z = 8x1 + 7x2 ,
Subject to 2x1 + x2 ≤ 8
5x1 + 2x2 ≤ 15
x1 , x2 ≥ 0. [16]
⋆⋆⋆⋆⋆
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.

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

3. (a) In graphical method, when do you get [3+3=6]

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

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

4. (a) Develop the flowchart for simplex method [6]

5. Describe a method to obtain an initial feasible for a transportation problem by

(a) Least cost method [6]

8. Use dynamic programming technique to solve the following problem. [16]

4. Reduce the following system of equations

1. (a) What is meant by statement of an optimization problem? Explain. [8]

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

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

7. Determine whether the following optimization problem is convex, concave, or nei-

You might also like