Solutions Manual for Introduction to Management Science 11th

Edition Taylor 0132751917 9780132751919

Full Link Download:
Test Bank:
https://testbankpack.com/p/test-bank-for-introduction-to-
management-science-11th-edition-taylor-0132751917-
9780132751919/
Solution Manual:
https://testbankpack.com/p/solutions-manual-for-introduction-to-
management-science-11th-edition-taylor-0132751917-9780132751919/
Chapter Two: Linear Programming: Model Formulation and Graphical Solution
PROBLEM SUMMARY 25. Constraint analysis (2–24)

1. Maximization (1–28 continuation), graphical 26. Minimization, graphical solution

solution 27. Sensitivity analysis (2–26)
2. Maximization, graphical solution 28. Sensitivity analysis (2–26)
3. Minimization, graphical solution 29. Sensitivity analysis (2–22)
4. Sensitivity analysis (2–3) 30. Minimization, graphical solution
5. Minimization, graphical solution 31. Minimization, graphical solution
6. Maximization, graphical solution 32. Sensitivity analysis (2–31)
7. Slack analysis (2–6) 33. Minimization, graphical solution
8. Sensitivity analysis (2–6) 34. Maximization, graphical solution
9. Maximization, graphical solution
10. Slack analysis (2–9)
11. Maximization, graphical solution
12. Minimization, graphical solution
13. Maximization, graphical solution
14. Sensitivity analysis (2–13)
15. Sensitivity analysis (2–13)
16. Maximization, graphical solution
17. Sensitivity analysis (2–16)
18. Maximization, graphical solution
19. Sensitivity analysis (2–18)
20. Maximization, graphical solution
21. Standard form (2–20)
22. Maximization, graphical solution
23. Standard form (2–22)
24. Maximization, graphical solution

2-1
Copyright © 2013 Pearson Education, Inc. publishing as Prentice Hall
36. Maximization, graphical solution 54. Sensitivity analysis (2–53)
37. Sensitivity analysis (2–34) 55. Minimization, graphical solution
38. Minimization, graphical solution 56. Sensitivity analysis (2–55)
39. Maximization, graphical solution 57. Maximization, graphical solution
40. Maximization, graphical solution 58. Minimization, graphical solution
41. Sensitivity analysis (2–38) 59. Sensitivity analysis (2–52)
42. Maximization, graphical solution 60. Maximization, graphical solution
43. Sensitivity analysis (2–40) 61. Sensitivity analysis (2–54)
44. Maximization, graphical solution 62. Multiple optimal solutions
45. Sensitivity analysis (2–42) 63. Infeasible problem
46. Minimization, graphical solution 64. Unbounded problem
47. Sensitivity analysis (2–44)
48. Maximization, graphical solution PROBLEM SOLUTIONS
49. Sensitivity analysis (2–46) 1. a) x1 = # cakes
50. Maximization, graphical solution x2 = # loaves of bread
maximize Z = $10x1 + 6x2
51. Sensitivity analysis (2–48) subject to
52. Maximization, graphical solution 3x1 + 8x2 ≤ 20 cups of flour
45x1 + 30x2 ≤ 180 minutes
53. Minimization, graphical solution x1,x2 ≥ 0
35. Minimization, graphical solution

2-2
Copyright © 2013 Pearson Education, Inc. publishing as Prentice Hall
 b) b)
x2
A: x1 = 0 *A : x1 = 0
x2
12 x2 = 2.5 x2 = 8
Z = 15 12 Z = .24
10
B: x1 = 3.1 B : x1 = 12/5
10
8 x2 = 1.33 x2 = 24/5
Z = 38.98 A
8 Z = .26

6
*C: x1 = 4 optimal C : x1 = 12
x2 = 0 6

4 B x2 = 0
Z = 40
A 4 Z = .60
2 B
Point A is optimal
x 2 Z
C
1

