Scribd Logo
Upload

Welcome to Scribd!

  • Saz5c

    Uploaded by

    San Dinakar Dheena
    144 views7 pages
    This 7-page document contains a sample exam for Operations Research with 3 sections - Section A with 10 short answer questions, Section B with 5 medium questions, and Section C with 3 long questions. Some example questions are on linear programming, transportation problems, network diagrams, simulation, and assignment problems. The document provides context and questions for summarizing key concepts and solutions in Operations Research.

    Original Description:

    Rmt question

    Original Title

    51311 SAZ5C (6)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This 7-page document contains a sample exam for Operations Research with 3 sections - Section A with 10 short answer questions, Section B with 5 medium questions, and Section C with 3 long questions. Some example questions are on linear programming, transportation problems, network diagrams, simulation, and assignment problems. The document provides context and questions for summarizing key concepts and solutions in Operations Research.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    144 views7 pages

    Saz5c

    Uploaded by

    San Dinakar Dheena
    This 7-page document contains a sample exam for Operations Research with 3 sections - Section A with 10 short answer questions, Section B with 5 medium questions, and Section C with 3 long questions. Some example questions are on linear programming, transportation problems, network diagrams, simulation, and assignment problems. The document provides context and questions for summarizing key concepts and solutions in Operations Research.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 7

    (7 pages)

    NOVEMBER 2013 51311/SAZ5C

    Time : Three hours Maximum : 75 marks

    SECTION A — (10 × 2 = 20 marks)


    Answer any TEN questions.
    All questions carry equal marks.
    Each answer should not exceed 30 words.

    1. Write any two features of operations Research


    Solution.

    2. Mention the advantages of Linear Programming.

    3. Define Surplus variable.

    4. What do you mean by an optimal basic feasible


    solution to a linear programming problem?

    5. What is mean by duality?

    6. Define North west corner rule.

    7. What is an assignment problem?

    8. Define sequencing problems.

    9. Write a rules to determine saddle point.

    10. What is pay – off matrix?


    11. What is predecessor and successor activities in
    network diagram?

    12. Define Simulation. Why is simulation used?


    SECTION B — (5 × 5 = 25 marks)
    Answer any FIVE questions.
    All questions carry equal marks.
    13. Explain the general mathematical model of linear
    programming problem.
    14. Use the graphical method to solve the following
    LP problem.
    minimize z = − x1 + 2x2
    Subject to the constraints: − x1 + 3 x2 ≤10
    x1 + x2 ≤ 6
    x1 − x2 ≤ 2
    and x1 ; x2 ≥ 0.
    15. Compute all the basic feasible solution to the LP
    problem
    maximize z = 2 x1 + 3 x2 + 4 x3 + 7 x4
    subject to the constraints 2 x1 + 3 x2 − x3 + 4 x4 = 8
    x1 − 2 x2 + 6 x3 − 7 x4 = − 3
    and x1 , x2 , x3 , x4 ≥ 0.

    2 51311/SAZ5C
    16. Describe the computational procedure of
    optimality test in a transportation problem.

    17. We have five jobs, each of which must be processed


    on the two machines A and B in the order AB.
    Processing times in hours are given in the table
    below.
    Job 1 2 3 4 5
    Machine A 5 1 9 3 10
    Machine B 2 6 7 8 4

    Determine a sequence for the five jobs that will


    minimize the elapsed time T.
    18. Player A is paid Rs 8/- if two coins turn both heads
    and Rs 10/- if two coins turn both tails. Player B is
    paid Rs 3 when the two coins do not match. Give
    the choice of being A or B, which one would you
    choose and what would be your stratergy?
    19. A bakery keeps stock of a popular brand of cake –
    previous experience shows the daily demand
    pattern for the item with associated probabilities,
    as given below.
    Daily
    Demand : 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.
    Random number: 25, 39, 65, 76, 12, 05, 73, 89, 19, 49
    Also estimate the daily average demand for the cakes
    on the basis of simulated data.
    3 51311/SAZ5C
    SECTION C — (3 × 10 = 30 marks)
    Answer any THREE questions.
    All questions carry equal marks.

    20. A trucking firm has received an order to more


    3,000 tonnes of industrial material to a
    destination 1,000km away. The firm has available
    at the moment a fleet of 150 class – A 15 tonne
    trailer trucks and another fleet of 100 class – B 10
    tonnes trailer trucks. The operating costs of these
    trucks are Rs 3 and Rs 4 pertonnes per km,
    respectively. Based on past experience, the firm
    has a policy of retaining at least one class – A
    truck with every two class – B trucks in reserve. It
    is desired to know how many of these two classes
    of vehicles should be dispatched to move the
    material at minimal operating costs.
    Formulate this problem as an LP model.

    21. Use the penalty method to solve the following LP


    problem.
    maximize z = 2 x1 + x2 + 3 x3

    subject to constraints : x1 + x2 + 2 x3 ≥ 5

    2 x1 + 3x2 + 4 x3 =12

    and x1 , x2 , x3 ≥ 0

    4 51311/SAZ5C
    [P.T.O.]
    22. The following table shows all the necessary
    information in the availability of supply to each
    warehouse, the requirement of each market and
    unit transportation cost (in Rs) form each
    warehouse to each market.
    Market

    P Q R S Supply

    A 6 3 5 4 22

    Warehouse B 5 9 2 7 15

    C 5 7 8 6 8

    Demand 7 12 17 9 45

    The shipping clerk has worked out the following


    schedule form experience:
    12 units from A to Q
    1 units from A to R
    8 units from A to S
    15 units from B to R
    7 units from C to P
    and 1 units from C to R
    (a) Check and see if the clerk has the optimal
    schedule.
    (b) Find the optimal, schedule and minimum
    total transport cost.
    5 51311/SAZ5C
    23. Five workers and available to work with the
    machines and the respective cost(Rs) associated
    with each worker – machine assignment are give
    below. A sixth machine is available to replace one
    of the existing ones and the associated costs are
    also given below.
    Machines

    M1 M2 M3 M4 M5 M6

    W1 12 3 6 – 5 9

    W2 4 11 – 5 – 8

    Workers W3 8 2 10 9 7 5

    W4 – 7 8 6 12 10

    W5 5 8 9 4 6 1

    (a) Determine whether the new machine canbe


    accepted.
    (b) Also determine optimal assignment and the
    associated saving in cost.

    24. A project consists of the activities A, B, C ….H, I,


    and x < y means that the activity x must be
    completed before y can start, and x, y< w means
    that ‘w’ will start only after completion of
    activities x and y. With the notation construct the
    network diagram for the following constraints.
    A < D; A < E; B < F; C < G, D < H; E, F < I
    The project has the following time schedules of the
    above activities.
    6 51311/SAZ5C
    Task: A B C D E F G HI

    Optimistic (to) time 5 18 26 16 15 6 7 7 3

    Pessimistic time(tp) 10 22 40 20 25 12 12 9 5

    More likely time,(tm) 8 20 33 18 20 9 10 8 4

    Determine the following


    (a) Draw the network diagram of activities and
    determine the cirtical path.
    (b) The probability of an event occurring at the
    expected completion date if the original
    schedule time of completing the project is
    41.5 weeks.

    ———————

    7 51311/SAZ5C

    You might also like