Hall Ticket Number:

NRIA23

23A2200103
II B. Tech. II Semester Regular Examinations
OPTIMIZATION TECHNIQUES
(Common to CSE, IT, CSE(AIML), CSE(DS), AIML & CSE-RL)
Time: 3 Hours Max. Marks: 70
------------------------------------------------------------------------------------------------ --------
Question paper contains two parts A and B.
Part A is compulsory
Part B consists of 5 Units. Answer any one full question from each unit.
*****
PART A 10X2M=20M
Q.No. Questions Marks BTL
1. a) Define unbounded solution. 2M 1
b) Explain degeneracy in simplex method. 2M 2
c) What is meant by a unbalance transportation problem? 2M 1
d) Briefly explain about balanced assignment problem. 2M 2
e) What is the main purpose of a Gantt Chart? 2M 1
f) Explain about CPM model. 2M 2
g) What are the assumptions of the EOQ model? 2M 1
h) Define the break-even point. 2M 1
i) What is a dominant strategy? 2M 1
j) Define Nash Equilibrium. 2M 1

PART B 5x10M=50M
Q.No. Questions Marks BTL
UNIT I
2. a) Explain the concepts of slack, surplus, and artificial variables in the 5M 2

context of Linear Programming.

b) Solve the LPP using graphical method, 𝑀𝑎𝑥 𝑧 = 8𝑥 + 𝑦 Subjected to 5M 3

the constraints 𝑥 + 𝑦 ≤ 40, 2𝑥 + 𝑦 ≤ 60 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑥, 𝑦 ≥ 0.

OR
3. a) Explain the graphical method of solving a Linear Programming 5M 2
problem with an example.
b) Solve the LPP using graphical method, 𝑀𝑎𝑥 𝑧 = 2𝑥1 + 𝑥2, subjected 5M 3

to the constraints 𝑥1 + 2𝑥2 ≤ 10, 𝑥1 + 𝑥2 ≤ 6, 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑥1 , 𝑥2 ≥ 0.

Page 1 of 3
 UNIT II
4. a) Write the procedure in detail to find initial basic feasible solution 5M 2
by Matrix minima method.

b) Find the initial basic feasible solution by North west corner rule 5M 3
D1 D2 D3 D4 D5 D6 Supply
O1 1 2 1 4 5 2 30
O2 3 3 2 1 4 3 50
O3 4 2 5 9 6 2 75
O4 3 1 7 3 4 6 20
Demand 20 40 30 10 50 25 175
OR
5. a) Discuss about the optimality criteria in the transportation model. 5M 2

b) Solve the assignment problem by Hungarian method 5M 3

Jobs Machines
A B C D
I 10 5 13 15
II 3 9 18 3
III 10 7 3 2
IV 5 11 9 7
UNIT III
6. a) Write any five applications of sequencing models. 5M 2

b) 5M 3
Find an optimal sequence for the following sequencing problem of
four jobs and five machines when passing is not allowed, of which
processing time (in hours) is given below:
Job Machine
A B C D E
1 7 5 2 3 9

2 6 6 4 5 10

3 5 4 5 6 8
4 8 3 3 2 6

Also find the total elapsed time.

OR

Page 2 of 3
7. a) What are the advantages of PERT. 5M
b) Find out the completion time and the critical activities for the 5M 3
following project:

UNIT IV
8. a) What are the assumptions in Economic Order Quantity model? 5M 2

b) Discuss the role of safety stock in inventory management. How is it 5M 2

calculated?
OR
9. a) Discuss the limitations of Break-Even Analysis. 5M 2

b) How does Break-Even Analysis assist in pricing and cost control 5M 3

decisions? Provide practical examples.
UNIT V
10. a) Solve the following pay-off matrix 5M 3

b) Explain in detail about the Minimax and Maximin principles. 5M 2

OR
11. a) Write few limitations of Decision – Making under uncertainty. 5M 2

b) A company has three possible investment projects, and the returns are 5M 3
shown below under different market conditions.
Investment Good Moderate Poor
Market (₹) Market (₹) Market (₹)
Project X 150,000 80,000 20,000
Project Y 200000 50,000 30,000
Project Z 120000 100,000 50,000
Using the Maximax Criterion, which project should the company
choose?

—ooOoo—

Page 3 of 3