0% found this document useful (0 votes)
18 views

Or Assignment

The solver found an optimal solution that maximized total profit of 1980. It allocated production of 20 units of good X1 and 100 units of good X2, fully utilizing the cotton and dacron constraints. The sensitivity report and limits report provided additional details on optimal solution and ranges of objective function with parameter changes.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
18 views

Or Assignment

The solver found an optimal solution that maximized total profit of 1980. It allocated production of 20 units of good X1 and 100 units of good X2, fully utilizing the cotton and dacron constraints. The sensitivity report and limits report provided additional details on optimal solution and ranges of objective function with parameter changes.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 33

Microsoft Excel 16.

0 Answer Report
Worksheet: [OR_assignment.xlsx]Sheet1
Report Created: 7/4/2022 1:02:48 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.032 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%, Solve Without Integer Constraints, Assume

Objective Cell (Max)


Cell Name Original Value Final Value
$D$7 Total Profit MaxZ 0 1980

Variable Cells
Cell Name Original Value Final Value Integer
$B$2 qty X1 0 20 Contin
$C$2 qty X2 0 100 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$D$11 cotton Used 24000 $D$11<=$F$11 Binding 0
$D$12 dacron Used 26000 $D$12<=$F$12 Binding 0
$D$13 linen Used 16000 $D$13<=$F$13 Not Binding 6000
eger Constraints, Assume NonNegative
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [OR_assignment.xlsx]Sheet1
Report Created: 7/4/2022 1:02:48 PM

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$B$2 qty X1 20 0 19.5 4.35 3.6
$C$2 qty X2 100 0 15.9 3.6 2.9

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$D$11 cotton Used 24000 0.0435 24000 2000 4000
$D$12 dacron Used 26000 0.036 26000 3000 2000
$D$13 linen Used 16000 0 22000 1E+030 6000
Microsoft Excel 16.0 Limits Report
Worksheet: [OR_assignment.xlsx]Sheet1
Report Created: 7/4/2022 1:02:48 PM

Objective
Cell Name Value
$D$7 Total Profit MaxZ 1980

Variable Lower Objective Upper Objective


Cell Name Value Limit Result Limit Result
$B$2 qty X1 20 0 1590 20 1980
$C$2 qty X2 100 0 390 100 1980
X1 X2
qty 20 100

profit/unit 19.5 15.9 MaxZ

Total Profit 390 1590 1980

Constraints Used Available

cotton 200 200 24000 <= 24000


