Code No: R203105E R20 SET - 1

III B. Tech I Semester Regular Examinations, Dec/Jan -2022-23

OPTIMIZATION IN OPERATIONS RESEARCH
(Common to CSE,CSE(AIML),CSE(AI),CSE(DS),CSE(AIDS),AIDS,AIML)

Time: 3 hours Max. Marks: 70

Answer any FIVE Questions ONE Question from Each unit
All Questions Carry Equal Marks
*****
UNIT-I
1. a) Construct an optimization problem with constrains. [7M]
b) Explain multivariate optimization problem without constrains. [7M]
Give its general format
(OR)
2. a) Describe Kuhn Tucker conditions. [7M]
b) Write about multivariable optimization with inequality [7M]
constrains.
UNIT-II
3. a) Formulate the following optimization problem. [7M]
A product consists of two components A and B. These
components require two different raw materials X and Y. 100
units of X and 200 units of Y are available for production. The
materials are processed in three departments. The requirement
of production time in hours and materials in units are given in
the table below.
Departmen Raw material input per Output of components
ts run in unit per run in units
X Y A B
1 7 5 6 4
2 4 8 5 8
3 2 7 7 3
b) Define Operations Research and List the basic steps involved in [7M]
an Operations Research study.
(OR)
4. a) Explain the procedure followed in simplex method of solving [7M]
linear programming problem.
b) An oil refinery wishes its product to have at least minimum [7M]
amount of 3 components: 10% of A, 20% of B and 12% of C. It
has available three different grades of crude oil: x, y, and z.
Grade x contains: 15% of A, 10% of B and 9% of C and costs Rs.
200/– per barrel. Grade y contains: 18% of A, 25% of B and 3%
of C and costs Rs. 250/– per barrel. Grade z contains 10% of A,
15% of B and 30% of C and costs Rs. 180/– per barrel.
Formulate the linear programming for least cost mix and obtain
the initial feasible solution.
UNIT-III
5. a) Explain steps in VAM method to solve Transportation problem. [7M]
b) Compare various methods of finding initial basic feasible [7M]
solution
(OR)
|''|''|||''|''|'|||| 1 of 2
 Code No: R203105E R20 SET - 1

6. a) Describe degeneracy in transportation problem and its remedy. [7M]

b) Explain finding optimum solution in transportation model with [7M]
an example.
UNIT-IV
7. a) Write about non linear programming problem and its solution. [7M]
b) Explain penality approach method. [7M]
(OR)
8. a) Describe steepest descent method. [7M]
b) Solve the following optimization problem. [7M]
A company manufactures two products A and B on two
machines. Whatever is manufactured is sold in the market, as
the market for the product is good. The capacities of the
machines are limited to produce daily 80 units of product A and
60 units of product B. The raw material supply required for the
product is limited to produce 600 units per day. The labour
required is 160 man-days and the organization has 160 men on
the roll. The production of A requires one man day hour of
labour and that of product B is 2 man day hour. The company's
objective is to maximize the total profit if the sales–price
relationships are as given below.
Product Unit price Quantity Cost function
demand
A P1 1500 – 5P1 200 a + 0.1 a2
B P2 3800 – 10P2 300 b + 0.1 b2
In the above table a and b are the number of units of A and B
produced, respectively. This can also be written as: a = 1500 – 5
P1 and b = 3800 – 10 P2
UNIT-V
9. a) Minimize a2 + b2 + c2 [7M]
Subject to a + b + c = 10
where a, b, c are non-negative integers.
b) Define dynamic programming problem and give its applications. [7M]
(OR)
10. a) Explain computational procedure of dynamic programming [7M]
problem.
b) Determine the value of u1, u2, and u3 so as to [7M]
Maximize u1. u2. u3
Subject to u1 + u2 + u3 = 10
and u1, u2 , u3 ≥ 0.

2 of 2
|''|''|||''|''|'||||
 Code No: R203105E
