Ot

www.andhracolleges.
com The Complete Information About Colleges in Andhra Pradesh
Code No: M0206 Set No. 1

IV B.Tech I Semester Regular Examinations, November 2009
OPTIMIZATION TECHNIQUES
(Electrical & Electronic Engineering)
Time: 3 hours Max Marks: 80
www.andhracolleges.com
Answer any FIVE Questions
All Questions carry equal marks
?????
1. (a) What are the different types of optimization problems? Explain each with the
help of suitable objective function and constraints. [8]
(b) Discuss briefly about the following with respect to LPP
i. Objective function [3]
ii. Constraints [3]
iii. Variable [2]
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 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) 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) Discuss the techniques used to solve the transportation problem [6]
Seminar Topics - Scholarships - Admission/Entrance Exam Notifications

USA-UK-Australia-Germany-France-NewZealand Universities List
1 of 2
www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information
www.andhracolleges.com The Complete Information About Colleges in Andhra Pradesh

(b) Solve the following transportation problem [10]
D\O A B C Availability
X 500 300 2200 1
Y 900 450 1700 3
Z 2500 2000 500 4
Requirement 4 2 2 8
6. (a) List the one dimensional minimization methods. [8]

(b) Draw the flow chart for implementing Fibonacci series method. [8]
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.
www.andhracolleges.com ?????

2 of 2

?????
(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]
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 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. Use simplex method to maximize Z = 3x1 − x2

subject to 2x1 + x2 ≥ 2
x1 + 3x2 ≤ 3
x2 ≤ 4
x1 ≥ 0
[16]
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
1 of 2

Requirement 15 6 8 [10]
6. Draw the flowchart of Powell’s method. Explain about each block. [16]
7. Construct the φk function, according to (a) interior and (b) exterior penalty func-
tion methods and plot its contours for the following problem:
Maximize f = 2x
Subject to 2 ≤ x ≤ 10. [16]
8. The ABC Corporation has nine salesmen who presently sell in three separate sales
areas of Northern India. The profitability for each salesman in the three sales areas
are as follows:
No of salesman
1 0 1 2 3 4 5 6 7 8 9
Area 2 9 8 7 6 5 4 3 2 1 0
3 0 1 2 3 4 5 6 7 8 9
Profitability (in thousand of Rs)
Area 1 20 32 47 57 66 71 82 90 100 110
2 135 125 115 104 93 82 71 60 50 40
3 50 61 72 84 97 109 120 131 140 150
Determine the optimum allocation of salesmen in order to maximize profits. [16]
?????
2 of 2

?????
(b) Discuss briefly about the following with respect to LPP
i. Objective function [3]
ii. Constraints [3]
iii. Variable [2]
2. (a) State and explain Kuhn-Tucker Conditions for non-linear programming prob-
lem. [8]
(b) Use Kuhn-Tucker conditions to determine x1 , x2 , x3 so as to maximize [8]
z = −x1 2 − x2 2 − x3 2 + 4x1 + 6x2
subject to x1 + x2 <= 2,
2x1 + 3x2 <= 12
and x1 , x2 >= 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. 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) With the help of an example discuss unbalanced transportation problem [6]
(b) Solve the following transportation problem
Availability
30 20 10 800
5 15 25 500
Requirement 300 300 400 [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]
1 of 2

7. Construct the φk function, according to (a) interior and (b) exterior penalty func-
tion methods and plot its contours for the following problem:
Maximize f = 2x
Subject to 2 ≤ x ≤ 10. [16]
8. An electronic device consists of four components each of which must function for
the system to function. The system reliability can be improved by installing par-
allel units in one or more components. The reliability of components, R with one,
two, or three parallel units, and the corresponding cost, C are given in the table.
The maximum amount available for this device is 100. Determine the number of
parallel units in each component by dynamic programming. [16]
No of Components
parallel
units
1 2 3 4
R C R C R C R C
1 0.7 10 0.5 20 0.7 10 0.6 20
2 0.8 20 0.7 40 0.9 30 0.7 30
3 0.9 30 0.8 50 0.95 40 0.9 40
?????
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) Discuss the method of Lagrange Multipliers method applicable for single Vari-
able Optimization with equality constraints. [8]
(b) Use Lagrangian Multiplier method to solve
min Z = 2x1 2 − 24x1 + 2x2 2 − 8x2 + 2x3 2 − 12x3 + 200. [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 solve maximize Z = 2x1 + 5x2

Subjected to x1 + 2x2 ≤ 8
x1 ≤ 4
0 ≤ x2 ≤ 3 x1 is unrestricted.
[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. (a) Give a proof for the convergence of interior penalty function method. [6]
(b) Using an exterior algorithm solve the following problem:
Minimize f(x1 , x2 ) = 31 (x1 + 1)3 + x2
Subject to g1 (x1 , x2 ) = 1 − x1 ≤ 0
g2 (x1 , x2 ) = −x2 ≤ 0 [10]

1 of 2

8. A student has five days at his disposal to revise the subject before examination.
The course is divided into four sections. He decides to devote a whole day to
the study of some section so that he may study a section for one day, two days,
three days etc., or not at all. The expected grade points he will get for different
alternative arrangements are as follows:
Study days Course sections

I II III IV
0 1 1 0 0
1 2 1 0 1
2 2 2 1 2
3 3 3 2 2
4 4 3 3 3
5 4 4 3 4
How should he distribute the available days to the different sections of the course
so that he maximizes his grade point average? [16]
?????
2 of 2

Ot

Uploaded by

Document Information

Original Title

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

Ot

Uploaded by

Copyright:

Available Formats

www.andhracolleges.

com The Complete Information About Colleges in Andhra Pradesh

Code No: M0206 Set No. 1

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

Seminar Topics - Scholarships - Admission/Entrance Exam Notifications

Code No: M0206 Set No. 1

6. (a) List the one dimensional minimization methods. [8]

7. Consider the problem:

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

Seminar Topics - Scholarships - Admission/Entrance Exam Notifications

Code No: M0206 Set No. 2

4. Use simplex method to maximize Z = 3x1 − x2

Code No: M0206 Set No. 2

Code No: M0206 Set No. 3

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

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

Code No: M0206 Set No. 3

Code No: M0206 Set No. 4

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

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

4. Use simplex method to solve maximize Z = 2x1 + 5x2

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

Seminar Topics - Scholarships - Admission/Entrance Exam Notifications

Code No: M0206 Set No. 4

Study days Course sections

You might also like