BCom In Accounting & Finance (BCAF) SEM III 2016 2017 Sep 2017 QUANTITATIVE METHOD FOR BUS Question Paper - Mumbai University | munotes

Questions asked in this paper

• 3. Figures to the right indicate maximum marks to the

1. Q4 Use of simple calculator is allowed
   • A] Attempt any eight multiple choice questions: C A 6 8) 8
2. Q1 The linear programming problem + 4y, under the constrains
   • a). no solution b). 3 solutions
   • c). infinity many solutions d). solution at (5,6)
   • ii) In of pay-off table available maximax criterion can be considered as
   • iii) A solution of a Linear Programming Problem, whatever exists, is
   • a) In every convex region b). In every concave region
   • c). Within the feasible region d), anywhere in the XY plane
   • iv) are the unknown variable x1, . to be determined as the optimal feasible solution of the linear programming problem Optimality condition are expressed as incase all non-basic cells? costs Advanced costs c) Reduced costs d) None of the above VCD-041016 SYBAF (2) QUANTITATIVE METHOD FOR BU: one of the fundamental combinatorial optimization problems Optimization problem d) None of the above
   • vii) For maximization in transportation problem, the objective is to maximize the total
   • a) Solutions Profit matrix c) Profit d) None of the above
   • viii) To make an unbalanced assignment problem balanced, what are added with all ent
   • ix) Decision maker has over the occurrence of situation
   • a) b) no control sometime control rarely control
3. Q10 In case of pay-off table available for decision making them maximize
   • B] Attempt any seven True or False: ( Any 07)
   • i)Any solution which satisfies at least one of the constraints is included in the feasible regiot
   • ii) A constraint is called redundant when it does not affect the solution
   • iii) Decision variable in LPP should be either zero or positive
   • iv) In transportation problem, a single source may supply something to all destinations
   • v) An Assignment problem may have more than one optimal solution,
   • vi) The best act to be selected using EMV and EOL are same
   • vii) States of nature are under the control of decision maker
   • viii) The Hungarian method is designed to solve assignment problems efficiently
   • ix) In transportation problem is unbalanced when total supply is equal to total demand
   • x) Opportunity loss table will contain all positive value VCD-041016 (3) QUANTITATIVE METHOD FOR BUSINESS-II
   • A] The projected pay-offs for each variant under each demand situation is given below: Find the optimal decision using: i) Maimax criterion. ii) Maximin criterion. iii) Laplace criterion
   • B] A manufacturer produces two different models X and Y of the same product. Model X makes 7 a contribution of Rs. 50 per unit and model Y, Rs. 30 per unit towards total profit, Raw materials R, and are required for production. At least 18 Kg of R, and at least 12 Kg of R must be used daily. Also at most 34 labour hours are to be utilized. A quantity of 2 Kg of R, is réquired for X and 1 Kg of is required for Y. For each of X and Y, of R2 is takes 3 labour hours to manufacture X and 2 labour hours to manufacture Y. How many units of each modal should be produced to maximize the profit? Formulate the LPP and solwe For the following pay-off matrix: Acts( Profits in Rs
   • a) Find optimal decision by EMV criterion
   • b) Find optimal decision by EOL criterion
   • c) Calculate EPPI
   • d) Calculate EVPI VCD-041016 SYBAF (4) QUANTITATIVE METHOD FOR BU: D Solve the following linear Programming problem graphically and interpret the result
   • A] Solve the following linear programming problem by Simplex method The following information is available regarding four different jobs to be perform about the clerks capable of performing the jobs. Cost of each assignment is given in th Jobs (cost in hundred rupees Clerk II cannot be assigned to job A and Clerk III cannot be assigned to job B. you are rec to find out the optimal assignment schedule and the total minimum cost of performing th by using Hungarian method VCD-041016 (5) QUANTITATIVE METHOD FOR BUSINESS
4. Q7 C] A company has three plants A, B, C for which capacities are 7, 10 and 18 units. It has werehouses P, Q, R, S for which demands are 5, 8, 7 and 15 units. Unit transportation cost is given in Rs Find initial feasible solution by Least Cost method. [08]
5. Q8 D] A company has four districts I, II, III and IV to sell its product and four salesmen A, B, C and D for it. The district-wise sales record of each salesman is as given in the table. Determine the area allocation so as to make the sales maximum What will be total maximum sale? [07]
   • A] A company has three factories A, B, C with production capacities of 11, 13, and 19 units(in thousands).It has four warehouses M, N, O and P with demands of 6, 10, 12 and 15 units(in cost of transportation is given from each factory to each warehouse Based on the above information, construct a transportation table. Find initial feasible solution by VCD-041016 SYBAF (6) QUANTITATIVE METHOD FOR BUSINESS-II
   • B] ABC company is evaluating 4 alternatives on investment whose returns are based on the state Draw decision tree and determine the expected return for each alternative, Give your decision
   • C] Solve the following linear programming problem by Simplex method. 8
   • D] A distribution company ‘Sonata’ has four territories open for four transport available for assignment. The territories are not equally rich in their economic activity potentials It is estimated that typical transport company operating in each territory would bring in th following annual economic activity potential measured in rupees The four transport companies are also considered to differ in ability. It is estimated that, workin under the same condition, their yearly turnover would be proportionately as follows If the criterion is the maximum expected total economic activity potential, What will t
   • A] Explain the algorithm of Hungarian method to solve an Assignment problem. [0
   • B] Explain the concept of perfect information while taking decision under risk. [0 VCD-041016 SYBAF (7) QUANTITATIVE METHOD FOR
   • C] Write short notes :(any three) 15
   • i) Regret matrix
   • iv)Shadow Price of a resource

Read from the scan above, so a character or two may differ. The scan is the original.