Magleo Michael Angelo Seatwork

Microsoft Excel 15.
0 Feasibility Report
Worksheet: [MAGLEO, MICHAEL ANGELO SEATWORK.xlsx]#1
Report Created: 8/17/2015 6:09:31 PM
Constraints Which Make the Problem Infeasible

Cell Name Cell Value
Formula
Status
$E$6 LHS
0 $E$6<=$G$6 Violated
Slack
-1
Microsoft Excel 15.0 Feasibility Report

Worksheet: [MAGLEO, MICHAEL ANGELO SEATWORK.xlsx]#1
Constraints (not including Variable Bounds) Which Make the Problem Infeasible
Cell Name Cell Value
Formula
Status Slack
$E$6 LHS
0 $E$6<=$G$6 Violated
-1
X1
OF, Max Z
S.T.
X2
0
4
X3
0
1
0
3
0
LHS
2
1
1
1
1
2
Condition RHS
0 <=
0 <=
1
-1
Microsoft Excel 15.0 Answer Report

Worksheet: [Book1]#2
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%
Objective Cell (Min)

Cell
Name
$F$3 OF, min Z
Original Value Final Value

0
10.6
Variable Cells
Cell
Name
$B$2 Y1
$C$2 Y2
$D$2 Y3
$E$2 Y4

Integer
0
0 Contin
0
0.6 Contin
0
-0.8 Contin
0
2.8 Contin
Constraints
Cell
Name
$F$5 LHS
$F$6 LHS
$F$7 LHS
$B$2 Y1
$C$2 Y2
$D$2 Y3
Cell Value
Formula
4 $F$5>=$H$5
-1 $F$6=$H$6
2 $F$7=$H$7
0 $B$2>=0
0.6 $C$2>=0
-0.8 $D$2<=0
Status
Binding
Binding
Binding
Binding
Not Binding
Not Binding
Slack
0
0
0
0
0.6
0.8
ditions are satisfied.
matic Scaling
Microsoft Excel 15.0 Sensitivity Report

Variable Cells
Cell
$B$2
$C$2
$D$2
$E$2
Final Reduced Objective

Allowable
Allowable
Name Value
Cost
Coefficient
Increase
Decrease
Y1
0
0.4
5 1.00000E+030
0.4
Y2
0.6
0
7 0.6666666667
6
Y3
-0.8
0
6
2 1.000E+030
Y4
2.8
0
4 1.00000E+030
2
Constraints
Cell
$F$5
$F$6
$F$7
Final Shadow Constraint

Allowable
Allowable
Name Value
Price
R.H. Side
Increase
Decrease
LHS
4
2.4
4 1.00000E+030
1.5
LHS
-1
2.2
-1
2
3
LHS
2
1.6
2
1.5 1.000E+030
Microsoft Excel 15.0 Limits Report

Objective
Cell
Name
Value
$F$3 OF, min Z
10.6
Cell
$B$2
$C$2
$D$2
$E$2
Variable
Name
Y1
Y2
Y3
Y4
Value
0
0.6
-0.8
2.8
Lower Objective
Limit
Result
0
10.6
0.6
10.6
-0.8
10.6
2.8
10.6
Upper Objective
Limit
Result
0
10.6
0.6
10.6
-0.8
10.6
2.8
10.6
Y1
OF, Min Z
S.T.
Y2
0
5
Y3
0.6
7
Y4
-0.8
6
2.8
4
10.6
LHS
1
1
0
2
1
0
0
2
1
1
0
1
Condition
>=
4
=
-1
=
2
RHS
4
-1
2

Solver Engine
Engine: Simplex LP
Solution Time: 0.016 Seconds.
Solver Options
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegati
Objective Cell (Max)

Cell
Name
$D$3 OF, max Z

0
6
Variable Cells
Cell
Name
$B$2 X1
$C$2 X2

