Scribd Logo
Hochladen

Willkommen bei Scribd!

  • Cell Name Original Value Final Value

    Hochgeladen von

    Madhur Pahuja
    9 Ansichten10 Seiten
    This document contains the output reports from solving a linear programming optimization problem in Microsoft Excel. The problem involved maximizing an objective cell subject to various constraints on variable cells. The solver found a feasible solution that satisfied all constraints and optimality conditions in 3 iterations, taking 0.016 seconds. A sensitivity analysis was also performed on the variable cells and constraints. Subsequently, additional constraints were added and the problem was re-solved, finding an improved optimal solution of $11,700,000 in 0 iterations.

    Originalbeschreibung:

    Solution of merton truck case study

    Originaltitel

    Merton 1

    Copyright

    © © All Rights Reserved

    Verfügbare Formate

    XLSX, PDF, TXT oder online auf Scribd lesen

    Stufen Sie dieses Dokument als nützlich ein?

    Sind diese Inhalte unangemessen?

    Dieses Dokument melden
    This document contains the output reports from solving a linear programming optimization problem in Microsoft Excel. The problem involved maximizing an objective cell subject to various constraints on variable cells. The solver found a feasible solution that satisfied all constraints and optimality conditions in 3 iterations, taking 0.016 seconds. A sensitivity analysis was also performed on the variable cells and constraints. Subsequently, additional constraints were added and the problem was re-solved, finding an improved optimal solution of $11,700,000 in 0 iterations.

    Copyright:

    © All Rights Reserved
    Als XLSX, PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    9 Ansichten10 Seiten

    Cell Name Original Value Final Value

    Hochgeladen von

    Madhur Pahuja
    This document contains the output reports from solving a linear programming optimization problem in Microsoft Excel. The problem involved maximizing an objective cell subject to various constraints on variable cells. The solver found a feasible solution that satisfied all constraints and optimality conditions in 3 iterations, taking 0.016 seconds. A sensitivity analysis was also performed on the variable cells and constraints. Subsequently, additional constraints were added and the problem was re-solved, finding an improved optimal solution of $11,700,000 in 0 iterations.

    Copyright:

    © All Rights Reserved
    Als XLSX, PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    von 10

    Microsoft Excel 15.

    0 Answer Report
    Worksheet: [Book1]Sheet1
    Report Created: 10/10/2016 10:18:35 AM
    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 NonNegati

    Objective Cell (Max)


    Cell
    Name
    Original Value Final Value
    $E$2
    0
    11000000

    Variable Cells
    Cell
    Name
    $C$4 T101
    $D$4 T102

    Constraints
    Cell
    Name
    $E$5 EA LHS
    $E$6 MS LHS
    $E$7 101A LHS
    $E$8 102A LHS

    Original Value Final Value


    Integer
    0
    2000 Contin
    0
    1000 Contin

    Cell Value
    Formula
    Status
    4000 $E$5<=$G$5 Binding
    6000 $E$6<=$G$6 Binding
    4000 $E$7<=$G$7 Not Binding
    3000 $E$8<=$G$8 Not Binding

    Slack
    0
    0
    1000
    1500

    nditions are satisfied.

    matic Scaling
    nce 1%, Assume NonNegative

    Microsoft Excel 15.0 Sensitivity Report


    Worksheet: [Book1]Sheet1
    Report Created: 10/10/2016 10:18:35 AM

    Variable Cells
    Cell
    Name
    $C$4 T101
    $D$4 T102

    Final Reduced Objective Allowable Allowable


    Value
    Cost
    Coefficient Increase Decrease
    2000
    0
    3000
    2000
    500
    1000
    0
    5000
    1000
    2000

    Constraints
    Cell
    $E$5
    $E$6
    $E$7
    $E$8

    Name
    EA LHS
    MS LHS
    101A LHS
    102A LHS

    Final Shadow Constraint Allowable Allowable


    Value
    Price
    R.H. Side
    Increase Decrease
    4000
    2000
    4000
    500
    500
    6000
    500
    6000
    500
    1000
    4000
    0
    5000 1.000E+030
    1000
    3000
    0
    4500 1.000E+030
    1500

    Microsoft Excel 15.0 Answer Report


    Worksheet: [MERTON1.xlsx]Sheet1
    Report Created: 10/10/2016 11:00:49 AM
    Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
    Solver Engine
    Engine: Simplex LP
    Solution Time: 0.015 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 NonNegati

    Objective Cell (Max)


    Cell
    Name
    Original Value Final Value
    $F$2
    11000000
    11000000

    Variable Cells
    Cell
    Name
    $C$4 T101
    $D$4 T102
    $E$4 T103

    Constraints
    Cell
    Name
    $F$5 EA LHS
    $F$6 MS LHS
    $F$7 101A LHS
    $F$8 102A LHS

    Original Value Final Value


    Integer
    2000
    2000 Contin
    1000
    1000 Contin
    0
    0 Contin

    Cell Value
    Formula
    4000 $F$5<=$H$5
    6000 $F$6<=$H$6
    4000 $F$7<=$H$7
    3000 $F$8<=$H$8

    Status
    Binding
    Binding
    Not Binding
    Not Binding

    Slack
    0
    0
    1000
    1500

    nditions are satisfied.

    matic Scaling
    nce 1%, Assume NonNegative

    Microsoft Excel 15.0 Sensitivity Report


    Worksheet: [MERTON1.xlsx]Sheet1
    Report Created: 10/10/2016 11:00:49 AM

    Variable Cells
    Cell
    Name
    $C$4 T101
    $D$4 T102
    $E$4 T103

    Final Reduced Objective Allowable Allowable


    Value
    Cost
    Coefficient Increase Decrease
    2000
    0
    3000
    2000
    500
    1000
    0
    5000
    1000
    2000
    0
    -350
    2000
    350 1.000E+030

    Constraints
    Cell
    $F$5
    $F$6
    $F$7
    $F$8

    Name
    EA LHS
    MS LHS
    101A LHS
    102A LHS

    Final Shadow Constraint Allowable Allowable


    Value
    Price
    R.H. Side
    Increase Decrease
    4000
    2000
    4000
    500
    500
    6000
    500
    6000
    500
    1000
    4000
    0
    5000 1.000E+030
    1000
    3000
    0
    4500 1.000E+030
    1500

    Microsoft Excel 15.0 Answer Report


    Worksheet: [MERTON1.xlsx]Sheet1
    Report Created: 10/10/2016 11:29:42 AM
    Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
    Solver Engine
    Engine: Simplex LP
    Solution Time: 0 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 NonNegati

    Objective Cell (Max)


    Cell
    Name
    $G$2

    Original Value Final Value


    11000000
    11700000

    Variable Cells
    Cell
    Name
    $C$4 T101
    $D$4 T102
    $E$4 T101OT
    $F$4 T102OT

    Original Value Final Value


    Integer
    2000
    1500 Contin
    1000
    1250 Contin
    0
    0 Contin
    0
    250 Contin

    Constraints
    Cell
    Name
    $G$5 EA LHS
    $G$6 MS LHS
    $G$7 101A LHS
    $G$8 102A LHS
    $G$9 EA-OT LHS

    Cell Value
    Formula
    4000 $G$5<=$I$5
    6000 $G$6<=$I$6
    3000 $G$7<=$I$7
    4500 $G$8<=$I$8
    500 $G$9<=$I$9

    Status
    Binding
    Binding
    Not Binding
    Binding
    Not Binding

    Slack
    0
    0
    2000
    0
    1500

    ditions are satisfied.

    matic Scaling
    ce 1%, Assume NonNegative

    Microsoft Excel 15.0 Sensitivity Report


    Worksheet: [MERTON1.xlsx]Sheet1
    Report Created: 10/10/2016 11:29:42 AM

    Variable Cells
    Cell
    $C$4
    $D$4
    $E$4
    $F$4

    Name
    T101
    T102
    T101OT
    T102OT

    Final
    Value
    1500
    1250
    0
    250

    Reduced
    Cost
    0
    0
    0
    0

    Objective Allowable Allowable


    Coefficient Increase Decrease
    3000
    1400
    0
    5000
    0
    1200
    2400
    0 1.000E+030
    3800
    1200
    0

    Constraints
    Cell
    $G$5
    $G$6
    $G$7
    $G$8
    $G$9

    Name
    EA LHS
    MS LHS
    101A LHS
    102A LHS
    EA-OT LHS

    Final
    Shadow
    Constraint Allowable Allowable
    Value
    Price
    R.H. Side
    Increase Decrease
    4000
    600
    4000
    500
    1500
    6000
    1200
    6000
    2000
    1000
    3000
    0
    5000 1.000E+030
    2000
    4500 466.66666667
    4500
    4500
    1500
    500
    0
    2000 1.000E+030
    1500

    3000
    T101
    EA
    MS
    101A
    102A
    EA-OT

    5000
    T102

    1500
    1
    2
    2

    2400
    3800 11700000
    T101OT
    T102OT
    1250
    0
    250 LHS
    RHS
    2
    0
    0
    4000 <=
    2
    2
    2
    6000 <=
    2
    3000 <=
    3
    3
    4500 <=
    1
    2
    500 <=

    4000
    6000
    5000
    4500
    2000

    Das könnte Ihnen auch gefallen