R203105C
R203105D R20 SET - 2

III B. Tech I Semester Regular Examinations, Dec/Jan -2022-23

OPTIMIZATION IN OPERATIONS RESEARCH
(Common to CSE,CSE(AIML),CSE(AI),CSE(DS),CSE(AIDS),AIDS,AIML)

Time: 3 hours Max. Marks: 70

Answer any FIVE Questions ONE Question from Each unit
All Questions Carry Equal Marks
*****
UNIT-I
1. a) Define objective function and list out its properties. [5M]
b) Describe classification of optimization problem with an example. [9M]
(OR)
2. a) Discuss single variable optimization problem. [7M]
b) Sate and prove Kuhn tucker conditions. [7M]
UNIT-II
3. a) A company manufactures two products X and Y whose profit [7M]
contributions are Rs. 10 and Rs. 20 respectively. Product X
requires 5 hours on machine I, 3 hours on machine II and 2
hours on machine III. The requirement of product Y is 3 hours
on machine I, 6 hours on machine II and 5 hours on machine III.
The available capacities for the planning period for machine I, II
and III are 30, 36 and 20 hours respectively. Find the optimal
product mix.
b) Define and explain the significance of Slack variable, Surplus [7M]
variable, Artificial variable in linear programming resource
allocation model.
(OR)
4. a) A company produces three products A, B and C by using two [7M]
raw materials X and Y. 4000 units of X and 6000 units of Z are
available for production. The requirement of raw materials by
each product is given below:
Raw material Requirement per unit of product
A B C
X 2 3 5
Y 4 2 7

The labour time for each unit of product A is twice that of

product B and three times that of product C. The entire labour
force of the company can produce the equivalent of 2500 units of
product A. A market survey indicates the minimum demand of
the three products are 500, 500 and 375 respectively for A, B
and C. However, their ratio of number of units produced must be
equal to 3: 2: 5. Assume that the profit per units of product A, B
and C are Rupees 60/–, 40/– and 100 respectively. Formulate
the L.P.P. for maximizing the profit.
b) Define operations research. List the areas in which Operations [7M]
Research Techniques can be employed.
1 of 2

|''|''|||''|''|'||||
 Code No: R203105E R20 SET - 2

UNIT-III
5. a) Explain the terms: (a) Opportunity cost, (b) Implied cost, (c) Row [7M]
opportunity cost, (d) Column opportunity cost.
b) What is transshipment problem? In what way it differs from [7M]
general transportation problem?
(OR)
6. a) From three warehouses A, B, and C orders for certain commodities [7M]
are to be supplied to demand points 1, 2, 3, 4 and 5 monthly. The
relevant information is given below:
warehous Demand points (Transportation cost in Availability
es Rs per unit. in units.
1 2 3 4 5
A 4 1 2 6 9 100
B 6 4 3 5 7 120
C 5 2 6 4 8 120
Units 40 50 70 90 90
demand
During certain month a bridge on the road-connecting warehouse
B to demand point 3 is closed for traffic. Modify the problem
suitably and find the least cost transportation schedule. (The
demand must be complied with).
b) Describe Modi’s method of finding optimal solution. [7M]
UNIT-IV
7. a) Explain sufficiency of KUHN – TUCKER Condition. [7M]
b) Find the extreme value of Z = f (x1, x2) = 2 x1x2 [7M]
Subject to x12 + x22 = 1.
(OR)
8. a) Discuss about powell’s method for non linear programming. [7M]
b) Describe exterior penalty function method. [7M]
UNIT-V
9. a) Explain about dynamic programming problem and give its [7M]
importance.
b) A manufacturing firm has a contract to supply lathe chucks as per [7M]
the following schedule. The product made during a month will be
supplied at the end of the month. The setup cost is Rs. 1000/-,
while the inventory carrying cost is Re. 1/- per piece per month. In
which month should the batches be produced and of what size, so
that the total of setup and inventory carrying cost are minimized?
Month Number of iteams
January 100
February 200
March 300
April 400
May 400
June 300
(OR)
10. a) Explain how to derive optimal solution for a dynamic programming [7M]
problem.
b) Write about dynamic programming multistage decision process. [7M]
2 of 2
|''|''|||''|''|'||||
 Code No: R203105E R20 SET - 3

