r05311501 Optimization Techniques

Code No: R05311501 Set No.
1
III B.Tech I Semester Regular Examinations, November 2007
OPTIMIZATION TECHNIQUES
(Computer Science & Systems Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆
1. (a) Explain with the help of examples, how optimization problems are classified
based on: [8]
i. Single value objective function
ii. Multi value objective function.
(b) Explain the formulation of any engineering problem. Include objective func-
tions and constraints. [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. Use simplex method to maximize Z = 3x1 − x2

subject to 2x1 + x2 ≥ 2
x1 + 3x2 ≤ 3
x2 ≤ 4
x1 ≥ 0. [16]
5. (a) Explain degeneracy in transportation problem [6]
(b) Solve the following transportation problem [10]
Availability
19 30 50 10 7
70 30 40 60 9
40 8 70 20 18
Requirement 5 8 7 14
1 of 2
Code No: R05311501 Set No. 1
6. Draw the flow chart for the univariate method, explain about each block in the flow
chart. [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]
No of medical teams thousands of additional man-years of life

Country 1 Country 2 Country 3
0 0 0 0
1 45 20 50
8.
2 70 45 70
3 90 75 80
4 105 110 100
5 120 150 130
Determine how many teams are to be allocated for each country for maximum
effectiveness. [16]
⋆⋆⋆⋆⋆
2 of 2
⋆⋆⋆⋆⋆
based on: [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. (a) Explain the canonical form with respect to LPP. [6]

(b) Solve the following system of equations by using PIVOT operations
4x1 + 3x2 + x3 = 13
3x1 + 0x2 + 7x3 = 24
x1 + 2x2 + 3x3 = 14. [10]
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]
chart. [16]
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
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
⋆⋆⋆⋆⋆
based on: [8]
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) 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) 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]
1 of 2
7. Explain the basic approach of the penalty function to solve a constrained nonlinear
programming problem. [16]
No of medical teams thousands of additional man-years of life

Country 1 Country 2 Country 3
0 0 0 0
1 45 20 50
8.
2 70 45 70
3 90 75 80
4 105 110 100
5 120 150 130
Determine how many teams are to be allocated for each country for maximum
effectiveness. [16]
⋆⋆⋆⋆⋆
2 of 2
⋆⋆⋆⋆⋆
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) 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) 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. Solve the following LPP using simplex method
maximizeZ = −x1 + 2x2
subject to x1 + 2x2 ≤ 4
2x1 + 5x2 ≤ 10. [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]
chart. [16]
7. Explain the basic approach of the penalty function to solve a constrained nonlinear
programming problem. [16]
8. Solve the following problem by the dynamic programming approach: [16]
MaxZ = 3x1 + 7x2 ,
Subject to x1 + 4x2 ≤ 8
x2 ≤ 2
x1 , x2 ≥ 0.
1 of 2
⋆⋆⋆⋆⋆
2 of 2

r05311501 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

r05311501 Optimization Techniques

Uploaded by

Copyright:

Available Formats

Code No: R05311501 Set No.

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

7. Consider the problem:

No of medical teams thousands of additional man-years of life

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

4. (a) Explain the canonical form with respect to LPP. [6]

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

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

No of medical teams thousands of additional man-years of life

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

You might also like