0 2 4 6 8 10 12 14 C
x1
0 2 4 6 8 10 12 14
2. a) Maximize Z = 6x1 + 4x2 (profit, $)
subject to 4. The optimal solution point would change
10x1 + 10x2 ≤ 100 (line 1, hr) from point A to point B, thus resulting in
7x1 + 3x2 ≤ 42 (line 2, hr) the optimal solution
x1,x2 ≥ 0 x1 = 12/5 x2 = 24/5 Z = .408
b) 5. a) Minimize Z = 3x1 + 5x2 (cost, $)
x2 subject to
A : x1 = 0
10x + 2x ≥ 20 (nitrogen, oz)
1 2
14 x2 = 10
Z = 40
6x1 + 6x2 ≥ 36 (phosphate, oz)
12 x2 ≥ 2 (potassium, oz)
*B : x1 = 3
A x2 = 7 x1,x2 ≥ 0
10
Z = 46 b)
8 C : x1 = 6 x2
B A : x1 = 0
x2 = 0
6 12 x2 = 10
Z = 36
A Z = 50
4 10
Z B : x1 = 1
Point B is optimal
2 8 x2 = 5
C x1 Z = 28
0 2 4 6 8 10 12 14 6
*C : x1 = 4
B
3. a) Minimize Z = .05x1 + .03x2 (cost, $) 4 x2 = 2
subject to Z = 22
2
8x1 + 6x2 ≥ 48 (vitamin A, mg) C Point C is optimal
Z
x1 + 2x2 ≥ 12 (vitamin B, mg) x1
x1,x2 ≥ 0 0 2 4 6 8 10 12 14

6. a) Maximize Z = 400x1 + 100x2 (profit, $)

subject to
8x1 + 10x2 ≤ 80 (labor, hr)
2x1 + 6x2 ≤ 36 (wood)
x1 ≤ 6 (demand, chairs)
x1,x2 ≥ 0

2-3
Copyright © 2013 Pearson Education, Inc. publishing as Prentice Hall
 b) b)
x2 x2 *A : x1 = 0
A : x1 = 0 * C : x1 = 6
12
x2 = 6 12 x2 = 4
x2 = 3.2
Z = 600 Z = 2,720 Z = 20
10 10
B : x1 = 30/7 D : x1 = 6 B : x1 = 2
8 x2 = 32/7 x2 = 0 x2 = 3
8
A Z = 2,171 Z = 2,400
6 Z = 17
B 6
C : x1 = 5
4 A
C Point C is optimal
4 x2 = 0
B
2 Z Z=5
D 2 Point A is optimal
x1 Z
0 2 4 6 8 10 12 14 16 18 C
x1
7. In order to solve this problem, you must 0 2 4 6 8 10 12 14
substitute the optimal solution into the 10. In order to solve this problem, you must
resource constraint for wood and the substitute the optimal solution into the
resource constraint for labor and resource constraints for flour and sugar
determine how much of each resource and determine how much of each
is left over. resource is left over.
Labor Flour
8x1 + 10x2 ≤ 80 hr 5x1 + 5x2 ≤ 25 lb

8(6) + 10(3.2) ≤ 80 5(0) + 5(4) ≤ 25

48 + 32 ≤ 80 20 ≤ 25
80 ≤ 80 25 − 20 = 5
There is no labor left unused. There are 5 lb of flour left unused.
Wood Sugar

2x1 + 6x2 ≤ 36 2x1 + 4x2 ≤ 16

2(6) + 6(3.2) ≤ 36 2(0) + 4(4) ≤ 16
12 + 19.2 ≤ 36 16 ≤ 16
31.2 ≤ 36
There is no sugar left unused.
36 − 31.2 = 4.8
11.
There is 4.8 lb of wood left unused.
x2 *A : x1 = 0
8. The new objective function, Z = 400x1 + x2 = 9
12
500x2, is parallel to the constraint for
Z = 54

labor, which results in multiple optimal 10 A

solutions. Points B (x1 = 30/7, x2 = 32/7) B : x1 = 4
and C (x1 = 6, x2 = 3.2) are the alternate 8 x2 = 3
optimal solutions, each with a profit of Z = 30
$4,000. 6 C : x1 = 4
9. a) Maximize Z = x1 + 5x2 (profit, $) 4 x2 = 1
subject to B Z = 18
2
5x1 + 5x2 ≤ 25 (flour, lb) Z C Point A is optimal
2x1 + 4x2 ≤ 16 (sugar, lb) x1
0 2 4 6 8 10 12
x1 ≤ 5 (demand for cakes)
x1,x2 ≥ 0 12. a) Minimize Z = 80x + 50x (cost, $)
2-4
Copyright © 2013 Pearson Education, Inc. publishing as Prentice Hall
 1 2
