Scribd Logo
Upload

Welcome to Scribd!

  • GARBO, Mark Ian - Linear Programming

    Uploaded by

    Mj Ong Pierson Garbo
    62 views1 page
    Winkler Furniture manufactures two types of cabinets and needs to determine the optimal production mix to maximize daily revenue within production capacity constraints. The furniture goes through carpentry, painting, and finishing departments, with different production times and capacities for each. The problem aims to find the number of each cabinet type to produce to meet a minimum order of 300 per week while maximizing revenue, given production constraints.

    Original Description:

    e

    Original Title

    GARBO, Mark Ian_Linear Programming

    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
    Winkler Furniture manufactures two types of cabinets and needs to determine the optimal production mix to maximize daily revenue within production capacity constraints. The furniture goes through carpentry, painting, and finishing departments, with different production times and capacities for each. The problem aims to find the number of each cabinet type to produce to meet a minimum order of 300 per week while maximizing revenue, given production constraints.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    62 views1 page

    GARBO, Mark Ian - Linear Programming

    Uploaded by

    Mj Ong Pierson Garbo
    Winkler Furniture manufactures two types of cabinets and needs to determine the optimal production mix to maximize daily revenue within production capacity constraints. The furniture goes through carpentry, painting, and finishing departments, with different production times and capacities for each. The problem aims to find the number of each cabinet type to produce to meet a minimum order of 300 per week while maximizing revenue, given production constraints.

    Copyright:

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

    PROBLEM SOLVING

    Linear Programming

    Problem No. 1

    Winkler Furniture manufactures two different types of china cabinets: a French Provincial model and a
    Danish Modern Model. Each cabinet produced must go through three departments: carpentry, painting,
    and finishing. The table below contains all relevant information concerning production times per cabinet
    produced and production capacities for each operation per day, along with net revenue per unit produced.
    The firm has a contract with an Indiana distributor to produce a minimum of 300 of each cabinet per week
    ( or 60 cabinets per day). Owner Bob Winkler would like to determine a product mix to maximize his
    daily.

    a. Formulate as an LP problem.
    b. Solve using an LP software program or spreadsheet.

    Cabinet Style Carpentry Painting Finishing Net Revenue/Cabinet


    (hrs/cabinet) (hrs/cabinet) (hrs/cabinet) ($)
    French Provincial 3 1.5 0.75 28
    Danish Modern 2 1 0.75 25
    Department 360 200 120
    Capacity (hrs)

    You might also like