Integer
0
0 Contin
0
1 Contin
Constraints
Cell
Name
$D$5 LHS
$D$6 LHS
Cell Value
Formula
Status
7 $D$5<=$F$5 Not Binding
2 $D$6<=$F$6 Binding
Slack
28
0
ditions are satisfied.
matic Scaling
ce 1%, Assume NonNegative

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value
Cost
Coefficient Increase Decrease
$B$2 X1
0
0
-3
0 1.000E+030
$C$2 X2
1
0
6
0
6
Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value
Price
R.H. Side
Increase Decrease
$D$5 LHS
7
0
35 1.000E+030
28
$D$6 LHS
2
3
2
8
2

Objective
Cell
Name
Value
$D$3 OF, max Z
6
Variable
Cell
Name
$B$2 X1
$C$2 X2
Value
0
1
Lower Objective
Limit
Result
0
6
0
0
Upper Objective
Limit
Result
5.6
-10.8
1
6
X1
OF, Max Z
S.T.
X2
0
-3
1
6
6
LHS
5
-1
7
2
Condition RHS
7 <=
2 <=
35
2

Solver Engine
Engine: Simplex LP
Solution Time: 0 Seconds.
Solver Options
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegati
Objective Cell (Max)

Cell
Name
$E$3 OF, max Z
0
53.75
Variable Cells
Cell
Name
$B$2 X1
$C$2 X2
$D$2 X3
Constraints
Cell
Name
$E$5 LHS
$E$6 LHS
Original Value Final Value Integer

0
3.75 Contin
0 3.3333333333 Contin
0
0 Contin
Cell Value
Formula
Status Slack
17.5 $E$5<=$G$5 Binding
0
15 $E$6<=$G$6 Binding
0
are satisfied.
Assume NonNegative

Variable Cells
Cell
$B$2
$C$2
$D$2
Final
Reduced Objective Allowable Allowable
Name
Value
Cost
Coefficient Increase Decrease
X1
3.75
0
9 1.000E+030
5
X2
3.3333333333
0
6
7.5
6
X3
0
-20.25
5
20.25 1.000E+030
Constraints
Cell Name
$E$5 LHS
$E$6 LHS
Final
Shadow Constraint Allowable Allowable
Value
Price
R.H. Side
Increase Decrease
17.5
2
17.5 1.000E+030
10
15
1.25
15
20
15

Objective
Cell
Name
$E$3 OF, max Z
Cell
$B$2
$C$2
$D$2
Value
53.75
Variable
Name
Value
X1
3.75
X2
3.3333333333
X3
0
Lower Objective
Limit
Result
0
20
0
33.75
0
53.75
Upper
Objective
Limit
Result
3.75
53.75
3.3333333333
53.75
0
53.75
X1
OF, Max Z
S.T.
X2
X3
3.75 3.333333
9
6
0
5
53.75
LHS
2
4
3
0
7
9
Condition RHS
17.5 <=
17.5
15 <=
15

Magleo Michael Angelo Seatwork

Uploaded by

Copyright:

Available Formats

Magleo Michael Angelo Seatwork

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Magleo Michael Angelo Seatwork

Uploaded by

Copyright:

Available Formats

Microsoft Excel 15.

Constraints Which Make the Problem Infeasible

Microsoft Excel 15.0 Feasibility Report

Microsoft Excel 15.0 Answer Report

Objective Cell (Min)

Original Value Final Value

Original Value Final Value

ditions are satisfied.

Microsoft Excel 15.0 Sensitivity Report

Final Reduced Objective

Final Shadow Constraint

Microsoft Excel 15.0 Limits Report

Microsoft Excel 15.0 Answer Report

Objective Cell (Max)

Original Value Final Value

Original Value Final Value

ditions are satisfied.

Microsoft Excel 15.0 Sensitivity Report

Microsoft Excel 15.0 Limits Report

Microsoft Excel 15.0 Answer Report

Objective Cell (Max)

Original Value Final Value Integer

Microsoft Excel 15.0 Sensitivity Report

Microsoft Excel 15.0 Limits Report

You might also like