b) subject to
b)
3x1 + x2 ≥ 6 (antibiotic 1, units)
x1 + x2 ≥ 4 (antibiotic 2, units)

2-5
Copyright © 2013 Pearson Education, Inc. publishing as Prentice Hall
 2x1 + 6x2 ≥ 12 (antibiotic 3, units) 15. a) Optimal solution: x1 = 4 necklaces, x2 = 3
bracelets. The maximum demand is not
x1,x2 ≥ 0 achieved by the amount of one bracelet.
b)
x2
A : x1 = 0 C : x1 = 3 corresponds to no bracelets being
12 x2 = 6 x2 = 1 produced must be on the x1 axis where x2 =
Z = 300 Z = 290 0. This is point D on the graph. In order
10 *B : x 1 = 1 D : x1 = 6 for point D to be optimal, the objective
x2 = 3 x2 = 0 function “slope” must change such that it
8 Z = 230 Z = 480 is equal to or greater than the slope of the
A constraint line, 3x1 + 2x2 = 18.
6
Transforming this constraint into the form
4 y = a + bx enables us to compute the
B
slope:
2 Point B is optimal
C 2x2 = 18 − 3x1
Z D x1 x2 = 9 − 3/2x1
0 2 4 6 8 10 12 14
From this equation the slope is −3/2.
13. a) Maximize Z = 300x1 + 400x2 (profit, $) Thus, the slope of the objective function
subject to must be at least −3/2. Presently, the slope
of the objective function is −3/4:
3x1 + 2x2 ≤ 18 (gold, oz)
2x1 + 4x2 ≤ 20 (platinum, oz) 400x2 = Z − 300x1
x2 ≤ 4 (demand, bracelets) x2 = Z/400 − 3/4x1

x1,x2 ≥ 0 The profit for a necklace would have to

increase to $600 to result in a slope of −3/2:
b)
400x2 = Z − 600x1
x2
A: x1 = 0 *C: x1 = 4 x2 = Z/400 − 3/2x1
12 x2 = 4 x2 = 3
Z = 1,600 Z = 2,400
However, this creates a situation where
10 both points C and D are optimal, ie.,
B: x1 = 2 D: x1 = 6 multiple optimal solutions, as are all
8 x2 = 4 x2 = 0 points on the line segment between
Z = 2,200 Z = 1,800 C and D.
6
B
16. a) Maximize Z = 50x1 + 40x2 (profit, $)
A
4
C
subject to
2

Point C is optimal
3x1 + 5x2 ≤ 150 (wool, yd )
2
Z 10x1 + 4x2 ≤ 200 (labor, hr)
D x1 x1,x2 ≥ 0
0 2 4 6 8 10 12 14
b)
14. The new objective function, Z = 300x1 +
600x2, is parallel to the constraint line for x2
platinum, which results in multiple A : x1 = 0
60

optimal solutions. Points B (x1 = 2, x2 = 4) be rnate

and C (x1 = 4, x2 = 3) are the alternate pres optimal
optimal solutions, each with a profit of ent solutions
$3,000. in are at x1 =
this 1.33, x2 = 4
The feasible solution space will change. sce
The new constraint line, 3x1 + 4x2 = 20, is nari
parallel to the existing objective function. o.
Thus, multiple optimal solutions will also The
alte
2-4
Copyright © 2013 Pearson Education, Inc. publishing as Prentice Hall
 x2 =
30
50 Z=
1,200
40
*B :
A x1 =
30
B 10.5
20 x2 =
23.7
10 Z Z=
1,473
C
C:
x1
=
20
x
2
=
0
Z=
1,000
Point B is
optimal
and x1 = 2.4, x2 = 3.2, each with a profit x1
0 10 20 30 40 50 60 70
of $2,000.

2-5
Copyright © 2013 Pearson Education, Inc. publishing as Prentice Hall
17. The feasible solution space changes from 19. a) No, not this winter, but they might after
the area 0ABC to 0AB'C', as shown on the they recover equipment costs, which
nd
following graph. should be after the 2 winter.
x2
b) x1 = 55

