Introduction to Management Science 13th Edition Anderson Solutions Manual - PDF Format Is Available With All Chapters
Introduction to Management Science 13th Edition Anderson Solutions Manual - PDF Format Is Available With All Chapters
https://testbankdeal.com/product/introduction-to-management-
science-13th-edition-anderson-test-bank/
https://testbankdeal.com/product/introduction-to-management-science-
quantitative-13th-edition-anderson-test-bank/
https://testbankdeal.com/product/introduction-to-management-science-
quantitative-approach-15th-edition-anderson-solutions-manual/
https://testbankdeal.com/product/development-across-the-life-span-8th-
edition-feldman-solutions-manual/
Essentials of Marketing Research A Hands-On Orientation
1st Edition Malhotra Test Bank
https://testbankdeal.com/product/essentials-of-marketing-research-a-
hands-on-orientation-1st-edition-malhotra-test-bank/
https://testbankdeal.com/product/cfin-5th-edition-besley-test-bank/
https://testbankdeal.com/product/mechanisms-and-machines-kinematics-
dynamics-and-synthesis-si-edition-1st-edition-stanisic-solutions-
manual/
https://testbankdeal.com/product/american-promise-value-volume-1-7th-
edition-roark-test-bank/
Starting out with Visual C 4th Edition Gaddis Test Bank
https://testbankdeal.com/product/starting-out-with-visual-c-4th-
edition-gaddis-test-bank/
Chapter 7
Integer Linear Programming
Learning Objectives
1. Be able to recognize the types of situations where integer linear programming problem formulations
are desirable.
2. Know the difference between all-integer and mixed integer linear programming problems.
3. Be able to solve small integer linear programs with a graphical solution procedure.
4. Be able to formulate and solve fixed charge, capital budgeting, distribution system, and product
design problems as integer linear programs.
5. See how zero-one integer linear variables can be used to handle special situations such as multiple
choice, k out of n alternatives, and conditional constraints.
Solutions:
7-1
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Chapter 7
x1 , x2 0
b. This is an all-integer linear program. Its LP Relaxation just requires dropping the words "and
integer" from the last line.
2. a.
b. The optimal solution to the LP Relaxation is given by x1 = 1.43, x2 = 4.29 with an objective function
value of 41.47.
Rounding down gives the feasible integer solution x1 = 1, x2 = 4. Its value is 37.
c.
7-2
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Integer Linear Programming
x2
5x
1 +
3 8x
2 =
40
0 x1
0 1 2 3 4 5 6 7 8
The optimal solution is given by x1 = 0, x2 = 5. Its value is 40. This is not the same solution as that
found by rounding down. It provides a 3 unit increase in the value of the objective function.
3. a.
b. The optimal solution to the LP Relaxation is shown on the above graph to be x1 = 4, x2 = 1. Its
7-3
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Chapter 7
value is 5.
c. The optimal integer solution is the same as the optimal solution to the LP Relaxation. This is always
the case whenever all the variables take on integer values in the optimal solution to the LP
Relaxation.
4. a.
The value of the optimal solution to the LP Relaxation is 36.7 and it is given by x1 = 3.67, x2 = 0.0.
Since we have all less-than-or-equal-to constraints with positive coefficients, the solution obtained
by "rounding down" the values of the variables in the optimal solution to the LP Relaxation is
feasible. The solution obtained by rounding down is x1 = 3, x2 = 0 with value 30.
Thus a lower bound on the value of the optimal solution is given by this feasible integer solution
with value 30. An upper bound is given by the value of the LP Relaxation, 36.7. (Actually an upper
bound of 36 could be established since no integer solution could have a value between 36 and 37.)
b.
7-4
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Integer Linear Programming
x2
4 10 x1 + 3 x 2 = 36
0 x1
0 1 2 3 4 5
The optimal solution to the ILP is given by x1 = 3, x2 = 2. Its value is 36. The solution found by
"rounding down" the solution to the LP relaxation had a value of 30. A 20% increase in this value
was obtained by finding the optimal integer solution - a substantial difference if the objective
function is being measured in thousands of dollars.
7-5
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Chapter 7
c.
x2
..
Optimal solution to
6 LP relaxation (0,5.71)
(2.47,3.60)
4
3x1 + 6x2 = 30
2
1 (3.67,0)
0 x1
0 1 2 3 4 5
The optimal solution to the LP Relaxation is x1= 0, x2 = 5.71 with value = 34.26. The solution
obtained by "rounding down" is x1 = 0, x2 = 5 with value 30. These two values provide an upper
bound of 34.26 and a lower bound of 30 on the value of the optimal integer solution.
7-6
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Integer Linear Programming
5. a.
The feasible mixed integer solutions are indicated by the boldface vertical lines in the graph above.
b. The optimal solution to the LP relaxation is given by x1 = 3.14, x2 = 2.60. Its value is 14.08.
Rounding the value of x1 down to find a feasible mixed integer solution yields x1 = 3, x2 = 2.60 with
a value of 13.8. This solution is clearly not optimal. With x1 = 3 we can see from the graph that x2
can be made larger without violating the constraints.
c.
The optimal solution to the MILP is given by x1 = 3, x2 = 2.67. Its value is 14.
7-7
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Chapter 7
6. a.
x2
7
Optimal solution to
6 LP relaxation (1.96, 5.48)
5
x1 + x 2 = 7.44
4
0 x1
0 1 2 3 4 5 6 7 8
b. The optimal solution to the LP Relaxation is given by x1 = 1.96, x2 = 5.48. Its value is 7.44. Thus
an upper bound on the value of the optimal is given by 7.44.
Rounding the value of x2 down yields a feasible solution of x1 = 1.96, x2 = 5 with value 6.96. Thus
a lower bound on the value of the optimal solution is given by 6.96.
7-8
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Integer Linear Programming
c.
x2
x1 + x 2 = 7.29
4
0 x1
0 1 2 3 4 5 6 7 8
7. a. x1 + x3 + x5 + x6 = 2
b. x3 - x5 = 0
c. x1 + x4 = 1
d. x4 x1
x4 x3
e. x4 x1
x4 x3
x4 x1 + x3 - 1
7-9
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Chapter 7
x3 = 1
x4 = 1
x6 = 1
Value = 17,500
9. a. x4 8000 s4
b. x6 6000 s6
c. x4 8000 s4
x6 6000 s6
s4 + s6 = 1
7 - 10
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Integer Linear Programming
min xA + xB + xC + xD + xE + xF + xG
s.t.
xA + xB + xC + xG 1 (area 1 covered)
xB + xD 1 (area 2 covered)
xC + xE 1 (area 3 covered)
xD + xE + xF 1 (area 4 covered)
xA + xB + xC + xD + xF + xG 1 (area 5 covered)
xE + xF + xG 1 (area 6 covered)
xA + xB + xG 1 (area 7 covered)
P1 = 60
P2 = 80 Value = 5540
P3 = 60
c. Since the solution in part (b) calls for producing all three products, the total setup cost is
Subtracting the total setup cost from the profit in part (b), we see that
d. We introduce a 0-1 variable yi that is one if any quantity of product i is produced and zero otherwise.
With the maximum production quantities provided by management, we obtain 3 new constraints:
P1 175y1
P2 150y2
P3 140y3
Bringing the variables to the left-hand side of the constraints, we obtain the following fixed charge
formulation of the Hart problem.
7 - 11
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Chapter 7
P1 = 100 y1 = 1
P2 = 100 y2 = 1 Value = 4350
P3 = 0 y3 = 0
The profit associated with this solution is $4350. This is an improvement of $360 over the solution
in part (c).
12. a. Constraints
P 15 + 15YP
D 15 + 15YD
J 15 + 15YJ
YP + YD + YJ 1
P, D, J 0
YP, YD, YJ = 0, 1
7 - 12
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Integer Linear Programming
13. a. One just needs to add the following multiple choice constraint to the problem.
y1 + y2 = 1
New Optimal Solution: y1 = 1, y3 = 1, x12 = 10, x31 = 30, x52 = 10, x53 = 20
Value = 940
b. Since one plant is already located in St. Louis, it is only necessary to add the following constraint to
the model
y3 + y4 1
Value = 860
The following table shows the options which involve modernizing two plants.
700 1300 No
1100 900 Yes 60
900 1400 Yes 65
600 700 No
1200 1200 Yes 70
1000 1700 Yes 75
700 1000 No
1400 1300 Yes 75
1100 600 No
900 1100 Yes 60
7 - 13
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Chapter 7
1 if plant i is modernized
c. Let xi =
0 if plant i is not modernized
d. Optimal Solution: x1 = x3 = 1.
The objective function for an integer programming model calls for minimizing the population not
served.
There are 13 constraints needed; each is written so that yi will be forced to equal one whenever it is
not possible to do business in county i.
Constraint 1: x1 + x2 + x3 + y1 1
Constraint 2: x1 + x2 + x3 + x4 + x6 + x7 + y2 1
• • •
• • •
• • •
Constraint 13: x11 + x12 + x13 + y13 1
One more constraint must be added to reflect the requirement that only one principal place of
business may be established.
x1 + x2 + • • • + x13 = 1
The optimal solution has a principal place of business in County 11 with an optimal value of
739,000. A population of 739,000 cannot be served by this solution. Counties 1-5 and 10 will not
be served.
b. The only change necessary in the integer programming model for part a is that the right-hand side of
the last constraint is increased from 1 to 2.
x1 + x2 + • • • + x13 = 2.
The optimal solution has principal places of business in counties 3 and 11 with an optimal value of
76,000. Only County 10 with a population of 76,000 is not served.
7 - 14
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Integer Linear Programming
c. It is not the best location if only one principal place of business can be established; 1,058,000
customers in the region cannot be served. However, 642,000 can be served and if there is no
opportunity to obtain a principal place of business in County 11, this may be a good start. Perhaps
later there will be an opportunity in County 11.
16. a.
min 105x9 + 105x10 + 105x11 + 32y9 + 32y10 + 32y11 + 32y12 + 32y1 + 32y2 + 32y3
x9 + y9 6
x9 + x10 + y9 + y10 4
x9 + x10 + x11 + y9 + y10 + y11 8
x9 + x10 + x11 + y9 + y10 + y11 + y12 10
x10 + x11 + y10 + y11 + y12 + y1 9
x9 x11 + y11 + y12 + y1 + y2 6
x9 + x10 + y12 + y1 + y2 + y3 4
x9 + x10 + x11 + y1 + y2 + y3 7
x10 + x11 + y 2 + y3 6
x11 + y3 6
c. The solution to the LP Relaxation is integral therefore it is the optimal solution to the integer
program.
A difficulty with this solution is that only part-time employees are used; this may cause problems
with supervision, etc. The large surpluses from 5, 12-1 (4 employees), and 3-4 (9 employees)
indicate times when the tellers are not needed for customer service and may be reassigned to other
tasks.
x9 1
x11 1
x9 +x10 + x11 5
x9 = 1 y9 = 5
x11 = 4 y12 = 5
y3 = 2
There is now much less reliance on part-time employees. The new solution uses 5 full-time
employees and 12 part-time employees; the previous solution used no full-time employees and 21
part-time employees.
7 - 15
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Chapter 7
Min x1 + x2 + x3 + x4 + x5 + x6 + x7
s.t.
x1 + x2 + x4 + x6 1 (Lorain)
x1 + x2 + x3 + x4 1 (Huron)
x2 + x3 + x4 + x7 1 (Richland)
x1 + x2 + x3 + x4 + x5 + x6 + x7 1 (Ashland)
x4 + x5 + x6 1 (Wayne)
x1 + x4 + x5 + x6 1 (Medina)
x3 + x4 + x7 1 (Knox)
b. Locating a principal place of business in Ashland county will permit Ohio Trust to do business in all
7 counties.
18. a. Add the part-worths for Antonio's Pizza for each consumer in the Salem Foods' consumer panel.
Max y1 + y2 + y3 + y4 + y5 + y6 + y7 + y8
s.t.
11l11 + 2l21 + 6l12 + 7l22 + 3l13 + 17l23 + 26l14 + 27l24 + 8l34 - 52y1 1
11l11 + 7l21 + 15l12 + 17l22 + 16l13 + 26l23 + 14l14 + 1l24 + 10l34 - 49y2 1
7l11 + 5l21 + 8l12 + 14l22 + 16l13 + 7l23 + 29l14 + 16l24 + 19l34 - 36y3 1
13l11 + 20l21 + 20l12 + 17l22 + 17l13 + 14l23 + 25l14 + 29l24 + 10l34 - 83y4 1
2l11 + 8l21 + 6l12 + 11l22 + 30l13 + 20l23 + 15l14 + 5l24 + 12l34 - 39y5 1
12l11 + 17l21 + 11l12 + 9l22 + 2l13 + 30l23 + 22l14 + 12l24 + 20l34 - 70y6 1
9l11 + 19l21 + 12l12 + 16l22 + 16l13 + 25l23 + 30l14 + 23l24 + 19l34 - 79y7 1
5l11 + 9l21 + 4l12 + 14l22 + 23l13 + 16l23 + 16l14 + 30l24 + 3l34 - 59y8 1
l11 + l21 =1
l12 + l22 =1
l13 + l23 =1
l14 + l24 + l34 =1
7 - 16
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Integer Linear Programming
The optimal solution shows l21 = l22 = l23 = l24 = 1. This calls for a pizza with a thick crust, a cheese
blend, a chunky sauce, and medium sausage. With y1 = y2 = y3 = y5 = y7 = y8 = 1, we see that 6 of the
8 people in the consumer panel will prefer this pizza to Antonio's.
Max y1 + y2 + y3 + y4 + y5 + y6
s.t.
The optimal solution obtained using LINDO on Excel shows l11 = l32 = l13 = 1. This indicates that a
cereal with a low wheat/corn ratio, artificial sweetener, and no flavor bits will maximize the share of
choices.
The optimal solution also has y4 = y5 = y7 = 1 which indicates that children 4, 5, and 7 will prefer this
cereal.
b. The coefficients for the yi variable must be changed to -70 in constraints 1-4 and to -80 in constraints
5-7.
The new optimal solution has l21 = l12 = l23 = 1. This is a cereal with a high wheat/corn ratio, a sugar
sweetener, and no flavor bits. Four children will prefer this design: 1, 2, 4, and 5.
d. x1 = x3 = 1; modernize the Michigan plant and the first New York plant.
7 - 17
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Chapter 7
d. x3 = x6 = x9 = x11 = x12 = 1. Thus, cameras should be located at openings 3, 6, 9, 11, and 12.
The following two constraints will guarantee that the team size will be 3, 5, or 7.
Of course, the variables in the first constraint will need to be brought to the left hand side if a
computer solution is desired.
23. a. A mixed integer linear program can be set up to solve this problem. Binary variables are used to
indicate whether or not we setup to produce the subassemblies.
7 - 18
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Integer Linear Programming
A mixed integer linear programming model for solving this problem follows. There are 11
constraints. Constraints (1) to (5) are to satisfy demand. Constraint (6) reflects the limitation on
manufacturing time. Finally, constraints (7) - (11) are constraints not allowing production unless the
setup variable equals 1. Variables SB, STVC, SVCRC, STVP, and SVCRP must be specified as 0/1.
MIN
0.4BM+2.9TVCM+3.15VCRCM+0.3TVPM+0.55VCRPM+0.65BP+3.45TVCP+3.7VCRCP+
0.5TVPP+0
.7VCRPP+1000SB+1200STVC+1900SVCRC+1500STVP+1500SVCRP
S.T.
1) 1BM+1BP=12000
2) +1TVCM+1TVCP=7000
3) +1VCRCM+1VCRCP=5000
4) +1TVPM+1TVPP=7000
5) +1VCRPM+1VCRPP=5000
6) 0.9BM+2.2TVCM+3VCRCM+0.8TVPM+1VCRPM <= 30000
7) 1BM-12000SB <= 0
8) +1TVCM-7000STVC <=0
9) +1VCRCM-5000SVCRC <=0
10) +1TVPM-7000STVP <=0
11) +1VCRPM-5000SVCRP <=0
OPTIMAL SOLUTION
Variable Value
-------------- ---------------
BM 12000.000
TVCM 7000.000
VCRCM 0.000
TVPM 0.000
VCRPM 0.000
BP 0.000
TVCP 0.000
VCRCP 5000.000
TVPP 7000.000
VCRPP 5000.000
SB 1.000
STVC 1.000
SVCRC 0.000
STVP 0.000
SVCRP 0.000
7 - 19
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Chapter 7
Constraint Slack/Surplus
-------------- ---------------
1 0.000
2 0.000
3 0.000
4 0.000
5 0.000
6 3800.000
7 0.000
8 0.000
9 0.000
10 0.000
11 0.000
b. This part can be solved by changing appropriate coefficients in the formulation for part (a). The
coefficient of SVCRC becomes 3000 and the coefficient of VCRCM becomes 2.6 in the objective
function. Also, the coefficient of VCRCM becomes 2.5 in constraint (6). The new optimal solution
is shown below.
OPTIMAL SOLUTION
Variable Value
-------------- ---------------
BM 0.000
TVCM 7000.000
VCRCM 5000.000
TVPM 0.000
VCRPM 0.000
BP 12000.000
TVCP 0.000
VCRCP 0.000
TVPP 7000.000
VCRPP 5000.000
SB 0.000
STVC 1.000
SVCRC 1.000
STVP 0.000
SVCRP 0.000
Constraint Slack/Surplus
-------------- ---------------
1 0.000
2 0.000
3 0.000
4 0.000
5 0.000
6 2100.000
7 0.000
8 0.000
9 0.000
7 - 20
© 2010 Cengage Learning. All Rights Reserved.
May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Another Random Scribd Document
with Unrelated Content
He sniffed suspiciously, and rearranged his cravat in the
mirror upon the wall.
“Very well, my dear sir,” I called after him down the hospital
ward, “when Sir Charles Renton asks for your explanation of
your conduct to-day, you will perhaps regret that you were
not a little more civil.”
My words fell upon him, causing him to turn back. Mention
of the name of the head of his particular department of the
Foreign Office stirred the thought within him that he might,
after all, be acting contrary to his own interests. He was a
toady and place-seeker of the first water.
“Now you recognise me, I’ll tell you all that occurred,” I said
quickly. And then I related to them both in detail all the
startling incidents, just as I have already written them
down.
“Yes,” I said.
Within half an hour an active search was being made for the
four who had sat at table that night at Biffi’s, and although I
hoped that the assassin would be caught, I felt a little
apprehensive lest Marigold should fall into the hands of the
police and the Earl’s name be dragged into the criminal
court.
“Why, what’s the matter with your head?” asked old Lord
Cotterstock, noticing a bandage upon it as I raised my straw
hat.
“Oh, nothing very much,” I answered then. “I slipped on the
kerb in the Strand, fell back, and struck it rather badly. But
it’s getting better. The unsightliness of the plaster is its
worst part.”
The colour had left her cheeks when her startled eyes
encountered me, and she glared at me as though I were a
ghost. By that alone I knew that my re-appearance there
was utterly unexpected—in truth, that she believed that I
was dead!
She had turned away from the party at once, to speak with
the stud-groom in order to conceal her dismay. Her face
had, in an instant, assumed a death-like pallor, and I saw
how anxious she was to escape me. Though she made a
desperate effort to remain calm and to face me, she was
unable, for her attitude in itself betrayed her guilty
knowledge.
“You!” I cried.
I related how the doctor, Pink, had been called to the girl,
and of the investigations he and I made afterwards,
whereupon he said, smiling—
“Why?”
“At least you know who the man was?” I said. “You have
already mentioned his name.”
“Can you tell me why he, a perfect stranger, wore upon his
finger the portrait of Lady Lolita?” I asked.
“I don’t know.”
“If so, then she must know the truth, Mr Keene,” I said in a
hard voice, watching his dark face. “What I want to discover
is the reason he came here in secret that night.”
“If you really desire to decipher it, and think it will help you
to a knowledge of the real facts, why not try the single and
very unusual word—her own name!”
“Lolita!” I gasped quickly in eagerness. “Then the keyword
is Lolita!”
At last the secret was mine! Very soon I had deciphered the
numerals into this message:—
“Ah! and that’s pretty near the mark too,” observed Lord
Cotterstock, who had himself been in the diplomatic service.
“It is said of Lord Barmouth that when he was Ambassador
at the Porte, he, for a joke, wore the Blue Ribbon, and the
Turkish Court thought it the highest of British distinctions.
He told the unspeakable ones that it was the Order of Saint
Schweppe!”
“Her ladyship has a very bad headache, sir. She’s been lying
down. But she’s now in her boudoir writing, and has told me
that I am not to disturb her this evening.”
“No, sir,” replied the maid anxiously. “I’ve noticed this last
week or two a very great change in her. She seems highly
nervous, and when alone always thinking very deeply, and—
and—”
“Very well, sir,” was the maid’s reply, and then I descended
to the long meal, where the chatter was gay, and the
serving of the most ceremonious character.
“But—”
I went to the grate and saw that every particle of paper had
been consumed.
“I think her ladyship must have gone out. Her cape and
motor-cap have gone.”
“Of what I will reveal on our return to the Hall,” was the
man’s answer. “You know much that you have not told, but
to save her ladyship here, I will now make the whole thing
plain.”
“But why have you not spoken before? You had plenty of
opportunity,” Keene remarked.
The four of us were silent, all too occupied with own our
thoughts to discuss the matter with each other. The sudden
determination of the man Logan showed me that he meant
at last to tell all that he knew.
“Her ladyship is with the Earl in the blue boudoir, sir.” And
eyeing Logan with some surprise, he added, “Will you step
this way?”
She tried to face Lolita, the woman whom she had hounded
to her death, but her gaze wavered, and I saw that her
effort to regain her self-composure was an utterly vain one.
She trembled visibly from head to foot, while the expression
in her eyes was sufficient to show the terror now consuming
her.
The Earl noticing the change in her, and how she shrank
from us, looked from Keene to the stranger, and asked—
“Well, sir? I have not the pleasure of knowing you. Who are
you?”
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
testbankdeal.com