Quantitative Methods For Business 13Th Edition Anderson Test Bank Full Chapter PDF

Quantitative Methods for Business 13th
Edition Anderson Test Bank

Visit to download the full and correct content document: https://testbankdeal.com/dow
nload/quantitative-methods-for-business-13th-edition-anderson-test-bank/
Chapter 10 - Distribution & Network Models
True / False
1. Whenever total supply is less than total demand in a transportation problem, the LP model does not determine how the
unsatisfied demand is handled.
a. True
b. False
ANSWER: True
POINTS: 1
TOPICS: Transportation problem
2. Converting a transportation problem LP from cost minimization to profit maximization requires only changing the
objective function; the conversion does not affect the constraints.
a. True
b. False
ANSWER: True
POINTS: 1
3. A transportation problem with 3 sources and 4 destinations will have 7 decision variables.
a. True
b. False
ANSWER: False
POINTS: 1
4. If a transportation problem has four origins and five destinations, the LP formulation of the problem will have nine
constraints.
a. True
b. False
ANSWER: True
POINTS: 1
5. The capacitated transportation problem includes constraints which reflect limited capacity on a route.
a. True
b. False
ANSWER: True
POINTS: 1
6. When the number of agents exceeds the number of tasks in an assignment problem, one or more dummy tasks must be
introduced in the LP formulation or else the LP will not have a feasible solution.
a. True
b. False
ANSWER: False
POINTS: 1
Cengage Learning Testing, Powered by Cognero Page 1
TOPICS: Assignment problem
7. A transshipment constraint must contain a variable for every arc entering or leaving the node.
a. True
b. False
ANSWER: True
POINTS: 1
TOPICS: Transshipment problem
8. The shortest-route problem is a special case of the transshipment problem.

a. True
b. False
ANSWER: True
POINTS: 1
TOPICS: Shortest-route problem
9. Transshipment problem allows shipments both in and out of some nodes while transportation problems do not.
a. True
b. False
ANSWER: True
POINTS: 1
TOPICS: Transportation and transshipment problems
10. A dummy origin in a transportation problem is used when supply exceeds demand.
a. True
b. False
ANSWER: False
POINTS: 1
11. When a route in a transportation problem is unacceptable, the corresponding variable can be removed from the LP
formulation.
a. True
b. False
ANSWER: True
POINTS: 1
12. In the LP formulation of a maximal flow problem, a conservation-of-flow constraint ensures that an arc's flow
capacity is not exceeded.
a. True
b. False
ANSWER: False
POINTS: 1
TOPICS: Maximal flow problem

13. The maximal flow problem can be formulated as a capacitated transshipment problem.
a. True
b. False
ANSWER: True
POINTS: 1
14. The direction of flow in the shortest-route problem is always out of the origin node and into the destination node.
a. True
b. False
ANSWER: True
POINTS: 1
15. A transshipment problem is a generalization of the transportation problem in which certain nodes are neither supply
nodes nor destination nodes.
a. True
b. False
ANSWER: True
POINTS: 1
16. The assignment problem is a special case of the transportation problem in which all supply and demand values equal
one.
a. True
b. False
ANSWER: True
POINTS: 1
17. A transportation problem with 3 sources and 4 destinations will have 7 variables in the objective function.
a. True
b. False
ANSWER: False
POINTS: 1
18. Flow in a transportation network is limited to one direction.

a. True
b. False
ANSWER: True
POINTS: 1
19. In a transportation problem with total supply equal to total demand, if there are four origins and seven destinations,
and there is a unique optimal solution, the optimal solution will utilize 11 shipping routes.
a. True
b. False
ANSWER: False
POINTS: 1
20. In the general assignment problem, one agent can be assigned to several tasks.
a. True
b. False
ANSWER: True
POINTS: 1
21. In a capacitated transshipment problem, some or all of the transfer points are subject to capacity restrictions.
a. True
b. False
ANSWER: False
POINTS: 1
Multiple Choice
22. The problem which deals with the distribution of goods from several sources to several destinations is the
a. maximal flow problem
b. transportation problem
c. assignment problem
d. shortest-route problem
ANSWER: b
POINTS: 1
23. The parts of a network that represent the origins are

a. the capacities
b. the flows
c. the nodes
d. the arcs
ANSWER: c
POINTS: 1
24. The objective of the transportation problem is to

a. identify one origin that can satisfy total demand at the destinations and at the same time minimize total
shipping cost.
b. minimize the number of origins used to satisfy total demand at the destinations.
c. minimize the number of shipments necessary to satisfy total demand at the destinations.
d. minimize the cost of shipping products from several origins to several destinations.
ANSWER: d
POINTS: 1
25. The number of units shipped from origin i to destination j is represented by

a. xij.
b. xji.
c. cij.
d. cji.
ANSWER: a
POINTS: 1
26. Which of the following is not true regarding the linear programming formulation of a transportation problem?
a. Costs appear only in the objective function.
b. The number of variables is (number of origins) x (number of destinations).
c. The number of constraints is (number of origins) x (number of destinations).
d. The constraints' left-hand side coefficients are either 0 or 1.
ANSWER: c
POINTS: 1
27. The difference between the transportation and assignment problems is that
a. total supply must equal total demand in the transportation problem
b. the number of origins must equal the number of destinations in the transportation problem
c. each supply and demand value is 1 in the assignment problem
d. there are many differences between the transportation and assignment problems
ANSWER: c
POINTS: 1
28. In the general linear programming model of the assignment problem,

a. one agent can do parts of several tasks.
b. one task can be done by several agents.
c. each agent is assigned to its own best task.
d. one agent is assigned to one and only one task.
ANSWER: d
POINTS: 1
29. The assignment problem is a special case of the

a. transportation problem.
b. transshipment problem.
c. maximal flow problem.
d. shortest-route problem.
ANSWER: a
POINTS: 1
30. Which of the following is not true regarding an LP model of the assignment problem?
a. Costs appear in the objective function only.
b. All constraints are of the ≥ form.
c. All constraint left-hand side coefficient values are 1.
d. All decision variable values are either 0 or 1.
ANSWER: b
POINTS: 1
31. The assignment problem constraint x31 + x32 + x33 + x34 ≤ 2 means
a. agent 3 can be assigned to 2 tasks.
b. agent 2 can be assigned to 3 tasks.
c. a mixture of agents 1, 2, 3, and 4 will be assigned to tasks.
d. there is no feasible solution.
ANSWER: a
POINTS: 1
32. Arcs in a transshipment problem

a. must connect every node to a transshipment node.
b. represent the cost of shipments.
c. indicate the direction of the flow.
d. All of the alternatives are correct.
ANSWER: c
POINTS: 1
33. Constraints in a transshipment problem

a. correspond to arcs.
b. include a variable for every arc.
c. require the sum of the shipments out of an origin node to equal supply.
d. All of the alternatives are correct.
ANSWER: b
POINTS: 1
34. In a transshipment problem, shipments

a. cannot occur between two origin nodes.

b. cannot occur between an origin node and a destination node.
c. cannot occur between a transshipment node and a destination node.
d. can occur between any two nodes.
ANSWER: d
POINTS: 1
35. Consider a shortest route problem in which a bank courier must travel between branches and the main operations
center. When represented with a network,
a. the branches are the arcs and the operations center is the node.
b. the branches are the nodes and the operations center is the source.
c. the branches and the operations center are all nodes and the streets are the arcs.
d. the branches are the network and the operations center is the node.
ANSWER: c
POINTS: 1
36. The shortest-route problem finds the shortest-route

a. from the source to the sink.
b. from the source to any other node.
c. from any node to any other node.
d. from any node to the sink.
ANSWER: b
POINTS: 1
37. Consider a maximal flow problem in which vehicle traffic entering a city is routed among several routes before
eventually leaving the city. When represented with a network,
a. the nodes represent stoplights.
b. the arcs represent one way streets.
c. the nodes represent locations where speed limits change.
d. None of the alternatives is correct.
ANSWER: b
POINTS: 1
38. We assume in the maximal flow problem that

a. the flow out of a node is equal to the flow into the node.
b. the source and sink nodes are at opposite ends of the network.
c. the number of arcs entering a node is equal to the number of arcs exiting the node.
d. None of the alternatives is correct.
ANSWER: a
POINTS: 1

39. If a transportation problem has four origins and five destinations, the LP formulation of the problem will have
a. 5 constraints
b. 9 constraints
c. 18 constraints
d. 20 constraints
ANSWER: b
POINTS: 1
40. Which of the following is not a characteristic of assignment problems?

a. costs appear in the objective function only
b. the RHS of all constraints is 1
c. the value of all decision variables is either 0 or 1
d. the signs of constraints are always <
ANSWER: d
POINTS: 1
41. The network flows into and out of demand nodes are what makes the production and inventory application modeled in
the textbook a
a. shortest-route model.
b. maximal flow model.
c. transportation model
d. transshipment model
ANSWER: d
POINTS: 1
TOPICS: A production and inventory application
Subjective Short Answer
42. Write the LP formulation for this transportation problem.
ANSWER:
Min 5X1A + 6X1B + 4X2A + 2X2B + 3X3A + 6X3B + 9X 4A + 7X4B
s.t. X1A + X1B ≤ 100

X2A + X2B ≤ 200
X3A + X3B ≤ 150
X4A + X4B ≤ 50
X1A + X2A + X3A + X4A = 250
X1B + X 2B + X3B + X4B = 250
all Xij ≥ 0
POINTS: 1
43. Draw the network for this transportation problem.
Min 2XAX + 3XAY + 5XAZ+ 9XBX + 12XBY + 10XBZ
s.t. XAX + XAY + XAZ ≤ 500