60 x2 = 16.25
Z = 1,851
50

40
No, profit will go down
A c) x1 = 40
30
B′
x2 = 25
20 B
Z = 2,435
Z
10
Profit will increase slightly
C C′

x1
0 10 20 30 40 50 60 70 d) x1 = 55

x2 = 27.72
The extreme points to evaluate are now
A, B', and C'. Z = $2,073
A: x1 = 0 Profit will go down from (c)
x2 = 30 20.
Z = 1,200 x2
*B': x1 = 15.8 A : x1 = 0
12
x2 = 20.5 x2 = 5
10 Z=5
Z = 1,610
* B : x1 = 4
C': x1 = 24 8
x2 = 1
x2 = 0
Z=7
Z = 1,200 6
A
C : x1 = 4
Point B' is optimal 4 x
2= 0
18. a) Maximize Z = 23x1 + 73x2 Z=6
2
subject to B Point B is optimal

Z C
x1 ≤ 40 0 2 4 6 8 10 12 14
x1

x2 ≤ 25
x1 + 4x2 ≤ 120 21. Maximize Z = 1.5x + x + 0s + 0s + 0s
subject to
x1,x2 ≥ 0 1 2 1 2 3

b)
x1 + s1 = 4
x2 + s 2 = 6
x2
100
x1 + x2 + s3 = 5
x1,x2 ≥ 0
90
A: s1 = 4, s2 = 1, s3 = 0
C optimal,
80
x1 = 40
3 x2 = 20
0
70 Z = 2,380
B
A 22.
60 20
C
50
10
40

2-5
Copyright © 2013 Pearson Education, Inc. publishing as Prentice Hall
 B: s1 = 0, s2 = 5,
s3 = 0
C: s1 = 0, s2 = 6,
s3 = 1
A
:
x
x2 1
=
12 0
A x2 =
10 10
Z=
8
80
Poin
tB * B : x1 = 8
is
opti x2 =
mal 5.2
6
Z=
4 81.6
C
:
B x
1
Z =
2 8
x
2
=
0
Z=
40
C
D x1
x1
0 10 20 30 40 50 60 70 80 90 100 110 120 0 2 4 6 8 10 12 14 18 20
16

2-6
Copyright © 2013 Pearson Education, Inc. publishing as Prentice Hall
23. Maximize Z = 5x1 + 8x2 + 0s1 + 0s3 + 0s4 27. Changing the pay for a full-time claims
subject to processor from $64 to $54 will change the
3x1 + 5x2 + s1 = 50 solution to point A in the graphical
2x1 + 4x2 + s2 = 40 solution where x1 = 28.125 and x2 = 0, i.e.,
there will be no part-time operators.
x1 + s3 = 8
Changing the pay for a part-time operator
x2 + s4 = 10 from $42 to $36 has no effect on the
x1,x2 ≥ 0 number of full-time and part-time
A: s1 = 0, s2 = 0, s3 = 8, s4 = 0 operators hired, although the total cost will
B: s1 = 0, s2 = 3.2, s3 = 0, s4 = 4.8 be reduced to $1,671.95.
C: s1 = 26, s2 = 24, s3 = 0, s4 = 10
28. Eliminating the constraint for defective
24. claims would result in a new solution,
x2 x1 = 0 and x2 = 37.5, where only part-time

16 A : x1 = 8 operators would be hired.

x2 = 6
14 29. The solution becomes infeasible; there
Z = 112
are not enough workstations to handle the
*B : x1 = 10
12 increase in the volume of claims.
x2 = 5
10 Z= 30.
115
x2
C : x1 = 15 A : x1 = 2
8
x2 = 0

6 Z = 97.5 12 x2 = 6
B Point B is optimal
A
Point B is Z = 52
Z
4 optimal 10 *B : x1 = 4
x2 = 2
2 8
Z = 44
C 6 A
x1

