Download JNTUK MBA 1st Sem 2018 Dec R16MBA106 Quantitative Analysis For Business Disions Question Paper

Firstranker's choice

Subjt Code: R16MBA106

MBA - I Semester Regular Examinations, D-2018

--- Content provided by FirstRanker.com ---

QUANTITATIVE ANALYSIS FOR BUSINESS DECISIONS

Time: 3 hours

Max Marks: 60

Question Paper Consists of Part-A and Part-B

Answering the question in Part-A is Compulsory

--- Content provided by FirstRanker.com ---

Four Questions should be answered from Part-B, each question carries equal marks of 12.

PART-A (CASE STUDY)

1. Solve the travelling salesman problem given by the following data:

   C12=20, C13 = 4, C14 = 10, C23 = 5, C34 = 6,

   C25 = 10, C35= 6, C45=20, where Cij = Cji

   --- Content provided by FirstRanker.com ---

   and there is no route between cities i and j if the value for Cij is not shown

   1 X 12 = 12

PART-B

4X 12 = 48

--- Content provided by FirstRanker.com ---

2. Calculate Rank Correlation Coefficient between X and Y series:

   X	68	64	75	50	64	80	75	40	55	64
   Y	62	58	68	45	81	68	48	50	70	60

3. Solve the following LPP by graphical method:

   Maximize Z = 5x1+7x2 st x1 + x2 <=4,

   6x1 + 8x2 <= 24, 10x₁ +7x2 <= 35 (x1,x2>=0)

   --- Content provided by FirstRanker.com ---

4. What is game theory? What are its limitations? Show how a game theory problem can be formulated as a linear programming problem.

5. Solve the following transportation problem having cost structure as:

   	A	B	C	D	ai
   1	10	18	11	7	20
   2	9	12	14	6	40
   3	8	9	12	10	35
   bj	16	18	31	30	95

--- Content provided by FirstRanker.com ---

6. An engineering company is offered a material handling equipment 'A'. 'A' is priced at Rs. 60,000 including cost of installation and the costs for operation and maintenance are estimated to be Rs.10,000 for each of the first 5 years, increasing every year by Rs.3000 per year in the sixth and subsequent years. The company expects a return of 10% on all its investments. What is the optimal replacement period?

7. For the project represented by the network diagram, find the earliest and latest times, given the following data:

   Task	1-2	1-3	1-4	2-5	2-6	3-6	4-7	5-7	6-7	7-8	8-9
   Least time to	4	5	8	4	6	2	8	5	3	5	6
   Greatest Time tp	8	10	12	10	15	7	16	9	7	11	13
   Most likely time tm	5	7	11	7	9	3	12	6	5	8	9

--- Content provided by FirstRanker.com ---