Seat No.: Enrolment No.
GUJARAT TECHNOLOGICAL UNIVERSITY
--- Content provided by FirstRanker.com ---
MBA - SEMESTER 2 - EXAMINATION - WINTER 2018
Subject Code:2820007 Date: 28/12/ 2018
Subject Name: Quantitative Analysis 11
Time:02:30 to 05:30 Total Marks: 70
Instructions:
--- Content provided by FirstRanker.com ---
- Attempt all questions.
- Make suitable assumptions wherever necessary.
- Figures to the right indicate full marks.
Q.1 (a) Choose the correct option from the following questions: 06
- Which technique is used in finding a solution for optimizing a given objective, such as profit maximization or cost minimization under certain constraints?
- Queuing Theory
- Waiting Line Theory
- Both A & B
- Linear Programming
--- Content provided by FirstRanker.com ---
- Every LPP is associated with certain limitations/conditions which is called as
- Limiting Factor
- Key Factor
- Constraints
- None of the above
--- Content provided by FirstRanker.com ---
- A feasible solution is called a basic feasible solution if the number of non- negative allocations is equal to - - - - - -
- m- ntl
- m-n-1
- mtn- 1
- None of the above
--- Content provided by FirstRanker.com ---
- From the following which constraint is not a constraint if the problem is of a maximization type?
- 2x1+3x2<60
- 4x1+3x2<96
- 6x1+4x2=150
- 5x1+2x2<106
--- Content provided by FirstRanker.com ---
- If Optimal Solution is x1=60 and x2=40 what would be the value of slack for constraint 2x1 + 4x2 = 400?
- 120
- 150
- 280
- 180
--- Content provided by FirstRanker.com ---
- In----------+ models one can estimate randomly demand, sales, profit, cost etc by running random numbers.
- Simulation
- Markov Chain
- Symbolic
- None
--- Content provided by FirstRanker.com ---
Q.1 (b) Briefly explain the following terms. 04
--- Content provided by FirstRanker.com ---
- Degeneracy in Transportation Problem
- Maximization in Linear Programming
- Infeasibility
- Unbounded Solution
Q.1 (c) Explain the concept of Infeasibility with respect to graphical solution of a LPP 04
--- Content provided by FirstRanker.com ---
Q.2 (a) Solve graphically the following Linear Programming Problem (LPP): 07
Maximize Z = x1 + 3x2
Subject to
x1+2x2<9
x1 +4x2 <11
--- Content provided by FirstRanker.com ---
x1-x2>2
x1,x2>0
(b) Explain Minimum-Spanning tree, Maximal Flow and Shortest Route models 07
OR
(b) Discuss the concept of Brand Switching with an example. What is steady state condition in Markov Analysis? 07
--- Content provided by FirstRanker.com ---
Q.3 (a) How many air-conditioners to transport from each factory to each wholesaler on a monthly basis in order to minimize the total cost of transportation 07
Data: Factory Supply wholesaler Demand
1 150 A 200
2 175 B 100
3 275 c 300
--- Content provided by FirstRanker.com ---
Total 600 ACs Total 600 ACs
Transport cost from Factory to Wholesaler (Rs./AC)
Factory A B L
1 6 8 10
2 7 11 11
--- Content provided by FirstRanker.com ---
3 1 3 12
Find initial feasible solution by using N'W corner method. Least cost method and VAM method.
(b) A salesman has to visit four cities A, B, C and D. The inter-city distances are given as follows: 07
From/To A B C D
A - 1 1 3
--- Content provided by FirstRanker.com ---
B 4 - 6 3
C 1 6 - 1
D 3 3 1 -
If the salesman starts from city A and has to back to city A, which route should he select so that the total distance travelled by him is the minimum?
OR
--- Content provided by FirstRanker.com ---
Q.3 (a) ABC company is engaged in manufacturing 5 brands of packed snacks. It is having five manufacturing setups, each capable of manufacturing any of its brands one at a time. The cost to make a brand on these setups vary according to the table below: 07
S1 S2 S3 S4 S5
B1 4 6 7 5 11
B2 7 3 6 9 5
B3 8 5 1 6 9
--- Content provided by FirstRanker.com ---
B4 9 12 7 11 10
B5 7 5 9 8 11
Find the optimum assignment resulting in the minimum cost.
(b) Explain the concept of Goal Programming. Explain preemptive and non- preemptive goal programming. 07
Q4 (a) What is queuing theory? In what type of problem situation can it be applied successfully? Discuss giving examples 07
--- Content provided by FirstRanker.com ---
(b) A bakery keeps stock of a popular brand of cakes. Previous experience shows the daily demand pattern for the item with associated probabilities, as given: 07
Daily demand (Nos.): 0 10 20 30 40 50
Probability : 0.01 0.20 0.15 0.50 0.12 0.02
Use the following sequence of random numbers to simulate the demand for next 10 days. Also find out the average demand per day.
Random numbers : 25, 39, 65, 76, 12, 05, 73, 89, 19, 49
--- Content provided by FirstRanker.com ---
OR
Q4 (a) What is simulation? Discuss Monte Carlo simulation with example. State its advantages 07
(b) In a certain market, only two brands of lipsticks A and B are sold. Given that a lady last purchased lipstick A, there is 80% chance that she would but the same brand in the next purchase, while if a lady purchased brand B, there is 90% chance that her next purchase would be brand B. using this information, develop transition probability matrix. 07
Calculate:
a) the probability that if a customer is currently a brand A purchaser, she will purchase brand B two purchases from now;
--- Content provided by FirstRanker.com ---
b) the steady state probabilities.
Q5 (a) What do you understand by Markov process? In what areas of management can it be applied successfully? 07
(b) What is an unbalanced assignment problem? How is the Hungarian Assignment Method applied in respect of such problem? 07
OR
Q5 (a) What is degeneracy? How does the problem of degeneracy arise in a transportation problem? How can we deal with this problem? 07
--- Content provided by FirstRanker.com ---
(b) Explain the concept of Integer Programming problem. Explain types of IPP. 07
--- Content provided by FirstRanker.com ---
This download link is referred from the post: GTU MBA Last 10 Years 2010-2020 Question Papers || Gujarat Technological University