dacron 300 200 26000 <= 26000
linen 300 100 16000 <= 22000
X1(TV PrimX2(Prime t (Radio) X4(Magazine)
qty 0 0 0 0

customer reach/Ad Max Z

Constraint
Used Available
Total budget 40000 75000 30000 15000 0 <= 800000
TV Budget 40000 75000 0 0 <= 500000
Max Radio Ad 0 0 1 0 <= 10
Max Magazine Ads 0 0 0 1 <=
Microsoft Excel 16.0 Answer Report
Worksheet: [OR_assignment.xlsx]Sheet2
Report Created: 7/13/2022 2:15:17 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.031 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%, Solve Without Integer Constraints, Assume

Objective Cell (Min)


Cell Name Original Value Final Value
$E$5 Profit Min Z 0 1980

Variable Cells
Cell Name Original Value Final Value Integer
$B$3 Quantity Y1 0 0.0435 Contin
$C$3 Quantity Y2 0 0.036 Contin
$D$3 Quantity Y3 0 0 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$E$8 Used 19.5 $E$8>=$G$8 Binding 0
$E$9 Used 15.9 $E$9>=$G$9 Binding 0
Integer Constraints, Assume NonNegative
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [OR_assignment.xlsx]Sheet2
Report Created: 7/13/2022 2:15:17 PM

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$B$3 Quantity Y1 0.0435 0 24000 2000 4000
$C$3 Quantity Y2 0.036 0 26000 3000 2000
$D$3 Quantity Y3 0 6000 22000 1E+030 6000

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$E$8 Used 19.5 20 19.5 4.35 3.6
$E$9 Used 15.9 100 15.9 3.6 2.9
Microsoft Excel 16.0 Limits Report
Worksheet: [OR_assignment.xlsx]Sheet2
Report Created: 7/13/2022 2:15:17 PM

Objective
Cell Name Value
$E$5 Profit Min Z 1980

Variable Lower Objective Upper Objective


Cell Name Value Limit Result Limit Result
$B$3 Quantity Y1 0.0435 0.0435 1980 #N/A #N/A
$C$3 Quantity Y2 0.036 0.036 1980 #N/A #N/A
$D$3 Quantity Y3 0 0 1980 #N/A #N/A
Y1 Y2 Y3

Quantity 0.0435 0.036 0


24000 26000 22000 Min Z
Profit 1044 936 0 1980

Constraints Used Available


200 300 300 19.5 >= 19.5
200 200 100 15.9 >= 15.9
Microsoft Excel 16.0 Answer Report
Worksheet: [OR_assignment.xlsx]Sheet6
Report Created: 7/13/2022 2:46:47 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.016 Seconds.
Iterations: 2 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%, Solve Without Integer Constraints, Assume

Objective Cell (Max)


Cell Name Original Value Final Value
$D$7 Total Profit MaxZ 0 330

Variable Cells
Cell Name Original Value Final Value Integer
$B$3 Qty Chair 0 3 Contin
$C$3 Qty TABLE 0 9 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$D$12 M1 Used 36 $D$12<=$F$12 Binding 0
$D$13 M2 Used 33 $D$13<=$F$13 Not Binding 17
$D$14 M3 Used 60 $D$14<=$F$14 Binding 0
eger Constraints, Assume NonNegative
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [OR_assignment.xlsx]Sheet6
Report Created: 7/13/2022 2:46:47 PM

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$B$3 Qty Chair 3 0 20 10 10
$C$3 Qty TABLE 9 0 30 30 10

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$D$12 M1 Used 36 5 36 7.846153846 6
$D$13 M2 Used 33 0 50 1E+030 17
$D$14 M3 Used 60 2.5 60 12 22.66666667
Microsoft Excel 16.0 Limits Report
Worksheet: [OR_assignment.xlsx]Sheet6
Report Created: 7/13/2022 2:46:47 PM

Objective
Cell Name Value
$D$7 Total Profit MaxZ 330

Variable Lower Objective Upper Objective


Cell Name Value Limit Result Limit Result
$B$3 Qty Chair 3 0 270 3 330
$C$3 Qty TABLE 9 0 60 9 330
Chair TABLE

Qty 3 9

Profit/unit 20 30 MaxZ

Total Profit 60 270 330

Constraints Used Available

M1 3 3 36 <= 36
M2 5 2 33 <= 50
M3 2 6 60 <= 60
Microsoft Excel 16.0 Answer Report
Worksheet: [OR_assignment.xlsx]Variable constraint MAX
Report Created: 7/25/2022 6:15:23 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.031 Seconds.
Iterations: 2 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Max)


Cell Name Original Value Final Value
$F$6 Contribution Max z 0 1880

Variable Cells
Cell Name Original Value Final Value Integer
$C$3 Qty X1 0 30 Contin
$D$3 Qty X2 0 50 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$F$10 Used 740 $F$10<=$H$10 Not Binding 60
$F$11 Used 600 $F$11<=$H$11 Binding 0
$F$12 Used 720 $F$12<=$H$12 Binding 0
Microsoft Excel 16.0 Sensitivity Report
Worksheet: [OR_assignment.xlsx]Variable constraint MAX
Report Created: 7/25/2022 6:15:23 PM

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$C$3 Qty X1 30 0 17 28.66666667 7.866666667
$D$3 Qty X2 50 0 27.4 23.6 17.2

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$F$10 Used 740 0 800 1E+030 60
$F$11 Used 600 0.983333333 600 102.8571429 240
$F$12 Used 720 1.791666667 720 110.7692308 480
Microsoft Excel 16.0 Limits Report
Worksheet: [OR_assignment.xlsx]Variable constraint MAX
Report Created: 7/25/2022 6:15:23 PM

Objective
Cell Name Value
$F$6 Contribution Max z 1880

Variable Lower Objective Upper Objective


Cell Name Value Limit Result Limit Result
$C$3 Qty X1 30 0 1370 30 1880
$D$3 Qty X2 50 0 510 50 1880
X1 X2

Qty 30 50

wage/hour 17 27.4 Max z


Contribution 510 1370 1880

Constraints Used Available

8 10 740 <= 800


10 6 600 <= 600
4 12 720 <= 720
Microsoft Excel 16.0 Answer Report
Worksheet: [OR_assignment.xlsx]Transshipment
Report Created: 8/1/2022 4:34:55 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.031 Seconds.
Iterations: 7 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance %, Assume NonNegative

Objective Cell (Min)


Cell Name Original Value Final Value
$J$8 <= Min cost 2750 4450

Variable Cells
Cell Name Original Value Final Value Integer
$C$8 XA 0 100 Integer
$D$8 XB 150 0 Integer
$E$8 XC 50 100 Integer
$C$9 YA 100 0 Integer
$D$9 YB 0 150 Integer
$E$9 YC 0 150 Integer

Constraints
Cell Name Cell Value Formula Status Slack
$C$11 Required A 100 $C$11>=$C$14 Binding 0
$D$11 Required B 150 $D$11>=$D$14 Binding 0
$E$11 Required C 250 $E$11>=$E$14 Binding 0
$F$8 X Used 200 $F$8<=$H$8 Binding 0
$F$9 Y Used 300 $F$9<=$H$9 Binding 0
$C$8:$E$9=Integer
Cost/Unit A B C

X 7 8 9
Y 11 9 10

Allocated/Unit A B C Used Supply Min cost

X 100 0 100 200 <= 200 4450


Y 0 150 150 300 <= 300

Required 100 150 250


>= >= >=

Demand 100 150 250


Microsoft Excel 16.0 Answer Report
Worksheet: [OR_assignment.xlsx]Transhipment1
Report Created: 8/1/2022 4:49:51 PM
Result: Solver stopped at user's request.
Solver Engine
Engine: Simplex LP
Solution Time: 10.235 Seconds.
Iterations: 4 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling, Show Iteration Results
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Min)


Cell Name Original Value Final Value
$I$3 X Min Cost 0 5500

Variable Cells
Cell Name Original Value Final Value Integer
$C$12 XX 300 0 Integer
$D$12 XY 0 200 Integer
$E$12 XA 0 300 Integer
$F$12 XB 0 0 Integer
$G$12 XC 0 0 Integer
$C$13 YX 0 300 Integer
$D$13 YY 0 0 Integer
$E$13 YA 0 0 Integer
$F$13 YB 0 0 Integer
$G$13 YC 0 0 Integer
$C$14 AX 0 0 Integer
$D$14 AY 0 0 Integer
$E$14 AA 0 0 Integer
$F$14 AB 0 0 Integer
$G$14 AC 0 0 Integer
$C$15 BX 0 0 Integer
$D$15 BY 0 0 Integer
$E$15 BA 0 0 Integer
$F$15 BB 0 0 Integer
$G$15 BC 0 0 Integer
$C$16 CX 0 0 Integer
$D$16 CY 0 0 Integer
$E$16 CA 0 0 Integer
$F$16 CB 0 0 Integer
$G$16 CC 0 0 Integer
Constraints
Cell Name Cell Value Formula Status Slack
$C$18 Required X 300 $C$18>=$C$20 Binding 0
$D$18 Required Y 200 $D$18>=$D$20 Binding 0
$E$18 Required A 300 $E$18>=$E$20 Binding 0
$F$18 Required B 0 $F$18>=$F$20 Binding 0
$G$18 Required C 0 $G$18>=$G$20 Binding 0
$I$12 X Used 500 $I$12<=$K$12 Binding 0
$I$13 Y Used 300 $I$13<=$K$13 Not Binding 200
$I$14 A Used 0 $I$14<=$K$14 Not Binding 400
$I$15 B Used 0 $I$15<=$K$15 Not Binding 350
$I$16 C Used 0 $I$16<=$K$16 Not Binding 250
$C$12:$G$16=Integer
ation Results
cost/unit X Y A B C Min Cost

X 0 8 7 8 9 4350
Y 6 0 11 9 10
A 7 2 0 5 1
B 1 5 1 0 4
C 8 9 7 8 0

allocated/unit X Y A B C Used

X 300 0 200 0 0 500 <=


Y 0 200 0 150 150 500 <=
A 0 0 300 0 100 400 <=
B 0 0 0 350 0 350 <=
C 0 0 0 0 250 250 <=

Required 300 200 500 500 500


>= >= >= >= >=
Demand 300 200 500 500 500
Supply

500
500
400
350
250
Time M1 M2 M3 Min time
J1 3 10 12 18
J2 15 8 9
J3 2 16 7

Allocation M1 M2 M3 Used Available


J1 1 0 0 1= 1
J2 0 1 0 1= 1
J3 0 0 1 1= 1
Used 1 1 1
= = =
Required 1 1 1
Time M1 M2 M3 M4 max
J1 11 11 9 9 55
J2 13 16 11 10
J3 12 17 13 8
J4 16 14 16 12

Allocation M1 M2 M3 M4 Used Available


J1 0 0 0 1 1= 1
J2 1 0 0 0 1= 1
J3 0 1 0 0 1= 1
J4 0 0 1 0 1= 1
Used 1 1 1 1
= = = =
1 1 1 1
Time M1 M2 M3 M4 Min time
J1 3 10 12 0 14
J2 15 8 9 0
J3 2 16 7 0
J4 11 9 4 0

Allocation M1 M2 M3 M4 Used Available


J1 0 0 0 1 1= 1
J2 0 1 0 0 1= 1
J3 1 0 0 0 1= 1
J4 0 0 1 0 1= 1
Used 1 1 1 1
= = = =
Required 1 1 1 1
Time P1 P2 P3 P4 P5 Maxprofit
M1 30 10 75 30 20 240
M2 20 60 65 30 15
M3 40 50 55 25 30
M4 45 50 75 35 15
M5 40 45 55 25 20

Time P1 P2 P3 P4 P5 Used
M1 0 0 1 0 0 1= 1
M2 0 1 0 0 0 1= 1
M3 0 0 0 0 1 1= 1
M4 0 0 0 1 0 1= 1
M5 1 0 0 0 0 1= 1

Used 1 1 1 1 1
= = = = =
1 1 1 1 1
X1 X2 X3 X4 X5 X6 X7

X1 X2 X3 X4 X5 X6 X7
Qty 0 0 0 0 0 0 0 Used
Constraint 1 1 0 1 0 0 0 1 0
Constraint 2 0 1 1 0 1 0 0 0
Constraint 3 1 0 0 1 1 0 0 0
Constraint 4 1 1 0 0 0 1 0 0
Constraint 5 0 0 1 0 0 1 1 0
Constraint 6 1 1 0 1 0 0 0 1
Constraint 7 0 0 0 1 1 0 1 1
Constraint 8 0 1 0 0 0 1 1 0
Constraint 9 1 0 0 0 1 0 1 0
Constraint 10 1 0 0 1 0 1 0 0

Cost for nodes 125 85 70 60 90 100 110


Total cost 0 0 0 0 0 0 0
RHS

>= 1
>= 1
>= 1
>= 1
>= 1
>= 1
>= 1
>= 1
>= 1
>= 1

MinZ
0

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy