Scribd Logo
Upload

Welcome to Scribd!

  • 14 views

    Q1 Assigment

    Uploaded by

    kharratlotfi469
    The document describes a linear programming optimization problem to maximize profit from producing two products. It defines decision variables for the quantities of each product, sets the objective as profit which is defined as revenue minus costs, and lists four constraints: maximum machine hours, available raw materials, maximum production for each product, and non-negativity constraints. The optimal solution is found to be producing 1900 of product 1 and 1100 of product 2 for a maximum profit of $112,000.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd

    Q1 Assigment

    Uploaded by

    kharratlotfi469
    14 views15 pages
    The document describes a linear programming optimization problem to maximize profit from producing two products. It defines decision variables for the quantities of each product, sets the objective as profit which is defined as revenue minus costs, and lists four constraints: maximum machine hours, available raw materials, maximum production for each product, and non-negativity constraints. The optimal solution is found to be producing 1900 of product 1 and 1100 of product 2 for a maximum profit of $112,000.

    Original Title

    Q1 assigment

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes a linear programming optimization problem to maximize profit from producing two products. It defines decision variables for the quantities of each product, sets the objective as profit which is defined as revenue minus costs, and lists four constraints: maximum machine hours, available raw materials, maximum production for each product, and non-negativity constraints. The optimal solution is found to be producing 1900 of product 1 and 1100 of product 2 for a maximum profit of $112,000.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Download as xlsx, pdf, or txt
    14 views15 pages

    Q1 Assigment

    Uploaded by

    kharratlotfi469
    The document describes a linear programming optimization problem to maximize profit from producing two products. It defines decision variables for the quantities of each product, sets the objective as profit which is defined as revenue minus costs, and lists four constraints: maximum machine hours, available raw materials, maximum production for each product, and non-negativity constraints. The optimal solution is found to be producing 1900 of product 1 and 1100 of product 2 for a maximum profit of $112,000.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Download as xlsx, pdf, or txt
    of 15

    Profit 180500 Profit 0

    Demand 9500
    Cost 2 Xwine 0
    Price 21 Xbeer 0
    Min 10
    Max 40
    Decisions variables

    Objective function
    Constratins
    Qfa= K of Fabric A
    Define Varaible Qfb= K of Fabrik B

    Profit 500*Qfa+400*Qfb

    Time Machine 4Qfa+3QFb<=800


    1Qfa+3Qfb<450
    Raw material
    2Qfa+1Qfb<480
    Production L QFA<=QFb+200

    Non negativity Qfa>0


    Qfb>0
    Decisions variables

    Objective function

    Revenue

    Cost

    Profit

    Equation

    Constratins
    Machine hours
    Metal
    Model 101 Assembly
    Model 102 Assembly

    b) 1999
    1001
    X1 = number of model 101 trucks produced 2000 x1
    X2 = number of model 102 trucks produced 1000 X2

    Max Revenue Model 101 & 102


    Profit= Revenue - Cost

    Model 101 Model 102 x1


    Sales Revenue 39000 38000 x1
    Direct Material 24000 20000 x1
    Direct Labour 4000 4500 3x2
    Variable Overhead 8000 8500
    Profit 3000 5000

    Maxmise : 3000 X1+5000 X2 3000 5000 11000000

    1 X1 +2X2 <= 4000


    2 X1 + 2 X2 <= 6000
    2 X1 <= 5000
    3X2 <= 4500
    x1>0 X2>0

    Model 101
    Model 102
    4000-2x2
    3000-X2
    2500

    Target

    x1
    Decisions variables

    Objective function

    Revenue

    Cost

    Profit

    Equation

    Constratins
    Machine hours
    Metal
    Model 101 Assembly
    Model 102 Assembly

    b) 1999
    1001
    Extra unit of capacity worth is
    X1 = number of model 101 trucks produced 1999 x1
    X2 = number of model 102 trucks produced 1001 X2

    Max Revenue Model 101 & 102


    Profit= Revenue - Cost

    Model 101 Model 102 x1


    Sales Revenue 39000 38000 x1
    Direct Material 24000 20000 x1
    Direct Labour 4000 4500 3x2
    Variable Overhead 8000 8500
    Profit 3000 5000

    Maxmise : 3000 X1+5000 X2 3000 5000 11002000

    1 X1 +2X2 <= 4001


    2 X1 + 2 X2 <= 6000
    2 X1 <= 5000
    3X2 <= 4500
    x1>0 X2>0

    Model 101
    Model 102
    2000
    4000-2x2
    3000-X2
    2500

    Target

    x1
    Decisions variables

    Objective function

    Revenue

    Cost

    Profit

    Equation

    Constratins
    Machine hours
    Metal
    Model 101 Assembly
    Model 102 Assembly

    b) 1999
    1001
    X1 = number of model 101 trucks produced 1900 x1
    X2 = number of model 102 trucks produced 1100 X2

    Max Revenue Model 101 & 102


    Profit= Revenue - Cost

    Model 101 Model 102 x1


    Sales Revenue 39000 38000 x1
    Direct Material 24000 20000 x1
    Direct Labour 4000 4500 3x2
    Variable Overhead 8000 8500
    Profit 3000 5000

    Maxmise : 3000 X1+5000 X2 3000 5000 11200000

    1 X1 +2X2 <= 4100


    2 X1 + 2 X2 <= 6000
    2 X1 <= 5000
    3X2 <= 4500
    x1>0 X2>0

    Model 101
    Model 102
    4000-2x2
    3000-X2
    2500

    Target

    x1
    Microsoft Excel 16.0 Sensitivity Report
    Worksheet: [Q1 assigment.xlsx]Sheet4
    Report Created: 25/01/2024 6:33:41 PM

    Variable Cells
    Final Reduced
    Cell Name Value Gradient
    $I$3 number of model 101 trucks produced 2000 0
    $I$4 number of model 102 trucks produced 1000 0

    Constraints
    Final Lagrange
    Cell Name Value Multiplier
    $I$3 number of model 101 trucks produced 2000 2000
    $I$3 number of model 101 trucks produced 2000 1000
    $I$3 number of model 101 trucks produced 2000 0
    $I$4 number of model 102 trucks produced 1000 0
    Decisions variables

    Objective function
    Constratins
    Maximise Revenue 20100

    2 P >=2
    Somme P <=4
    Px<>Px+1

    You might also like