Exam Details

Subject operations research
Paper
Exam / Course mca(integrated)
Department
Organization Gujarat Technological University
Position
Exam Date December, 2018
City, State gujarat, ahmedabad


Question Paper

1
Seat No.: Enrolment
GUJARAT TECHNOLOGICAL UNIVERSITY
MCA Integrated SEMESTER- IV- EXAMINATION WINTER 2018
Subject Code: 4440602 Date: 01-12-2018
Subject Name: Operations Research
Time: 02.30 pm to 5.00 pm Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
Q.1

Comment on the following statement
OR is the art of winning war without actually fighting it.
ii) OR is the art of finding bad answers where worse exists
07

What is Linear Programming? Explain the basic components of an LP model. Also state its assumptions
07
Q.2

Solve the following LP problem using graphical method.
Minimize Z 3
1 2
2
Subject to constraints
5
1
2 10
1
2 6
1 4
2 12
and

2 0
07

A tape recorder company manufactures models B and which have profit contributions per unit of Rs 15, Rs 40 and Rs 60, respectively. The weekly minimum production requirements are 25 units for model 130 units for model B and 55 units for model C. Each type of recorder requires a certain amount of time for the manufacturing of the component parts, for assembling and for packing. Specifically, a dozen units of model A require 4 hours for manufacturing, 3 hours for assembling and 1 hour for packaging. The corresponding figures for a dozen units of model B are 2.5, 4 and 2 and for a dozen units of model C are 9 and 4. During the forthcoming week, the company has available 130 hours of manufacturing, 170 hours of assembling and 52 hours of packaging time. Formulate this problem as an LP model so as to maximize the total profit to the company (Do not solve).
07
OR

Construct the dual of the problem
Minz 3
1 2
2 4
3
Subject to
3
1 5
2 4
3
6
1
2 3
3
7
1 2
2
3 10,
1 2
2 5
3
4
1 7
2 2
3
and
1

3 0.
07
2
Q.3

Find the optimal solution of the following transportation problem:
Plants
Ware houses
D1
D2
D3
D4
Supply
S1
19
30
50
10
7
S2
70
30
40
60
9
S3
40
8
70
20
18
Demand
5
8
7
14
07

Explain the Hungarian Assignment Method. Is it better than other methods of solving assignment problem? How?
07
OR
Q.3

A construction company has requested bids for subcontracts on five different projects. Five companies have responded their bids and are represented below:
Bidders
Bid amounts Rs)
A
B
C
D
E
1
41
72
39
52
25
2
22
29
49
65
81
3
27
39
60
51
40
4
45
50
48
52
37
5
29
40
45
26
30
Determine the minimum cost assignment of subcontracts to bidders, assuming that each bidder can receive only one contract
07

What is Simulation? Explain the types of simulation.
07
Q.4

In a railway marshalling yard, goods trains arrive at a rate of 30 trains per day. Assuming that the inter-arrival time follows an exponential distribution and the service time (the time taken to hump a train) distribution is also exponential with an average of 36 minutes. Calculate the following:
The average number of trains in a queue.
The probability that the queue size exceeds 10.
Expected waiting time in a queue.
07

What are the three time estimates used in the context of PERT? How are the expected duration of a project and its standard deviation calculated?
07
OR
Q.4

For what value of λ, the game with following pay-off matrix is strictly determinable?
Player B
B1
B2
B3
A1
λ
6
2
A2

λ

A3

4
λ
Define the terms:
saddle point fair game payoff matrix
04
03

What is Replacement? Explain briefly the replacement policies of items whose efficiency deteriorates with time.
07
3
Q.5

Ten jobs are to be processed on two machines M1 and M2. Determine the optimal sequence and evaluate the total elapsed time, besides the job and machine idle time. The job processing times (in hours) are given below in table.
Job processing times in hours
Machines
J1
J2
J3
J4
J5
J6
J7
J8
J9
J10
M1
8
9
10
4
8
5
6
9
6
7
M2
5
3
7
7
6
8
3
7
8
7
07

What are inventory models? Enumerate various types of inventory models and describe them briefly
07
OR
Q.5

Determine the optimal sequence of performing 4 jobs on 5 machines. The matching of each machine is required in the order ABCDE and the process timings as as follows.
Jobs
Machines
A
B
C
D
E
I
7
5
2
3
9
II
6
6
4
5
10
III
5
4
5
6
8
IV
8
3
3
2
6
Determine a sequence of these jobs that will minimize the total elapsed time T. Also find idle time for all machines.
07

What is queue? Explain the structure of the queuing system.
07



Subjects

  • advanced c programming (adv – c)
  • advanced python
  • basic mathematics for it
  • big data
  • c++ with class libraries (cpp)
  • communication skills - ii
  • communication skills-1
  • cyber security and forensics (csf)
  • data analytics with r
  • data structure
  • database management systems
  • discrete mathematics for computer science (dmcs)
  • environmental studies
  • fundamentals of computer
  • fundamentals of database management systems
  • fundamentals of networking
  • fundamentals of programming – i
  • fundamentals of web
  • information security
  • java programming
  • machine learning
  • management information systems (mis)
  • mobile programming
  • network security
  • operating system
  • operations research
  • python (py)
  • software engineering
  • software testing
  • statistical methods
  • uml & object oriented modeling
  • web development tools