Code No: R5311501 1

III B.Tech I Semester(R05) Supplementary Examinations, May 2009

OPTIMIZATION TECHNIQUES
(Computer Science & Systems 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. (a) State and explain the necessary and sufficient conditions for existence of relative 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 conditions, 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. (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. Minimize f = 4x1 2 + 3x2 2 − 5x1 x2 − 8x1 starting from the point (0,0) using Powell’s method. [16]
7. Explain an interior penalty function to solve a constrained nonlinear programming problem. [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.

?????
Code No: R5311501 2
III B.Tech I Semester(R05) Supplementary Examinations, May 2009
OPTIMIZATION TECHNIQUES
(Computer Science & Systems Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????

1. (a) Differentiate between single variable and multivariable optimization. [8]

(b) Explain the necessary and sufficient conditions for existence of relative optima in case of
single variable optimization. [8]
2. (a) State and explain the necessary and sufficient conditions for existence of relative 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. Reduce the following system of equations
[16] 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.
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]
th th
(b) Cij = unit cost transportation from i source to j destination [10]
6. (a) Briefly explain Powell’s modified procedure. [8]
(b) Write down the stepwise procedure to prevent premature termination of the process as
given by Powell. [8]
7. Explain the basic approach of the penalty function to solve a constrained nonlinear program-
ming problem. [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]

?????
Code No: R5311501 3
III B.Tech I Semester(R05) Supplementary Examinations, May 2009
OPTIMIZATION TECHNIQUES
(Computer Science & Systems Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????

1. (a) Differentiate between single variable and multivariable optimization. [8]

(b) Explain the necessary and sufficient conditions for existence of relative optima in case of
single variable optimization. [8]
2. (a) Write the necessary conditions for the following problem [8]
Max z = x1 3 − x2 2 + x1 x3 2
Subject to x1 + x2 2 + x3 = 5,
5x1 2 − x2 2 − x3 >= 2,
x1 , x2 , x3 >= 0.
(b) Use Lagrange Multiplier?s method to solve [8]
min Z = x1 + x2 + x3 = 20, 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. By simplex method maximize Z = 2x1 + 2x2
subject to x1 + 2x2 ≤ 10
x1 + x2 ≤ 6
x1 − x2 ≤ 2
x1 − 2x2 ≤ 1
x1 , x 2 ≥ 0 [16]
P P
5. (a) If all the sources 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. Define [8+8=16]
(a) Gradient of a function
(b) Steepest descent direction using contour representation.
7. Explain the basic approach of the penalty function to solve a constrained nonlinear program-
ming problem. [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.

?????
Code No: R5311501 4
III B.Tech I Semester(R05) Supplementary Examinations, May 2009
OPTIMIZATION TECHNIQUES
(Computer Science & Systems Engineering)
Time: 3 hours Max Marks: 80
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) 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. 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) Define the following terms with respect to LPP [4+4=8]
i. Line segment in n-dimensional space
ii. Convex set
(b) Prove that the feasible region of a LPP is convex. [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. There are three parties who supply the following quantities of coal and three consumers who
require the coal as follows: [16]
party 1 : 14 tons consumer A : 6 tons
party 2 : 12 tons B : 10 tons
party 3 : 5 tons C : 15 tons
The cost matrix is shown below
6 8 4
4 9 3
1 2 6
Find the schedule of a transportation policy which minimizes the cost.
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. Explain the basic approach of the penalty function to solve a constrained nonlinear program-
ming problem. [16]
8. In an investment project, only 8 units of money are available for allocation in unit amounts
to three investment programmes. The return function for each programme is given in table.
The function fi (x) represents the return from investing x units of money in ith investment
programme (i= 1,2,3......). What is the optimal investment policy? [16]
X 0 1 2 3 4 5 6 7 8
f1 (X) 0 5 15 40 80 90 95 98 100
f2 (X) 0 5 15 40 60 70 73 74 75
f3 (X) 0 4 26 40 45 50 51 52 53

?????