0% found this document useful (0 votes)
30 views11 pages

Three Problems

The document contains 3 Microsoft Excel answer reports that show the solutions found by the solver tool for 3 different optimization problems, with the reports detailing the objective values, decision variables, constraints, and other solver output for linear programming models addressing production scheduling, hotel room allocation, and marketing campaign budgeting.

Uploaded by

Petal Remon
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)
30 views11 pages

Three Problems

The document contains 3 Microsoft Excel answer reports that show the solutions found by the solver tool for 3 different optimization problems, with the reports detailing the objective values, decision variables, constraints, and other solver output for linear programming models addressing production scheduling, hotel room allocation, and marketing campaign budgeting.

Uploaded by

Petal Remon
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/ 11

Microsoft Excel 16.

0 Answer Report
Worksheet: [ThreeProblems.xlsx]Sheet1
Report Created: 2/26/2020 5:01:13 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.031 Seconds.
Iterations: 5 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
$G$8 MAX Z = 23 10800

Variable Cells
Cell Name Original Value Final Value Integer
$C$6 Comp. #1 1 600 Contin
$D$6 Comp. #2 1 700 Contin
$E$6 Comp. #3 1 200 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$G$10 Time (Shaper) 7200 $G$10<=$I$10 Binding 0
$G$11 Time (Grinder) 6300 $G$11<=$I$11 Not Binding 300
$G$12 Max (C3) 200 $G$12<=$I$12 Binding 0
$G$13 Max (C1) 600 $G$13<=$I$13 Not Binding 400
$G$14 Max (C2) 700 $G$14<=$I$14 Not Binding 300
$G$15 Min C1 Order 600 $G$15>=$I$15 Binding 0
NonNegative
Vollmer Manufacturing

Decision Variables:
Comp. #1 Comp. #2 Comp. #3
600 700 200

MAX Z = 8 6 9 10800 $$ Profit


s.t.
Time (Shaper) 6 4 4 7200 <= 7200
Time (Grinder) 4 5 2 6300 <= 6600
Max (C3) 1 200 <= 200
Max (C1) 1 600 <= 1000
Max (C2) 1 700 <= 1000
Min C1 Order 1 600 >= 600
Microsoft Excel 16.0 Answer Report
Worksheet: [ThreeProblems.xlsx]Sheet2
Report Created: 2/26/2020 5:05:25 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.015 Seconds.
Iterations: 5 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
$I$8 MAZ Z = 155 7100

Variable Cells
Cell Name Original Value Final Value Integer
$C$6 S1 1 100 Contin
$D$6 S2 1 10 Contin
$E$6 D1 1 0 Contin
$F$6 D2 1 50 Contin
$G$6 B2 1 60 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$I$10 Demand for SS 110 $I$10<=$K$10 Not Binding 20
$I$11 Demand for Deluxe 50 $I$11<=$K$11 Binding 0
$I$12 Demand for Biz 60 $I$12<=$K$12 Binding 0
$I$13 Type I Rooms 100 $I$13<=$K$13 Binding 0
$I$14 Type II Rooms 120 $I$14<=$K$14 Binding 0
Round Tree Manor

Decision Variables:
S1 S2 D1 D2 B2
100 10 0 50 60

MAZ Z = 30 20 35 30 40 7100 $$ Profit/Night


s.t.
Demand for SS 1 1 110 <=
Demand for Deluxe 1 1 50 <=
Demand for Biz 1 60 <=
Type I Rooms 1 1 100 <=
Type II Rooms 1 1 1 120 <=
$$ Profit/Night

130
50
60
100
120
Microsoft Excel 16.0 Answer Report
Worksheet: [ThreeProblems.xlsx]Sheet3
Report Created: 2/26/2020 5:07:03 PM
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 0.015 Seconds.
Iterations: 4 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
$G$8 MAX Z = 158000 1052000

Variable Cells
Cell Name Original Value Final Value Integer
$C$6 TV Ads 1 4 Contin
$D$6 Radio Ads 1 14 Contin
$E$6 Web Ads 1 10 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$G$10 Budget 18200 $G$10<=$I$10 Binding 0
$G$11 Max TV 4 $G$11<=$I$11 Not Binding 6
$G$12 Max Radio 14 $G$12<=$I$12 Not Binding 6
$G$13 Max Web 10 $G$13<=$I$13 Binding 0
$G$14 Max 50% Radio 0 $G$14<=$I$14 Binding 0
$G$15 Min 10% TV 1.2 $G$15>=$I$15 Not Binding 1.2
onNegative
Westchester Chamber of Commerce

Decision Variables:
TV Ads Radio Ads Web Ads
4 14 10

MAX Z = 100,000 18,000 40,000 1052000 Views


s.t.
Budget 2000 300 600 18200 <= 18200
Max TV 1 4 <= 10
Max Radio 1 14 <= 20
Max Web 1 10 <= 10
Max 50% Radio -0.5 0.5 -0.5 0 <= 0
Min 10% TV 0.9 -0.1 -0.1 1.2 >= 0
Round Tree Manor

Decision Variables
Class SS DL Biz
Type I 100 0 0 100 Type Is <=
Type II 10 50 60 120 Type Iis <=

Class totals 110 50 60


<= <= <=
130 50 60

Profit / Nig 30 35
20 30 40

MAX Z = 7100
100
120

You might also like