Академический Документы
Профессиональный Документы
Культура Документы
4. a) Reduce the following system of equations into a canonical form with x1,x2 and x3
as basic variables
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
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.
b) Explain different methods of obtaining BFS in transportion problem.
6. Draw the flow chart for the univariate method, explain about each block in the
flow chart.
Contd…2
Code No. 310206 .2. Set No. 1
8. A firm has divided its marketing area into three zones. The amount of sales
depends upon the number of salesman in each zone. The firm has been collecting
the data regarding sales and salesman in each area over a number of past years.
The information is given in the table. For the next year firm has only nine
salesmen and the problem is to allocate these salesmen to three different zones so
that the total sales are maximum.
###
Set No.
Code No: 310206
III B.Tech. I-Semester Regular Examinations, November-2003
OPTIMIZATION TECHNIQUES
(Electrical and Electronics Engineering)
2
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
12 x 5 − 45 x 4 + 40 x 3 + 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.
4. Maximize Z = 8x2
subject to x1- x2 ≥ 0
2x1 + 3x2 ≤ -6
x1,x2 are unrestricted in sign
use simplex method
5. Solve the following transportion problem. Get BFS by north west corner method
Availability
1 2 1 4 30
3 3 2 1 50
4 2 5 9 20
Requirement 20 40 30 10
6. Define
a) Gradient of a function
b) Steepest descent direction using contour representation.
Contd…2
Code No. 310206 .2. Set No. 2
###
Set No.
Code No: 310206
III B.Tech. I-Semester Regular Examinations, November-2003
OPTIMIZATION TECHNIQUES
(Electrical and Electronics Engineering)
3
Time: 3 hours Max. Marks: 80
Answer any FIVE questions
All questions carry equal marks
---
2. a) State and explain the necessary conditions for existence of relative optima in case
of multivariable objective functions without constraints.
b) Obtain the set of necessary conditions for the non-linear programming problem:
Maximize Z = x12 + 3x22 + 5x32
subject to the constraints x1 + x2 + 3x3 = 2,
5x1 + 2x2 + x3 = 5,
x1, x2, x3 >= 0.
5. There are three parties who supply the following quantities of coal and three
consumers who require the coal as follows
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.
Contd…2
Code No. 310206 .2. Set No. 3
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:
Course sections
Study days
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?
###
Set No.
2. a) Discuss the method of Lagrange Multipliers method applicable for single Variable
Optimization with equality constraints.
b) Use Lagrangian Multiplier method to solve
min Z = 2x12 -24x1 + 2x22 - 8x2 + 2x32 - 12x3 + 200.
3. a) The set of feasible solutions of a LPP must have only a finite number of vertices.
True/False? Discuss.
b) Solve the following LPP graphically
Min Z = x1 – 2x2
Subject to –x1 + x2 ≤ 1
2x1 + x2 ≤ 2 and x1, x2 ≥ 0
4. a) Given the following LP model, introduce slack, surplus and artificial variables to
form an equivalent problem that can be presented to the simplex method to obtain
an optimal solution
maximize Z = 3x1+2x2 + 8x3
subjected to 4x1-3x2 + 12x3 ≥ 12
x1 + 4x3 ≤ 6
x1- x3 = 2 and xi ≥ 0 where i=1,2,3
b) Solve the model using simplex algorithm
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?
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
###