Scribd Logo
Upload

Welcome to Scribd!

  • Radio I Radioii Radioiii MAX Avaibility (In HRS) : Plant A 1 2 2 8 Plant B 3 2 6 12 Plant C 2 3 4 12

    Uploaded by

    harsh7777
    2 views2 pages
    The manufacturer makes three types of radios that require different amounts of time in three plants to produce. Radio I requires 1 hour in Plant A, 2 hours in Plant B, and 2 hours in Plant C. Radio II requires 3 hours in Plant A, 2 hours in Plant B, and 6 hours in Plant C. Radio III requires 2 hours in Plant A, 3 hours in Plant B, and 4 hours in Plant C. Each plant has a maximum number of operating hours per day. The problem aims to formulate a linear programming problem to determine the number of each type of radio to produce to maximize profit, where Radio I yields $3 profit, Radio II yields $2 profit, and Radio III yields $5 profit.

    Original Description:

    simplex maths

    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
    The manufacturer makes three types of radios that require different amounts of time in three plants to produce. Radio I requires 1 hour in Plant A, 2 hours in Plant B, and 2 hours in Plant C. Radio II requires 3 hours in Plant A, 2 hours in Plant B, and 6 hours in Plant C. Radio III requires 2 hours in Plant A, 3 hours in Plant B, and 4 hours in Plant C. Each plant has a maximum number of operating hours per day. The problem aims to formulate a linear programming problem to determine the number of each type of radio to produce to maximize profit, where Radio I yields $3 profit, Radio II yields $2 profit, and Radio III yields $5 profit.

    Copyright:

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

    Radio I Radioii Radioiii MAX Avaibility (In HRS) : Plant A 1 2 2 8 Plant B 3 2 6 12 Plant C 2 3 4 12

    Uploaded by

    harsh7777
    The manufacturer makes three types of radios that require different amounts of time in three plants to produce. Radio I requires 1 hour in Plant A, 2 hours in Plant B, and 2 hours in Plant C. Radio II requires 3 hours in Plant A, 2 hours in Plant B, and 6 hours in Plant C. Radio III requires 2 hours in Plant A, 3 hours in Plant B, and 4 hours in Plant C. Each plant has a maximum number of operating hours per day. The problem aims to formulate a linear programming problem to determine the number of each type of radio to produce to maximize profit, where Radio I yields $3 profit, Radio II yields $2 profit, and Radio III yields $5 profit.

    Copyright:

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

    A manufacturer makes three types of radio.

    To produce Radio I, it requires 1hr in plant A, 2hrs in plant B and 2hrs in plant C. To produce Radio II ,it requires 3hrs in plant A ,2hrs in plant B and 6hrs in plant C. To produce Radio III ,it requires 2hrs in plant A, 3hrs in plant B and 4hrs in plant C. Plant A can operate for at the most 8hrs a day, plant B for 12hrs a day and plant C for 12hrs a day. If the manufacturer makes a profit of Rs 3 on Radio I, Rs 2 on Radio II and rs 5 on Radio III, in order to produce number of Radios of each type ,to maximise the profit, formulate the above problem as L.P.P.

    RADIO I

    RADIOII

    RADIOIII

    MAX AVAIBILITY (IN HRS) 8 12 12

    PLANT A PLANT B PLANT C

    1 3 2

    2 2 3

    2 6 4

    You might also like