III B. Tech I Semester Regular Examinations, Dec/Jan -2022-23

OPTIMIZATION IN OPERATIONS RESEARCH
(Common to CSE,CSE(AIML),CSE(AI),CSE(DS),CSE(AIDS),AIDS,AIML)

Time: 3 hours Max. Marks: 70

Answer any FIVE Questions ONE Question from Each unit
All Questions Carry Equal Marks
*****

UNIT-I
1. a) Define optimization problem and give its classification. [9M]
b) Explain objective function surface with an example. [5M]
(OR)
2. a) Explain necessary and sufficient condition maximum [7M]
optimization function.
b) Describe lagrange mulitiplies for multivariable optimization [7M]
conditions.
UNIT-II
3. a) Minimise Z = 1.5 x + 2.5 y [7M]
Subject to
1x + 3y ≥ 3
1x + 6y ≥ 2 and both x and y ≥ 0
b) Give the step by step procedure for simplex algorithm. [7M]
(OR)
4. a) An aviation fuel manufacturer sells two types of fuel A and B. [7M]
Type A fuel is 25 % grade 1 gasoline, 25 % of grade 2 gasoline
and 50 % of grade 3 gasoline. Type B fuel is 50 % of grade 2
gasoline and 50 % of grade 3 gasoline. Available for production
are 500 liters per hour grade 1 and 200 liters per hour of grade 2
and grade 3 each. Costs are 60 paise per liter for grade 1, 120
paise for grade 2 and100 paise for grade 3. Type A can be sold at
Rs. 7.50 per liter and B can be sold at Rs. 9.00 per liter. How
much of each fuel should be made and sold to maximise the
profit.
b) Explain dual simplex method with an example. [7M]
UNIT-III
5. a) How do you say that a transportation model has an alternate [7M]
solution? In case it has an alternate optimal solution, how do
you arrive at alternate solution?
b) Explain the procedure of getting basic feasible solution by using [7M]
VAM.
(OR)

1 of 2

|''|''|||''|''|'||||
 Code No: R203105E R20 SET - 3

6. a) List out the differences and similarities between Resource [7M]

allocation model and Transportation model in linear
programming.
b) The demand pattern for a product at for consumer centers, A, B, [7M]
C and D are 5000 units, 7000 units, 4000 units and 2000 units
respectively. The supply for these centers is from three factories
X, Y and Z. The capacities for the factories are 3000 units, 6000
units and 9000 units respectively. The unit transportation cost
in rupees from a factory to consumer center is given below in the
matrix. Develop an optimal transportation schedule and find the
optimal cost.

from To
A B C D
X 8 9 12 8
Y 3 4 3 2
Z 5 3 7 4
UNIT-IV
7. a) Explain convex programming problem. How is it different from [7M]
concave programming
b) Describe about interior penalty function method. [7M]
(OR)
8. a) Describe quadratic interpolation method. [7M]
b) x1 2
Maximize Z = 3.6 x1 – 0.4 x2 2
+ 1.6x2 – 0.2 subject to [7M]
constraints 2x1 + x2 ≤ 10 and both x1 and x2 are ≥ 0.
UNIT-V
9. a) Maximize Z = 3a + 5b [7M]
subject to a ≤ 4
b≤6
3a + 2b ≤ 18 and a, b both ≥ 0
b) Explain sub optimization technique in dynamic programming [7M]
problem.
(OR)
10. a) Describe about dynamic programming multistage decision [7M]
process.
b) Solve the given L.P. Model by using dynamic programming [7M]
technique.
Max Z = a = 9b
Subject to
2a + 1b ≤ 25,
0a + 1b ≤ 11 and both a and b are ≥ 0.