0 2 4 6 8 10 12 14 16 18 20 C : x1 = 6
x2 = 0
25. It changes the optimal solution to point A 4
Z = 48
(x1 = 8, x2 = 6, Z = 112), and the constraint, B
2
x1 + x2 ≤ 15, is no longer part of the Z
solution space boundary. C x1
–6 –4 –2 0 2 4 6 8 10 12
26. a) Minimize Z = 64x1 + 42x2 (labor cost, $)
subject to 31.
16x1 + 12x2 ≥ 450 (claims) x2 A : x1 = 2.67
x1 + x2 ≤ 40 (workstations) x2 = 2.33
12
0.5x1 + 1.4x2 ≤ 25 (defective claims) Point C is optimal Z = 22
x1,x2 ≥ 0 10 B : x1 = 4
(1) x2 = 3
b) 8 Z = 30
(4)
x2 *C : x1 = 4
(3)
50 6 x2 = 1
(2)
D
45 A Z = 18
A : x1 = 28.125 C : x1 = 5.55 4 B
x2 = 0 x2 = 34.45 D : x1 = 3.36
40 (5) C
Z = 1,800 Z = 2,437.9
2 x2 = 3.96
35 *B : x1 = 20.121 D : x1 = 40 Z = 33.84
x2 = 10.670 x2 = 0
x
30 1
Z = 1,735.97 Z = 2,560 0 2 4 6 8 10 12
25
Point B is optimal 32. The problem becomes infeasible.
20

2-6
Copyright © 2013 Pearson Education, Inc. publishing as Prentice Hall
15

10 B
C
5
A D
x1
0 5 10 15 20 25 30 35 40 45 50

2-7
Copyright © 2013 Pearson Education, Inc. publishing as Prentice Hall
33. 36. a) Maximize Z = $4.15x1 + 3.60x2 (profit, $)
subject to
x2
*A : x1 = 4.8 x1 + x2 ≤ 115 (freezer space, gals.)
12 x2 = 2.4
Z = 26.4
0.93x1 + 0.75x2 ≤ 90 (budget, $)
10
B : x1 = 6 x1 2
or x 2x 0 (demand)
8 x2 = 1.5 ≥ 1 − 2 ≥
x2 1
Z = 31.5

6
x1 ,x2 ≥ 0
4
A b)
Point A is optimal x2
2 Feasible

space B 120
x1
0 2 4 6 8 10 12 14 *A : x1 = 68.96 B : x1 = 96.77
100
34. x2 = 34.48 x2 = 0
Z = 410.35 Z = 401.6
x2

80 Point A is optimal
12 A : x1 = 4
x2 = 3.5
10 Z = 19
60
*B : x1 = 5
8
x2 = 3
6 Z = 21
40
A C : x1 = 4
4 A
B x2 = 1
2 Z = 14
20
0 C

x1
–10 –8 –6 –4 –2 2 4 6 8 10 12
B
–2 x1
Point B is optimal 0 20 40 60 80 100 120

–4
37. No additional profit, freezer space is not
–6 a binding constraint.
–8 38. a) Minimize Z = 200x1 + 160x2 (cost, $)
subject to
35.
6x1 + 2x2 ≥ 12 (high-grade ore, tons)
x2
2x1 + 2x2 ≥ 8 (medium-grade ore, tons)

12 *A : x1 = 3.2 4x1 + 12x2 ≥ 24 (low-grade ore, tons)

x2 = 6
x ,x ≥ 0
10 Z = 37.6
1 2

B : x1 = 5.33
b)
8
x2 = 3.33 x2
A
6 Z = 49.3 14 A : x1 = 0 C : x1 = 3
C : x1 = 9.6 x2 = 6 x2 = 1
4 12
x2 = 1.2 Z = 960 Z = 760
B
2 Z = 79.2 *B : x1 = 1 D : x1 = 6
10
x2 = 3 x2 = 0
0 C
x1 8 Z = 680
2 4 6 8 10 12 14 Z = 1,200

–2 Point A is optimal A
6

2-7
Copyright © 2013 Pearson Education, Inc. publishing as Prentice Hall
4 B 2 Point B is optimal
C
D
x1
0 2 4 6 8 10 12 14

