Spreadsheet Modeling and Decision Analysis A Practical Introduction to Business Analytics 8th Edition Ragsdale Test Bank instant download all chapter

Spreadsheet Modeling and Decision
Analysis A Practical Introduction to

Business Analytics 8th Edition
Ragsdale Test Bank
Go to download the full and correct content document:
https://testbankdeal.com/product/spreadsheet-modeling-and-decision-analysis-a-prac
tical-introduction-to-business-analytics-8th-edition-ragsdale-test-bank/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...
Spreadsheet Modeling and Decision Analysis A Practical

Introduction to Business Analytics 8th Edition Ragsdale
Solutions Manual
https://testbankdeal.com/product/spreadsheet-modeling-and-
decision-analysis-a-practical-introduction-to-business-
analytics-8th-edition-ragsdale-solutions-manual/

Introduction to Business Analytics 7th Edition Cliff
Ragsdale Test Bank
analytics-7th-edition-cliff-ragsdale-test-bank/

Introduction to Business Analytics 7th Edition Cliff
Ragsdale Solutions Manual
analytics-7th-edition-cliff-ragsdale-solutions-manual/
Spreadsheet Modeling and Decision Analysis 6th Edition

Ragsdale Test Bank
decision-analysis-6th-edition-ragsdale-test-bank/
Managerial Decision Modeling International 6th Edition
Ragsdale Test Bank
https://testbankdeal.com/product/managerial-decision-modeling-
international-6th-edition-ragsdale-test-bank/
Business Analytics Data Analysis and Decision Making

6th Edition Albright Test Bank
https://testbankdeal.com/product/business-analytics-data-
analysis-and-decision-making-6th-edition-albright-test-bank/
Business Analytics Data Analysis And Decision Making

5th Edition Albright Test Bank
analysis-and-decision-making-5th-edition-albright-test-bank/

6th Edition Albright Solutions Manual
analysis-and-decision-making-6th-edition-albright-solutions-
manual/

5th Edition Albright Solutions Manual
analysis-and-decision-making-5th-edition-albright-solutions-
manual/
Name: Class: Date:
Chapter 07
1. A constraint which cannot be violated is called a
a. binding constraint.
b. hard constraint.
c. definite constraint.
d. required constraint.
ANSWER: b
2. A constraint which represents a target value for a problem is called a

a. fuzzy constraint.
b. vague constraint.
c. preference constraint
d. soft constraint
ANSWER: d
3. Goal programming differs from linear programming or integer linear programming is that
a. goal programming provides for multiple objectives.
b. goal programming excludes hard constraints.
c. with goal programming we iterate until an acceptable solution is obtained.
d. goal programming requires fewer variables.
ANSWER: c
4. Decision-making problems which can be stated as a collection of desired objectives are known as what type of
problem?
a. A non-linear programming problem.
b. An unconstrained programming problem.
c. A goal programming problem.
d. An integer programming problem.
ANSWER: c
5. Which of the following is true regarding goal programming?

a. The objective function is not useful when comparing goal programming solutions.
b. We can place upper bounds on any of the deviation variables.
c. A preemptive goal program involves deviations with arbitrarily large weights.
d. All of these are true.
ANSWER: d
6. The RHS value of a goal constraint is referred to as the

a. target value.
b. constraint value.
c. objective value.
d. desired value.
ANSWER: a
7. The di+, di− variables are referred to as

Copyright Cengage Learning. Powered by Cognero. Page 1
Name: Class: Date:
Chapter 07
a. objective variables.
b. goal variables.
c. target variables.
d. deviational variables.
ANSWER: d
8. Which of the following are true regarding weights assigned to deviational variables?
a. Larger weights are assigned to undesirable deviations from the respective goals.
b. The weights assigned must sum to one.
c. The weight assigned to the deviation under a particular goal must be the same as the weight assigned to the
deviation above that particular goal.
d. All weights must be nonzero.
ANSWER: a
9. The di+ variable indicates the amount by which each goal's target value is
a. missed.
b. underachieved.
c. overachieved.
d. overstated.
ANSWER: c
10. Suppose that X1 equals 4. What are the values for d1+ and d1− in the following constraint?
X1 + d1−− d1+ = 8
a. d1− = 4, d1+ = 0
b. d1− = 0, d1+ = 4
c. d1− = 4, d1+ = 4
d. d1− = 8, d1+ = 0
ANSWER: a
11. Suppose that the first goal in a GP problem is to make 3 X1 + 4 X2 approximately equal to 36. Using the deviational
variables d1− and d1+, what constraint can be used to express this goal?
a. 3 X1 + 4 X2 + d1− − d1+ ≤ 36
b. 3 X1 + 4 X2 − d1− − d1+ = 36
c. 3 X1 + 4 X2 + d1− + d1+ = 36
d. 3 X1 + 4 X2 + d1− − d1+ = 36
ANSWER: d
12. Suppose that the first goal in a GP problem is to make 3 X1 + 4 X2 approximately equal to 36. Using the deviational
variables d1− and d1+, the following constraint can be used to express this goal.

Name: Class: Date:
Chapter 07
3 X1 + 4 X2 + d1− − d1+ = 36
If we obtain a solution where X1 = 6 and X2 = 2, what values do the deviational variables assume?
a. d1− = 0, d1+ = 10
b. d1− = 10, d1+ = 0
c. d1− = 5, d1+ = 5
d. d1− = 6, d1+ = 0
ANSWER: b
13. What is the soft constraint form of the following hard constraint?
3X1 + 2 X2 ≤ 10
a. 3X1 + 2 X2 + d1− − d1+ = 10

b. 3X1 + 2 X2 + d1− + d1+ = 10
c. 3X1 + 2 X2 − d1− − d1+ ≤ 10
d. 3X1 + 2 X2 + d1− − d1+ ≥ 10
ANSWER: a
14. Which of the following formulas is a deviation-minimizing objective function for a goal programming problem?
a.
b.
c.
d.
ANSWER: d
15. What is the meaning of the ti term in this objective function for a goal programming problem?
a. The time required for each decision variable.

b. The percent of goal i met.
c. The coefficient for the ith decision variable
d. The target value for goal i.
ANSWER: d
16. What weight would be assigned to a neutral deviational variable?

a. 0
b. 1
c. 10
d. 100
Name: Class: Date:
Chapter 07
ANSWER: a
17. Which of the following is false regarding a goal constraint?

a. A goal constraint allows us to determine how close a given solution comes to achieving a goal.
b. A goal constraint will always contain two deviational variables.
c. Deviation variables are non-negative.
d. If two deviation variables are used in a constraint at least one will have a value of zero.
ANSWER: b
Exhibit 7.1
The following questions are based on the problem below.
A company wants to advertise on TV and radio. The company wants to produce about 6 TV ads and 12 radio ads. Each
TV ad costs $20,000 and is viewed by 10 million people. Radio ads cost $10,000 and are heard by 7 million people. The
company wants to reach about 140 million people, and spend about $200,000 for all the ads. The problem has been set up
in the following Excel spreadsheet.
A B C D E
1 Problem Data TV Radio
2 Cost 20 10
3 Coverage 10 7
4
5 Goal Constraints TV Radio Cost Coverage
6 Actual Amount 0 0
7 +Under 0 0 0 0
8 − Over 0 0 0 0
9 = Goal 0 0 0 0
10 Target Value 6 12 200 140
11
12 Percentage Deviation:
13 Under 1 1 1 1
14 Over 0 0 0 0
15
16 Weights
17 Under
18 Over
19
20 Objective 0
18. Refer to Exhibit 7.1. What formula goes in cell D6?

