Scribd Logo
Upload

Welcome to Scribd!

  • 18 views

    1 A

    Uploaded by

    cyclo tron
    The document describes solving an optimization problem to find the best product mix using a linear programming model. It provides the objective function, decision variables, coefficients, constraints and reports that the solver found a solution satisfying all constraints and optimality conditions with 2000 units of Model A Truck and 1000 units of Model B Truck as the optimal solution.

    Copyright:

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

    1 A

    Uploaded by

    cyclo tron
    18 views2 pages
    The document describes solving an optimization problem to find the best product mix using a linear programming model. It provides the objective function, decision variables, coefficients, constraints and reports that the solver found a solution satisfying all constraints and optimality conditions with 2000 units of Model A Truck and 1000 units of Model B Truck as the optimal solution.

    Original Title

    1a

    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 solving an optimization problem to find the best product mix using a linear programming model. It provides the objective function, decision variables, coefficients, constraints and reports that the solver found a solution satisfying all constraints and optimality conditions with 2000 units of Model A Truck and 1000 units of Model B Truck as the optimal solution.

    Copyright:

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

    1 A

    Uploaded by

    cyclo tron
    The document describes solving an optimization problem to find the best product mix using a linear programming model. It provides the objective function, decision variables, coefficients, constraints and reports that the solver found a solution satisfying all constraints and optimality conditions with 2000 units of Model A Truck and 1000 units of Model B Truck as the optimal solution.

    Copyright:

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

    ABC Automobiles

    Answer-1(a)
    Finding the best product mix

    Decision Variables X1 X2
    Solution 2000 1000
    Co-efficient 3000 5000

    Objective Function
    Maximize 11000000

    subject to
    coefficient
    Constraints coefficient of X2 Inequality RHS
    of X1
    Constraint 1 1 2 <= 4000
    Constraint 2 2 2 <= 6000
    Constraint 3 2 0 <= 5000
    Constraint 4 0 3 <= 4500

    The best product mix is to produce 2000 units of Model A Truck and 1000 units of Model B Truck

    Microsoft Excel 16.0 Answer Report


    Worksheet: [1a]1a
    Report Created: 31-12-2022 17:29:05
    Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
    Solver Engine
    Engine: Simplex LP
    Solution Time: 0.016 Seconds.
    Iterations: 3 Subproblems: 0
    Solver Options
    Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
    Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

    Objective Cell (Max)


    Cell Name Original Value Final Value
    $B$6 Maximize 0 11000000

    Variable Cells
    Cell Name Original Value Final Value Integer
    $B$2 X1 0 2000 Contin
    $B$3 X2 0 1000 Contin

    Constraints
    Cell Name Cell Value Formula Status Slack
    $B$10 6000 $B$10<=$D$10 Binding 0
    $B$11 4000 $B$11<=$D$11 Not Binding 1000
    $B$12 3000 $B$12<=$D$12 Not Binding 1500
    $B$9 4000 $B$9<=$D$9 Binding 0

    Microsoft Excel 16.0 Sensitivity Report


    Worksheet: [1a]1a
    Report Created: 31-12-2022 17:29:05

    Variable Cells
    Final Reduced Objective Allowable Allowable
    Cell Name Value Cost Coefficient Increase Decrease
    $B$2 X1 2000 0 3000 2000 500
    $B$3 X2 1000 0 5000 1000 2000

    Constraints
    Final Shadow Constraint Allowable Allowable
    Cell Name Value Price R.H. Side Increase Decrease
    $B$10 6000 500 6000 500 1000
    $B$11 4000 0 5000 1E+030 1000
    $B$12 3000 0 4500 1E+030 1500
    $B$9 4000 2000 4000 500 500
    2000
    1000

    You might also like