X BX + XBY + XBZ ≤ 400
XAX + XBX = 300
XAY + XBY = 300
XAZ + XBZ = 300
Xij ≥ 0
ANSWER:
POINTS: 1
44. Canning Transport is to move goods from three factories to three distribution centers. Information about the move is
given below. Give the network model and the linear programming model for this problem.
Source Supply Destination Demand
A 200 X 50
B 100 Y 125
C 150 Z 125
Shipping costs are:
Destination
Source X Y Z
A 3 2 5
B 9 10 --
C 5 6 4
(Source B cannot ship to destination Z)
ANSWER:
Min 3XAX + 2XAY + 5XAZ + 9XBX + 10XBY + 5XCX + 6XCY + 4XCZ
s.t. XAX + XAY + XAZ ≤ 200

XBX + XBY ≤ 100
XCX + XCY + XCZ ≤ 150
XDX + XDY + XDZ ≤ 50
XAX + XBX + XCX + XDX = 250
X AY + XBY + XCY + XDY = 125
XAZ + XBZ + XCZ + XDZ = 125
Xij ≥ 0
POINTS: 1
45. The following table shows the unit shipping cost between cities, the supply at each source city, and the demand at
each destination city. The Management Scientist solution is shown. Report the optimal solution.
Destination
Source Terre Haute Indianapolis Ft. Wayne South Bend Supply
St. Louis 8 6 12 9 100
Evansville 5 5 10 8 100
Bloomington 3 2 9 10 100
Demand 150 60 45 45
TRANSPORTATION PROBLEM
*****************************
OBJECTIVE: MINIMIZATION
SUMMARY OF ORIGIN SUPPLIES

********************************
ORIGIN SUPPLY
---------- -----------
1 100
2 100
3 100
SUMMARY OF DESTINATION DEMANDS
***************************************
DESTINATION DEMAND
------------------- -------------
1 150
2 60
3 45
4 45
SUMMARY OF UNIT COST OR REVENUE DATA
*********************************************
FROM TO DESTINATION
ORIGIN 1 2 3 4
---------- ----- ----- ----- -----
1 8 6 12 9
2 5 5 10 8
3 3 2 9 10
OPTIMAL TRANSPORTATION SCHEDULE
****************************************
SHIP
FROM TO DESTINATION
ORIGIN 1 2 3 4
---------- ----- ----- ----- -----
1 0 10 45 45
2 100 0 0 0
3 50 50 0 0
TOTAL TRANSPORTATION COST OR REVENUE IS 1755
ANSWER: Ship 10 from St. Louis to Indianapolis, 45 from St. Louis to Ft. Wayne, 45 from St. Louis to South Bend, 100
from Evansville to Terre Haute, 50 from Bloomington to Terre Haute, and 50 from Bloomington to
Indianapolis. The total cost is 1755.
POINTS: 1
46. After some special presentations, the employees of the AV Center have to move projectors back to classrooms. The
table below indicates the buildings where the projectors are now (the sources), where they need to go (the destinations),
and a measure of the distance between sites.
Destination
Source Business Education Parsons Hall Holmstedt Hall Supply
Baker Hall 10 9 5 2 35
Tirey Hall 12 11 1 6 10
Arena 15 14 7 6 20
Demand 12 20 10 10
a. If you were going to write this as a linear programming model, how many decision variables would there be, and how
many constraints would there be?
The solution to this problem is shown below. Use it to answer the questions b - e.
TRANSPORTATION PROBLEM
*****************************
OPTIMAL TRANSPORTATION SCHEDULE
****************************************
FROM TO DESTINATION
FROM ORIGIN 1 2 3 4
------------------- ------ ------ ------ ------
1 12 20 0 3
2 0 0 10 0
3 0 0 0 7
TOTAL TRANSPORTATION COST OR REVENUE IS 358

NOTE: THE TOTAL SUPPLY EXCEEDS THE TOTAL DEMAND BY 13
ORIGIN EXCESS SUPPLY

---------- -----------------------
3 13
b. How many projectors are moved from Baker to Business?

c. How many projectors are moved from Tirey to Parsons?
d. How many projectors are moved from the Arena to Education?
e. Which site(s) has (have) projectors left?
ANSWER:
a. 12 decision variables, 7 constraints
b. 12
c. 10
d. 0
e. Arena
POINTS: 1
47. Show both the network and the linear programming formulation for this assignment problem.
Task
Person A B C D
1 9 5 4 2
2 12 6 3 5
3 11 6 5 7
ANSWER:

Let Xij = 1 if person i is assigned to job j

= 0 otherwise
Min 9X1A + 5X1B + 4X1C + 2X1D

+ 12X2A + 6X2B + 3X2C + 5X2D
+ 11X3A + 6X3B + 5X3C + 7X3D
s.t. X1A + X1B + X1C + X1D ≤ 1

X2A + X2B + X2C + X2D ≤ 1
X 3A + X3B + X3C + X3D ≤ 1
X4A + X4B + X4C + X4D ≤ 1
X1A + X2A + X3A + X4A = 1
X1B + X2B + X3B + X4B = 1
X1C + X2C + X3C + X4C = 1
X1D + X2D + X3D + X4D = 1
POINTS: 1
48. Draw the network for this assignment problem.
Min 10x1A + 12x1B + 15x1C + 25x1D + 11x2A + 14x2B + 19x2C + 32x2D

+ 18x3A + 21x3B + 23x3C + 29x3D + 15x4A + 20x4B + 26x4C + 28x4D
s.t. x1A + x1B + x1C + x1D = 1

x2A + x2B + x2C + x2D = 1
x3A + x3B + x3C + x3D = 1
x4A + x4B + x4C + x4D = 1
x1A + x2A + x3A + x4A = 1
x1B + x 2B + x3B + x4B = 1
x1C + x 2C + x3C + x4C = 1
x1D + x2D + x3D + x4D = 1
ANSWER:
POINTS: 1
49. A professor has been contacted by four not-for-profit agencies that are willing to work with student consulting teams.
The agencies need help with such things as budgeting, information systems, coordinating volunteers, and forecasting.
Although each of the four student teams could work with any of the agencies, the professor feels that there is a difference
in the amount of time it would take each group to solve each problem. The professor's estimate of the time, in days, is
given in the table below. Use the computer solution to see which team works with which project.
Projects
Team Budgeting Information Volunteers Forecasting
A 32 35 15 27
B 38 40 18 35
C 41 42 25 38
D 45 45 30 42
ASSIGNMENT PROBLEM
************************
OBJECTIVE: MINIMIZATION
SUMMARY OF UNIT COST OR REVENUE DATA

*********************************************
TASK
AGENT 1 2 3 4
---------- ----- ----- ----- -----
1 32 35 15 27
2 38 40 18 35
3 41 42 25 38
4 45 45 30 42
OPTIMAL ASSIGNMENTS COST/REVENUE
************************ ***************
ASSIGN AGENT 3 TO TASK 1 41
------------------------------------------- -----
TOTAL COST/REVENUE 131
ANSWER: Team A works with the forecast, Team B works with volunteers, Team C works with budgeting, and Team D
works with information. The total time is 131.
POINTS: 1
50. Write the linear program for this transshipment problem.
ANSWER:
Min 3x16 + 2x14 + 3x15 + 5x24 + 6x25 + 2x32 + 8x 34 + 10x35 + 5x46 + 9x47 + 12x56 + 15x57
s.t. x16 + x14 + x35 ≤ 500

x24 + x25 − x23 ≤ 400
x32 + x34 + x35 ≤ 300
x46 + x47 − (x14 + x24 + x34) = 0
x56 + x57 − (x15 + x25 + x35) = 0
x16 + x46 + x56 = 600
x56 + x57 = 600
POINTS: 1
51. Peaches are to be transported from three orchard regions to two canneries. Intermediate stops at a consolidation station
are possible.
Orchard Supply Station Cannery Capacity

Riverside 1200 Waterford Sanderson 2500
Sunny Slope 1500 Northside Millville 3000
Old Farm 2000
Shipment costs are shown in the table below. Where no cost is given, shipments are not possible. Where costs are shown,
shipments are possible in either direction. Draw the network model for this problem.
R SS OF W N S M
Riverside 1 5 3
Sunny Side 4 5
Old Farm 6 3
Waterford 2 2 4
Northside 5 9
Sanderson 2
Millville
ANSWER:
POINTS: 1
52. RVW (Restored Volkswagens) buys 15 used VW's at each of two car auctions each week held at different locations. It
then transports the cars to repair shops it contracts with. When they are restored to RVW's specifications, RVW sells 10
each to three different used car lots. There are various costs associated with the average purchase and transportation prices
from each auction to each repair shop. Also there are transportation costs from the repair shops to the used car lots. RVW
is concerned with minimizing its total cost given the costs in the table below.
a. Given the costs below, draw a network representation for this problem.
Repair Shops Used Car Lots
S1 S2 L1 L2 L3
Auction 1 550 500 250 300 500
S1
Auction 2 600 450 350 650 450
S2
b. Formulate this problem as a transshipment linear programming model.

ANSWER:

a.
b. Denote A1 as node 1, A2 as node 2, S1 as node 3, S2 as node 4,

L1 as node 5, L2 as node 6, and L3 as node 7
Min 50X13 + 500X14 + 600X23 + 450X24 + 250X35 + 300X36

+ 500X37 + 350X45 + 650X46 + 450X47
s.t. X13 + X14 ≤ 15

X23 + X24 ≤ 15
X13 + X23 − X35 − X36 − X37 = 0
X14 + X24 − X45 − X46 − X47 = 0
X35 + X45 = 10
X36 + X46 = 10
X37 + X4 = 10
Xij ≥ 0 for all i,j
POINTS: 1
53. Consider the network below. Formulate the LP for finding the shortest-route path from node 1 to node 7.
ANSWER:
Min 10X12 + 12X13 + 4X24 + 8X25 + 7X35 + 9X36 + 4X 42 + 3X45

+ 6X47 + 8X52 + 7X53 + 3X54 + 4X57 + 9X63 + 3X67
s.t. X12 + X13 =1

