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

Welcome to Scribd!

  • 29 views

    Institute of Management Studies Devi Ahilya Vishwavidyalaya, Indore Mba (Executive) Semester Iii BATCH 2020-22 Operation Research Assignment - 1

    Uploaded by

    Xylem Solutions
    This document contains 5 questions from 2 assignments on the topic of Operations Research for an MBA program. The questions cover topics like linear programming, transportation problems, game theory, replacement costs, machine scheduling, and more. Students are asked to solve problems, define terms, explain concepts, and find minimum times. Operations Research techniques are used to help decision making in business and industry.

    Copyright:

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

    Institute of Management Studies Devi Ahilya Vishwavidyalaya, Indore Mba (Executive) Semester Iii BATCH 2020-22 Operation Research Assignment - 1

    Uploaded by

    Xylem Solutions
    29 views2 pages
    This document contains 5 questions from 2 assignments on the topic of Operations Research for an MBA program. The questions cover topics like linear programming, transportation problems, game theory, replacement costs, machine scheduling, and more. Students are asked to solve problems, define terms, explain concepts, and find minimum times. Operations Research techniques are used to help decision making in business and industry.

    Original Title

    operation research

    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 contains 5 questions from 2 assignments on the topic of Operations Research for an MBA program. The questions cover topics like linear programming, transportation problems, game theory, replacement costs, machine scheduling, and more. Students are asked to solve problems, define terms, explain concepts, and find minimum times. Operations Research techniques are used to help decision making in business and industry.

    Copyright:

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

    Institute of Management Studies Devi Ahilya Vishwavidyalaya, Indore Mba (Executive) Semester Iii BATCH 2020-22 Operation Research Assignment - 1

    Uploaded by

    Xylem Solutions
    This document contains 5 questions from 2 assignments on the topic of Operations Research for an MBA program. The questions cover topics like linear programming, transportation problems, game theory, replacement costs, machine scheduling, and more. Students are asked to solve problems, define terms, explain concepts, and find minimum times. Operations Research techniques are used to help decision making in business and industry.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    INSTITUTE OF MANAGEMENT STUDIES

    DEVI AHILYA VISHWAVIDYALAYA, INDORE


    MBA (EXECUTIVE) SEMESTER III
    BATCH 2020-22
    OPERATION RESEARCH
    ASSIGNMENT - 1
    Q1. “Executives all levels in business and industry come across the problems of making decision
    at every state in their day-to-day activities. Operation Research provides them with various
    quantitative techniques for decision making an enhance their ability to make long range plans
    and solve everyday problems of running a business and industry with greater efficiency,
    competence and confidence.” Comment with examples.
    Q2. Discuss the concept and role of artificial variable is context of linear programming. Take
    suitable example to illustrate your answer.
    Q3. Solve the following transportation problem for minimising nthe transportation cost. Apply
    Vogal Approximation and Modified Distribution Method.
    Store -> S1 S2 S3 S4 S5 Supply
    W1 9 12 10 10 6 150
    W2 5 18 12 11 2 30
    W3 10 M 7 3 20 120
    W4 5 6 2 M 8 130
    Requirement 80 60 20 210 80
    ‘M' indicates that the root is not available
    Q4. Solve the following transportation problem for minimization :
    D1 D2 D3 D4 Supply
    S1 9 12 9 6 7
    S2 7 3 7 7 6
    S3 6 4 9 11 9
    Demand 6 4 6 2

    Q5. A car hire company has one car at each of the five depots P, Q, R, S and T. A customer in
    each of the five towns A, B, C, D and E requires a car. The distance (in miles) between the
    deport and the town’s where the customers are given in the following distance matrix:
    P Q R S T
    A 160 130 175 190 200
    B 135 120 130 160 175
    C 140 110 155 170 185
    D 50 50 80 80 110
    E 55 35 70 80 105
    ASSIGNMENT - 2
    Q1. Define the following terms as applicable in Game theory?
    a) Players
    b) Payoff Matrix
    c) Outcome
    d) Saddle Point
    e) Strategy
    f) Value of a Game
    Q2. How does the problem of degeneracy arise in a transportation problem? Explain how can
    one overcome it.
    Q3. A computer contains 10,000 resistors. When any resistor fails, it is replaced. The cost of
    replacing a resistor individually in Re. one only. If all resistors are replaced at the same time, the
    cost per resistor would be reduced to 35 paise. The percentage of surviving resistors at the end of
    month is given below:
    Month. : 0 1 2 3 4 5 6
    % Surviving at the end of the month. : 100 97 90 70 30 15 0
    Q4. (a) The two armies are at a war. Army A has two airbase, one of which is twice as valuable
    as the other. Army B can destroy an undefended air base, but it can destroy only one of them.
    Army A can also defend only one of them. Find the best strategy for A to minimize it’s losses.
    (b) In a game of matching coins with two players, Suppose A wins one unit of value when there
    are two heads, wins nothing when there are two tails and loses ½ unit of value when there are
    one head and one tail . Determine the payoff matrix, the best strategies for each player, and the
    value of the game of the game A.
    Q5. For jobs 1, 2, 3 and 4 are to be processed on each of the four machines A, B, C and D in
    order ABCD. The processing times in minutes are given in one following table. Find minimum
    elapsed time and idle time of each machine:
    MACHINE
    JOB A B C D
    1 58 14 14 48
    2 30 10 18 32
    3 28 12 16 44
    4 64 16 12 42

    You might also like