Page 1 of 5
Seat No.: Enrolment
GUJARAT TECHNOLOGICAL UNIVERSITY
MBA SEMESTER- 02 • EXAMINATION WINTER 2016
Subject Code: 2820007 Date: 24/10/2016
Subject Name: Quantitative Analysis II (QA II)
Time: 10:30 am to 1:30 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

Answer the following multiple choice questions.
6
1
If your goal was to construct a network in which all points were connected and the distance between them was as short as possible, the technique that you would use is
shortest-route.
maximal-flow.
minimal-flow.
minimal-spanning tree.
2
Assume that we are using a waiting line model to analyze the number of service technicians required to maintain machines in a factory. Our goal should be to
maximize productivity of the technicians.
minimize the number of machines needing repair.
minimize the downtime for individual machines.
minimize the total cost (cost of maintenance plus cost of downtime).
3
The following is not an advantage of simulation:
It allows for the study of what-if questions.
It allows time compression.
It allows the study of interaction of components or variables to determine which are important.
Each simulation model is unique.
4
Markov analysis is a technique that deals with the probabilities of future occurrences by
using the simplex solution method.
Page 2 of 5
the minimal spanning tree.
statistical sampling.
analyzing currently known probabilities.
5
The selection of specific media from among a wide variety of alternatives is the type of LP problem known as
the product mix problem.
the investment banker problem.
the Wall Street problem.
None of the above
6
Typical resources of an organization include
machinery usage
labor volume
warehouse space utilization
All of the above
Q. 1

Identify which of the following statements are true or false.
4
1
Resource restrictions are called constraints.
2
Transportation and assignment problems are really linear programming techniques called network flow problems.
3
If conditions require that all decision variables must have an integer solution, then the class of problem described is an integer programming problem.
4
The maximal-flow technique would be helpful to city planners in determining how freeways should be expanded.
Q. 1

Define following with reference to Linear Programming.
1. Proportionality
2. Additivity
3. Continuity
4. Certainty
4
Q. 2

The PetGroom Company manufactures climate-controlled doghouses. The company believes that its high-volume customers are high-income male and female dog owners who want to pamper their pets. To reach these groups, the marketing manager at PetGroom is considering placing one-minute commercials on the following national TV shows on colors channel: "24" and "Jhalak Dikhala Jha."
7
Page 3 of 5
A one-minute commercial on "24" costs Rs. 200,000, and a one-minute commercial on "Jhalak Dikhala Jha" costs Rs. 50,000. The marketing manager would like the commercials to be seen by at least 60 million high-income women and at least 36 million high-income men. Marketing studies show the following:
• Each one-minute commercial on "24" is seen by six million high-income women and two million high-income men.
• Each one-minute commercial on "Jhalak Dikhala Jha" is seen by three million high-income women and three million high-income men.
Formulate as LPP and solve Graphically the minimum cost associated with advertisement.
Q. 2

Construct the dual of the following problem:
Maximize: Z 7X1 5X2 2X3
Subject to
X1 X2 3X3 10
2X1 X2 3X3 16
3X1 X2 2X3 0
X1 X2 X3 Unrestricted in Sign
7
OR
Q. 2

Explain complete enumeration method of solving an assignment problem.
7
Q. 3

Explain symmetrical relationship between Primal and Dual.
7
Q. 3

Explain multiple servers Infinite population Queuing model in detail.
7
OR
Q. 3

A steel company has 3 open health furnaces and five rolling mills. Transportation cost (Rs. Per quintal) for shipping steel from furnaces to rolling mills are shown in the following table:
M1
M2
M3
M4
M5
Supply
F1
4
2
3
2
6
8
F2
5
4
5
2
1
12
F3
6
5
4
7
7
14
Demand
4
4
6
8
8
What is the optimum shipping schedule? (USE VAM Method)
7
Page 4 of 5
Q. 3

ABC Company is engaged in manufacturing 5 brands of packed snacks. It has five manufacturing set ups, each capable of manufacturing any of its brands one at a time. The costs to make a brand on these setups vary according to the following table.
S1
S2
S3
S4
S5
B1
4
6
7
5
11
B2
7
3
6
9
5
B3
8
5
4
6
9
B4
9
12
7
11
10
B5
7
5
9
8
11
Assuming five setups are S1, S2, S3, S4 and S5 and five brands are B1, B2, B3, B4 and B5. Find the optimum assignment of products on these setups resulting in minimum cost.
7
Q. 4

Explain various steps associated with Operation Research approach to problem solving.
7
Q. 4

Explain Infeasibility and Unboundedness with suitable example.
7
OR
Q. 4

In a city, only 2 brands of cola are sold: AA and BB. If a buyer bought cola AA last time, there is 0.75 chances that he would buy the same cola in the next purchase. Similarly, it is known that if a buyer bought brand BB last time, the probability for him to buy the brand AA next time is 0.4.
Using this information, develop the transition probability matrix.
Calculate the probability that a customer, who is currently a cola AA purchaser, shall take cola BB in the next to next purchase.
7
Q. 4

Explain various types of networks models with proper examples.
7
Q. 5
A telephone exchange has 2 long distance operators. It is observed that, during the peak load, long distance calls arrive in a Poisson fashion at an average rate of 15 per hour. The length of service on these calls is approximately exponentially distributed with mean length of 5 minutes.
What is the probability that a subscriber will have to wait for this long distance call during the peak hours of the day?
ii) If the subscribers will wait and are serviced in turn, what is the expected waiting time?
14
OR
Page 5 of 5
Q. 5
A small retailer has studied the weekly receipts and payments over the past 200 weeks and has developed the following set of information:
Weekly Receipts
Probability
Weekly Payment
Probability
3000
0.20
4000
0.30
5000
0.30
6000
0.40
7000
0.40
8000
0.20
12000
0.10
10000
0.10
Using the following sequence of random numbers, simulate the weekly pattern of receipts and payments for the 12 weeks of the next quarter, assuming further that the beginning bank balance is Rs 8000. What is the estimated balance at the end of the 12 weekly periods? What is the highest weekly balance during the quarter? What is the average weekly balance for the quarter?
Random numbers:
For receipts
For payments
3
61
91
96
38
30
55
32
17
3
46
88
32
48
43
28
69
88
72
18
24
71
22
99
14