Scribd Logo
Upload

Welcome to Scribd!

  • Machine A 2 3 12 Machine B 1 2 7

    Uploaded by

    harsh7777
    3 views2 pages
    A manufacturer makes products A and B using machines A and B, with machine A available for 12 hours and machine B for 7 hours daily. Product A takes 2 hours in machine A and 1 in B, while product B takes 3 in A and 2 in B. Product A profits Rs2 and product B Rs3. The problem is to formulate a linear programming problem to maximize total profit by determining the optimal number of each product to make.

    Original Description:

    simplex-2

    Original Title

    SIMPLEX.pptx

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    A manufacturer makes products A and B using machines A and B, with machine A available for 12 hours and machine B for 7 hours daily. Product A takes 2 hours in machine A and 1 in B, while product B takes 3 in A and 2 in B. Product A profits Rs2 and product B Rs3. The problem is to formulate a linear programming problem to maximize total profit by determining the optimal number of each product to make.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    3 views2 pages

    Machine A 2 3 12 Machine B 1 2 7

    Uploaded by

    harsh7777
    A manufacturer makes products A and B using machines A and B, with machine A available for 12 hours and machine B for 7 hours daily. Product A takes 2 hours in machine A and 1 in B, while product B takes 3 in A and 2 in B. Product A profits Rs2 and product B Rs3. The problem is to formulate a linear programming problem to maximize total profit by determining the optimal number of each product to make.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    A manufacturer produces two products A and B, each of which must be processed through two machines A and B.

    The maximum availability of machine A and B per day are 12 and 7hrs respectively. If manufacturing a product A requires 2hrs in machine A and 1hr in machine B , whereas a product B requires 3hr of machine A and 2hrs of machine B. The profit on product A is Rs2 and on product B is Rs3. Formulate the above problem as L.P.P. to maximise the profit.
    PRODUCT A MACHINE A MACHINE B 2 1 PRODUCT B 3 2 MAX AVAIBILITY 12 7

    You might also like