|''|''|||''|''|'|||| 2 of 2
 Code No: R203105D
R203105C
R203105E R20 SET - 4

III B. Tech I Semester Regular Examinations, Dec/Jan -2022-23

OPTIMIZATION IN OPERATIONS RESEARCH
(Common to CSE,CSE(AIML),CSE(AI),CSE(DS),CSE(AIDS),AIDS,AIML)

Time: 3 hours Max. Marks: 70

Answer any FIVE Questions ONE Question from Each unit
All Questions Carry Equal Marks
*****
UNIT-I
1. a) Discuss multiple variable optimization problem with both cases. [9M]
b) Explain slack and surplus variables in LPP. [5M]
(OR)
2. a) Construct an optimization problem with constrains. [7M]
b) Discuss the solution by method of Lagrange multipliers [7M]
UNIT-II
3. a) Maximise Z = 3 a + 2 b S.T. 1a – 1 b ≤ 1 [7M]
1 a + 1b ≥ 3 and both x and y are ≥ 0
b) Explain geometry of linear programming problem. [7M]
(OR)
4. a) A company manufactures two products X1 and X2 on three machines [7M]
A, B, and C. X1 require 1 hour on machine A and 1 hour on machine
B and yields a revenue of Rs.3/-. Product X2 requires 2 hours on
machine A and 1 hour on machine B and 1 hour on machine C and
yields revenue of Rs. 5/-. In the coming planning period the available
time of three machines A, B, and C are 2000 hours, 1500 hours and
600 hours respectively. Find the optimal product mix.
b) Derive solution for simultaneous equations with suitable data. [7M]
UNIT-III
5. a) Explain feasible solution. List out properties of basic feasible solution. [7M]
b) Four factories, A, B, C and D produce sugar and the capacity of each [7M]
factory is given below: Factory A produces 10 tons of sugar and B
produces 8 tons of sugar, C produces 5 tons of sugar and that of D is
6 tons of sugar. The sugar has demand in three markets X, Y and Z.
The demand of market X is 7 tons, that of market Y is 12 tons and
the demand of market Z is 4 tons. The following matrix gives the
transportation cost of 1 ton of sugar from each factory to the
destinations. Find the Optimal Solution for least cost transportation
cost.
Factories. Cost in Rs. per ton (× 100) Availability
Factories. Markets. in tons.
X Y Z
A 4 3 2 10
B 5 6 1 8
C 6 4 3 5
D 3 5 4 6
Requirement 7 12 4
in tons
(OR)
1 of 2
|''|''|||''|''|'||||
 Code No: R203105E R20 SET - 4

6. a) Explain North- west corner method of finding initial basic feasible [7M]
solution.
b) Describe the steps in Vogel’s Approximation Method. [7M]
UNIT-IV
7. a) Explain KUHN – TUCKER condition for non-linear programming [7M]
b) Describe non linear programming problem with an example. [7M]
(OR)
8. a) Elaborate Fibonacci method of finding solution to non-linear [7M]
programming.
b) Maximize Z = 3.6x1 – 0.4x12 + 1.6x2 – 0.2x22 [7M]
subject to constraints
2x1 + x2 ≤ 10 and both x1 and x2 are ≥ 0.
UNIT-V
9. a) Explain principle of optimality in dynamic programming problem [5M]
b) Maximize Z = 3a + 5b [9M]
subject to a ≤ 4
b≤6
3a + 2b ≤ 18 and a, b both ≥ 0
(OR)
10. a) Explain dynamic programming problem and their properties. [7M]
b) Minimize Z = a2 + b2 + c2 [7M]
subject to a + b + c ≥ 10 and a, b, c ≥ 0

2 of 2
|''|''|||''|''|'||||