Scribd Logo
Upload

Welcome to Scribd!

  • Operations Research

    Uploaded by

    OdlanyerZaidAlludad
    3 views2 pages
    The manufacturer has daily constraints of $2,000 for production costs and 660 hours of labor. They want to maximize daily profit by determining the optimal quantities of clocks, radios, and toasters to produce given their costs, labor hours, maximum demands, and selling prices. By solving the linear program with these constraints, the optimal solution is 178 clocks, 0 radios, and 150 toasters for a maximum daily profit of $2,474 using 656 labor hours at a total daily cost of $1,996.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The manufacturer has daily constraints of $2,000 for production costs and 660 hours of labor. They want to maximize daily profit by determining the optimal quantities of clocks, radios, and toasters to produce given their costs, labor hours, maximum demands, and selling prices. By solving the linear program with these constraints, the optimal solution is 178 clocks, 0 radios, and 150 toasters for a maximum daily profit of $2,474 using 656 labor hours at a total daily cost of $1,996.

    Copyright:

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

    Operations Research

    Uploaded by

    OdlanyerZaidAlludad
    The manufacturer has daily constraints of $2,000 for production costs and 660 hours of labor. They want to maximize daily profit by determining the optimal quantities of clocks, radios, and toasters to produce given their costs, labor hours, maximum demands, and selling prices. By solving the linear program with these constraints, the optimal solution is 178 clocks, 0 radios, and 150 toasters for a maximum daily profit of $2,474 using 656 labor hours at a total daily cost of $1,996.

    Copyright:

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

    1.

    Given:

    Cost/Unit Labor Hours/Unit


    Clock $7 2
    Radio 10 3
    Toaster 5 2

    Implicitly, all quantities produced daily are to be positive, so


    =>
    c≥0
    r≥0
    t≥0

    The manufacturer has a daily production budget of $2,000


    =>
    7c+10r+5t ≤ 2000

    and maximum of 660 hours of labor.


    =>
    2c+3r+2t ≤ 660

    Maximum daily customer demand is for 200 clocks, 300 radios, and
    150 toasters.
    =>
    c ≤ 200
    r ≤ 300
    t ≤ 150

    Clocks sell for $15, radios for $20, and toasters for $12.The company
    wants to know the optimal product mix that will maximize profit.
    =>
    profit for clocks = 15-7 = 8
    profit for radios = 20-10 = 10
    profit for toasters = 12-5 = 7
    Also, labour cost is not provided, so the 600 hours will be assumed a
    fixed cost.
    =>
    Z=8c+10r+7t (objective function)

    Feed in all these inequalities to your linear programming solver.


    I get c=178, r=0, t=150
    for Z=2474, 656 hours, and cost = $1996

    You might also like