−X12 + X24 + X25 − X42 − X52 =0
−X13 + X35 + X36 − X53 − X63 =0
−X24 + X42 + X45 + X47 − X54 =0
−X25 − X35 − X45 + X52 + X53 + X57 = 0
−X36 + X63 + X67 =0
X47 + X57 + X67 =1
POINTS: 1
54. Consider the following shortest-route problem involving six cities with the distances given. Draw the network for this
problem and formulate the LP for finding the shortest distance from City 1 to City 6.
Path Distance
1 to 2 3
1 to 3 2
2 to 4 4
2 to 5 5
3 to 4 3
3 to 5 7
4 to 6 6
5 to 6 2
ANSWER:
Min 3X12 + 2X13 + 4X24 + 5X25 + 3X34 + 7X35

+ 4X42 + 3X43 + 6X46 + 5X 52 + 7X53 + 2X56
s.t. X12 + X13 =1

−X12 + X24 + X25 − X42 − X52 = 0
−X13 + X34 + X35 − X 43 − X53 = 0
−X24 − X34 + X42 + X43 + X46 = 0
−X25 − X35 + X52 + X53 + X56 = 0
X46 + X56 =1

POINTS: 1
55. A beer distributor needs to plan how to make deliveries from its warehouse (Node 1) to a supermarket (Node 7), as
shown in the network below. Develop the LP formulation for finding the shortest route from the warehouse to the
supermarket.
ANSWER:
Min 3X12 + 3X15 + 12X16 + 5X23 + 5X32 + 6X34 + 6X 43
+ 4X46 + 5X47 + 8X56 + 4X64 + 8X65 + 3X67
s.t. X12 + X15 + X16 =1

−X 12 + X23 =0
−X23 + X32 + X34 =0
−X34 + X43 + X46 + X47 − 4X64 =0
−X15 + X56 =0
−X16 − X46 − X56 + X64 + X65 + X67 = 0
X47 + X67 =1
POINTS: 1
56. Consider the following shortest-route problem involving seven cities. The distances between the cities are given
below. Draw the network model for this problem and formulate the LP for finding the shortest route from City 1 to City 7.
Path Distance
1 to 2 6
1 to 3 10
1 to 4 7
2 to 3 4
2 to 5 5
3 to 4 5
3 to 5 2
3 to 6 4
4 to 6 8
5 to 7 7
6 to 7 5
ANSWER:
Min 6X12 + 10X13 + 7X14 + 4X23 + 5X25 + 4X32 + 5X34 + 2X35 + 4X36
+ 5X43 + 8X46 + 5X52 + 2X53 + 7X57 + 4X63 + 8X64 + 5X67
s.t. X12 + X13 + X14 =1

−X12 + X23 + X25 − X32 − X52 =0
−X13 − X23 + X32 + X34 + X35 + X36 − X43 − X53 − X63 = 0
−X14 − X34 + X43 + X46 − X64 =0
−X25 − X35 + X52 + X53 + X57 =0
−X36 − X46 + X63 + X64 + X67 =0
X57 + X67 =1
POINTS: 1
57. The network below shows the flows possible between pairs of six locations. Formulate an LP to find the maximal flow
possible from Node 1 to Node 6.
ANSWER:
Min X61
s.t.
X12 + X13 + X15 − X61 =0
X23 + X 24 − X12 − X32 =0
X32 + X34 + X35 − X13 − X23 − X53 = 0
X43 + X46 − X24 − X34 =0

X53 + X56 − X15 − X35 =0
X61 − X36 − X46 − X56 =0
X12 ≤ 18 X13 ≤ 20 X15 ≤ 10
X23 ≤ 9 X24 ≤ 15
X32 ≤ 4 X34 ≤ 10 X35 ≤ 8
X43 ≤ 10 X46 ≤ 14
X53 ≤ 8 X56 ≤ 10
POINTS: 1
58. A network of railway lines connects the main lines entering and leaving a city. Speed limits, track reconstruction, and
train length restrictions lead to the flow diagram below, where the numbers represent how many cars can pass per hour.
Formulate an LP to find the maximal flow in cars per hour from Node 1 to Node F.
ANSWER:
Min XF1
s.t.
X12 + X15 + X16 − XF1 =0
X23 + X24 − X 12 =0
X34 − X23 =0
X48 + X4F − X24 − X34 − X84 = 0
X57 − X15 =0
X67 + X69 − X16 − X76 =0
X76 + X79 − X57 − X67 =0
X84 + X89 + X8F − X48 − X98 = 0
X98 + X9F − X69 − X79 − X89 = 0
XF1 − X4F − X8F − X9F =0
X12 ≤ 500 X15 ≤ 300 X16 ≤ 600

X23 ≤ 300 X24 ≤ 400

