Scribd Logo
Upload

Welcome to Scribd!

  • 76 views

    Adca / Mca (Ii Year) Term-End Examination June, 2OO7 Cs-51: Operations Research

    Uploaded by

    amritanshuu
    1) The document describes an operations research problem involving a bank allocating $12 million in loans across different types of loans to maximize net return while meeting constraints. 2) It also includes sample questions related to linear programming, queueing theory, inventory management, and probability. 3) The final question formulates a minimum shipping cost problem for canned peas between multiple canneries and warehouses as an integer linear programming problem.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Adca / Mca (Ii Year) Term-End Examination June, 2OO7 Cs-51: Operations Research

    Uploaded by

    amritanshuu
    76 views8 pages
    1) The document describes an operations research problem involving a bank allocating $12 million in loans across different types of loans to maximize net return while meeting constraints. 2) It also includes sample questions related to linear programming, queueing theory, inventory management, and probability. 3) The final question formulates a minimum shipping cost problem for canned peas between multiple canneries and warehouses as an integer linear programming problem.

    Original Title

    CS-51j

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1) The document describes an operations research problem involving a bank allocating $12 million in loans across different types of loans to maximize net return while meeting constraints. 2) It also includes sample questions related to linear programming, queueing theory, inventory management, and probability. 3) The final question formulates a minimum shipping cost problem for canned peas between multiple canneries and warehouses as an integer linear programming problem.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    76 views8 pages

    Adca / Mca (Ii Year) Term-End Examination June, 2OO7 Cs-51: Operations Research

    Uploaded by

    amritanshuu
    1) The document describes an operations research problem involving a bank allocating $12 million in loans across different types of loans to maximize net return while meeting constraints. 2) It also includes sample questions related to linear programming, queueing theory, inventory management, and probability. 3) The final question formulates a minimum shipping cost problem for canned peas between multiple canneries and warehouses as an integer linear programming problem.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 8

    ADCA / MCA (II Year)

    Term-End Examination
    June, 2OO7

    CS-51 : OPERATIONS
    RESEARCH
    Ttme : 3 hours Maximum Marks : 75
    Note t Question number 1 is compulsory. Attempt any
    three more questions from questions numbered
    2to5.

    l. (a) A financialinstitutionis in the processof formulating


    '
    a loan polky involving $12 million. Being a full
    servicefacility, the bank is obligatedto grant loans to
    different clientele. The following table provides the
    types of loans, the interest rate charged by the bank,
    and,the probbiliry of bad debt as estimated from
    past experienee:

    Probability of
    Type of Loan Interest Rate
    Bad Debt
    Personal 0.140 0.10
    Car 0.130 0.07
    House o.120 0.03
    Farm 4.125 0.05
    Commercial 0.100 0.02

    CS-s1 P.T.O.
    Bad debts are assumed irrecoverable and hence
    produce no interest revenue.Competition with other
    financial institutions in the area requires that the
    bank allocates at least 400/oof the total funds to
    farms and commercial loans. To assist housing
    industry in the region, home loans must be at least
    5Ao/oof the personal,car and home loans. The bank
    also has a stated policy specifying that the overall
    ratio for bad debts on all loans may not exceed
    0.04.
    Formulate the above so as to maximize net return
    ,that is comprised of the difference between the
    revenue from interest and lost funds to bad debts. 10
    (b) Answer the following in the context of simple
    method for LPP : 5
    (il State the us€s of slack, surplus and artificial
    variables.
    (ii) Indicate the reasons for applying Big M and
    two-phasemethods.
    (c) An average of 10 cars per hour arrive at a
    . single-serverdrive-in teller. Assume that the average
    service time for each customer is 4 minutes, and
    both inter-arrival time and service time are
    exponentiallydistributed.
    (i) What is the probability that the teller is idle ?
    (ii) What is the averagenumber of cars waiting in
    line for the teller ?
    (iii) What=isthe a\i€rageamount of time a customer
    spendsin the bank ?

    CS-51 2
    (d) The ABC Retail Company has the following data
    availablein the context of inventory for one of its
    items : o'r'ru?l demand : 10,000 units; rate of
    ordering cost : Rs. 20; rate of inventory carrying
    cost = Rs. 6,25. Find ;
    (i) EoQ,
    (ii) frequencyof orders, and
    (iii) minimum total variablecost.

    2' (a) Define the following teiins and give one example of
    each (any fouf) | g
    (i) Monte Carlo simulation
    (ii) Value of garne
    (iii) Goal programrning
    (iv) Degeneracy
    (v) Buffer stock

    (b) Based on the past data, it is establishedthat the


    probabilitydistributionon the frequencyof accidents,
    at a road-intersectionpoint, is as follows : 7
    Probability
    0 0.50
    1 0.30
    2 0.15
    3 0.05
    (i) simulate the number of accidentsover 10 days.

    CS-51 P.T.O.
    (ii) Compute mean of this simulated data, and
    compare it with the mean of the probability
    distribution.

    I Use the sequenceof random digits :


    5 7 4 6 6 00 7 9 L 5 9 0 3 8 1 6 1 3 1 I

    3. (a) Suppose four professors are each capable of


    teachingany of the four courses- LP, DP, ILP and
    NLP. However, the average weehy classpreparation
    time for any course varies from professor to
    professor.Since the professors'department is highly
    research oriented, the chairperson would like to
    assign each professor one and only one course to
    minimize the total of course preparation times.
    Preparation time for each course by elch professor
    is given below :

    Courses
    Professors
    LP DP ILP NLP

    Dantzig 2 10 9 7

    Bellrnan 15 4 L4 8

    Little 13 T4 T6 11

    Wilson 4 15 13 9

    Formulate the Chairperson's problem as an


    optimizationproblem, and provide the solution. 10

    CS-51
    (b) Use the graphical method to demonstrate that the
    following problem has no feasiblesolution : 5

    M a x i m i z et : 5 x , + 7*z

    subjectto 2*, - xz< - 1

    -xl + 2*, S - 1

    *1'x2

    4- (a) Considerthe following optimizationproblem : I

    M a x i m i z ez : 2 1 x 1 + llx,
    t -

    subjectto 7*, + 4*z

    Xr.,xz

    List all feasible solutions,


    {' and hence obtain optimal
    solution.
    "
    /
    (b) If the probability of a defectivebolt is 0'01, find
    '
    mean and standald ,deviation of the number of
    defective bolts in a random sample of 400 bolts.
    Further, in a random sample of 4 bolts, find the
    probability that we observe (i) no defective bolt,
    (ii) at least one defectivebolt. 7

    CS-b1 b P.T.O.
    5. (a) one of the main products of P&T Company is
    canned peas. The peas are prepared at three
    canneries, and then shipped by truck to four
    distributing warehouses.Becausethe shipping costs
    are substantial,managementhas initiated a study to
    reduce them as much as possible.For the upcoming
    season,dr estimatehas been made about the output
    from each cannery, each warehouse has been
    allocateda certain amount from the total supply of
    peas. This information (in units of truckloads),along
    with , the shipping cost per truckload for each
    cannery-warehouse combinationis given below.

    Cost (Rs.) per truck-load Output


    Canneries
    (truck-loads)
    w1 w2 w3 w4

    c1 464 5 1 3 654 867 75"

    c2 352 476 690 79L r25

    c3 995 682 388 685 100

    Allocation
    (truck-loads)
    80 65 70 85

    Give a formulation for the minimum shipping cost


    plan, and obtain initial feasible solution by Vogel's
    Approximation Method (vAM).

    CS-s1
    (b) What is integer linear programming problem ? How
    can the optimal solution of an integer programming
    problem be compared with that of the linear
    programmingproblem ?

    CS-51 13,000
    I

    You might also like