a. =SUMPRODUCT(B2:B3,B6:B7)
b. =B2*C2+B6*C6
c. =SUMPRODUCT(B2:C2,B10:C10)
d. =SUMPRODUCT(B2:C2,B6:C6)
ANSWER: d
19. Refer to Exhibit 7.1. What formula goes in cell B9?

Name: Class: Date:
Chapter 07
a. =SUM(B6:B8)
b. =B6+B7-B8
c. =B6-B7+B8
d. =B10-B8
ANSWER: b
20. Refer to Exhibit 7.1. Which of the following is a constraint specified to Analytic Solver Platform for this model?
a. $B$9:$E$9=$B$6:$E$6
b. $B$9:$E$9<$B$10:$E$10
c. $B$9:$E$9=$B$10:$E$10
d. $B$9:$E$9>$B$10:$E$10
ANSWER: c
21. Refer to Exhibit 7.1. Which cells are the variable cells in this model?
a. $B$6:$C$6, $B$7:$E$8
b. $B$6:$C$6
c. $B$9:$E$9
d. $B$6:$E$8
ANSWER: a
22. Refer to Exhibit 7.1. Which cell(s) is(are) the objective cell(s) in this model?
a. $B$20
b. $D$6
c. $E$6
d. $B$13:$E$14, $B$9:$E$9
ANSWER: a
23. Refer to Exhibit 7.1. If the company is very concerned about going over the $200,000 budget, which cell value should
change and how should it change?
a. D13, increase
b. D13, decrease
c. D14, increase
d. D14, decrease
ANSWER: c
24. A manager wants to ensure that he does not exceed his budget by more than $1000 in a goal programming problem. If
the budget constraint is the third constraint in the goal programming problem which of the following formulas will best
ensure that the manager's objective is met?
a. MIN d3+
b. d3− ≥ 1000
c. d3+ = 1000
d. d3+ ≤ 1000
ANSWER: d
Name: Class: Date:
Chapter 07
25. An optimization technique useful for solving problems with more than one objective function is
a. dual programming.
b. sensitivity analysis.
c. multi-objective linear programming.
d. goal programming.
ANSWER: c
26. The MINIMAX objective

a. yields the smallest possible deviations.
b. minimizes the maximum deviation from any goal.
c. chooses the deviation which has the largest value.
d. maximizes the minimum value of goal attainment.
ANSWER: b
27. The primary benefit of a MINIMAX objective function is

a. it yields any feasible solution by changing the weights.
b. it is limited to all corner points.
c. it yields a larger variety of solutions than generally available using an LP method.
d. it makes many of the deviational variables equal to zero.
ANSWER: c
28. The decision maker has expressed concern with Goal 1, budget, achievement. He indicated that future candidate
solutions should stay under budget. How can you modify your goal programming model to accommodate this change?
a. Make budget a hard constraint in the model.
b. Give d1+ an extremely large weight in the objective function.
c. Remove d1+ from the goal constraint.
d. All of these.
ANSWER: d
29. MINIMAX solutions to multi-objective linear programming (MOLP) problems are

a. dually optimal.
b. Pareto optimal.
c. suboptimal.
d. maximally optimal.
ANSWER: b
30. If no other feasible solution to a multi-objective linear programming (MOLP) problem allows an increase in any
objective without decreasing at least one other objective, the solution is said to be
a. dually optimal.
b. Pareto optimal.
c. suboptimal.
d. maximally optimal.
ANSWER: b
Name: Class: Date:
Chapter 07
Exhibit 7.2
An investor has $150,000 to invest in investments A and B. Investment A requires a $10,000 minimum investment, pays a
return of 12% and has a risk factor of .50. Investment B requires a $15,000 minimum investment, pays a return of 10%
and has a risk factor of .20. The investor wants to maximize the return while minimizing the risk of the portfolio. The
following multi-objective linear programming (MOLP) has been solved in Excel.
A B C D
1 Problem data A B
2 Expected return 12% 10%
3 Risk rating 0.50 0.20
4
5 Variables A B Total
6 Amount invested 0 0 0
7 Minimum required $10,000 $15,000 $150,000
8
9 Objectives:
10 Average return 0
11 Average risk 0

a. =SUMPRODUCT(B2:C2,$B$6:$C$6)/$D$7
b. =B2*C2+B3*C3
c. =SUMPRODUCT(B3:C3,$B$6:$C$6)/$D$7
d. =SUMPRODUCT(B2:C2,$B$6:$C$6)
ANSWER: a
32. Refer to Exhibit 7.2. What Analytic Solver Platform constraint involves cells $B$6:$C$6?
a. $B$6:$C$6=$B$7:$C$7
b. $B$6:$C$6≥$B$7:$C$7
c. $B$6:$C$6≤$B$7:$C$7
d. $B$6:$C$6=$D$7
ANSWER: b

a. =SUMPRODUCT(B2:C2,$B$6:$C$6)/$D$7
b. =B2*C2+B3*C3
c. =SUMPRODUCT(B3:C3,$B$6:$C$6)/$D$7
d. =SUMPRODUCT(B3:C3,$B$6:$C$6)
ANSWER: c
34. Refer to Exhibit 7.2. Which cells are the changing cells in this model?
a. $B$6:$C$6, $B$10:$B$11

Name: Class: Date:
Chapter 07
b. $B$6:$C$6
c. $B$6:$D$6
d. $B$10:$B$11
ANSWER: b
35. Refer to Exhibit 7.2. Which cell(s) is(are) the target cells in this model?
a. $B$6:$C$6, $B$10:$B$11
b. $B$6:$C$6
c. $B$6:$D$6
d. $B$10:$B$11
ANSWER: d
Exhibit 7.3
An investor has $150,000 to invest in investments A and B. Investment A requires a $10,000 minimum investment, pays a
return of 12% and has a risk factor of .50. Investment B requires a $15,000 minimum investment, pays a return of 10%
and has a risk factor of .20. The investor wants to maximize the return while minimizing the risk of the portfolio. The
following minimax formulation of the problem has been solved in Excel.
A B C D E
1 Problem data A B
4
8
9 Weighted
10 Goals Actual Target Weights % Deviation
11 Average return 0 11.8% 1 0
12 Average risk 0 0.22 1 0
13
14 Objective: 0
36. Refer to Exhibit 7.3. What formula goes in cell E11?

a. =D11*(C11−B11)/C11
b. =(C11−B11)/C11
c. =D11*C11
d. =D11*(C11−B11)
ANSWER: a
37. Refer to Exhibit 7.3. Which value should the investor change, and in what direction, if he wants to reduce the risk of
the portfolio?
a. D11, increase
Name: Class: Date:
Chapter 07
b. D12, increase
c. C12, increase
d. D12, decrease
ANSWER: b
38. Goal programming solution feedback indicates that the d4+ level of 50 should not be exceeded in future solution
iterations. How should you modify your goal constraint
40 X1 + 20 X2 + d4− + d4+ = 300
to accommodate this requirement?

a. Increase the RHS value from 300 to 350.
b. Replace the constraint with 40 X1 + 20 X2 ≤ 350.
c. Do not modify the constraint, add a constraint d4+ ≤ 50.
d. Do not modify the constraint, add a constraint d4+ = 50.
ANSWER: c
39. Given the following goal constraints
5 X1 + 6 X2 + 7 X3 + d1− − d1+ = 87
3 X1 + X2 + 4 X3 + d2− − d2+ = 37
7 X1 + 3 X2 + 2 X3 + d3− − d3+ = 72
and solution (X1, X2, X3) = (7, 2, 5), what values do the deviational variables assume?
ANSWER: d1− = 5, d2+ = 6, d3− = 7, all others equal to zero.
40. Consider the following multi-objective linear programming problem (MOLP):
MAX: 3 X1 + 4 X2
MAX: 2 X1 + X2
Subject to: 6 X1 + 13 X2 ≤ 78
12 X1 + 9 X2 ≤ 108
8 X1 + 10 X2 ≤ 80
X1, X2 ≥ 0
Graph the feasible region for this problem and compute the value of each objective at each extreme point. What are the
solutions to each of the component LPs?

Name: Class: Date:
Chapter 07
ANSWER:
X1 X2 OBJ 1 OBJ 2
0 0 0 0
0 6 24 6
9 0 27 18
5.9 3.27 30.78 15.07
7.5 2 30.5 17
The solution to MAX 3 X1 + 4 X2 is (X1, X2) = (5.9, 3.27) and objective function value of 30.78.
The solution to MAX 2 X1 + X2 is (X1, X2) = (9, 0) and objective function value of 18.
41. A company makes 2 products A and B from 2 resources, labor and material. The products have the following resource
requirements and produce the accompanying profits. The available quantity of resources is also shown in the table.

Name: Class: Date:
Chapter 07
Product A B Available resources
Labor (hr/unit) 3 2 150
Material (ounces/unit) 1 2 200
Profit($/unit) 7 6
Management has developed the following set of goals
Goal 1: Produce approximately 40 units of product 1.

Goal 3: Achieve a profit over $400.
Goal 4: Consume less than 150 hours of labor
Goal 5: Consume less than 200 ounces of material
Formulate a goal programming model of this problem.
ANSWER: Let X1 = number of product 1
X2 = number of product 2
MIN: d1− + d1+ + d2 − + d2+ + d3− + d4+ + d5+

Subject to: X1 + d1− − d1+ = 40 product 1
X2 + d2− − d2+ = 70 product 2
7 X1 + 6 X2 + d3− − d3+ = 400 profit
3 X1 + 2 X2 + d4− − d4+ = 150 labor
1 X1 + 2 X2 + d5− − d5+ = 200 material
Xi, di−, di+ ≥ 0 for all i
42. A company makes 2 products A and B from 2 resources. The products have the following resource requirements and
produce the accompanying profits. The available quantity of resources is also shown in the table.
Product 1 2 Available resources

Profit($/unit) 7 6

Based on this GP formulation of the problem and the associated optimal integer solution what values should go in cells
B2:F16 of the following Excel spreadsheet?
Let X1 = number of product 1

MIN: d1− + d1+ + d2− + d2+ + d3− + d4+ + d5+

Name: Class: Date:
Chapter 07
Subject to: X1 + d 1 − − d 1 + = 40 product 1
X2 + d 2 − − d 2 + = 70 product 2
7 X1 + 6 X2 + d3− − d3+ = 400 profit
3 X1 + 2 X2 + d4− − d4+ = 150 labor
1 X1 + 2 X2 + d5− − d5+ = 200 material
(X1, X2) = (4, 69)
A B C D E F
1 Problem Data A B
2 Labor
3 Material
4 Profit
5 Goal Constraints A B Labor Material Profit
6 Actual Amount
7 + Under
8 − Over
9 = Goal
10 Target Value
11
12 Weights
13 Under
14 Over
15
16 Objective
ANSWER:
A B C D E F
1 Problem Data A B
2 Labor 3 2
3 Material 1 2
4 Profit 7 6
6 Actual Amount 4 69 150 142 442
7 + Under 36 1 0 58 0
8 − Over 0 0 0 0 42
9 = Goal 40 70 150 200 400
10 Target Value 40 70 150 200 400
11
12 Weights
13 Under 1 1 0 0 1
14 Over 1 1 1 1 0
15
16 Objective 37
43. A company makes 2 products A and B from 2 resources. The products have the following resource requirements and
Name: Class: Date:
Chapter 07
produce the accompanying profits. The available quantity of resources is also shown in the table.
Product 1 2 Available resources

Profit($/unit) 7 6

Based on the following GP formulation of the problem, and the associated optimal solution, what formulas should go in
cells D6:F6, B9:F9, and B16 of the following Excel spreadsheet? NOTE: Formulas are not required in all of these cells.
Let X1 = number of product 1

MIN: d1− + d1+ + d2− + d2+ + d3− + d4+ + d5+

Subject to: X1 + d1− − d1+ = 40 product 1
X2 + d2− − d2+ = 70 product 2
7 X1 + 6 X2 + d3− − d3+ = 400 profit
3 X1 + 2 X2 + d4− − d4+ = 150 labor
1 X1 + 2 X2 + d5− − d5+ = 200 material
(X1, X2) = (4, 69)
A B C D E F
1 Problem Data A B
2 Labor 3 2
3 Material 1 2
4 Profit 7 6
6 Actual Amount 4 69 150 142 442
7 + Under 36 1 0 58 0
8 − Over 0 0 0 0 42
9 = Goal 40 70 150 200 400
10 Target Value 40 70 150 200 400
11
12 Weights
13 Under 1 1 0 0 1
14 Over 1 1 1 1 0
15
16 Objective 37
Name: Class: Date:
Chapter 07
ANSWER: Cell Formula Copied to
D6 =SUMPRODUCT(B2:C2,$B$6:$C$6)
E6 =SUMPRODUCT(B3:C3, $B$6:$C$6)
F6 =SUMPRODUCT(B4:C4, $B$6:$C$6)
B9 =B6+B7-B8 C9:F9
B16 =SUMPRODUCT(B7:F8,B13:F14)
44. A company wants to purchase large and small delivery trucks. The company wants to purchase about 10 large and 15
small trucks. Each large truck costs $30,000 and has a 10 ton capacity. Each small truck costs $20,000 and has a 7 ton
capacity. The company wants to have about 200 tons of capacity and spend about $600,000.
ANSWER: Let X1 = number of large trucks
X2 = number of small trucks
MIN: d1− + d1+ + d2− + d2+ + d3− + d3+ + d4− − d4+

Subject to: X1 + d1− − d1+ = 10 large trucks
X2 + d2− − d2+ = 15 small trucks
10 X1 + 7 X2 + d3− − d3+ = 200 capacity
30 X1 + 20 X2 + d4− − d4+ = 600 cost
Based on the following formulation and associated integer solution, what values should go in cells B2:E16 of the
spreadsheet?
Let X1 = number of large trucks

MIN: d1− + d1+ + d2− + d2+ + d3− + d3+ + d4− − d4+

10 X1 + 7 X2 + d3− − d3+ = 200 capacity
30 X1 + 20 X2 + d4− − d4+ = 600 cost
Xi, di−, di+ ≥ 0 for all I
(X1, X2) = (10, 15)
A B C D E
1 Problem Data Large Small
2 Cost
3 Capacity

Name: Class: Date:
Chapter 07
4
5 Goal Constraints Large Small Cost Capacity
6 Actual Amount
7 + Under
8 − Over
9 = Goal
10 Target Value
11
12 Weights
13 Under
14 Over
15
16 Objective
ANSWER:
A B C D E
2 Cost 10 7
3 Capacity 30 20
4
6 Actual Amount 10 15 205 600
7 + Under 0 0 0 0
8 − Over 0 0 5 0
9 = Goal 10 15 200 600
10 Target Value 10 15 200 600
11
12 Weights
13 Under 1 1 1 1
14 Over 1 1 1 1
15
16 Objective 5
Based on the following goal programming formulation, associated solution, and spreadsheet model, what formulas should
go in cells D6:E6, B9:E9, and B16 of the spreadsheet?
Let X1 = number of large trucks

MIN: d1− + d1+ + d2− + d2+ + d3− + d3+ + d4− − d4+


Name: Class: Date:
Chapter 07
10 X1 + 7 X2 + d3− − d3+ = 200 capacity
30 X1 + 20 X2 + d4− − d4+ = 600 cost
Xi, di−, di+ ≥ 0 for all I
(X1, X2) = (10, 15)
A B C D E
2 Cost 10 7
3 Capacity 30 20
4
6 Actual Amount 10 15 205 600
7 + Under 0 0 0 0
8 − Over 0 0 5 0
9 = Goal 10 15 200 600
10 Target Value 10 15 200 600
11
12 Weights
13 Under 1 1 1 1
14 Over 1 1 1 1
15
16 Objective 5
D6 =SUMPRODUCT(B2:C2,$B$6:$C$6)
E6 =SUMPRODUCT(B3:C3, $B$6:$C$6)
B9 =B6+B7-B8 C9:E9
B16 =SUMPRODUCT(B13:E14,B7:E8)
47. A dietician wants to formulate a low cost, high calorie food product for a customer. The following information is
available about the 2 ingredients which can be combined to make the food. The customer wants 1000 pounds of the food
product and it should contain 250 pounds of Food 1 and 300 pounds of Food 2. The final cost of the blend should be about
$1.15 and contain about 2500 calories per pound. The percent of fat, protein, carbohydrate in each food is summarized
below with the target values for the goals. The dietician would prefer the food product be low in fat while also high in
protein and carbohydrates.
Food 1 Food 2 TARGET

Cost ($/pound) $1.00 $1.25 $1.15
Fat 15% 25% 300 pounds
Protein 35% 40% 370 pounds
Carbohydrate 50% 35% 400 pounds
Calories/pound 3000 2000 2500
Pounds of food 1 250
Pounds of food 2 300
Formulate the GP for this problem
ANSWER: Let X1 = pounds of food 1
X2 = pounds of food 2

Name: Class: Date:
Chapter 07
MIN: d1− + d1+ + d2+ + d3− + d4− + d5− + d5+ + d6− + d6+ + d7− + d7+
Subject to: 1 X1 + 1.25 X2 + d1− − d1+ = 1.15 cost
+
.15 X1 + .25 X2 + d2− − d2 = 300 fat
+
.35 X1 + .40 X2 + d3− − d3 = 370 protein
+
.50 X1 + .35 X2 + d4− − d4 = 400 carbohydrate
+
3000 X1 + 2000 X2 + d5− − d5 = 2500 calories
+
X1 + d6− − d6 = 250 food 1
+
X2 + d7− − d7 = 300 food 2
X1 + X2 = 1000 food product required
48. A dietitian wants to formulate a low cost, high calorie food product for a customer. The following information is
available about the 2 ingredients which can be combined to make the food. The customer wants 1000 pounds of the food
product and it must contain at least 250 pounds of Food 1 and 300 pounds of Food 2.
Food 1 Food 2 Requirements

Cost ($/pound) 1.00 1.25 Minimize
% Fat 15 25 Less than 30%
% Protein 35 40 At least 37%
% Carbohydrate 50 35 At least 40%
Calories/pound 3000 2000 Maximize
Minimum pounds of food 250 300
Formulate the MOLP for this problem.
ANSWER: Let X1 = pounds of food 1
X2 = pounds of food 2
MIN: 1 X1 + 1.25 X2 minimize cost or food product

MAX: 3000 X1 + 2000 X2 maximize the calories
Subject to: .15 X1 + .25 X2 ≤ 300 fat
.35 X1 + .40 X2 ≥ 370 protein
.50 X1 + .35 X2 ≥ 400 carbohydrate
X1 ≥ 250 food 1
X2 ≥ 300 food 2
X1 + X2 = 1000 total food product required
Xi ≥ 0 for all i
49. A company needs to supply customers in 3 cities from its 3 warehouses. The supplies, demands and shipping costs are
shown below.
Destination
Warehouse 1 2 3 Supply
1 34 60 36 400
2 70 40 50 300
Name: Class: Date:
Chapter 07
3 56 40 32 200
Demand 500 300 200
The company has identified the following goals:
The company would like to come as close as possible to satisfying its customers
Goal 1:
demand.
Goal 2: It would also like to ensure that the cost is approximately $290,000.
ANSWER: Let Xij = number of units shipped from warehouse i to destination j
MIN:
Subject to:
X11 + X12 + X13 + d 1 − − d 1 + = 400
X21 + X22 + X23 + d 2 − − d 2 + = 300
X31 + X32 + X33 + d 3 − − d 3 + = 200
X11 + X21 + X31 + d 4 − − d 4 + = 500
X12 + X22 + X32 + d 5 − − d 5 + = 300
X13 + X23 + X33 + d 6 − − d 6 + = 200
34 X11 + 60 X12 + 36 X13 + 70 X21 + 40 X22 + 50 X23 + 56 X31 + 40 X32 + 32 X33 +
d7− + d7+ = 290000
Xij, di−, di+ ≥ 0 for all i,j
50. An investor wants to invest $50,000 in two mutual funds, A and B. The rates of return, risks and minimum investment
requirements for each fund are:
Fund Rate of return Risk Minimum investment

A 12% 0.5 $20,000
B 9% 0.3 $10,000
Note that a low Risk rating means a less risky investment. The investor can invest to maximize the expected rate of return
or minimize risk. Any money beyond the minimum investment requirements can be invested in either fund.
Formulate the MOLP for this investor.

ANSWER: Let X1 = dollars in investment A
X2 = dollars in investment B
MAX: 0.12 X1/50000 + 0.09 X2/50000

MIN: 0.5 X1/50000 + 0.3 X2/50000
Subject to: X1 + X2 = 50000
X1 ≥ 20000
X2 ≥ 10000
Xi ≥ 0 for all i
Name: Class: Date:
Chapter 07

A 12% .5 $20,000
B 9% .3 $10,000
The following is the multi-objective linear programming (MOLP) formulation for this problem:
Let X1 = dollars in investment A

MAX: 0.12 X1/50000 + 0.09 X2/50000

MIN: 0.5 X1/50000 + 0.3 X2/50000
X1 ≥ 20000
X2 ≥ 10000
Xi ≥ 0 for all i
The solution for the second LP is (X1, X2) = (20,000, 30,000).
Based on this solution, what values should go in cells B2:D11 of the spreadsheet?
A B C D
1 Problem data A B
2 Expected return
3 Risk rating
4
6 Amount invested
7 Minimum required
8
9 Objectives:
10 Average return
11 Average risk
ANSWER:
A B C D
1 Problem data A B
4
6 Amount invested $20,000 $30,000 $50,000
Name: Class: Date:
Chapter 07
8
9 Objectives:
10 Average return 10.2%
11 Average risk 0.32

A 12% 0.5 $20,000
B 9% 0.3 $10,000
The following is the MOLP formulation for this problem:
Let X1 = dollars in investment A

MAX: 0.12 X1/50000 + 0.09 X2/50000

MIN: 0.5 X1/50000 + 0.3 X2/50000
X1 ≥ 20000
X2 ≥ 10000
Xi ≥ 0 for all i
The solution for the second LP is (X1, X2) = (20,000, 30,000).
What formulas should go in cells B2:D11 of the spreadsheet? NOTE: Formulas are not required in all of these cells.
A B C D
1 Problem data A B
4
6 Amount invested $20,000 $30,000 $50,000
8
9 Objectives:
10 Average return 10.2%
11 Average risk 0.32
ANSWER: Cell Formula
D6 =B6+C6
B10 =SUMPRODUCT(B2:C2,B6:C6)/D7
Name: Class: Date:
Chapter 07
B11 =SUMPRODUCT(B3:C3,B6:C6)/D7

A 12% 0.5 $20,000
B 9% 0.3 $10,000
Note that a low Risk rating means a less risky investment. The investor wants to maximize the expected rate of return
while minimizing his risk. Any money beyond the minimum investment requirements can be invested in either fund. The
investor has found that the maximum possible expected rate of return is 11.4% and the minimum possible risk is 0.32.
Formulate a goal programming model with a MINIMAX objective function.

ANSWER: Let X1 = dollars in investment A
MINIMIZE Q
X1 ≥ 20000
X2 ≥ 10000
Xi ≥ 0 for all i, Q ≥ 0

A 12% 0.5 $20,000
B 9% 0.3 $10,000
Note that a low Risk rating means a less risky investment. The investor wants to maximize the expected rate of return
while minimizing his risk. Any money beyond the minimum investment requirements can be invested in either fund. The
investor has found that the maximum possible expected rate of return is 11.4% and the minimum possible risk is 0.32.
The following Excel spreadsheet has been created to solve a goal programming problem with a MINIMAX objective
based on the following goal programming formulation with MINIMAX objective and corresponding solution.
MINIMIZE Q
X1 ≥ 20000
Name: Class: Date:
Chapter 07
X2 ≥ 10000
Xi ≥ 0 for all i, Q ≥ 0
with solution (X1, X2) = (15,370, 34,630).
What values should go in cells B2:D14 of the spreadsheet?
A B C D E
1 Problem data A B
2 Expected return
3 Risk rating
4
6 Amount invested
7 Minimum required
8
9 Weighted
11 Average return 1
12 Average risk 1
13
14 Objective:
ANSWER:
A B C D E
1 Problem data A B
2 Expected return 0.12 0.09
4
7 Minimum required 10000 20000 50000
8
9 Weighted
11 Average return 0.09922 0.114 1 0.12963
12 Average risk 0.36148 0.320 1 0.12963
13
14 Objective: 0.12963
55. Robert Gardner runs a small, local-only delivery service. His fleet consists of three smaller panel trucks. He recently
Name: Class: Date:
Chapter 07
accepted a contract to deliver 12 shipping boxes of goods for delivery to 12 different customers. The box weights are:
210, 160, 320, 90, 110, 70, 410, 260, 170, 240, 80 and 180 for boxes 1 through 12, respectively. Since each truck differs
each truck has different load capacities as given below:
Truck Weight Capacity Box Capacity Cost per pound

1 800 pounds 5 $0.34
2 900 pounds 6 $0.42
3 700 pounds 4 $0.25
Robert would like each truck equally loaded, both in terms of number of boxes and in terms of total weight, while
minimizing his shipping costs. Assume a cost of $50 per item for trucks carrying extra boxes and $0.10 per pound cost for
trucks carrying less weight.
Formulate the integer goal programming problem for Robert. (Hint: objective function involves decision and deviation
variables.)
ANSWER: Y1 = weight loaded in truck 1; Y2 = weight loaded in truck 2; Y3 = weight loaded in truck 3;
Xi,j = 0 if truck i not loaded with box j; 1 if truck i loaded with box j.
MIN
0.34Y1 + 0.42Y2 + 0.25Y3 + 50*(d1+ + d2+ + d3+) + 0.10*(d4− + d5− + d6−)*100
Subject to:
Y1 = 210X11 + 160X12 + 320X13 + 90X14 + 110X15 + 70X16 + 410X17 + 260X18
+ 170X19 + 240X1,10 + 80X1,11 + 180X1,12
Y2 = 210X21 + 160X22 + 320X23 + 90X24 + 110X25 + 70X26 + 410X27 + 260X28
+ 170X29 + 240X2,10 + 80X2,11 + 180X2,12
Y3 = 210X31 + 160X32 + 320X33 + 90X34 + 110X35 + 70X36 + 410X37 + 260X38
+ 170X39 + 240X3,10 + 80X3,11 + 180X3,12
Y1 ≤ 800
Y2 ≤ 900
Y3 ≤ 700
Y1 + d1− − d1+ = 767
Y2 + d2− − d2+ = 767
Y3 + d3− − d3+ = 767
X11 + X21 + X31 = 1
X12 + X22 + X32 = 1
X13 + X23 + X33 = 1
X14 + X24 + X34 = 1
X15 + X25 + X35 = 1
X16 + X26 + X36 = 1
X17 + X27 + X37 = 1
X18 + X28 + X38 = 1
X19 + X29 + X39 = 1
X1,10 + X2,10 + X3,10 = 1
X1,11 + X2,11 + X3,11 = 1
X1,12 + X2,12 + X3,12 = 1
Name: Class: Date:
Chapter 07
X11 + X12 + X13 + X14 + X15 + X16 + X17 + X18 + X19

+ X1,10 + X1,11 + X1,12 + d4− − d4+ = 4
X21 + X22 + X23 + X24 + X25 + X26 + X27 + X28 + X29
+ X2,10 + X2,11 + X2,12 + d5− − d5+ = 4
X31 + X32 + X33 + X34 + X35 + X36 + X37 + X38 + X39
+ X3,10 + X3,11 + X3,12 + d6− − d6+ = 4
Xij ≥ 0, dk−, dk+ ≥ 0 for k = 1,2,3,4,5,6
Exhibit 7.4
Robert Gardner runs a small, local-only delivery service. His fleet consists of three smaller panel trucks. He recently
accepted a contract to deliver 12 shipping boxes of goods for delivery to 12 different customers. The box weights are:
210, 160, 320, 90, 110, 70, 410, 260, 170, 240, 80 and 180 for boxes 1 through 12, respectively. Since each truck differs
each truck has different load capacities as given below:
Truck Weight Capacity Box Capacity Cost per pound

1 800 pounds 5 $0.34
2 900 pounds 6 $0.42
3 700 pounds 4 $0.25
Robert would like each truck equally loaded, both in terms of number of boxes and in terms of total weight, while
minimizing his shipping costs. Assume a cost of $50 per item for trucks carrying extra boxes and $0.10 per pound cost for
trucks carrying less weight.
The following integer goal programming formulation applies to his problem.
Y1 = weight loaded in truck 1; Y2 = weight loaded in truck 2; Y3 = weight loaded in truck 3;

Xi,j = 0 if truck i not loaded with box j; 1 if truck i loaded with box j.
MIN
0.34Y1 + 0.42Y2 + 0.25Y3 + 50*(d1+ + d2+ + d3+) + 0.10*(d4− + d5− + d6−)*100
Subject to:
Y1 = 210X11 + 160X12 + 320X13 + 90X14 + 110X15 + 70X16 + 410X17 + 260X18
+ 170X19 + 240X1,10 + 80X1,11 + 180X1,12
Y2 = 210X21 + 160X22 + 320X23 + 90X24 + 110X25 + 70X26 + 410X27 + 260X28
+ 170X29 + 240X2,10 + 80X2,11 + 180X2,12
Y3 = 210X31 + 160X32 + 320X33 + 90X34 + 110X35 + 70X36 + 410X37 + 260X38
+ 170X39 + 240X3,10 + 80X3,11 + 180X3,12
Y1 ≤ 800
Y2 ≤ 900
Y3 ≤ 700
Y1 + d1− − d1+ = 767
Name: Class: Date:
Chapter 07
Y2 + d2− − d2+ = 767
Y3 + d3− − d3+ = 767
X11 + X21 + X31 = 1
X12 + X22 + X32 = 1
X13 + X23 + X33 = 1
X14 + X24 + X34 = 1
X15 + X25 + X35 = 1
X16 + X26 + X36 = 1
X17 + X27 + X37 = 1
X18 + X28 + X38 = 1
X19 + X29 + X39 = 1
X1,10 + X2,10 + X3,10 = 1
X1,11 + X2,11 + X3,11 = 1
X1,12 + X2,12 + X3,12 = 1
X11 + X12 + X13 + X14 + X15 + X16 + X17 + X18 + X19 + X1,10 + X1,11 + X1,12 + d4− − d4+ = 4
X21 + X22 + X23 + X24 + X25 + X26 + X27 + X28 + X29 + X2,10 + X2,11 + X2,12 + d5− − d5+ = 4
X31 + X32 + X33 + X34 + X35 + X36 + X37 + X38 + X39 + X3,10 + X3,11 + X3,12 + d6− − d6+ = 4
Xij ≥ 0, dk−, dk+ ≥ 0 for k = 1,2,3,4,5,6
Given the following spreadsheet solution of this integer goal programming formulation, answer the following questions.
A B C D E F G
1 Cost $0.34 $0.42 $0.25
2 Capacity 8.0 9.0 7.0
3 1 2 3 Weight Assigned Required
4 1 0 1 0 2.1 1 1
5 2 1 0 0 1.6 1 1
6 3 1 0 0 3.2 1 1
7 4 0 0 1 0.9 1 1
8 5 0 1 0 1.1 1 1
9 6 0 1 0 0.7 1 1
10 7 0 1 0 4.1 1 1
11 8 0 0 1 2.6 1 1
12 9 0 0 1 1.7 1 1
13 10 1 0 0 2.4 1 1
14 11 1 0 0 0.8 1 1
15 12 0 0 1 1.8 1 1
16 Total Items 4 4 4
17 Under 0 0 0 Item Cost $50
18 Over 0 0 0 Wt. Cost $0.25
19 Actual 4 4 4
20 Target Items 4 4 4
21 Total Wt 8 8 7
22 Under 0.00 0.00 0.67
23 Over 0.33 0.33 0.00
24 Actual Wt 7.67 7.67 7.67
25 Target Wt 7.67 7.67 7.67
Name: Class: Date:
Chapter 07
26 Cost $7.8967
56. Refer to Exhibit 7.4. Given the solution indicated in the spreadsheet, which trucks, if any, are under an equal weight
amount, and which trucks are over an equal weight amount?
ANSWER: Trucks 1 and 2 are over the target weight by 33 pounds. Truck 3 is under the target weight by 67 pounds.
57. Refer to Exhibit 7.4. The solution indicates Truck 3 is under the target weight by 67 pounds. What if anything can be
done to this model to provide a solution in which Truck 3 is closer to the target weight?
ANSWER: Nothing. Truck 3 is at its capacity of 700 pounds.
58. Refer to Exhibit 7.4. The spreadsheet model has scaled all the weights from pounds into 100s pounds. How does this
scaling effect the solution obtained using the Analytic Solver Platform (ASP)?
ANSWER: The solution obtained is the same regardless of scaling. In terms of pounds, the total cost would be multiplied
by 100, to obtain $78,967.
59. Refer to Exhibit 7.4. What formulas should go in cell E26 of the spreadsheet?
ANSWER: =SUMPRODUCT(B21:D21, B1:D1) + F17*SUM(B18:D18) + F18*SUM(B22:D22)
60. Refer to Exhibit 7.4. Based on the integer goal programming formulation, the associated solution, and spreadsheet
model, what formulas should go in cells B19:E19 and B24:E24 of the spreadsheet?
B19 =B16 + B17 − B18 C19:E19
B24 =B21 + B22 − B23 C24:E24
61. One major advantage of goal programming (GP) is that the technique:
a. allows a decision-maker to jointly examine several objectives
b. multiple objectives can be assigned different weights depending on their relative importance
c. can focus on a single objective, if necessary
d. all of the above
ANSWER: d
62. Goal programming (GP) is:

a. iterative
b. inaccurate
c. static
d. all of the above
ANSWER: a
63. A MINIMAX objective function in goal programming (GP):

a. is used to minimize the maximum deviation from a goal
b. is captured in a decision table
c. is estimated by trial-and-error
d. often produces an infeasible solution
ANSWER: a
64. A hard constraint

Name: Class: Date:
Chapter 07
a. cannot be violated
b. may be violated
c. is always binding
d. is always part of the feasible solution
ANSWER: a
65. A soft constraint

a. represents a target a decision-maker would like to achieve
b. is always tight
c. cannot be violated
d. typically represents a single goal
ANSWER: a
66. Goal programming problems

a. typically include a set of multiple goals
b. cannot include hard constraints
c. consist of soft constraints only
d. must have a single objective function
ANSWER: a
67. Deviational variables

a. are added to constraints to indicate acceptable departures from the target values of their corresponding goals
b. are negative
c. are positive for underachievement only
d. are positive for overachievement only
ANSWER: a
68. The "triple bottom line" incorporates multiple objective decision-making by:
a. simultaneously considering profit, people and planet
b. environmental issues only
c. financial objectives only
d. wealth redistribution in the society
ANSWER: a
69. Goal programming (GP) is typically

a. a minimization problem of the sum of weighted percentage deviations
b. a maximization problem of positive deviations only
c. a minimization problem of negative deviations only
d. a maximization problem of continuous goals
ANSWER: a
70. Suppose that environmental and human variables are assigned the weight of zero. Then the "triple bottom line"
approach reduces to:
a. profit maximization
Name: Class: Date:
Chapter 07
b. environmental issues
c. HR objectives
d. achieving social equilibrium
ANSWER: a
71. Suppose that profit and human variables are assigned the weight of zero. Then the "triple bottom line" approach
reduces to:
a. profit maximization only
b. environmental considerations only
c. HR objectives only
d. achieving social happiness
ANSWER: b
72. In the "triple bottom line" the term "people" refers to:
a. social responsibility issues
b. environmental issues
c. financial objectives
d. all of the above
ANSWER: a
73. Multi-objective linear programming (MOLP) provide

a. a way to analyze LP problems with multiple conflicting objectives
b. a way to incorporate soft constraints
c. a way to incorporate hard constraints
d. a simple way to solve the problem as a relaxed LP
ANSWER: a
74. Goal Programming and Multiple Objective Optimization are not related
a. True
b. False
ANSWER: False
75. Hard constraints can be violated, if necessary

a. True
b. False
ANSWER: False
76. The second step in Goal Programming is defining the goals

a. True
b. False
ANSWER: True
77. The deviational variables represent the amount by which the goal's target is underachieved
a. True
Name: Class: Date:
Chapter 07
b. False
ANSWER: False
78. In the goal programming problem, the weights, wi, attached to deviational variables must decay exponentially
a. True
b. False
ANSWER: False
79. Trade-offs in goal programming can be made by modifying the weights to satisfy the priorities of a decision maker
a. True
b. False
ANSWER: True
80. Linear programming problems cannot have multiple objectives

a. True
b. False
ANSWER: False
81. In MOLP, a decision alternative is dominated if another alternative produces a better value of at least one objective
without worsening the value of other objectives
a. True
b. False
ANSWER: True

Another random document with
no related content on Scribd:
"Good morning, Christopher Robin," he said, brushing away Roo and
Piglet, and sitting down on THE WOLERY. "Are we alone?"
"Yes," said Christopher Robin, smiling to himself.