X34 ≤ 150
X48 ≤ 400 X4F ≤ 600
X57 ≤ 400
X67 ≤ 300 X69 ≤ 500
X76 ≤ 200 X79 ≤ 350
X84 ≤ 200 X89 ≤ 300 X8F ≤ 450
X98 ≤ 300 X9F ≤ 500
POINTS: 1
59. Fodak must schedule its production of camera film for the first four months of the year. Film demand (in 1,000s of
rolls) in January, February, March and April is expected to be 300, 500, 650 and 400, respectively. Fodak's production
capacity is 500 thousand rolls of film per month. The film business is highly competitive, so Fodak cannot afford to lose
sales or keep its customers waiting. Meeting month i 's demand with month i +1's production is unacceptable.
Film produced in month i can be used to meet demand in month i or can be held in inventory to meet demand in month i
+1 or month i +2 (but not later due to the film's limited shelflife). There is no film in inventory at the start of January.
The film's production and delivery cost per thousand rolls will be $500 in January and February. This cost will increase to
$600 in March and April due to a new labor contract. Any film put in inventory requires additional transport costing $100
per thousand rolls. It costs $50 per thousand rolls to hold film in inventory from one month to the next.
a. Modeling this problem as a transshipment problem, draw the network representation.
b. Formulate and solve this problem as a linear program.
ANSWER:
a.
b. Define the decision variables:

xij = amount of film "moving" between node i and node j
Define objective:
MIN 600x15 + 500x18 + 600x26 + 500x29 + 700x 37 + 600x310 + 600x411 + 50x59
+ 100x510 + 50x610 + 100x611 + 50x711

Define the constraints:
Amount (1000's of rolls) of film produced in January: x15 + x18 ≤ 500
Amount (1000's of rolls) of film produced in February: x26 + x29 ≤ 500
Amount (1000's of rolls) of film produced in March: x37 + x310 ≤ 500
Amount (1000's of rolls) of film produced in April: x411 ≤ 500
Amount (1000's of rolls) of film in/out of January inventory: x15 − x59 − x510 = 0
Amount (1000's of rolls) of film in/out of February inventory: x26 − x610 − x611 = 0
Amount (1000's of rolls) of film in/out of March inventory: x37 − x711 = 0
Amount (1000's of rolls) of film satisfying January demand: x18 = 300
Amount (1000's of rolls) of film satisfying February demand: x29 + x59 = 500
Amount (1000's of rolls) of film satisfying March demand: x310 + x510 + x610 = 650
Amount (1000's of rolls) of film satisfying April demand: x411 + x611 + x711 = 400
Non-negativity of variables: xij ≥ 0, for all i and j.
The Management Scientist provided the following solution:
Objective Function Value = 1045000.000

VARIABLE VALUE REDUCED COST
X15 150.000 0.000
X18 300.000 0.000
X26 0.000 100.000
X29 500.000 0.000
X37 0.000 250.000
X310 500.000 0.000
X411 400.000 0.000
X59 0.000 0.000
X510 150.000 0.000
X610 0.000 0.000
X611 0.000 150.000
X711 0.000 0.000
POINTS: 1
TOPICS: Production and inventory application
60. Find the maximal flow from node 1 to node 7 in the following network.

ANSWER: Decision variables:

xij = amount of flow from node i to node j
Objective function:
Maximize the flow through the network: Max x71
Constraints:
Conservation of flow for each node:
(1) x12 + x13 + x14 − x 71 = 0 (node 1)
(2) x24 + x25 − x12 − x42 − x52 = 0 (node 2)
(3) x34 + x36 − x13 − x43 = 0 (node 3)
(4) x42 + x 43 + x45 + x46 + x47 − x14 − x24 − x34 − x54 − x64 = 0 (node 4)
(5) x52 + x54 + x57 − x25 − x45 = 0 (node 5)
(6) x64 + x67 − x36 − x46 = 0 (node 6)
(7) x71 − x47 − x57 − x67 = 0 (node 7)
Capacity for each arc:
(8) x12 ≤ 4 (14) x36 ≤ 6 (20) x52 ≤ 3
(9) x13 ≤ 3 (15) x42 ≤ 3 (21) x54 ≤ 4
(10) x14 ≤ 4 (16) x43 ≤ 5 (22) x57 ≤ 2
(11) x24 ≤ 2 (17) x45 ≤ 3 (23) x64 ≤ 1
(12) x25 ≤ 3 (18) x46 ≤ 1 (24) x67 ≤ 5
(13) x34 ≤ 3 (19) x47 ≤ 3
Nonnegativity:
All xij ≥ 0
The LP was solved using The Management Scientist. Two solutions are given below.
Objective Function Value = 10.000

Variable Solution 1 Solution 2
x12 3.000 3.000
x13 3.000 3.000
x14 4.000 4.000
x24 1.000 1.000
x25 2.000 2.000
x36 5.000 4.000

x43 2.000 1.000
x46 0.000 1.000
x47 3.000 3.000
x57 2.000 2.000
x67 5.000 5.000
x71 10.000 10.000
POINTS: 1
61. A foreman is trying to assign crews to produce the maximum number of parts per hour of a certain product. He has
three crews and four possible work centers. The estimated number of parts per hour for each crew at each work center is
summarized below. Solve for the optimal assignment of crews to work centers.
Work Center
WC1 WC2 WC3 WC4
Crew A 15 20 18 30
Crew B 20 22 26 30
Crew C 25 26 27 30
ANSWER: OBJECTIVE FUNCTION VALUE = 82.000
VARIABLE VALUE REDUCED COST
AA1 0.000 12.000
AA2 0.000 0.000
AA3 0.000 0.000
AA4 1.000 1.000
AB1 0.000 2.000
AB2 0.000 4.000
AB3 1.000 0.000
AB4 0.000 0.000
AC1 0.000 12.000
AC2 1.000 0.000
AC3 0.000 0.000
AC4 0.000 1.000
AD1 1.000 2.000
AD2 0.000 4.000
AD3 0.000 0.000
AD4 0.000 0.000
CONSTRAINT SLACK/SURPLUS DUAL PRICE

1 0.000 18.000
2 0.000 23.000
3 0.000 24.000
4 0.000 −1.000
5 0.000 1.000
6 0.000 2.000
7 0.000 3.000
8 0.000 12.000
An optimal solution is:

Crew Work Center Parts/Hour
Crew A WC4 30
Crew B WC3 26
Crew C WC2 26
---------- WC1 ---
Total Parts Per Hour 82
POINTS: 1
62. A plant manager for a sporting goods manufacturer is in charge of assigning the manufacture of four new aluminum
products to four different departments. Because of varying expertise and workloads, the different departments can
produce the new products at various rates. If only one product is to be produced by each department and the daily output
rates are given in the table below, which department should manufacture which product to maximize total daily product
output? (Note: Department 1 does not have the facilities to produce golf clubs.)
Baseball Tennis Golf Racquetball

Department Bats Rackets Clubs Rackets
1 100 60 X 80
2 100 80 140 100
3 110 75 150 120
4 85 50 100 75
Formulate this assignment problem as a linear program.

ANSWER:
xi represent all possible combinations of departments and products
For example: x1 = 1 if Department 1 is assigned baseball bats; = 0 otherwise
x2 = 1 if Department 1 is assigned tennis rackets; = 0 otherwise
x5 = 1 if Department 2 is assigned baseball bats; = 0 otherwise
x15 = 1 if Department 4 is assigned golf clubs; = 0 otherwise
(Note: x3 is not used because Dept.1/golf clubs is not a feasible assignment)
Min Z = 100x1+60x2+80x4+100x5+80x6+140x7+100x8+110x9
+75x10+150x11+120x12+85x13+50x14+100x15+75x16
S.T. x1 + x2 + x4 = 1
x5 + x6 + x7 + x8 = 1
x9 + x10 + x11 + x12 = 1
x13 + x14 + x15 + x16 = 1
x1 + x5 + x9 + x13 = 1
x2 + x6 + x10 + x14 = 1
x7 + x11 + x15 = 1
x4 + x8 + x12 + x16 = 1
POINTS: 1
63. A clothing distributor has four warehouses which serve four large cities. Each warehouse has a monthly capacity of
5,000 blue jeans. They are considering using a transportation LP approach to match demand and capacity. The following
table provides data on their shipping cost, capacity, and demand constraints on a per-month basis. Develop a linear
programming model for this problem.
Warehouse City E City F City G City H

A .53 .21 .52 .41
B .31 .38 .41 .29
C .56 .32 .54 .33
D .42 .55 .34 .52
City Demand 2,000 3,000 3,500 5,500
ANSWER:
Xij = each combination of warehouse i and city j
Min .53XAE + .21XAF + .52XAG + .41XAH + .31XBE + .38XBF + .41XBG + .29XBH
+ .56XCE + .32XCF + .54XCG + .33XCH + .42XDE + .55XDF + .34XDG + .52XDH
st XAE + XAF + XAG + XAH  5,000 XAE + XBE + XCE + XDE = 2,000
XBE + XBF + XBG + XBH  5,000 XAF + XBF + XCF + XDF = 3,000
XCE + XCF + XCG + XCH  5,000 XAG + XBG + XCG + XDG = 3,500
XDE + XDF + XDG + XDH  5,000 XAH + XBH + XCH + XDH = 5,500
POINTS: 1
64. A computer manufacturing company wants to develop a monthly plan for shipping finished products from three of its
manufacturing facilities to three regional warehouses. It is thinking about using a transportation LP formulation to exactly
match capacities and requirements. Data on transportation costs (in dollars per unit), capacities, and requirements are
given below.
Warehouse
Plant 1 2 3 Capacities
A 2.41 1.63 2.09 4,000
B 3.18 5.62 1.74 6,000
C 4.12 3.16 3.09 3,000
Requirement 8,000 2,000 3,000
a. How many variables are involved in the LP formulation?
b. How many constraints are there in this problem?
c. What is the constraint corresponding to Plant B?
d. What is the constraint corresponding to Warehouse 3?
ANSWER:
The problem formulation is shown below. Use it to answer the questions a - d.
Xij = each combination of plant i and warehouse j

Min 2.41XA1 + 1.63XA2 + 2.09XA3 + 3.18XB1 + 5.62XB2 + 1.74XB3
+ 4.12XC1 + 3.16XC2 + 3.09XC3
st XA1 + XA2 +XA3 = 4,000 (capacities) XA1 + XB1 +XC1 = 8,000 (requirements)
XB1 + XB2 + XB3 = 6,000 XA2 + XB2 +XC2 = 2,000
XC1 +XC2 + XC3 = 3,000 XA3 + XB3 +XC3 = 3,000
a. 9 variables
b. 6 constraints
c. XB1 + XB2 + XB3 = 6,000
d. XA3 + XB3 +XC3 = 3,000
POINTS: 1
65. A large book publisher has five manuscripts that must be edited as soon as possible. Five editors are available for
doing the work, however their working times on the various manuscripts will differ based on their backgrounds and
interests. The publisher wants to use an assignment method to determine who does what manuscript. Estimates of editing
times (in hours) for each manuscript by each editor are:
Editor
Manuscript Uley Vargas Way York Zee
A 12 8 10 16 13
B 9 10 14 13 9
C 17 14 9 18 12
D 15 7 11 9 18
E 12 18 22 11 27
Develop the LP formulation for this problem.
ANSWER:
One variable for each combination of manuscript and editor, 25 total
1 constraint for each manuscript (5) and 1 constraint for each editor (5); 10 total
Min 12AU + 8AV + 10AW + 16AY + 13AZ
+ 9BU + 10BV + 14BW + 13BY + 9BZ
+ 17CU + 14CV + 9CW+ 18CY + 12CZ
+ 15DU + 7DV + 11DW + 9DY + 18DZ
+ 12EU + 18EV + 22EW + 11EY + 27EZ
st AU + AV + AW + AY + AZ = 1 AU+ BU + CU + DU + EU = 1
BU + BV + BW + BY + BZ = 1 AV+ BV + CV + DV + EV = 1
CU + CV + CW + CY + CZ = 1 AW+ BW + CW + DW + EW = 1
DU + DV + DW + DY + DZ = 1 AY+ BY + CY + DY + EY = 1
EU + EV + EW + EY + EZ = 1 AZ+ BZ + CZ + DZ + EZ = 1
POINTS: 1
66. A Japanese Company is trying to decide between two alternative locations, C and D, for making their new wrist
cellular telephone using the LP transportation method. They currently have two factories, A and B, working 24 hours per
day but cannot keep up with demand. Costs are on a per-unit basis. Monthly data relating locations with centers of
demand are:
Demand Centers Factory
Factories U.S. Canada Mexico Output
Existing A .12 .38 .65 8,000
Existing B .23 .16 .23 5,000
Proposed C .20 .26 .37 5,000
Proposed D .18 .31 .34 5,000
Min. Demand 6,000 6,000 6,000
Formulate two transportation LPs, one including Proposed C factory and the other including Proposed D factory, that
could be solved to determine the lower-cost choice of new factories.
ANSWER:
Proposed Factory C:
Min .12AU + .38AC + .65AM + .23BU + .16BC
+.23BM + .20CU + .26CC + .37CM
st AU + AC + AM  8,000 AU + BU + CU = 6,000
BU + BC + BM  5,000 AC + BC + CC = 6,000
CU + CC + CM  5,000 AM + BM + CM = 6,000
Proposed location D:
Min .12AU + .38AC + .65AM + .23BU + .16BC
+.23BM + .18DU + .31DC + .34DM
st AU + AC + AM  8,000 AU + BU + DU = 6,000
BU + BC + BM  5,000 AC + BC + DC = 6,000
DU + DC + DM
≤
5,000 AM + BM + DM = 6,000
POINTS: 1
67. The Emerald Valley Country Club has three tractors that are used for cutting grass. Each is of a different size and has
different capabilities. The largest tractor cuts fairways and other large areas very efficiently, but has trouble around
bunkers and trees. The smallest tractor cuts very quickly around small objects but takes more time on the open expanses
of grass. The middle-sized tractor operates as a compromise between the other two. The 18-hole golf course is divided
into three parts for cutting purposes: holes 1‑ 6; holes 7‑ 12; and holes 13‑ 18. The club wants to determine which tractor
should be assigned to which part of the course so as to minimize total cutting time. The table shows cutting times (in
minutes) for the tractors in each of the three sections of the golf course:
Section of Course
Tractor 1‑ 6 7‑ 12 13‑ 18
Large 270 473 512
Medium 386 395 483
Small 456 409 476
Formulate this assignment problem as an LP.
ANSWER:
Xi = each combination of tractor and section; 9 total
Min 270X1 + 473X2 + 512X3 + 386X4 + 395X5 + 483X6 + 456X7 + 409X8 + 476X9
st L1 + L7 + L13 = 1 L1 + M1 + S1 = 1
M1 + M7 + M13 = 1 L7 + M7 + S7 = 1
S1 + S7 + S13 = 1 L13 +M13 + S13 = 1
POINTS: 1
Essay
68. Explain how the general linear programming model of the assignment problem can be modified to handle problems
involving a maximization function, unacceptable assignments, and supply not equally demand.
ANSWER: Answer not provided.
POINTS: 1
69. Define the variables and constraints necessary in the LP formulation of the transshipment problem.
POINTS: 1
70. Explain what adjustments can be made to the transportation linear program when there are unacceptable routes.
POINTS: 1
71. Is it a coincidence to obtain integer solutions to network problems? Explain.

POINTS: 1
TOPICS: Network problems
72. How is the assignment linear program different from the transportation model?
POINTS: 1
TOPICS: Transportation and assignment problems
73. Define the variables and constraints necessary in the LP formulation of the maximal flow problem.
POINTS: 1
74. How is the shortest-route problem like the transshipment problem?

POINTS: 1

Another random document with
no related content on Scribd:
the people up to the very Sepulchre, and so we were able to pass
by.
We arrived at the eastern doors of the Sepulchre. The Prince
came after us, and placed himself at the right side, near the partition
of the great altar, opposite the eastern doors, where there was a
special elevated place for the Prince. He ordered the abbot of St.
Sabbas and his monks and orthodox priests to stand around the
Sepulchre, but me, humble servant, he ordered to stand high above
the doors of the Sepulchre, opposite the great altar, so that I could
look into the doors of the Sepulchre: there are three of these doors
and they are locked and sealed with the royal seal. The Latin priests
stood at the great altar. At about the eighth hour of the day the
orthodox priests above the Sepulchre, and many monks and hermits
who had come, began to sing their vesper service, and the Latins at
the great altar chanted in their own way. I stood all the time they
were singing and watched diligently the doors of the Sepulchre.
When they began to read the prayers of the Holy Saturday, the
bishop walked down with his deacon from the altar and went to the
doors of the Sepulchre and looked through the chinks, but as he did
not see any light, he returned to the altar. When they had read the
sixth prayer, the bishop went again with his deacon to the door of the
Sepulchre, but he did not see anything within. Then all the people
sang in tears: “Kyrie, eleison!”
When it was the ninth hour of the day, and they had begun to sing,
“To the Lord we sing,” a small cloud suddenly came from the east
and stopping over the uncovered middle of the church, came down
in a rain over the Holy Sepulchre and gave us who were standing
around the tomb a good drenching. And then suddenly the holy light
glimmered in the Sepulchre, and then a mighty, bright brilliancy burst
forth from it. Then the bishop came with four deacons and opened
the doors of the Sepulchre and, taking a candle from the Prince,
went inside the tomb and lighted it. After coming out again, he
handed the candle to the Prince. The Prince remained standing in
his place, and held the candle with great joy. From that candle we
lighted all our candles, and from ours all the other candles were
lighted.
This holy light is not like any earthly fire, but quite different: it burns
with a bright flame like cinnabar. And all the people stood with their
burning candles and wept for great joy all the time they saw the
divine light. He who has not seen the great joy of that day cannot
believe one who is telling about it, although good and faithful men
believe it all and with pleasure listen to the account of this divine light
and of the holy places, for the faithful believe the great and small
things alike, but to an evil man truth is crooked. But to me, humble
servant, God, and the Holy Sepulchre, and my whole suite, Russian
men from Nóvgorod and Kíev, are my witnesses: Syedesláv
Ivánkovich, Gorodisláv Mikhálkovich, the two Kashkíchs and many
others know me and my narration.
But let us return to our story. When the light shone up in the
Sepulchre, the singing stopped, and all cried aloud: “Kyrie, eleison!”
Then they all went out of the church in great joy and with burning
candles, watching them carefully against gusts of wind, and going
home they all lighted the candles in their churches with that holy
light, and finished the singing in their own churches. But in the large
church of the Sepulchre the priests end the singing without the
people. We went with the abbot and the monks to our monastery,
carrying the burning candles, and after finishing our vesper singing,
we went to our cells praising the Lord who had shown us His
grace....
After three days I went to the keeper of the keys of the Holy
Sepulchre and said to him: “I should like to take away my lamp!” He
received me with much kindness, took me alone into the Sepulchre,
and walking in, I found my lamp still burning with the holy light. I
bowed before the Holy Sepulchre and kissed the glorious place
where once lay the illustrious body of our Lord Jesus Christ. Then I
measured the length, the width and the height of the Sepulchre, for
one is not allowed to measure it in presence of others. After having
honoured the Lord’s Sepulchre as much as I could, I gave the
keeper a little something and a blessing. He, seeing my love for the
Holy Sepulchre and kindness to himself, removed a little the boards
at the head of the Sepulchre and broke off a small piece of rock from
it which he gave to me after I had solemnly sworn to him that I would
not tell anyone in Jerusalem about it. I bowed to the Sepulchre and
to the keeper, took my lamp which was still burning, and went away
with great joy, having been enriched by the grace of God, carrying in
my hand a gift from the holy place and a token from the Holy
Sepulchre. And thus rejoicing at the treasures which I had acquired, I
went back to my cell.
EPILOGUE
I made my pilgrimage in the reign of Grand Prince Svyatopólk

Izyaslávich, the grandson of Yarosláv Vladímirovich of Kíev. God is
my witness, and the Holy Sepulchre, that in all those holy places I
did not forget the Russian princes and their wives and children, nor
the bishops, abbots, boyárs, nor my spiritual children, nor all the
Christians, but that I remembered them everywhere. And I also thank
God that He has enabled me, humble servant, to inscribe the names
of the Russian princes in the monastery of St. Sabbas, where they
are mentioned even now in their services....
May the benediction of the Lord, of the Holy Sepulchre and of all
the holy places be on all who read this message with faith and love!
For they will receive their reward from God equally with those who
have made pilgrimages to the holy places. Blessed are those who
have not seen and yet believe! Abraham came into the promised
land through faith, for indeed faith is equal to good deeds. For the
Lord’s sake, brothers and fathers, do not accuse my simplicity and
rudeness, and do not make light of this writing; not on my account,
but on account of the holy places, honour it in love, that you may
receive your reward from the Lord our God, and our Saviour Jesus
Christ, and may the God of peace be with all of you unto eternity.
Amen!
Cyril, Bishop of Túrov. (XII. century.)
Little is known of the life of this remarkable preacher. He
was born at Túrov, Government of Minsk, about the year
1130, where his parents were wealthy people. Having
become a monk, he distinguished himself by his austere
asceticism and great piety. At the request of the Prince of
Túrov he was made bishop. Eight or nine of his sermons and
some prayers have come down to us in manuscript. His
eloquence stands alone in the whole ancient period of
Russian literature. Though other preachers followed
Byzantine models in their sermons, yet none carried the
flowery Greek symbolism so far, or wrote in so fluent a
language.
FROM A SERMON ON THE FIRST SUNDAY AFTER EASTER
The Church needs a great teacher and a wise orator to properly

celebrate the holiday, but we are poor in words and dim in mind, not
having the fire of the Holy Ghost,—the enjoyment of words useful to
the soul; yet for the love of my brethren who are with me, we shall
say something about the renewal of the Lord’s resurrection. In the
past week of the Easter there was joy in heaven, and terror in the
nethermost regions, a renewal of life and liberation of the world, a
destruction of hell and victory over death, a resurrection of the dead,
and annihilation of the enticing power of the devil; a salvation of the
human race by the resurrection of Christ; an impoverishment of the
Old Testament and enslavement of the Sabbath; an enrichment of
the Church of Christ, and enthronement of the Sunday.
Last week there was a change of all things, for the earth was
opened up by heaven, having been purified from its satanic
impurities, and the angels with their wives humbly served at the
resurrection. All creation was renewed, for no longer are the air, the
sun, the fire, the springs, the trees, thought to be gods; no longer
does hell receive its due of infants sacrificed by their fathers, nor
death its honours, for idolatry has come to an end, and the satanic
power has been vanquished by the mystery of the cross. The Old
Testament has become impoverished by the rejection of the blood of
calves and sacrifices of goats, for Christ has given Himself to the
Lord as a sacrifice for all. And with this, Sunday ceased to be a
holiday, but the Sunday was sanctified on account of the
resurrection, and Sunday is now supreme, for Christ arose from the
dead on that day....
To-day the heavens have been cleared from the dark clouds that
enshrouded them as with a heavy veil, and they proclaim the glory of
God with a clear atmosphere....
To-day the sun rises and beams on high, and rejoicing warms the
earth, for there has arisen for us from the grave the real sun, Christ,
and He saves all who believe in Him. To-day the moon descends
from its high place, and gives honour to the greater lights. The Old
Testament, as had been prophesied, has stopped with its Sabbath,
and with its prophets gives honour to the Testament of Christ with its
Sunday. To-day the winter of sin has stopped in repentance, and the
ice of unbelief is melted by wisdom. To-day spring appears spruce,
and enlivens all earthly existence; the stormy winds blow gently and
generate fruits, and the earth, giving nurture to the seed, brings forth
green grass. For spring is the beautiful faith in Christ which, through
baptism, produces a regeneration of man, and the stormy winds are
the evil, sinful thoughts that, being changed to virtue through
repentance, generate soul-saving fruits; but the earth of our being,
having received the Word of God like a seed, and, passing through
an ecstatic labour, through the fear of Him, brings forth a spirit of
salvation.
To-day the new-born lambs and calves frisk and leap about joyfully
and returning to their mothers gambol about, so that the shepherds,
playing on their reeds, praise Christ in joy. The lambs, I say, are the
gentle people from among the pagans, and the calves—the idolaters
of the unbelieving countries who, having accepted the Law through
Christ’s incarnation and the teachings of the apostles and miracles,
and having returned to the holy Church, suck the milk of its
teachings; and the teachers of Christ’s flock, praying for all, praise
Christ, the Lord, who had collected all the wolves and sheep into one
herd.
To-day the trees send forth buds and the fragrant flowers bloom,
and behold, the gardens already emit a sweet odour, and the
workers labouring in hope acclaim Christ the giver of fruits. We were
before like the trees of the forest that bear no fruit, but to-day the
faith of Christ has been grafted on our unbelief, and those who
already held to the roots of Jesse have burgeoned with the flowers of
virtue and expect through Christ a regeneration in heaven, and the
saints who labour for the Church expect a reward from Christ. To-day
the ploughman of the Word leads the oxen of the Word to the
spiritual yoke, sinks the plough of baptism into the furrows of thought
and deepening them to furrows of repentance plants in them the
spiritual seed and rejoices in the hope of future returns. To-day
everything old has taken an end, and all is new for the sake of the
resurrection. To-day the apostolic rivers are full, and the pagan fish
let out their broods, and the fishermen, having examined the depth of
the divine incarnation, drag in full nets into the Church.... To-day the
industrious bees of the monastic order show their wisdom and set all
to wonder, for living in the wilderness and providing for themselves,
they astonish both angels and men, just as the bee flies upon the
flowers and forms combs of honey in order to furnish sweetness to
man and what is needed in the church....
To-day there is a feast of regeneration for the people who are
made new by the resurrection of Christ, and all new things are
brought to God: from heathens, faith; from good Christians, offerings;
from the clergy, holy sacrifices; from the civil authorities, God-
pleasing charity; from the noble, care for the Church; from the
righteous, humility; from the sinners, true repentance; from the
unhallowed, a turning to God; from the hating, spiritual love.
Néstor’s Chronicle. (XII. century.)
Néstor was born about 1056, and at the age of seventeen
entered the monastery of the Grottoes at Kíev. In 1091 he
was commissioned to find in the Grottoes the mortal relics of
Theodosius, the founder of the monastery. Having performed
this task he wrote a life of the founder. He died about 1146. To
this Néstor has been ascribed the authorship of the chronicle
which in one of the manuscripts of the fourteenth century
bears the title: The stories of bygone years, whence the
Russian land began, who first reigned at Kíev, and how the
Russian land was formed. It has, however, been proved that
only a small part of the chronicle belongs to him, and that the
last editor of the whole was the abbot Sylvester, the
continuator of Néstor’s Chronicle for the twelfth century.
The chronicle contains the reports of important facts in the
life of the princes, arranged in chronological order. The
author, or authors, being of the clerical profession, the
influence of Christianity shows itself throughout in the use of a
biblical diction. This is especially the case where Byzantine
chronographers, whose influence on all the early Russian
chronicles is unmistakable, and church and monastery notes
are the source of the historical narrative. But popular stories,
legends and accounts of eye-witnesses also play an
important part in the composition of the work, and in these the
diction is more dramatic and natural. The chronicle covers the
period from 862 to 1110, and is exceedingly valuable as the
chief source for the history of Russia for the time described. It
has not come down to us in the original, but has reached us in
copies of the fourteenth century, of which the Laurentian
manuscript, copied by the monk Laurentius for Dimítri
Konstantínovich, Prince of Súzdal, is the most important.
THE BAPTISM OF VLADÍMIR AND OF ALL RUSSIA

In the year 6495 (987), Vladímir called together his boyárs and city
elders, and said to them: “There have come to me Bulgarians who
said: ‘Accept our religion!’ Then came the Germans, and they
praised their religion; after them came the Jews.[16] But after them
came the Greeks, who spoke slightingly of all the other religions, but
praised their own. They spoke much about the beginning of the
universe and the existence of the whole world. They are cunning of
speech, and talk so pleasantly that it is a pleasure to hear them.
They say that there is another world, and that if anyone enters into
their faith, he would live after his death, and would not die for
eternity; but that if he accepts any other faith, he would burn in the
other world. Now, what counsel do you give me? What is your
answer?”
And the boyárs and elders said: “You know, O Prince, that nobody
detracts his own, but praises it. If you are anxious to find out the
truth, you have men whom you can send out to see how they all
serve God.”
And the speech pleased the Prince and all people. They selected
good and clever men, to the number of ten, and said to them: “Go
first to the Bulgarians and inquire into their religion!” And they went,
and saw their abominable deeds and worshipping in shrines, and
returned to their land. Vladímir said to them: “Go now to the
Germans, find out there also, and thence go to Greece!”
And they went to Germany and, having seen their divine service,
they came to Constantinople, and went to the Emperor. The Emperor
asked them what they had come for, and they told him all as it was.
Having heard this, the Emperor was glad, and gave them a banquet
on that very day. Next morning he sent to the Patriarch saying:
“Some Russians have come to find out about our faith; so have the
church and clergy in order, and yourself don the holy garments, that
they may see the glory of our God.”
Having heard this, the Patriarch called together the clergy to
celebrate the day according to the custom, and he had the censers
lighted, and arranged the singing and the choir. The Emperor went
with them to church, and they were placed in a prominent place
where they could see the beauty of the church, hear the singing and
archiepiscopal ministration, and watch the attendance of the
deacons in the divine service. They were surprised, and marvelled,
and praised their service. And the Emperors Basil and Constantine
called them and said to them: “Go to your land!” and they sent them
away with many gifts and honours.
They came back to their country, and their Prince called together
his boyárs and old men. Said Valdímir: “The men we have sent away
have come back. Let us hear what has happened!” And he said:
“Speak before the druzhína!” and they spoke: “When we were in
Bulgaria, we saw them worshipping in the temple, where they talk in
the shrine and stand without their girdles. Having made their
obeisance, they sit down and look around hither and thither like
madmen, and there is no joy among them, only sadness and a great
stench: their religion is not good. And we came to Germany, and we
saw many ceremonies in their temples, but of beauty we saw none.
We went to Greece, and they took us where they worship their God,
and we do not know whether we were in heaven or upon earth, for
there is not upon earth such sight or beauty. We were perplexed, but
this much we know that there God lives among men, and their
service is better than in any other country. We cannot forget that
beauty, for every man that has partaken of sweetness will not
afterwards accept bitterness, and thus we can no longer remain in
our former condition.” And the boyárs answered and said: “If the
Greek religion were bad, your grandmother Ólga, who was the
wisest of all men, would not have accepted it.” And Vladímir
answered and said: “Where shall we receive our baptism?” But they
answered: “Wheresoever it may please you!”
Next year, the year 6496, Vladímir went with his warriors against
Korsún,[17] a Greek city, and the Korsúnians shut themselves up in
the city. Vladímir was encamped at the side of the city nearest the
harbour, at one shot’s distance from it, and they fought valiantly in
the city, and Vladímir beleaguered it. The townspeople were
weakening, and Vladímir said to them: “If you do not surrender, I
shall stay here, if need be, three years.” They paid no attention to it,
and Vladímir drew up his soldiers, and ordered them to build a
rampart to the city. While they were asleep, the Korsúnians
undermined the city wall, and, stealing the dirt which they had thrown
up, carried it into the city, and deposited it there. The soldiers again
filled up the rampart, and Vladímir remained there.
A Korsún man, by the name of Nastás, shot an arrow upon which
was written as follows: “It is by the wells that are behind you in the
east, that the water is led by pipes into the city; dig them up, and
stop the supply!” Hearing this, Vladímir looked to the heavens and
said: “If it shall come to pass, I will be baptised,” and immediately he
ordered the pipes to be dug up, and the water was intercepted. The
people were exhausted with thirst, and they surrendered themselves.
Vladímir entered the city with his druzhína, and he sent word to the
Emperors Basil and Constantine: “I have taken your famous city. I
hear you have a sister who is still a maiden. If you will not give her to
me for a wife, I shall do unto your city as I have done unto this.”
And they heard the tsar, and were sad, and gave the following
answer: “It does not behoove Christians to give in marriage to a
pagan. If you will receive the baptism, you shall get her, and you will
receive the kingdom of heaven, and will be of one faith with us. If you
do not wish to do so, we cannot give you our sister.”
Hearing this, Vladímir said to the messengers of the Emperors:
“Tell your Emperors that I will be baptised, that I have inquired before
these days into your faith, and am pleased with your belief and
divine service, from what the men that had been sent by us have told
me.”
Which when the Emperors heard, they were glad and persuaded
their sister, by the name of Anna, and sent to Vladímir saying:
“Receive the baptism, and then we will send our sister to you.”
But Vladímir answered: “Let them come with your sister to baptise
me!”
The Emperors obeyed, and sent their sister and a few high officers
and presbyters. She did not want to go: “It is as if I were going into
captivity,” she said. “It were better if I died here.” And her brothers
said to her: “Perchance God will through you turn the Russian land
to repentance, and free Greece from a dire war. Do you not see how
much evil the Russians have caused to the Greeks? If you will not
go, they will do even thus to us.” They persuaded her with difficulty.
She boarded a boat, kissed her relatives under tears and went
across the sea. She arrived at Korsún, and the Korsúnians met her
with honours, and led her into the city and seated her in the palace.
By God’s will, Vladímir was at that time ailing with his eyes, and he
could not see, and was much worried. The empress sent to him
saying: “If you want to be rid of your disease, be baptised at once. If
not, you will not be rid of it.”
Hearing this, Vladímir said: “If it will be so in truth, then indeed
your Christian God is great.” And he ordered to baptise him. The
bishop of Korsún with the priests of the empress received Vladímir
as a catechumen and baptised him, and the moment he laid his
hands upon him, he regained his eyesight. When Vladímir saw this
sudden cure, he praised God and said: “Now have I for the first time
found the real God!” When his druzhína perceived this, many were
baptised. He was baptised in the church of St. Basil, and that church
is situated in Korsún, there where the Korsúnians have their market-
place. Vladímir’s palace by the church is standing up to the present
day. The palace of the empress is beyond the altar. After the baptism
he led the empress to the betrothal. Those who do not know right
say that he was baptised in Kíev; others say in Vasilév; others again
say otherwise.
After that, Vladímir took the empress and Nastás, and the Korsún
priests with the holy relics of Clement and Phœbus, his disciple, and
church vessels, and images, for his own use. He built a church in
Korsún on the hill which they had thrown up in the middle of the city
from the dirt they had carried away, and that church is still standing
there. Going away, he took along with him two brass statues and
four brass horses which stand to-day behind the church of the Holy
Virgin, and which the ignorant think to be of marble. He gave as a
marriage price Korsún back to the Greeks, for the sake of the
empress, and went back to Kíev.
Upon his return, he ordered the idols to be cast down, and some
to be cut to pieces, and others to be consumed by fire; but Perún he
had tied to the tail of a horse, and dragged down the hill over the
Boríchev[18] to the brook, and placed twelve men to strike him with
rods, not as if the wood had any feeling, but as a scorn to the devil
who had in that way seduced people, that he might receive his due
punishment from men. As he was dragged along the brook to the
Dnieper, the unbelievers wept over him, for they had not yet received
the holy baptism, and he was cast into the Dnieper. Vladímir stood
by, and said: “Should he be carried anywhere to the banks, push him
off, until he has passed the rapids, when you may leave him!” They
did as they were told. When he passed the rapids, and was let loose,
the wind carried him on a sandbank, which is named from this
“Perún’s Bank,” and is called so to this day.
After that Vladímir proclaimed throughout the whole city:
“Whosoever will not appear to-morrow at the river, whether he be
rich or poor, or a beggar, or a workingman, will be in my disfavour.”
Hearing this, people came gladly and with joy, and said: “If this were
not good, the Prince and boyárs would not have accepted it.” Next
morning Vladímir went out with the priests of the empress and of
Korsún to the Dnieper, and there came together people without
number. They went into the water, and stood there up to their necks,
and some up to their breasts, but the younger nearer the shore, and
others held the younger ones, while the grown people waded into the
water. And the priests stood there and said the prayers; and there
was a joy in heaven and upon earth at the sight of so many saved
souls, but the devil groaned, and said: “Woe to me! I am driven away
from here. Here I had intended to have my habitation, for here are no
apostolic teachings, and they do not know God, and I rejoiced in the
worship with which they served me. And now I am conquered by
ignorant people and not by apostles and martyrs. I shall no longer
reign in these lands.”
Having been baptised, the people went to their houses. Vladímir
was happy for having, himself and his people, found God, and
looking up to heaven he said: “God, Thou hast created heaven and
earth! Guard these Thy new people, and let them, O Lord, find out
the real God, such as the Christian people know Him. Strengthen the
true and constant faith in them, and help me, O Lord, against my foe,
that relying upon Thee and Thy power, I may escape his ambush!”
The people having been baptised, they all went to their homes,
and Vladímir ordered churches to be built, and to place them there
where formerly stood the idols. He built the church of St. Basil on the
hill where stood the idol Perún and the others, to whom the Prince
and others used to bring sacrifices. And he began to locate churches
and priests over the towns, and to lead people to baptism in all
towns and villages. He sent out men to take the children of
noblemen, and to put them out for book instruction; but the mothers
of those children wept for them, for they were not yet firm in their
faith, and they wept for them as for the dead.
FOOTNOTES:
[16] The Khazars, a Tartar tribe that professed the Mosaic Law.
[17] The ancient Tauric Chersonese; this later city was not built
on the ancient site, but near Sebastopol.
[18] A suburb of Kíev.
The Kíev Chronicle. (XII. century.)
The Kíev Chronicle is a continuation of Néstor’s Chronicle,
from 1111-1201, and describes mainly the acts of the
principality of Kíev. The best manuscript of this chronicle is
from the monastery of St. Ipáti, near Kostromá, and dates
from the end of the fourteenth, or the beginning of the
fifteenth, century. The passage given below is selected to
illustrate the historical account of the same incident contained
in the Word of Ígor’s Armament.
THE EXPEDITION OF ÍGOR SVYATOSLÁVICH AGAINST THE

PÓLOVTSES[19]
In the year 6693 (1185). At that time Ígor, the son of Svyatosláv,
the grandson of Olég, rode out of Nóvgorod on the 23rd of April,
which was on a Tuesday, having taken with him his brother Vsévolod
from Trubétsk, and Svyatosláv Ólgovich, his nephew, from Rylsk,
and Vladímir, his son, from Putívl, and Yarosláv had sent him, at his
request, Olstín Oléksich, the grandson of Prokhór, with Kovúans[20]
from Chernígov. They proceeded slowly, collecting their druzhína, for
their horses were very fat. As they were going towards the river
Donéts, Ígor looked one evening at the sky, and he saw the sun
standing there like a moon, and he said to his boyárs and druzhína:
“Do you see this omen?”
They looked up, and having noticed it, hung their heads, and said:
“Prince, this is not a good omen!”
But Ígor said: “Brothers and druzhína! Nobody knows God’s
mystery, and God is the creator of mystery, as well as of all His
world; but we shall find out in time whether God means our good or
our evil.”
Having said this, he forded the Donéts and came to the river
Oskól, where he waited for two days for his brother Vsévolod who
was marching by another road from Kursk; thence they proceeded to
Sálnitsa. There came to them the guards whom they had sent out to
reconnoitre; they said: “We have seen the army of the enemy; they
were riding rapidly: either you ride fast, or we had better return
home, for the time is not propitious.”
But Ígor consulted his brothers and said: “If we return without
fighting, our shame will be greater than death. Let us proceed with
God’s aid!”
Having said this, they travelled through the night, and the next day,
which was a Friday, they met the army of the Pólovtses at noontime.
When they saw them, they were without their tents, for they had left
them behind them, but the old and young were all standing on the
other side of the river Syuurlí. The Russians arranged their six troops
as follows: Ígor’s troop was in the middle, to his right was the troop of
his brother Vsévolod, and to the left that of his nephew Svyatosláv;
in front of him was placed his son Vladímir, and Yarosláv’s Kovúans,
and a third troop of archers was in front of them, and they were
selected from the troops of all the princes; that was the position of
their troops.
And Ígor spoke to his brothers: “Brothers! We have found what we
have been looking for, so let us move on them!” And they advanced,
placing their faith in God. When they came to the river Syuurlí, the
archers galloped out from the troops of the Pólovtses, sent each an
arrow against the Russians, and galloped back again, before the
Russians had crossed the river Syuurlí; equally the Pólovtses who
stood farther away from the river galloped away. Svyatosláv
Ólgovich, and Vladímir Ígorevich, and Olstín with his Kovúans, and
the archers ran after them, while Ígor and Vsévolod went slowly
ahead, and did not send forward their troops; but the Russians
ahead of them struck down the Pólovtses. The Pólovtses ran beyond
their tents, and the Russians, having come as far as the tents,
plundered them, and some returned in the night with their booty to
the army.
When the Pólovtses had come together, Ígor said to his brothers
and men: “God has given us the power to vanquish our enemy, and
honour and glory to us! We have seen the army of the Pólovtses that
it is large, and I wonder whether they have all been collected. If we
now shall ride through the night, what surety is there that all will
follow us next morning? And our best horsemen will be in the
meantime cut down, and we will have to shift as best we can.”
And Svyatosláv Ólgovich spoke to his uncles: “I have driven the
Pólovtses a long distance, and my horses are played out; if I am to
travel on to-day, I shall have to fall behind on the road,” and
Vsévolod agreed with him that it was best to rest.
Ígor spoke: “Knowing this, it is not proper to expose ourselves to
death,” and they rested there.
When the day broke on the Saturday, the troops of the Pólovtses
began to appear like a forest. The Russian princes were perplexed,
and did not know whom to attack first, for there was a numberless
host of them. And Ígor said: “See, I have collected against me the
whole land: Konchák, Kozá, Burnovích, Toksobích, Kolobích,
Etebích, and Tertrobích.” And seeing them, they dismounted from
their horses, for they wished to reach the river Donéts by fighting,
and they said: “If we remain on horseback, and run away, and leave
our soldiers behind, we will have sinned before God; but let us die or
live together!” And having said this, they all dismounted and fought
on foot.
By the will of God, Ígor was wounded, and his left arm was
disabled, and there was a great sorrow in his troop; and they
captured his general, having wounded him in front. And they fought
that day until evening, and many were the wounded and killed in the
Russian army. They fought till late into the night, and when the
Sunday began to break, the Kovúans became confused and ran
away. Ígor was at that time on horseback, for he was wounded, and
he followed them up, trying to bring them back to the army. Seeing
that he had gone far away from his people, he took off his helmet so
that they might recognise him and might return to the army, and he
rode back to his troop. But no one returned, except Mikhálko
Gyúrgevich who had recognised the Prince. The trouble was, no
one, except a few of the rank and file and boyárs’ youths, had
thoroughly mingled with the Kovúans, for they were all busy fighting
on foot; among these, Vsévolod excelled in bravery. As Ígor was
approaching his troop, the Pólovtses crossed his path and made him
prisoner within an arrow’s shot from his troop. While Ígor was held
captive, he saw his brother fighting mightily, and in his heart he
implored for his own death that he might not see his brother fall
dead; but Vsévolod was fighting until he had no weapons left in his
hands, and they were fighting around a lake.
It was on the day of the holy Sunday that the Lord brought down
His anger upon them, and changed joy into weeping, and instead of
pleasure gave them sorrow, on the river Kayála. And Ígor spoke: “I
now recall my sins before the Lord my God, for I have caused much
slaughter and bloodshed in the Christian land, and did not spare the
Christians, but took by storm the town of Glyébov near Pereyáslavl.
Then innocent Christians suffered no small measure of evil, for
fathers were separated from their children, brother from brother,
friend from friend, wives from husbands, and daughters from their
mothers, and all was confused in captivity and sorrow. The living
envied the dead, and the dying rejoiced because they had like holy
martyrs received their trial by fire in this life; old men were killed,
young men received fierce and inhuman wounds, men were cut to
pieces. All this I have done, and I am not worthy to live; to-day the
revenge of the Lord has reached me. Where is now my beloved
brother? Where is now the son of my brother? Where is the child of
my loins? Where are the counselling boyárs, where are the brave
men, the ranks of the soldiers? Where are the horses and costly
weapons? Am I not separated from all that, and has not the Lord
given me fettered into the hands of the pagans? The Lord has repaid
me for my lawlessness and my meanness, and my sins have this
day come down upon my head. The Lord is just, and His judgments
are right, and I have nothing in common with the living. I see to-day
others receiving the crown of martyrdom, but why can I not, guilty
one, suffer for all of them? But Lord my God! Do not reject me to the
end, but as Thy will, O Lord, is done, so also is Thy mercy to us, Thy
slaves!”
The battle being over, the Pólovtses scattered, and went to their
tents. Ígor was captured by the Targólans, by a man named Chilbúk;
his brother Vsévolod was taken by Román Kzich, Svyatosláv
Ólgovich by Eldechyúk of the Boburchéviches, and Vladímir by Kópti
of the Ulashéviches. Then Konchák took care of Ígor on the
battlefield, for he was wounded. Of the many prisoners taken but few
could run away, God being willing, for it was not possible for anyone
to escape, being surrounded on all sides by the Pólovts army as with
mighty walls; and yet there escaped about fifteen of us Russians,
and fewer Kovúans, but the rest were drowned in the sea.
At that time Grand Prince Vsévolod’s son Svyatosláv had gone to
Koráchev[21] to collect warriors in the upper lands, wishing in the
summer to go to the Don against the Pólovtses. When Svyatosláv
returned and was at Nóvgorod Syéverski, he heard that his brothers
had gone against the Pólovtses, without his knowledge, and he was
displeased. Svyatosláv was travelling in boats, and when he arrived
in Chernígov, Byelovolód Prosóvich came to him and told him what
had happened with the Pólovtses. When Svyatosláv heard that, he
sighed much and, wiping off his tears, he said: “O beloved brothers
and sons and men of the Russian land! Oh, that God would grant me
to crush the pagans! But they, impulsive in their youth, have opened
the gates into the Russian land. The will of the Lord be on
everything! However sorry I was for Ígor, I am more sorry for Ígor, my
brother!”
After that Svyatosláv sent his son Olég and Vladímir into the
Posémie,[22] for when the cities of the Posémie heard of the disaster,
they were disturbed, and there was a sorrow and heavy anguish
upon them, such as had never before been in the whole Posémie, in
Nóvgorod Syéverski and in the whole district of Chernígov. They had
heard that their princes had been taken prisoners, and the druzhína
had been captured, and killed; and they became restless, as if in
turbid water, and the cities revolted, and many had no care for their
relatives, but they renounced their souls, weeping for their princes.
After that Svyatosláv sent to David of Smolénsk, saying: “We had
intended to go against the Pólovtses, and pass the summer on the
Don; but now the Pólovtses have vanquished Ígor, and his brother
with his son; now come, brother, to protect the Russian land!” And
David came to the Dnieper, and there arrived also other help, and
they stopped at Trepól, but Yarosláv collected his troops at
Chernígov.
The pagan Pólovtses, having conquered Ígor and his brothers,
were filled with great conceit, and they gathered all their tribes
against the Russian land. And there was a strife among them, for
Konchák said: “Let us march against Kíev, where our brothers and
our Grand Prince Bonyák were cut down!” But Kza said: “Let us go
against the Sem, where their wives and children are left, an easy
booty for us; we shall sack their cities without danger!” And thus they
divided into two parts. Konchák went against Pereyáslavl. He
besieged the city, and they fought the whole day. At that time
Vladímir Glyébovich was the Prince of Pereyáslavl. He being bold
and a mighty warrior, rode out of the city and rushed against the
enemy, and then a few men of his druzhína were emboldened, and
they fought valiantly. Many Pólovtses surrounded them. Then the
others, seeing their Prince hard pressed, rushed out of the city, and
saved their Prince, who was wounded with three spear thrusts. This
good Vladímir rode back into the city heavily wounded, and he wiped
the sweat from his brave face, having fought doughtily for his
country.
Vladímir sent word to Svyatosláv, and to Rúrik, and to David: “The
Pólovtses are at my gates, help me!” Svyatosláv sent word to David,
who stood at Trepól with his Smolénsk troop. The men of Smolénsk
held a council, and said: “We have marched to Kíev to fight in case
there is a war there; but we cannot look for another war, for we are
worn out.” Svyatosláv hurried to the Dnieper with Rúrik and other
troops, against the Pólovtses, and David went away with his
Smolénsk men. When the Pólovtses heard this, they went away from
Pereyáslavl, but on their way they attacked Rímov. The Rímovans
shut themselves up in the city; having climbed the rampart, two
wicker structures gave way with all their men, God having so willed,
and broke in the direction of the enemy. Terror fell upon the city
people. Some of them sallied from the city and kept up a running
fight into the Rímov swamps, and thus escaped capture; but those
who remained in the city were all taken prisoners. Vladímir sent
again to Svyatosláv Vsévolodich and Rúrik Rostislávich, imploring
them to come to his aid. But they were tardy in coming, having
waited for David with his Smolénsk troop, and thus they did not get
there in time to meet the Pólovtses. Having taken the city of Rímov,
the Pólovtses returned to their homes, loaded down with booty. The
princes went back to their homes, and they were very sad, and they
were sorry for Vladímir Glyébovich, for he was struck down with
mortal wounds, and they were sorry for the Christians that had been
taken prisoners by the pagans....
The other Pólovtses were going by another road to Putívl. Kza had
a large host with him; they laid waste the country, burnt the villages,
and also burnt the castle near Putívl, and returned home again.
Ígor Svyatoslávich was that year with the Pólovtses, and he said:
“According to my deserts have I received defeat at Thy hands, my
Lord, and not the daring of the pagans has broken the might of Thy
servants. I do not complain of my suffering, for I have been punished
for my misdeeds.” The Pólovtses, respecting his leadership, did not
do him any harm, but placed over him fifteen guards of their sons,
and five lords’ sons, in all twenty. They gave him permission to go
where he wanted, and he went a-hunting with the hawk, and there
were with him five or six of his servants. His guards obeyed him and
honoured him, and whithersoever he sent them, they did his
command without grumbling. He had brought with him a priest from
Russia, with all the divine service, for he did not know the divine will,
and he thought he would have to stay there for a long time. But the
Lord delivered him for the many prayers of the Christians which they
sent up to heaven, and the many tears which they shed for him.
While he was among the Pólovtses, there was a man there, himself
a Pólovts, by the name of Lavór; he having a blessed thought said: “I
will go with you to Russia!” At first Ígor had no confidence in him, but
had a high opinion of his own manliness, for he did not intend to take
the man and run with him into Russia; he said: “For glory’s sake I did
not then run away from my druzhína, and even now will I not walk
upon an inglorious road.”

Quantitative Methods For Business 13Th Edition Anderson Test Bank Full Chapter PDF

Uploaded by

Document Information

Original Title

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

Quantitative Methods For Business 13Th Edition Anderson Test Bank Full Chapter PDF

Uploaded by

Copyright:

Available Formats

Quantitative Methods for Business 13th

Edition Anderson Test Bank

8. The shortest-route problem is a special case of the transshipment problem.

Cengage Learning Testing, Powered by Cognero Page 2

18. Flow in a transportation network is limited to one direction.

23. The parts of a network that represent the origins are

24. The objective of the transportation problem is to

25. The number of units shipped from origin i to destination j is represented by

28. In the general linear programming model of the assignment problem,

29. The assignment problem is a special case of the

32. Arcs in a transshipment problem

33. Constraints in a transshipment problem

34. In a transshipment problem, shipments

Cengage Learning Testing, Powered by Cognero Page 6

36. The shortest-route problem finds the shortest-route

38. We assume in the maximal flow problem that

Cengage Learning Testing, Powered by Cognero Page 7

40. Which of the following is not a characteristic of assignment problems?

Subjective Short Answer

42. Write the LP formulation for this transportation problem.

s.t. X1A + X1B ≤ 100

43. Draw the network for this transportation problem.

Min 2XAX + 3XAY + 5XAZ+ 9XBX + 12XBY + 10XBZ

s.t. XAX + XAY + XAZ ≤ 500

Min 3XAX + 2XAY + 5XAZ + 9XBX + 10XBY + 5XCX + 6XCY + 4XCZ

s.t. XAX + XAY + XAZ ≤ 200

SUMMARY OF ORIGIN SUPPLIES

TOTAL TRANSPORTATION COST OR REVENUE IS 358

ORIGIN EXCESS SUPPLY

b. How many projectors are moved from Baker to Business?

Cengage Learning Testing, Powered by Cognero Page 12

Let Xij = 1 if person i is assigned to job j

Min 9X1A + 5X1B + 4X1C + 2X1D

s.t. X1A + X1B + X1C + X1D ≤ 1

48. Draw the network for this assignment problem.

Min 10x1A + 12x1B + 15x1C + 25x1D + 11x2A + 14x2B + 19x2C + 32x2D

s.t. x1A + x1B + x1C + x1D = 1

SUMMARY OF UNIT COST OR REVENUE DATA

50. Write the linear program for this transshipment problem.

s.t. x16 + x14 + x35 ≤ 500

Orchard Supply Station Cannery Capacity

b. Formulate this problem as a transshipment linear programming model.

Cengage Learning Testing, Powered by Cognero Page 16

b. Denote A1 as node 1, A2 as node 2, S1 as node 3, S2 as node 4,

Min 50X13 + 500X14 + 600X23 + 450X24 + 250X35 + 300X36

s.t. X13 + X14 ≤ 15

Cengage Learning Testing, Powered by Cognero Page 17

+ 6X47 + 8X52 + 7X53 + 3X54 + 4X57 + 9X63 + 3X67

s.t. X12 + X13 =1

Min 3X12 + 2X13 + 4X24 + 5X25 + 3X34 + 7X35

s.t. X12 + X13 =1

Cengage Learning Testing, Powered by Cognero Page 18

s.t. X12 + X15 + X16 =1

s.t. X12 + X13 + X14 =1

X43 + X46 − X24 − X34 =0

Cengage Learning Testing, Powered by Cognero Page 21

X23 ≤ 300 X24 ≤ 400

b. Define the decision variables:

+ 100x510 + 50x610 + 100x611 + 50x711

The Management Scientist provided the following solution:

Objective Function Value = 1045000.000

Cengage Learning Testing, Powered by Cognero Page 23

ANSWER: Decision variables: