Download JNTUA (JNTU Anantapur) MCA (Master of Computer Applications) 2014 Feb Regular-Supplementary 1st Sem 9F00205 Operations Research Question Paper
Code: 9F00205
MCA II Semester Supplementary Examinations February 2014
OPERATIONS RESEARCH
(For 2009, 2010, 2011 & 2012 admitted batches only)
Time: 3 hours Max. Marks: 60
Answer any FIVE questions
All questions carry equal marks
*****
1 (a) Explain briefly the applications of operation research.
(b) Solve graphically the following LPP
Maximize
Subject to the constraints ,
(c) Use Big M method to maximize subject to the constraints
.
2 (a) Obtain the dual problem of the primal problem:
Minimize subject to the constraints
and is unrestricted.
(b) Use dual simplex method to solve the LPP.
Minimize subject to the constraints
.
3 (a) What is a balanced transportation problem? What are its applications?
(b) Solve the following travelling salesman problem so as to minimize the cost per cycle
City 1 2 3 4 5
1 10 25 25 10
2 1 10 15 2
3 8 9 20 10
4 14 10 24 15
5 10 8 25 27
4 (a) A company has 6 jobs on hand. Each of these must be processed through two departments
J I and J II. The time required for the jobs on each department in hours is given below.
A B C D E F
J I 1 4 6 3 5 2
J II 3 6 8 8 1 5
Draw a sequence table scheduling the six jobs on the two departments.
(b) A machine shop has four machines A, B, C, D. Two jobs must be processed through each of
these machines. The time (in hours) taken on each of the machines and the necessary
sequence of jobs through the shop are given below.
Job 1
Job 2
Use graphic method to obtain the total minimum elapsed time.
To
From
Page 1 of 2
Contd. in page 2
FirstRanker.com - FirstRanker's Choice
Code: 9F00205
MCA II Semester Supplementary Examinations February 2014
OPERATIONS RESEARCH
(For 2009, 2010, 2011 & 2012 admitted batches only)
Time: 3 hours Max. Marks: 60
Answer any FIVE questions
All questions carry equal marks
*****
1 (a) Explain briefly the applications of operation research.
(b) Solve graphically the following LPP
Maximize
Subject to the constraints ,
(c) Use Big M method to maximize subject to the constraints
.
2 (a) Obtain the dual problem of the primal problem:
Minimize subject to the constraints
and is unrestricted.
(b) Use dual simplex method to solve the LPP.
Minimize subject to the constraints
.
3 (a) What is a balanced transportation problem? What are its applications?
(b) Solve the following travelling salesman problem so as to minimize the cost per cycle
City 1 2 3 4 5
1 10 25 25 10
2 1 10 15 2
3 8 9 20 10
4 14 10 24 15
5 10 8 25 27
4 (a) A company has 6 jobs on hand. Each of these must be processed through two departments
J I and J II. The time required for the jobs on each department in hours is given below.
A B C D E F
J I 1 4 6 3 5 2
J II 3 6 8 8 1 5
Draw a sequence table scheduling the six jobs on the two departments.
(b) A machine shop has four machines A, B, C, D. Two jobs must be processed through each of
these machines. The time (in hours) taken on each of the machines and the necessary
sequence of jobs through the shop are given below.
Job 1
Job 2
Use graphic method to obtain the total minimum elapsed time.
To
From
Page 1 of 2
Contd. in page 2
Code: 9F00205
5 (a) A truck with first cost of Rs.80,000 has the depreciation and service pattern shown below;
Year : 1 2 3 4 5 6
Depreciation during year : 28000 20000 14000 5000 4000 4000
Annual service cost : 18000 21000 25000 29000 34000 40000
Assume no interest charges are necessary for the evaluation. How many years should the
truck be kept in service before replacement?
(b) Let the value of money be assumed to be 10% per year and suppose that machine A is
replaced after every 3 years where as machine B is replaced after every six years. The
yearly costs of both the machines are given below.
Year : 1 2 3 4 5 6
Machine A : 1000 200 400 1000 200 400
Machine B : 1700 100 200 300 400 500
Determine which machine should be purchased.
6 (a) Use dynamic programming to find the value of maximum subject to the
constraints .
(b) What is dynamic programming? Explain the advantages and disadvantages of dynamic
programming.
7 (a) Describe a two-person zero-sum game.
(b) Solve the following game after reducing it to game.
Player A
8 (a) Enumerate the various types of inventory models.
(b) The production department of a company requires 3,600 kg of raw material for
manufacturing a particular item per year. It has been estimated that the cost of placing an
order is Rs.36 and the cost of carrying inventory is 25 percent of the investment in the
inventories. The price is Rs.10 per kg. Determine an ordering policy for raw material with the
help of purchase manager.
*****
Player B
Page 2 of 2
FirstRanker.com - FirstRanker's Choice
This post was last modified on 28 July 2020