FirstRanker Logo

FirstRanker.com - FirstRanker's Choice is a hub of Question Papers & Study Materials for B-Tech, B.E, M-Tech, MCA, M.Sc, MBBS, BDS, MBA, B.Sc, Degree, B.Sc Nursing, B-Pharmacy, D-Pharmacy, MD, Medical, Dental, Engineering students. All services of FirstRanker.com are FREE

📱

Get the MBBS Question Bank Android App

Access previous years' papers, solved question papers, notes, and more on the go!

Install From Play Store

Download GTU BE/B.Tech 2019 Winter 6th Sem New 2163201 Operation Research Question Paper

Download GTU (Gujarat Technological University) BE/BTech (Bachelor of Engineering / Bachelor of Technology) 2019 Winter 6th Sem New 2163201 Operation Research Previous Question Paper

This post was last modified on 20 February 2020

GTU BE/B.Tech 2019 Winter Question Papers || Gujarat Technological University


FirstRanker.com

Seat No.:

Subject Code: 2163201

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

Enrolment No.

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER- VI (New) EXAMINATION — WINTER 2019

Date: 04/12/2019

Subject Name: Operation Research

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

Time: 02:30 PM TO 05:00 PM

Total Marks: 70

Instructions:

Attempt all questions.

Make suitable assumptions wherever necessary.

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

Figures to the right indicate full marks.

  1. (a) Discuss areas of application of operation research. [03]
    (b) A firm is engaged in producing two products, A and B. Each unit of product A requires 2 kg of raw material and 4 labor hours for processing, whereas each unit of product B requires 3 kg of raw material and 3 hours of labor, of the same type. Every week, the firm has an availability of 60 kg of raw material and 96 labor hours. One unit of product A sold yields Rs 40 and one unit of product B sold gives Rs 35 as profit. Formulate this problem as linear programming problem to determine as to know how many units of each of the products should be produced per week so that the firm can earn the maximum profit. Assume that there is no marketing constraint so that all that is produced can be sold. [04]
    (c) Explain methodology of operation research. [07]
  2. (a) Illustrate graphically 1) No feasible solution 2) Unbounded solution [03]

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

    (b) Solve graphically the following LPP: Maximize z=8x1+ 16x2 Subject to, X1+ x2 <200, x2<125, 3x; +6x2<900, x1,x2>0 [04]
    (c) Explain simplex method for solving linear programming problem. [07]
    OR
    (a) Solve the following LPP using simplex method. Maximize z=3x1+ 5x2 Subject to, x1 +2x2 <2000, x; + x2 <1500, x2 <600, x1,X2>0 [04]
    (b) Discuss North-West and Least cost method for finding initial basic solution. [07]
  3. --- Content provided by⁠ FirstRanker.com ---

  4. (a) Discuss assignment algorithm. [03]
    (b) Using Big-M method solve the following problem Minimize z=60x; + 80x2 Subject to, 20x; +30x2 > 900, 40x; +30x2 > 1200, x1,x2>0 [04]
    (c) Discuss Vogel’s approximation method for finding initial basic solution. [07]
    OR
    (a) Write the dual of the following LPP Minimize z=10x; +20x2 Subject to, 3x1+2x2 > 18, x1+3x2 >8,2x1-%x2 <6, x1,x2>0 [03]

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

    (b) Using the two-phase method solve the following problem Minimize z=150x: + 150x2+ 100x3 Subject to, 2x1+3x2+x3>4, 3x1+2x2 +X3>3, x1,X2,Xx3>0 [04]
    (c) Define interfering float, free float and independent float. [07]
  5. (a) Discuss various methods to generate random numbers. [03]
    (b) A tailor specializes in ladies’ dresses. The number of customers approaching the tailor appears to be Poison distributed with a mean of 6 customers per hour. The tailor attends the customers on a first come first served basis and the customers wait if the need be. The tailor can attend the customers at an average rate of 10 customers per hour with the service time exponentially distributed. Find 1) The utilization parameter 2) The probability that the system is idle 3) The average time that the tailor is free on a 10-hour working day 4) The probability of exactly one customer in queuing system 5) Expected number of customers in tailor’s shop 6) Expected number of customers waiting for tailor’s service 7) Expected time customer will spend in tailor’s shop [04]
    (c) A firm is using a machine whose purchase price is Rs 13000. The installation charges amount to Rs 3600 and the machine has a scrap value of Rs 1600. The maintenance cost in various years is given in the following table. [07]

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

    Year | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
    Cost(Rs) | 250 | 750 | 1000 | 1500 | 2100 | 2900 | 4000 | 4800 | 6000
    Determine after how many years the machine should be replaced assuming that machine replacement can be done only at the year ends.
    OR
    (a) What is simulation? What are the advantages and disadvantages of simulation? [03]

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

    (b) Information on the activities required for a project is as follows [04]
    Name | A | B | C | D | E | F | G | H | J | K
    Activities Node | 12 | 13 | 14 | 25 | 35 | 36 | 37 | 46 | 57 | 68 | 78
    Duration(Days) | 2 | 7 | 8 | 3 | 6 | 10 | 4 | 6 | 2 | 5 | 6
    Draw the network and calculate the earliest start (ES), earliest finish (EF), latest start (LS) and latest finish (LF) time for each of the activities. Also find critical path and time required to complete the project. [07]
  6. --- Content provided by FirstRanker.com ---

  7. (a) A firm owns facilities at 7 places. It has manufacturing plants at places A, B, C with daily output of 500, 300 and 200. It has warehouses at places P, Q, R, S with daily requirement of 180, 150, 350, 320 units respectively. Per unit shipping charge is given below [03]
    To: | P | Q | R | S
    From A | 12 | 10 | 12 | 13
    From B | 7 | 11 | 8 | 14
    From C | 6 | 16 | 11 | 7

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

    Find the transportation cost by Vogel's approximation method.
    (b) A production supervisor is considering how he should assign the four jobs that are to be performed, to four of the workers. He wants to assign the jobs to workers such that the aggregate time to perform the jobs is the least. The information for the time taken is given below [04]
    Worker | Job
    | A | B | C | D
    1 | 45 | 40 | 51 | 67

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

    2 | 57 | 42 | 63 | 55
    3 | 49 | 52 | 48 | 64
    4 | 41 | 45 | 60 | 55
    Solve this assignment problem using Hungarian Assignment Method.
    (c) A bakery keeps stock of popular brand of cake. Previous experience shows that the daily demand pattern is given below [07]

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

    Daily Demand | 0 | 10 | 20 | 30 | 40 | 50
    Probability | 0.01 | 0.2 | 0.15 | 0.5 | 0.12 | 0.02
    Use the following sequence of random numbers to simulate demand foe next 10 days and also find average demand per day. Random Numbers:- 25, 39,65, 76, 12, 05, 73, 89, 19, 49
    OR
    (a) Explain various elements of queuing system. [03]

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

    (b) Explain group replacement policy with suitable example. [04]
    (c) Discuss PERT, CPM and difference between PERT and CPM. [07]

FirstRanker.com


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


This download link is referred from the post: GTU BE/B.Tech 2019 Winter Question Papers || Gujarat Technological University