2-8
Copyright © 2013 Pearson Education, Inc. publishing as Prentice Hall
39. a) Maximize Z = 800x1 + 900x2 (profit, $) The slope of the new objective function
subject to is computed as follows:
2x1 + 4x2 ≤ 30 (stamping, days) Z = 90x1 + 70x2
4x1 + 2x2 ≤ 30 (coating, days) 70x2 = Z − 90x1
x1 + x2 ≥ 9 (lots) x2 = Z/70 − 9/7x1
x1,x2 ≥ 0 slope = −9/7
b) The change in the objective function not
only changes the Z values but also results
x2 in a new solution point, C. The slope of
14 A : x1 = 3
the new objective function is steeper and
thus changes the solution point.
12 x2 = 6
Z = 7,800 A: x1 = 0 C: x1 = 5.3

10 * B : x1 = 5 x =8 x = 4.7
2 2
x2 = 5 Z = 560 Z = 806
8
Z = 8,500
B: x1 = 3.3 D: x1 = 8
6 B C : x1 = 6
A x = 6.7 x =0
2 2
x2 = 3
4 C Z = 766 Z = 720
Z = 7,500
2 Point B is optimal 42. a) Maximize Z = 9x1 + 12x2 (profit, $1,000s)
subject to
x1
0 2 4 6 8 10 12 14 16 4x1 + 8x2 ≤ 64 (grapes, tons)
3

40. a) Maximize Z = 30x1 + 70x2 (profit, $) 5x1 + 5x2 ≤ 50 (storage space, yd )

subject to 15x1 + 8x2 ≤ 120 (processing time, hr)
4x1 + 10x2 ≤ 80 (assembly, hr) x1 ≤ 7 (demand, Nectar)
14x1 + 8x2 ≤ 112 (finishing, hr) x2 ≤ 7 (demand, Red)
x1 + x2 ≤ 10 (inventory, units) x1,x2 ≥ 0
x1,x2 ≥ 0 b)
b) x2

18 A : x1 = 0 D : x1 = 5.71
x2
x2 = 7 x2 = 4.28
16 Z = 84
14 A : x1 = 0 C : x1 = 5.3 Z = 102.79
x2 = 8 x2 = 4.7 B : x1 = 2 E : x1 = 7
12 14
Z = 560 Z = 488 x2 = 7 x2 = 1.875
* B : x1 = 3.3 Z = 102 Z = 85.5
10 D : x1 = 8 12
x2 = 6.7 *C : x1 = 4 F : x1 = 7
x2 = 0
8 10 x2 = 6 x2 = 0
A Z = 568 Z = 240
Z = 108 Z = 63
6 B
8
Point B is optimal
C
Optimal point
4 A B
6 C
2 4 D
D
x1
0 2 4 6 8 10 12 14 16 18 20 2 E

41. The slope of the original objective 70x2 = Z − 30x1

function is computed as follows: x2 = Z/70 − 3/7x1
Z = 30x1 + 70x2 slope = −3/7

2-8
Copyright © 2013 Pearson Education, Inc. publishing as Prentice Hall
 F
x1
0 2 4 6 8 10 12 14
16 18

43. a) 15(4) + 8(6) ≤

120 hr
60 + 48 ≤ 120
108 ≤ 120
120 − 108 = 12 hr left unused

2-9
Copyright © 2013 Pearson Education, Inc. publishing as Prentice Hall
Another random document with
no related content on Scribd:
 1.E.5. Do not copy, display, perform, distribute or redistribute
this electronic work, or any part of this electronic work, without
prominently displaying the sentence set forth in paragraph 1.E.1
with active links or immediate access to the full terms of the
Project Gutenberg™ License.

1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if
you provide access to or distribute copies of a Project
Gutenberg™ work in a format other than “Plain Vanilla ASCII” or
other format used in the official version posted on the official
Project Gutenberg™ website (www.gutenberg.org), you must, at
no additional cost, fee or expense to the user, provide a copy, a
means of exporting a copy, or a means of obtaining a copy upon
request, of the work in its original “Plain Vanilla ASCII” or other
form. Any alternate format must include the full Project
Gutenberg™ License as specified in paragraph 1.E.1.

1.E.7. Do not charge a fee for access to, viewing, displaying,

performing, copying or distributing any Project Gutenberg™
works unless you comply with paragraph 1.E.8 or 1.E.9.

1.E.8. You may charge a reasonable fee for copies of or

