Scribd Logo
Upload

Welcome to Scribd!

  • Auto Asembly Given

    Uploaded by

    LyLe IcEice Yeloyelo
    10 views1 page
    The document describes a linear programming problem to maximize profits from assembling two car models - a family sedan (FT) and luxury sedan (CC) - given constraints of assembly labor hours, door production, and CC demand. The objective is to maximize profits of $3,600 per FT and $5,400 per CC, subject to the assembly time, doors, and demand constraints, requiring the decision variables X1 (FT) and X2 (CC) to be non-negative.

    Original Description:

    Auto Assembly Given

    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 document describes a linear programming problem to maximize profits from assembling two car models - a family sedan (FT) and luxury sedan (CC) - given constraints of assembly labor hours, door production, and CC demand. The objective is to maximize profits of $3,600 per FT and $5,400 per CC, subject to the assembly time, doors, and demand constraints, requiring the decision variables X1 (FT) and X2 (CC) to be non-negative.

    Copyright:

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

    Auto Asembly Given

    Uploaded by

    LyLe IcEice Yeloyelo
    The document describes a linear programming problem to maximize profits from assembling two car models - a family sedan (FT) and luxury sedan (CC) - given constraints of assembly labor hours, door production, and CC demand. The objective is to maximize profits of $3,600 per FT and $5,400 per CC, subject to the assembly time, doors, and demand constraints, requiring the decision variables X1 (FT) and X2 (CC) to be non-negative.

    Copyright:

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

    Auto Assembly Given:

    Decision Variables:
    Let

    FT

    =Family Thrill Seeker


    = X1
    = (Four-door sedan with vinyl seats, family interior, standard features and
    excellent gas
    mileage)

    CC

    =Classic Cruiser
    = X2
    = Two-door luxury sedan with leather seats, wooden interior, custom
    features and navigation capabilities)

    = Profits

    Profit per unit sold : FT=$3,600


    CC=$5,400
    Capacity: 48000 hours per month

    Linear Program of the Problem:


    Maximize Profit=3600FT + 5400CC
    Subject to Constraints:
    Labour hours for Assembly: (you may use X1 and X2 )

    Doors:

    Demand for CC:

    NNC: FT and CC 0

    You might also like