Scribd Logo
Upload

Welcome to Scribd!

  • 42 views

    Exercise - Unit 1

    Uploaded by

    Shalini Shalini
    The document contains examples of linear programming problems involving maximizing or minimizing objectives subject to constraints on resources like machine hours or material quantities. The examples involve determining optimal product mixes or resource allocation to maximize profit or minimize costs. Multiple examples are provided for both maximization and minimization problems involving 2-4 decision variables and constraints. Graphical solutions are also presented for 2 variable linear programs.

    Copyright:

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

    Exercise - Unit 1

    Uploaded by

    Shalini Shalini
    42 views3 pages
    The document contains examples of linear programming problems involving maximizing or minimizing objectives subject to constraints on resources like machine hours or material quantities. The examples involve determining optimal product mixes or resource allocation to maximize profit or minimize costs. Multiple examples are provided for both maximization and minimization problems involving 2-4 decision variables and constraints. Graphical solutions are also presented for 2 variable linear programs.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains examples of linear programming problems involving maximizing or minimizing objectives subject to constraints on resources like machine hours or material quantities. The examples involve determining optimal product mixes or resource allocation to maximize profit or minimize costs. Multiple examples are provided for both maximization and minimization problems involving 2-4 decision variables and constraints. Graphical solutions are also presented for 2 variable linear programs.

    Copyright:

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

    Exercise - Unit 1

    Uploaded by

    Shalini Shalini
    The document contains examples of linear programming problems involving maximizing or minimizing objectives subject to constraints on resources like machine hours or material quantities. The examples involve determining optimal product mixes or resource allocation to maximize profit or minimize costs. Multiple examples are provided for both maximization and minimization problems involving 2-4 decision variables and constraints. Graphical solutions are also presented for 2 variable linear programs.

    Copyright:

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

    OPERATIONS RESEARCH FOR MANAGERS

    UNIT - 1 - FORMULATION OF LPP (Maximization Case)

    1. A company manufactures two products X1 and X2 on three machines A, B, and C.

    X1 require 1 hour on machine A and 1 hour on machine B and 3 hours on machine C and
    yields a revenue of Rs.3/-. Product X2 requires 2 hours on machine A and 1 hour on machine
    B and 1 hour on machine C and yields revenue of Rs. 5/-. In the coming planning period the
    available time of three machines A, B, and C are 2000 hours, 1500 hours and 600 hours
    respectively. Find the optimal product mix.

    2. Metal fabricators limited manufactures 3 plates in different sizes, A, B, and C through


    Casting, Grinding and Polishing processes for which processing time in minutes per unit are
    given below:

    If the contribution margins are Rs.1/–, 2/– and 3/– for A, B and C respectively, find
    contribution maximizing product mix.

    3. A manufacturer can produce three different products A, B, and C during a given time
    period. Each of these products requires four different manufacturing operations: Grinding,
    Turning, Assembly and Testing. The manufacturing requirements in hours per unit of the
    product are given below for A, B, and C:
    The available capacities of these operations in hours for the given time period are as follows:
    Grinding 30 hours, Turning: 60 hours, Assembly: 200 hours and Testing: 200 hours. The
    contribution of overheads and profit is Rs.4/– for each unit of A, Rs.6/– for each unit of B
    and Rs.5/– for each unit of C. The firm can sell all that it produces. Determine the optimum
    amount of A, B, and C to produce during the given time period for maximizing the returns.

    UNIT - 1 - FORMULATION OF LPP (Minimization case)

    1. XYZ company owns two flour mills viz. A and B, which have different production
    capacities for high, medium and low quality flour. The company has entered a contract to
    supply flour to a firm every month with at least 4, 6 and 12 quintals of high, medium and low
    quality respectively. It costs the company Rs.1000 and Rs.700 per day to run mill A and B
    respectively. On a day, Mill A produces 6, 2 and 4 quintals of high, medium and low quality
    flour, Mill B produces 2, 4 and 12 quintals of high, medium and low quality flour
    respectively. How many days per month should each mill be operated in order to meet the
    contract order most economically.

    2. A small city of 15,000 people requires an average of 3 lakhs of gallons of water daily. The
    city is supplied with water purified at a central water works, where water is purified by
    filtration, chlorination and addition of two chemicals softening chemical X and health
    chemical Y. Water works plans to purchase two popular brands of products, product A and
    product B, which contain these two elements. One unit of product A gives 8 Kg of X and 3
    Kg of Y. One unit of product B gives 4 Kg of X and 9 Kg of Y. To maintain the water at a
    minimum level of softness and meet a minimum in health protection, it is decided that 150
    Kg and 100 Kg of two chemicals that make up each product must be added daily. At a cost of
    Rs. 8/– and Rs. 10/– per unit respectively for A and B, what is the optimum quantity of each
    product that should be used to meet consumer standard?

    3. 10 grams of Alloy A contains 2 grams of copper, 1 gram of zinc and 1 gram of lead. 10
    grams of Alloy B contains 1 gram of copper, 1 gram of zinc and 1 gram of lead. It is required
    to produce a mixture of these alloys, which contains at least 10 grams of copper, 8 grams of
    zinc, and 12 grams of lead. Alloy B costs 1.5 times as much per Kg as alloy A. Find the
    amounts of alloys A and B, which must be mixed in order to satisfy these conditions in the
    cheapest way. Solution: The given data is: (Assume the cost of Alloy A as Re.1/– then the
    cost of Alloy B will be Rs. 1.50 per Kg.
    SOLVING LPP – GRAPHICAL METHOD

    1. Solve the following linear programming problem graphically.

    Maximize Z = 12x1 + 16x2


    subject to the constraints:
    10x1 + 20 x2  120
    8x1 + 8x2  80
    x1  0, x2  0

    2. Solve the following linear programming problem graphically.

    Minimize Z = 4x1 + 6x2


    subject to the constraints:
    x1 + x2  8
    6x1 + x2  12
    x1  0, x2  0

    You might also like