Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 21 views

    Operations Research: Master of Computer Applications

    Uploaded by

    VenkataLakshmi Krishnasamy
    This document contains information about an Operations Research exam, including 8 potential exam questions. 1) The first question asks students to discuss the various phases involved in solving an OR problem and solve an example problem involving purchasing hens within a budget constraint. 2) The second question explains the conditions of inconsistency and redundancy in linear programming problems and asks students to solve a sample LPP using the simplex method. 3) The third question explains the properties of duality in linear programming and asks students to write the dual of a sample problem and solve it to find the solution to the primal problem.

    Copyright:

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

    Operations Research: Master of Computer Applications

    Uploaded by

    VenkataLakshmi Krishnasamy
    21 views3 pages
    This document contains information about an Operations Research exam, including 8 potential exam questions. 1) The first question asks students to discuss the various phases involved in solving an OR problem and solve an example problem involving purchasing hens within a budget constraint. 2) The second question explains the conditions of inconsistency and redundancy in linear programming problems and asks students to solve a sample LPP using the simplex method. 3) The third question explains the properties of duality in linear programming and asks students to write the dual of a sample problem and solve it to find the solution to the primal problem.

    Original Description:

    Anna University qp

    Original Title

    Or question papers

    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?

    This document contains information about an Operations Research exam, including 8 potential exam questions. 1) The first question asks students to discuss the various phases involved in solving an OR problem and solve an example problem involving purchasing hens within a budget constraint. 2) The second question explains the conditions of inconsistency and redundancy in linear programming problems and asks students to solve a sample LPP using the simplex method. 3) The third question explains the properties of duality in linear programming and asks students to write the dual of a sample problem and solve it to find the solution to the primal problem.

    Copyright:

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

    Operations Research: Master of Computer Applications

    Uploaded by

    VenkataLakshmi Krishnasamy
    This document contains information about an Operations Research exam, including 8 potential exam questions. 1) The first question asks students to discuss the various phases involved in solving an OR problem and solve an example problem involving purchasing hens within a budget constraint. 2) The second question explains the conditions of inconsistency and redundancy in linear programming problems and asks students to solve a sample LPP using the simplex method. 3) The third question explains the properties of duality in linear programming and asks students to write the dual of a sample problem and solve it to find the solution to the primal problem.

    Copyright:

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

    Page No ...

    NEW SCHEME

    MCA453

    Fourth Semester M.C.A Degree Examination,


    Master of Computer Applications

    July/August

    2004

    Operations Research
    Time: 3 hrs.) . [Max.Marks : 100

    Note:

    1. A nswer any FIVE full questions. 2. Use of statistical tables permitted.

    1. (a) Discuss the various phases involved in solving an OR problem.


    (5 Marks)

    (b) Old hens can be bought for Rs 3.00 each but young ones cost Rs 5.0 each. The old hens lay 4 eggs per week and the young ones 5 eggs per week. each worth- 50 paise. A hen costs Re 1/- per week to feed. If! have only Rs: 90/ ~to spend for hens. how much of each kind should I buy. assuming that I cannot house more than 20 hens.
    (15 Marks)

    2. (a) Explain the conditions of inconsistancy and redundancy of constraints in


    L.P.P. (b) By simplex method. solve the following L.P.P.
    (15 Marks) (5 Marks)

    Maximise Z

    = :1:1 +

    2:1:2 + 3:1:3 :1:1+ 2:1:2 + 3:1:3 :1:1+:1:2 :1:1 :1:1 :1:2 :1:3

    Subject to

    ~ 10 ~5

    ~1
    >0
    (5 Marks)

    3. (a) Explain the properties of duality ..

    (b) Write the dual of the problem and by solving it. find the solution to the' pnimal Minimize Z ~ 2:1:1 + 2:1:2 Subject to
    2:1:1 + 4:1:2 :1:1+ 2:1:2 2:1:1 + :1:2 :1:1 :1:2

    > 1 >1 2: 1 2: 0
    (15 Marks)

    COntd .... 2

    Page No... 2 4.
    Solve the following tranportation problem. Stones A 1 Ware house B C D Available Cell entries represent

    MCA453
    profit.
    (20 Marks)

    22 21 18 200

    26 24 20 300

    20 20 19

    21 19 20

    450 300 250

    2
    3 Required

    150 270

    If the problem has an alternate

    solution, determine.

    5. (a) The owner of a small machine shop has four machinists

    available to assign to jobs for the day. Five jobs are offered with expected profit for each machinist on each job as follows. Determine the optimum assignment schedule. The total profit. Which job should be declined? ABC
    1

    2 3 4

    60 69 85 46

    76 82 90 62

    48 59 109 85

    99 71 69 75

    80 57 79 78
    (10 Marks)

    (b) Solve the travelling salesman

    problem given by the following data.

    012

    = 20,

    013

    = 4,

    014

    = ~O, 023 =

    5, 034

    = 6,

    025

    = 10

    035

    6, 045 = 20

    where. 0ij = 0ji and there is no route between cities i and j if a value for Cij is not shown. (10 Marks)

    6.

    Given the following data compute the following a) b) c) The expected task time and variance The earliest and latest expected times to reach each node The probabilities Predecessor that each task will be completed on schedule. Least Most likely Pessimistic time (days) time (days) time (days) Scheduled Completion time (days)

    Job

    A B C D

    A,B A,B

    E
    F

    C
    D,E

    8 14 16 24 28 18.5

    10 20 20 30 36 20

    14 26 22 36 46 21.5

    20 20 40 80 80 100
    (20 Marks)

    7.

    (a) Define i) Pure strategy ii) Mixed strategy tii) Saddle point.

    (5 Marks)

    Contd .... 3

    Page No ... 3 (b) Reduce the following game by dominance and hence solve.
    B I II 0 1 III N

    MCA453
    (15 Marks)

    v
    1

    I
    II

    3 3 3 3 3

    2
    3

    1
    2
    1

    A III
    N V

    7
    4 3

    -5
    -1

    -2

    2 2

    2 2 2 2

    8.

    Explain the following a) Graphical solution methods in L.P.P b) PERf and CPM c) Limitations of L.P.P. d) Different methods of solving transportation problem
    (4 x 5-20 Marks)

    ** * **

    You might also like