providing access to or distributing Project Gutenberg™
electronic works provided that:

• You pay a royalty fee of 20% of the gross profits you derive from
the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information
 about donations to the Project Gutenberg Literary Archive
Foundation.”

• You provide a full refund of any money paid by a user who

notifies you in writing (or by e-mail) within 30 days of receipt that
s/he does not agree to the terms of the full Project Gutenberg™
License. You must require such a user to return or destroy all
copies of the works possessed in a physical medium and
discontinue all use of and all access to other copies of Project
Gutenberg™ works.

• You provide, in accordance with paragraph 1.F.3, a full refund of

any money paid for a work or a replacement copy, if a defect in
the electronic work is discovered and reported to you within 90
days of receipt of the work.

• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.

1.E.9. If you wish to charge a fee or distribute a Project

Gutenberg™ electronic work or group of works on different
terms than are set forth in this agreement, you must obtain
permission in writing from the Project Gutenberg Literary
Archive Foundation, the manager of the Project Gutenberg™
trademark. Contact the Foundation as set forth in Section 3
below.

1.F.

1.F.1. Project Gutenberg volunteers and employees expend

considerable effort to identify, do copyright research on,
transcribe and proofread works not protected by U.S. copyright
law in creating the Project Gutenberg™ collection. Despite
these efforts, Project Gutenberg™ electronic works, and the
medium on which they may be stored, may contain “Defects,”
such as, but not limited to, incomplete, inaccurate or corrupt
data, transcription errors, a copyright or other intellectual
property infringement, a defective or damaged disk or other
medium, a computer virus, or computer codes that damage or
cannot be read by your equipment.

1.F.2. LIMITED WARRANTY, DISCLAIMER OF DAMAGES -

Except for the “Right of Replacement or Refund” described in
paragraph 1.F.3, the Project Gutenberg Literary Archive
Foundation, the owner of the Project Gutenberg™ trademark,
and any other party distributing a Project Gutenberg™ electronic
work under this agreement, disclaim all liability to you for
damages, costs and expenses, including legal fees. YOU
AGREE THAT YOU HAVE NO REMEDIES FOR NEGLIGENCE,
STRICT LIABILITY, BREACH OF WARRANTY OR BREACH
OF CONTRACT EXCEPT THOSE PROVIDED IN PARAGRAPH
1.F.3. YOU AGREE THAT THE FOUNDATION, THE
TRADEMARK OWNER, AND ANY DISTRIBUTOR UNDER
THIS AGREEMENT WILL NOT BE LIABLE TO YOU FOR
ACTUAL, DIRECT, INDIRECT, CONSEQUENTIAL, PUNITIVE
OR INCIDENTAL DAMAGES EVEN IF YOU GIVE NOTICE OF
THE POSSIBILITY OF SUCH DAMAGE.

1.F.3. LIMITED RIGHT OF REPLACEMENT OR REFUND - If

you discover a defect in this electronic work within 90 days of
receiving it, you can receive a refund of the money (if any) you
paid for it by sending a written explanation to the person you
received the work from. If you received the work on a physical
medium, you must return the medium with your written
explanation. The person or entity that provided you with the
defective work may elect to provide a replacement copy in lieu
of a refund. If you received the work electronically, the person or
entity providing it to you may choose to give you a second
opportunity to receive the work electronically in lieu of a refund.
If the second copy is also defective, you may demand a refund
in writing without further opportunities to fix the problem.

1.F.4. Except for the limited right of replacement or refund set

forth in paragraph 1.F.3, this work is provided to you ‘AS-IS’,
WITH NO OTHER WARRANTIES OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO
WARRANTIES OF MERCHANTABILITY OR FITNESS FOR
ANY PURPOSE.

1.F.5. Some states do not allow disclaimers of certain implied

warranties or the exclusion or limitation of certain types of
damages. If any disclaimer or limitation set forth in this
agreement violates the law of the state applicable to this
agreement, the agreement shall be interpreted to make the
maximum disclaimer or limitation permitted by the applicable
state law. The invalidity or unenforceability of any provision of
this agreement shall not void the remaining provisions.

1.F.6. INDEMNITY - You agree to indemnify and hold the

Foundation, the trademark owner, any agent or employee of the
Foundation, anyone providing copies of Project Gutenberg™
electronic works in accordance with this agreement, and any
volunteers associated with the production, promotion and
distribution of Project Gutenberg™ electronic works, harmless
from all liability, costs and expenses, including legal fees, that
arise directly or indirectly from any of the following which you do
or cause to occur: (a) distribution of this or any Project
Gutenberg™ work, (b) alteration, modification, or additions or
deletions to any Project Gutenberg™ work, and (c) any Defect
you cause.

Section 2. Information about the Mission of

Project Gutenberg™
Project Gutenberg™ is synonymous with the free distribution of
electronic works in formats readable by the widest variety of
computers including obsolete, old, middle-aged and new
computers. It exists because of the efforts of hundreds of
volunteers and donations from people in all walks of life.

Volunteers and financial support to provide volunteers with the

assistance they need are critical to reaching Project
Gutenberg™’s goals and ensuring that the Project Gutenberg™
collection will remain freely available for generations to come. In
2001, the Project Gutenberg Literary Archive Foundation was
created to provide a secure and permanent future for Project
Gutenberg™ and future generations. To learn more about the
Project Gutenberg Literary Archive Foundation and how your
efforts and donations can help, see Sections 3 and 4 and the
Foundation information page at www.gutenberg.org.

Section 3. Information about the Project

Gutenberg Literary Archive Foundation
The Project Gutenberg Literary Archive Foundation is a non-
profit 501(c)(3) educational corporation organized under the
laws of the state of Mississippi and granted tax exempt status by
the Internal Revenue Service. The Foundation’s EIN or federal
tax identification number is 64-6221541. Contributions to the
Project Gutenberg Literary Archive Foundation are tax
deductible to the full extent permitted by U.S. federal laws and
your state’s laws.

The Foundation’s business office is located at 809 North 1500

West, Salt Lake City, UT 84116, (801) 596-1887. Email contact
links and up to date contact information can be found at the
Foundation’s website and official page at
www.gutenberg.org/contact

Section 4. Information about Donations to

the Project Gutenberg Literary Archive
Foundation
Project Gutenberg™ depends upon and cannot survive without
widespread public support and donations to carry out its mission
of increasing the number of public domain and licensed works
that can be freely distributed in machine-readable form
accessible by the widest array of equipment including outdated
equipment. Many small donations ($1 to $5,000) are particularly
important to maintaining tax exempt status with the IRS.

The Foundation is committed to complying with the laws

regulating charities and charitable donations in all 50 states of
the United States. Compliance requirements are not uniform
and it takes a considerable effort, much paperwork and many
fees to meet and keep up with these requirements. We do not
solicit donations in locations where we have not received written
confirmation of compliance. To SEND DONATIONS or
determine the status of compliance for any particular state visit
www.gutenberg.org/donate.

While we cannot and do not solicit contributions from states

where we have not met the solicitation requirements, we know
of no prohibition against accepting unsolicited donations from
donors in such states who approach us with offers to donate.

International donations are gratefully accepted, but we cannot

make any statements concerning tax treatment of donations
received from outside the United States. U.S. laws alone swamp
our small staff.

Please check the Project Gutenberg web pages for current

donation methods and addresses. Donations are accepted in a
number of other ways including checks, online payments and
credit card donations. To donate, please visit:
www.gutenberg.org/donate.

Section 5. General Information About Project

Gutenberg™ electronic works
Professor Michael S. Hart was the originator of the Project
Gutenberg™ concept of a library of electronic works that could
be freely shared with anyone. For forty years, he produced and
distributed Project Gutenberg™ eBooks with only a loose
network of volunteer support.

Project Gutenberg™ eBooks are often created from several

printed editions, all of which are confirmed as not protected by
copyright in the U.S. unless a copyright notice is included. Thus,
we do not necessarily keep eBooks in compliance with any
particular paper edition.

Most people start at our website which has the main PG search
facility: www.gutenberg.org.

This website includes information about Project Gutenberg™,

including how to make donations to the Project Gutenberg
Literary Archive Foundation, how to help produce our new
eBooks, and how to subscribe to our email newsletter to hear
about new eBooks.