Scribd Logo
Upload

Welcome to Scribd!

  • 33 views

    (4666) - 55 M.C.A. (Commerce) 506-Operation Research (Semester-V) (2008 Pattern)

    Uploaded by

    KuNdAn DeOrE
    This document is a test for an operations research exam with 5 multiple choice questions. The questions cover topics like linear programming problems, transportation problems, assignment problems, project scheduling, and game theory. Students are asked to formulate and solve examples of these types of operations research problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    (4666) - 55 M.C.A. (Commerce) 506-Operation Research (Semester-V) (2008 Pattern)

    Uploaded by

    KuNdAn DeOrE
    33 views4 pages
    This document is a test for an operations research exam with 5 multiple choice questions. The questions cover topics like linear programming problems, transportation problems, assignment problems, project scheduling, and game theory. Students are asked to formulate and solve examples of these types of operations research problems.

    Original Description:

    Comm important question paper

    Original Title

    COMM_MCA

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document is a test for an operations research exam with 5 multiple choice questions. The questions cover topics like linear programming problems, transportation problems, assignment problems, project scheduling, and game theory. Students are asked to formulate and solve examples of these types of operations research problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    33 views4 pages

    (4666) - 55 M.C.A. (Commerce) 506-Operation Research (Semester-V) (2008 Pattern)

    Uploaded by

    KuNdAn DeOrE
    This document is a test for an operations research exam with 5 multiple choice questions. The questions cover topics like linear programming problems, transportation problems, assignment problems, project scheduling, and game theory. Students are asked to formulate and solve examples of these types of operations research problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 4

    Total No. of Questions : 5] SEAT No.

    :
    P2649 [Total No. of Pages :4

    [4666]-55
    M.C.A. ( Commerce )
    506-OPERATION RESEARCH
    (Semester-V) (2008 Pattern)
    Time : 3 Hours] [Max. Marks : 80
    Instructions to the candidates:
    1) All questions are compulsory.
    2) Figures to the right indicate full marks.
    3) Give illustrations wherever necessary.
    4) Use of calculator is allowed.

    Q1) Attempt Any Three of the following: [15]


    a) What is general linear programming problem? Write in mathematical form
    when the LPP is in standard form.

    b) Food X contains 5 units of vitamin A per gram and 12 units of Vitamin B


    per gram. Food Y contains 10 units of Vitamin A per gram and 6 units of
    Vitamin B per gram. Cost of food X and food Y are 12 paise and 20
    paise per gram respectively. The daily minimum requirement of Vitamin
    A is 100 units and that of B is 120 units. Formulate a LPP.

    c) Solve the following L.P.P. by Simplex method


    Max Z = 5 x + 3 y
    Subject to x + y ≤ 2
    5 x + 2 y ≤ 10
    3 x + 2 y ≤ 12
    x ≥ 0, y ≥ 0

    d) Find the dual of L.P.P.


    Min Z=10x1 + 6 x2 + 2 x3
    Subject to − x1 + x2 + x3 > 1
    3 x1 + x2 − x3 ≥ 2
    x1 , x2 x3 ≥ 0

    [4666]-55 1 P.T.O
    Q2) Attempt any three of the following: [15]
    a) Define Operation Research and give any two examples.
    b) Find IBFS by least cost method of the following TP
    Destination
    D1 D2 D3 D4 Supply
    O1 2 3 11 7 6
    O2 1 0 6 1 1
    Origin
    O3 5 8 15 9 10
    7 5 3 2 17
    c) Solve the following assignment problem for minimization.

    I II III IV
    A ⎡1 4 6 3⎤
    B ⎢9 7 10 9 ⎥
    ⎢ ⎥
    C ⎢4 5 11 7 ⎥
    ⎢ ⎥
    D ⎢8 7 8 5⎥

    d) Determine the dual of following primal


    Max Z=7y1 + 9 y2
    Subject to
    y1 + 2 y2 ≤ 1
    − y1 + 3 y2 ≤ 2
    Where y1,y2 are unrestricted

    Q3) Attempt any three of the following: [15]

    a) Write basic difference between PERT and CPM.

    b) Solve the following game by algebraic method.

    Player B
    Player A I II
    I ⎡ 20 −6 ⎤
    II ⎢⎣ −4 3 ⎥⎦

    [4666]-55 2
    c) Find IBFS for the T.P. by North -West Corner method.
    Destination
    D1 D2 D3 D 4 Supply
    O1 ⎡7 3 8 6 ⎤ 6
    O 2 ⎢ 4 2 5 10 ⎥ 10
    ⎢ ⎥
    O3 ⎣ 2 6 5 1 ⎥⎦
    ⎢ 4
    Demand 2 5 5 8 20

    d) Define
    i) Event ii) Activity iii) Critical Path iv) Float

    Q4) Attempt any three of the following: [15]


    a) Solve the following game graphically
    Player B
    ⎡ 6 7 15⎤
    Player A ⎢ ⎥
    ⎣ 20 12 10 ⎦
    b) Solve the following A.P. to minimize the lost such that machine M2 cannot
    be assigned job C and machine M3 cannot be assigned job A.
    Jobs

    A B C D E
    M1 ⎡ 9 11 15 10 11⎤
    Machine M 2 ⎢12 9 − 10 9 ⎥
    ⎢ ⎥
    M 3 ⎢ − 11 14 11 7 ⎥
    ⎢ ⎥
    M 4 ⎣14 8 12 7 8 ⎦

    c) Define
    i) Slack Variable ii) Surplus Variable
    iii) Feasible Solution iv) Degenerate basic feasible solution

    d) Convert the following LPP to canonical form


    Max Z=5x+3y
    Subject to
    x − 3y = 2
    −x + y ≥ 1
    x, y ≥ 0

    [4666]-55 3
    Q5) Attempt any two of the following: [20]
    a) A building construction project has the following time schedule.
    Activity Time in months
    1–2 2
    2–3 1
    2–4 4
    4–5 5
    5–6 8
    5–7 2
    6–8 3
    7-8 1

    i) Draw an arrow diagram for this project.


    ii) Find critical path and its duration.

    b) Obtain initial basic feasible solution of the following T.P by Vogel’s


    approximation method. Is this solution optimal? If not find optimal
    solution by MODI method.
    Destination

    ⎡5 6 2 3⎤ 8
    ⎢1 2 6 9⎥ 9
    Origin ⎢ ⎥
    ⎢⎣5 6 7 2 ⎥⎦ 11
    8 5 6 9 28

    c) Solve the following LPP by Simplex Method.


    Max Z=3x+2y+5z
    Subject to
    x + 2 y + z ≤ 43
    3 x + 2 z ≤ 46
    x + 4 y ≤ 12
    x, y , z ≥ 0

    cccc

    [4666]-55 4

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy