[go: up one dir, main page]
Scribd
Upload
134 views9 pages

Operations Research

This document defines a problem to maximize profit from producing two types of web servers (X1 and X2) subject to assembly time, inspection time and storage space constraints. The optimal solution is to produce 9 units of type A servers and 4 units of type B servers, yielding a maximum total profit of $740.

Uploaded by

rinosi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
134 views9 pages

Operations Research

This document defines a problem to maximize profit from producing two types of web servers (X1 and X2) subject to assembly time, inspection time and storage space constraints. The optimal solution is to produce 9 units of type A servers and 4 units of type B servers, yielding a maximum total profit of $740.

Uploaded by

rinosi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
You are on page 1/ 9

Web Server Problem

Definition of decision variables:

X1 = Number of type-A server to produce X2 = Number of type-B server to produce Maximize


Profit Constraints: Assembly time Inspection time Storage space Model 1 60 Model 2 50 Type <= <= <=

NOTES:

Evaluation for (z) = RHS 100 22 39 Units hours hours Cu. ft.

450

4 2 3

10 1 3

X1 -1 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

X2 Assembly Time Inspection Time Storage Space function Obj. 10.4 24 14 10.2 10 22 13 9 9.6 20 12 7.8 9.2 18 11 6.6 8.8 16 10 5.4 8.4 14 9 4.2 8 12 8 3 7.6 10 7 1.8 7.2 8 6 0.6 6.8 6 5 -0.6 6.4 4 4 -1.8 6 2 3 -3 5.6 0 2 -4.2 5.2 -2 1 -5.4 4.8 -4 0 -6.6 4.4 -6 -1 -7.8 4 -8 -2 -9 3.6 -10 -3 -10.2 3.2 -12 -4 -11.4 2.8 -14 -5 -12.6 2.4 -16 -6 -13.8 2 -18 -7 -15

Server Problem: Graphical Solution


24

Assembly Time Inspection Time Storage Space Obj. function

f server model 2 to produce (X2)

22 20 18 16 14

Qty. of server model 2 to produce (X2)

14 12 10 8 6 4 2 0 -2 -2 0 2 4 6 8 10 12 14 16 18 20 22

Qty. of server model 1 to produce (X1)

Solution: Extreme point approach:

Maximize
Profit Corner points 1 2 3 4 5

Model 1 60

Model 2 50 Profit 0 660 740 700 500

0 11 9 5 0

0 0 4 8 10

Assembly Time

Inspection Time

Storage Space

Obj. function

22

24

Objective function: Maximize 60 X1 + 50 X2 Subject to: 4 X1 + 10 X2 <= 100 hours 2 X1 + 1 X2 <= 22 hours 3 X1 + 3 X2 <= 39 cu. ft. X1 & X2 >= 0 Assembly time constraint: 4 X1 + 10 X2 = 100 10 X2 = 100 - 4 X1 X2 = (100 - 4 X1) / 10

(profit) (Assembly time) (Inspection time) (Storage space)

Inspection time constraints: 2 X1 + 1 X2 = 22 X2 = (22 - 2 X1) / 1 Storage Space Constraint: 3 X1 + 3 X2 = 39 X2 = (39 - 3*X1)/3 Objective function: 60 X1 + 50 X2 = 100 X2 = (100 - 60 X1) / 50

Microsoft Excel 12.0 Answer Report Worksheet: [2 Server Problem.xls]Server-Solver Report Created: 10/6/2010 3:39:20 PM

Target Cell (Max) Cell Name $D$11 Total Profit

Original Value 0

Final Value 740

Adjustable Cells Cell Name $B$8 TypeA $C$8 TypeB

Original Value 0 0

Final Value 9 4

Constraints Cell Name $D$14 Assembly time LHS $D$15 Inspection time LHS $D$16 Storage Space LHS

Cell Value

Formula Status Slack 76 $D$14<=$F$14 Not Binding 24 22 $D$15<=$F$15 Binding 0 39 $D$16<=$F$16 Binding 0

Microsoft Excel 12.0 Sensitivity Report Worksheet: [2 Server Problem.xls]Server-Solver Report Created: 10/6/2010 3:39:20 PM

Adjustable Cells Cell Name $B$8 TypeA $C$8 TypeB Constraints Cell Name $D$14 Assembly time LHS $D$15 Inspection time LHS $D$16 Storage Space LHS Final Shadow Constraint Allowable Allowable Value Price R.H. Side Increase Decrease 76 0 100 1E+30 24 22 10 22 4 4 39 13.33333333 39 4.5 6 Final Value 9 4 Reduced Cost Objective Allowable Allowable Coefficient Increase Decrease 0 60 40 10 0 50 10 20

Microsoft Excel 12.0 Limits Report Worksheet: [2 Server Problem.xls]Limits Report 1 Report Created: 10/6/2010 3:39:21 PM

Target Cell Name $D$11 Total Profit

Value 740

Adjustable Cell Name Value $B$8 TypeA 9 $C$8 TypeB 4

Lower Target Limit Result 0 200 0 540

Upper Target Limit Result 9 740 4 740

Web Server Problem


Definition of decision variables: x1 = number of type A server to produce x2 = number of type B server to produce Decisions Variables: Product Objective Function: 60 Constraints: Assembly time Inspection time Storage Space 50 X1 9 X2 4 Total Profit 740 LHS 4 2 3 10 1 3 76 22 39 Type <= <= <= RHS Units 100 hours 22 hours 39 Cu. ft.

You might also like