"I have been told—the news has worked through to my corner of the
Forest—the damp bit down on the right which nobody wants—that a
certain Person is looking for a house. I have found one for him."
"Ah, well done," said Rabbit kindly.
Eeyore looked round slowly at him, and then turned back to
Christopher Robin.
"We have been joined by something," he said in a loud whisper. "But
no matter. We can leave it behind. If you will come with me,
Christopher Robin, I will show you the house."
Christopher Robin jumped up.
"Come on, Pooh," he said.
"Come on, Tigger!" cried Roo.
"Shall we go, Owl?" said Rabbit.
"Wait a moment," said Owl, picking up his notice-board, which had
just come into sight again.
Eeyore waved them back.
"Christopher Robin and I are going for a Short Walk," he said, "not a
Jostle. If he likes to bring Pooh and Piglet with him, I shall be glad of
their company, but one must be able to Breathe."
"That's all right," said Rabbit, rather glad to be left in charge of
something. "We'll go on getting the things out. Now then, Tigger,
where's that rope? What's the matter, Owl?"
Owl, who had just discovered that his new address was THE
SMUDGE, coughed at Eeyore sternly, but said nothing, and Eeyore,
with most of THE WOLERY behind him, marched off with his friends.
So, in a little while, they came to the house which Eeyore had found,
and for some minutes before they came to it, Piglet was nudging
Pooh, and Pooh was nudging Piglet, and they were saying, "It is!"
and "It can't be!" and "It is, really!" to each other.
And when they got there, it really was.
"There!" said Eeyore proudly, stopping them outside Piglet's house.
"And the name on it, and everything!"
"Oh!" cried Christopher Robin, wondering whether to laugh or what.
"Just the house for Owl. Don't you think so, little Piglet?"
And then Piglet did a Noble Thing, and he did it in a sort of dream,
while he was thinking of all the wonderful words Pooh had hummed
about him.
"Yes, it's just the house for Owl," he said grandly. "And I hope he'll be
very happy in it." And then he gulped twice, because he had been
very happy in it himself.
"What do you think, Christopher Robin?" asked Eeyore a little
anxiously, feeling that something wasn't quite right.
Christopher Robin had a question to ask first, and he was wondering
how to ask it.
"Well," he said at last, "it's a very nice house, and if your own house
is blown down, you must go somewhere else, mustn't you, Piglet?
What would you do, if your house was blown down?"
Before Piglet could think, Pooh answered for him.
"He'd come and live with me," said Pooh, "wouldn't you, Piglet?"
Piglet squeezed his paw.
"Thank you, Pooh," he said, "I should love to."
CHAPTER X
IN WHICH Christopher Robin and Pooh Come to an Enchanted
Place, and We Leave Them There
Christopher Robin was going away. Nobody knew why he was going;
nobody knew where he was going; indeed, nobody even knew why
he knew that Christopher Robin was going away. But somehow or
other everybody in the Forest felt that it was happening at last. Even
Smallest-of-all, a friend-and-relation of Rabbit's who thought he had
once seen Christopher Robin's foot, but couldn't be quite sure
because perhaps it was something else, even S. of A. told himself
that Things were going to be Different; and Late and Early, two other
friends-and-relations, said, "Well, Early?" and "Well, Late?" to each
other in such a hopeless sort of way that it really didn't seem any
good waiting for the answer.
One day when he felt that he couldn't wait any longer, Rabbit brained
out a Notice, and this is what it said:
"Notice a meeting of everybody will meet at the House at Pooh
Corner to pass a Rissolution By Order Keep to the Left Signed
Rabbit."
He had to write this out two or three times before he could get the
rissolution to look like what he thought it was going to when he began
to spell it: but, when at last it was finished, he took it round to
everybody and read it out to them. And they all said they would come.
"Well," said Eeyore that afternoon, when he saw them all walking up
to his house, "this is a surprise. Am I asked too?"
"Don't mind Eeyore," whispered Rabbit to Pooh. "I told him all about it
this morning."
Everybody said "How-do-you-do" to Eeyore, and Eeyore said that he
didn't, not to notice, and then they sat down; and as soon as they
were all sitting down, Rabbit stood up again.
"We all know why we're here," he said, "but I have asked my friend
Eeyore——"
"That's Me," said Eeyore. "Grand."
"I have asked him to Propose a Rissolution." And he sat down again.
"Now then, Eeyore," he said.
"Don't Bustle me," said Eeyore, getting up slowly. "Don't now-then
me." He took a piece of paper from behind his ear, and unfolded it.
"Nobody knows anything about this," he went on. "This is a Surprise."
He coughed in an important way, and began again: "What-nots and
Etceteras, before I begin, or perhaps I should say, before I end, I
have a piece of Poetry to read to you. Hitherto—hitherto—a long
word meaning—well, you'll see what it means directly—hitherto, as I
was saying, all the Poetry in the Forest has been written by Pooh, a
Bear with a Pleasing Manner but a Positively Startling Lack of Brain.
The Poem which I am now about to read to you was written by
Eeyore, or Myself, in a Quiet Moment. If somebody will take Roo's
bull's-eye away from him, and wake up Owl, we shall all be able to
enjoy it. I call it—POEM."
This was it.
Christopher Robin is going.

At least I think he is.
Where?
Nobody knows.
But he is going—
I mean he goes
(To rhyme with "knows")
Do we care?
(To rhyme with "where")
We do
Very much.
(I haven't got a rhyme for that "is" in the second line yet.
Bother.)
(Now I haven't got a rhyme for bother. Bother.)
Those two bothers will have to rhyme with each other. Buther.
The fact is this is more difficult than I thought,
I ought—
(Very good indeed)
I ought
To begin again,
But it is easier
To stop.
Christopher Robin, good-bye,
I
(Good)
I
And all your friends
Sends—
I mean all your friend
Send—
(Very awkward this, it keeps going wrong)
Well, anyhow, we send
Our love
END.
"If anybody wants to clap," said Eeyore when he had read this, "now
is the time to do it."
They all clapped.
"Thank you," said Eeyore. "Unexpected and gratifying, if a little
lacking in Smack."
"It's much better than mine," said Pooh admiringly, and he really
thought it was.
"Well," explained Eeyore modestly, "it was meant to be."
"The rissolution," said Rabbit, "is that we all sign it, and take it to
Christopher Robin."
So it was signed POOH, PIGLET, WOL, EOR, RABBIT, KANGA,
BLOT, SMUDGE, and they all went off to Christopher Robin's house
with it.
"Hallo, everybody," said Christopher Robin—"Hallo, Pooh."
They all said "Hallo," and felt awkward and unhappy suddenly,
because it was a sort of good-bye they were saying, and they didn't
want to think about it. So they stood around, and waited for
somebody else to speak, and they nudged each other, and said "Go
on," and gradually Eeyore was nudged to the front, and the others
crowded behind him.
"What is it, Eeyore?" asked Christopher Robin. Eeyore swished his
tail from side to side, so as to encourage himself, and began.
"What is it, Eeyore?" asked Christopher Robin.
"Christopher Robin," he said, "we've come to say—to give you—it's

called—written by—but we've all—because we've heard, I mean we
all know—well, you see, it's—we—you—well, that, to put it as shortly
as possible, is what it is." He turned round angrily on the others and
said, "Everybody crowds round so in this Forest. There's no Space. I
never saw a more Spreading lot of animals in my life, and all in the
wrong places. Can't you see that Christopher Robin wants to be
alone? I'm going." And he humped off.
Not quite knowing why, the others began edging away, and when
Christopher Robin had finished reading POEM, and was looking up to
say, "Thank you," only Pooh was left.
"It's a comforting sort of thing to have," said Christopher Robin,
folding up the paper, and putting it in his pocket. "Come on, Pooh,"
and he walked off quickly.
"Where are we going?" said Pooh, hurrying after him, and wondering
whether it was to be an Explore or a What-shall-I-do-about-you-know-
what.
"Nowhere," said Christopher Robin.
So they began going there, and after they had walked a little way
Christopher Robin said:
"What do you like doing best in the world, Pooh?"
"Well," said Pooh, "what I like best——" and then he had to stop and
think. Because although Eating Honey was a very good thing to do,
there was a moment just before you began to eat it which was better
than when you were, but he didn't know what it was called. And then
he thought that being with Christopher Robin was a very good thing
to do, and having Piglet near was a very friendly thing to have; and
so, when he had thought it all out, he said, "What I like best in the
whole world is Me and Piglet going to see You, and You saying 'What
about a little something?' and Me saying, 'Well, I shouldn't mind a
little something, should you, Piglet,' and it being a hummy sort of day
outside, and birds singing."
"I like that too," said Christopher Robin, "but what I like doing best is
Nothing."
"How do you do Nothing?" asked Pooh, after he had wondered for a
long time.
"Well, it's when people call out at you just as you're going off to do it,
What are you going to do, Christopher Robin, and you say, Oh,
nothing, and then you go and do it."
"Oh, I see," said Pooh.
"This is a nothing sort of thing that we're doing now."
"Oh, I see," said Pooh again.
"It means just going along, listening to all the things you can't hear,
and not bothering."
"Oh!" said Pooh.
They walked on, thinking of This and That, and by-and-by they came
to an enchanted place on the very top of the Forest called Galleons
Lap, which is sixty-something trees in a circle; and Christopher Robin
knew that it was enchanted because nobody had ever been able to
count whether it was sixty-three or sixty-four, not even when he tied a
piece of string round each tree after he had counted it. Being
enchanted, its floor was not like the floor of the Forest, gorse and
bracken and heather, but close-set grass, quiet and smooth and
green. It was the only place in the Forest where you could sit down
carelessly, without getting up again almost at once and looking for
somewhere else. Sitting there they could see the whole world spread
out until it reached the sky, and whatever there was all the world over
was with them in Galleons Lap.
Suddenly Christopher Robin began to tell Pooh about some of the
things: People called Kings and Queens and something called
Factors, and a place called Europe, and an island in the middle of the
sea where no ships came, and how you make a Suction Pump (if you
want to), and when Knights were Knighted, and what comes from
Brazil. And Pooh, his back against one of the sixty-something trees,
and his paws folded in front of him, said "Oh!" and "I didn't know," and
thought how wonderful it would be to have a Real Brain which could
tell you things. And by-and-by Christopher Robin came to an end of
the things, and was silent, and he sat there looking out over the
world, and wishing it wouldn't stop.
But Pooh was thinking too, and he said suddenly to Christopher
Robin:
"Is it a very Grand thing to be an Afternoon, what you said?"
"A what?" said Christopher Robin lazily, as he listened to something
else.
"On a horse," explained Pooh.
"A Knight?"
"Oh, was that it?" said Pooh. "I thought it was a——Is it as Grand as
a King and Factors and all the other things you said?"
"Well, it's not as grand as a King," said Christopher Robin, and then,
as Pooh seemed disappointed, he added quickly, "but it's grander
than Factors."
"Could a Bear be one?"
"Of course he could!" said Christopher Robin. "I'll make you one."
And he took a stick and touched Pooh on the shoulder, and said,
"Rise, Sir Pooh de Bear, most faithful of all my Knights."
So Pooh rose and sat down and said "Thank you," which is the
proper thing to say when you have been made a Knight, and he went
into a dream again, in which he and Sir Pomp and Sir Brazil and
Factors lived together with a horse, and were faithful Knights (all
except Factors, who looked after the horse) to Good King Christopher
Robin ... and every now and then he shook his head, and said to
himself "I'm not getting it right." Then he began to think of all the
things Christopher Robin would want to tell him when he came back
from wherever he was going to, and how muddling it would be for a
Bear of Very Little Brain to try and get them right in his mind. "So,
perhaps," he said sadly to himself, "Christopher Robin won't tell me
any more," and he wondered if being a Faithful Knight meant that you
just went on being faithful without being told things.
Then, suddenly again, Christopher Robin, who was still looking at the
world, with his chin in his hands, called out "Pooh!"
"Yes?" said Pooh.

"When I'm—when——Pooh!"
"Yes, Christopher Robin?"
"I'm not going to do Nothing any more."
"Never again?"
"Well, not so much. They don't let you."
Pooh waited for him to go on, but he was silent again.
"Yes, Christopher Robin?" said Pooh helpfully.
"Pooh, when I'm—you know—when I'm not doing Nothing, will you
come up here sometimes?"
"Just Me?"

Spreadsheet Modeling and Decision Analysis A Practical Introduction to Business Analytics 8th Edition Ragsdale Test Bank instant download all chapter

Uploaded by

Document Information

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

Spreadsheet Modeling and Decision Analysis A Practical Introduction to Business Analytics 8th Edition Ragsdale Test Bank instant download all chapter

Uploaded by

Copyright:

Available Formats

Spreadsheet Modeling and Decision

Analysis A Practical Introduction to

Spreadsheet Modeling and Decision Analysis A Practical

Spreadsheet Modeling and Decision Analysis A Practical

Spreadsheet Modeling and Decision Analysis A Practical

Spreadsheet Modeling and Decision Analysis 6th Edition

Business Analytics Data Analysis and Decision Making

Business Analytics Data Analysis And Decision Making

Business Analytics Data Analysis and Decision Making

Business Analytics Data Analysis and Decision Making

2. A constraint which represents a target value for a problem is called a

5. Which of the following is true regarding goal programming?

6. The RHS value of a goal constraint is referred to as the

7. The di+, di− variables are referred to as

Copyright Cengage Learning. Powered by Cognero. Page 2

a. 3X1 + 2 X2 + d1− − d1+ = 10

a. The time required for each decision variable.

16. What weight would be assigned to a neutral deviational variable?

17. Which of the following is false regarding a goal constraint?

18. Refer to Exhibit 7.1. What formula goes in cell D6?

19. Refer to Exhibit 7.1. What formula goes in cell B9?

26. The MINIMAX objective

27. The primary benefit of a MINIMAX objective function is

29. MINIMAX solutions to multi-objective linear programming (MOLP) problems are

31. Refer to Exhibit 7.2. What formula goes in cell B10?

33. Refer to Exhibit 7.2. What formula goes in cell B11?

Copyright Cengage Learning. Powered by Cognero. Page 7

36. Refer to Exhibit 7.3. What formula goes in cell E11?

40 X1 + 20 X2 + d4− + d4+ = 300

to accommodate this requirement?

39. Given the following goal constraints

40. Consider the following multi-objective linear programming problem (MOLP):

Copyright Cengage Learning. Powered by Cognero. Page 9

Copyright Cengage Learning. Powered by Cognero. Page 10

Goal 1: Produce approximately 40 units of product 1.

MIN: d1− + d1+ + d2 − + d2+ + d3− + d4+ + d5+

Product 1 2 Available resources

Goal 1: Produce approximately 40 units of product 1.

Let X1 = number of product 1

MIN: d1− + d1+ + d2− + d2+ + d3− + d4+ + d5+

(X1, X2) = (4, 69)

Product 1 2 Available resources

Goal 1: Produce approximately 40 units of product 1.

Let X1 = number of product 1

MIN: d1− + d1+ + d2− + d2+ + d3− + d4+ + d5+

(X1, X2) = (4, 69)

MIN: d1− + d1+ + d2− + d2+ + d3− + d3+ + d4− − d4+

Let X1 = number of large trucks

MIN: d1− + d1+ + d2− + d2+ + d3− + d3+ + d4− − d4+

(X1, X2) = (10, 15)

Copyright Cengage Learning. Powered by Cognero. Page 14

Let X1 = number of large trucks

MIN: d1− + d1+ + d2− + d2+ + d3− + d3+ + d4− − d4+

Copyright Cengage Learning. Powered by Cognero. Page 15

(X1, X2) = (10, 15)

Food 1 Food 2 TARGET

Copyright Cengage Learning. Powered by Cognero. Page 16

Food 1 Food 2 Requirements

MIN: 1 X1 + 1.25 X2 minimize cost or food product

Fund Rate of return Risk Minimum investment

Formulate the MOLP for this investor.

MAX: 0.12 X1/50000 + 0.09 X2/50000

Fund Rate of return Risk Minimum investment

Let X1 = dollars in investment A