PDF Test Bank For An Introduction To Management Science Quantitative Approach 15Th Edition David R Anderson Online Ebook Full Chapter

Test Bank for An Introduction to
Management Science: Quantitative

Approach 15th Edition David R.
Anderson
Visit to download the full and correct content document: https://testbankbell.com/dow
nload/test-bank-for-an-introduction-to-management-science-quantitative-approach-15
th-edition-david-r-anderson/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...
Test Bank for An Introduction to Management Science:

Quantitative Approach, 15th Edition, David R. Anderson,
ISBN-10: 133740652X, ISBN-13: 9781337406529
http://testbankbell.com/product/test-bank-for-an-introduction-to-
management-science-quantitative-approach-15th-edition-david-r-
anderson-isbn-10-133740652x-isbn-13-9781337406529/
Test Bank for An Introduction to Management Science

Quantitative Approaches to Decision Making, 12th
Edition : Anderson Sweeney
management-science-quantitative-approaches-to-decision-
making-12th-edition-anderson-sweeney/
Solution Manual for An Introduction to Management

Science Quantitative Approaches to Decision Making 13th
Edition by Anderson
http://testbankbell.com/product/solution-manual-for-an-
introduction-to-management-science-quantitative-approaches-to-
decision-making-13th-edition-by-anderson/
Test Bank for An Introduction to Management Science

Quantitative Approaches to Decision Making, Revised,
13th Edition
management-science-quantitative-approaches-to-decision-making-
revised-13th-edition/
Quantitative Methods for Business, 12th Edition Test
Bank – David R. Anderson
http://testbankbell.com/product/quantitative-methods-for-
business-12th-edition-test-bank-david-r-anderson/
Test Bank for Strategic Management: A Competitive

Advantage Approach, Concepts, 15/E 15th Edition Fred R.
David, Forest R. David
http://testbankbell.com/product/test-bank-for-strategic-
management-a-competitive-advantage-approach-concepts-15-e-15th-
edition-fred-r-david-forest-r-david/
Solution Manual for Strategic Management: A Competitive

Advantage Approach, Concepts & Cases, 15/E 15th Edition
Fred R. David, Forest R. David
http://testbankbell.com/product/solution-manual-for-strategic-
management-a-competitive-advantage-approach-concepts-
cases-15-e-15th-edition-fred-r-david-forest-r-david/
Social Science An Introduction to the Study of Society

15th Edition Hunt Colander Test Bank
http://testbankbell.com/product/social-science-an-introduction-
to-the-study-of-society-15th-edition-hunt-colander-test-bank/
Test Bank for Strategic Management: A Competitive

Advantage Approach, Concepts, 15/E, Fred R. David
Forest R. David
http://testbankbell.com/product/test-bank-for-strategic-
management-a-competitive-advantage-approach-concepts-15-e-fred-r-
david-forest-r-david/
Test Bank for An Introduction to Management Science: Quantitative Approach 15th Edition Davi
Test Bank for An Introduction to Management

Science: Quantitative Approach 15th Edition David R.
Anderson
To download the complete and accurate content document, go to:

https://testbankbell.com/download/test-bank-for-an-introduction-to-management-scien
ce-quantitative-approach-15th-edition-david-r-anderson/
Visit TestBankBell.com to get complete for all chapters

CH 06 - Distribution and 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
DIFFICULTY: Easy
LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6.1
NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking
TOPICS: 6.1 Supply Chain Models
KEYWORDS: Bloom's: Remember
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
DIFFICULTY: Easy
3. A transportation problem with three sources and four destinations will have seven decision variables.
a. True
b. False
ANSWER: False
POINTS: 1
DIFFICULTY: Easy
KEYWORDS: Bloom's: Understand
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
DIFFICULTY: Easy
© Cengage. Testing Powered by Cognero. Page 1
5. When a transportation problem has capacity limitations on one or more of its routes, it is known as a capacitated
transportation problem.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy
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
DIFFICULTY: Easy
7. A transshipment constraint must contain a variable for every arc entering or leaving the node.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy
8. The shortest-route problem is a special case of the transshipment problem.

a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy
TOPICS: 6.3 Shortest-Route Problem
9. Transshipment problems allow shipments both in and out of some nodes, while transportation problems do not.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy
10. A dummy origin in a transportation problem is used when supply exceeds demand.
a. True
b. False
ANSWER: False
POINTS: 1
DIFFICULTY: Easy
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
DIFFICULTY: Easy
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
DIFFICULTY: Moderate
TOPICS: 6.4 Maximal Flow Problem
13. The maximal flow problem can be formulated as a capacitated transshipment problem and determines the maximum
amount of flow (such as messages, vehicles, fluid, etc.) that can enter and exit a network system in a given period of time.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy
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
DIFFICULTY: Easy
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
DIFFICULTY: Easy
16. The assignment problem is a special case of the transportation problem in which one agent is assigned to one, and only
one, task.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy
TOPICS: 6.2 Assignment Problem
17. A transportation problem with three sources and four destinations will have seven variables in the objective function.
a. True
b. False
ANSWER: False
POINTS: 1
DIFFICULTY: Easy
18. Flow in a transportation network is limited to one direction.

a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy
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
DIFFICULTY: Easy
20. In an assignment problem, one agent can be assigned to several tasks.

a. True

b. False
ANSWER: False
POINTS: 1
DIFFICULTY: Easy
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
DIFFICULTY: Easy
22. In a transportation problem, excess supply will appear as slack in the linear programming solution.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy
23. There are two specific types of problems common in supply chain models that can be solved using linear programing:
transportation problems and transshipment problems.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy
Multiple Choice

24. The problem that deals with the distribution of goods from several sources to several destinations is a(n)
a. maximal flow problem.
b. transportation problem.
c. assignment problem.
d. shortest-route problem.
ANSWER: b
POINTS: 1
DIFFICULTY: Easy
25. The parts of a network that represent the origins are called
a. capacities.
b. flows.
c. nodes.
d. arcs.
ANSWER: c
POINTS: 1
DIFFICULTY: Easy
26. 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
DIFFICULTY: Easy
27. We represent the number of units shipped from origin i to destination j by

a. xij .
b. xji .
c. oij .
d. oji .
ANSWER: a
POINTS: 1
DIFFICULTY: Easy
28. 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 calculated as number of origins times number of destinations.
c. The number of constraints is calculated as number of origins times number of destinations.
d. The constraints' left-hand-side coefficients are either 0 or 1.
ANSWER: c
POINTS: 1
29. 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
DIFFICULTY: Easy
30. 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
DIFFICULTY: Easy
31. 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
DIFFICULTY: Easy
32. 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
33. The assignment problem constraint x31 + x32 + x33 + x34 ≤ 2 means
a. agent 3 can be assigned to two tasks.
b. agent 2 can be assigned to three 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
NATIONAL STANDARDS: United States - BUSPROG: Analytic
34. 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 these are correct.
ANSWER: c
POINTS: 1
DIFFICULTY: Easy
35. 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 these are correct.
ANSWER: b
POINTS: 1
DIFFICULTY: Easy
36. 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
37. 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
38. The shortest-route problem finds the shortest route

a. from the source to any other node.
b. from any node to any other node.
c. from any node to the destination.
d. None of these are correct.
ANSWER: b
POINTS: 1
DIFFICULTY: Easy
39. 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.
ANSWER: b
POINTS: 1
40. In a maximal flow problem,

a. the flow out of a node is less than the flow into the node.
b. the objective is to determine the maximum amount of flow that can enter and exit a network system in a given
period of time.
c. the number of arcs entering a node is equal to the number of arcs exiting the node.
ANSWER: b
POINTS: 1

41. 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
DIFFICULTY: Easy
42. 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
43. 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: 6.5 A Production and Inventory Application
Subjective Short Answer
44. 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
DIFFICULTY: Challenging
KEYWORDS: Bloom's: Create
45. 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
46. 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
47. After some special presentations, the employees of 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 questions b through 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 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
KEYWORDS: Bloom's: Evaluate
48. 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
KEYWORDS: Bloom's: Analyze
49. 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
50. 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
51. Write the linear program for this transshipment problem.

ANSWER:
3x16 + 2x14 + 3x15 + 5x24 + 6x25 + 2x32 + 8x 34 + 10x35 + 5x46 + 9x47 + 12x56 +
Min
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
52. 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 Slope 4 5
Old Farm 6 3
Waterford 2 2 4
Northside 5 9
Sanderson 2
Millville
ANSWER:
POINTS: 1
53. 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. Various costs are associated with the average purchase and transportation prices from
each auction to each repair shop. There are also 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. 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 and j
POINTS: 1
54. 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
55. 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
56. 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
57. 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
58. 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
LEARNING OBJECTIVE IMS.ASWC.19.06.04 - 6.4
S:
NATIONAL STANDARDS United States - BUSPROG: Analytic
:
59. 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
60. 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
61. 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
62. A clothing distributor has four warehouses that serve four large cities. Each warehouse has a monthly capacity of
5,000 blue jeans. It is considering using a transportation LP approach to match demand and capacity. The following table
provides data on 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 0.53 0.21 0.52 0.41
B 0.31 0.38 0.41 0.29
C 0.56 0.32 0.54 0.33
D 0.42 0.55 0.34 0.52
City Demand 2,000 3,000 3,500 5,500
ANSWER:
Xij = each combination of warehouse i and city j
Min 0.53XAE + 0.21XAF + 0.52XAG + 0.41XAH + 0.31XBE + 0.38XBF + 0.41XBG +
0.29XBH
+ 0.56XCE + 0.32XCF + 0.54XCG + 0.33XCH + 0.42XDE + 0.55XDF + 0.34XDG +
0.52XDH
s.t. 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
63. 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

Test Bank for An Introduction to Management Science: Quantitative Approach 15th Edition Davi

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 questions a through 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
s.t. 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
Visit TestBankBell.com to get complete for all chapters

Another random document with
no related content on Scribd:
CHAPTER IX
Journey into Shansi in 1893
I
NOW must go back to my first coming to Tientsin in 1893. From
Shanghai I came in a coasting steamer, and it was after starting
that I made the rather disconcerting discovery that I was the only
woman on board. Nevertheless it was the pleasantest voyage I ever
had, as my cabin had a proper bed in it and its own bathroom, and I
made the happy discovery that Chinese servants could be the best
in the world, while the officers all conspired to amuse me. The
voyage lasted a week, and the slow passage up the mouth of the
Peiho (ho means “river”) was quite a new experience. We ran into
the soft banks pretty frequently, and they crumbled like dust;
sometimes we were in imminent danger of carrying away a hut as
well, but happily that did not occur. One dreadful object kept
recurring again and again—a tall pole on the river-bank with a basket
on the top, containing a criminal’s head.
At Tientsin I was met by one of my sisters and her husband, who
had come to take me into Shansi. The European town was very dull
and prosaic, and the native city abjectly squalid, but now the former
is well laid out and there are plenty of large houses, shops, schools,
colleges, and tramways. I was not sorry to get away from it, however,
as I was anxious to see the real China, and we soon got our things
accommodated in a small house-boat to travel up the river to
Paoting-fu. Three little compartments were all we had, but we spent
a good part of each day walking on the banks and admiring the
lovely autumn colouring of the rushes. On my return a year later we
were not so fortunate, as the war with Japan was in full swing, so
that the country was too disturbed for us to walk about, and we had
to take whatever could be got in the way of a boat, namely, one
infested with cockroaches and other vermin. For three days and
nights we sat in misery, scarcely able to eat or sleep, and when we
opened our trunks at Tientsin we found them simply swarming with
cockroaches. They had eaten all the straw of a bonnet, leaving
nothing but lining and trimmings!
CAMEL INN
At Paoting-fu we left the river, and I had a mule litter while the
others rode. These litters are the most horrible invention, as the
mules perpetually tumble down, and even though you pad the sides
with your bedding you get much shaken. When we came to a river
we had to ford it or be ferried across, for there are no bridges in this
part, and often the rivers are very dangerous. On the roads we met
long strings of camels carrying packs, the tail of one animal being
attached to the nose of the one behind. They have inns of their own,
being cantankerous beasts, and are supposed to travel at nights,
because of being such an obstruction to traffic. Certainly if you lie
awake you can generally hear the tinkle of their bells. They are a
most attractive feature of the landscape in the north, whether seen in
the streets of Peking, or on the sandy plains of Chili. My sketch was
taken in the summer when the camels were changing their coats, so
that the one in the front has a grey, dishevelled look, corresponding
with Mark Twain’s description. He says that camels always look like
“second-hand” goods; but it is clear that he cannot know the fine
stately beast of North China.
The road leading to Taiyüanfu—our objective—was always
thronged with traffic, men on foot, on horseback, in chairs, or in
carts. The official messengers wore yellow, and dashed along faster
than any one else; but one day we met six mandarins in four-bearer
chairs, carrying an important document from the Emperor at Peking
into Szechwan, the western province. They were received
everywhere ceremoniously, and crackers sent off in their honour;
they were accompanied by a military escort and gorgeous banners.
At nights we often had to put up in wretched inns. The cold was
extreme at this time of year (November), and the brick bedsteads
were heated from underneath by a fire. This was all very well if it was
properly regulated, but sometimes it was allowed to get too hot, and
then you woke to find yourself baked like a biscuit. The nights were
short, for we often arrived after dark and had to get up at 4.30. Even
then it was difficult to get the men started at six, sometimes only at
seven o’clock. The clear cold moonlight mornings were very lovely,
and I was glad enough to walk to keep warm.
One day my brother-in-law made a détour to visit a village where
there is an interesting Christian community, whose history is a
remarkable one. It was the home of a thief, who in his wanderings
happened to go into a mission hall and heard the story of the life of
Christ. The next time he returned home, amongst other items of
news he retailed what he could remember of this strange story, and
so deeply interested the listeners that they found his knowledge far
too meagre to satisfy them; they decided to send two of their most
respected seniors to learn more about it. These men went to the
mission station, were carefully instructed and became Christians.
They returned to their village in course of time, taking a supply of
Christian literature, and thenceforward they have given themselves
entirely to the work of evangelisation at their own cost. Occasionally
a missionary goes round to see them—as in the present instance—
but otherwise they work steadily and successfully, without any
assistance from Europeans. This is an example of a fact which holds
good in China generally, namely, that the people do not leave
mission work to be done only by the missionaries, but become the
best workers themselves when they have accepted Christianity.
What Mr. James (of the Bombay Civil Service) says of the work of
the Presbyterians in Manchuria exemplifies this same fact: “Of 600
people who have been baptized since Mr. Ross came to Manchuria,
not more than a dozen owe their conversion primarily or chiefly to
the foreign missionaries; the others have become disciples of these
converts, and this spiritual seed has produced within a dozen years
the sixth or seventh generation.” This is the experience of workers
throughout the Empire, and was expressed by a Chinese lady
visiting England in a pathetic appeal for more missionaries: “If only
you will send us teachers now—for a few years—we will do the rest.”
To return to our narrative, my brother-in-law brought the two
Chinese elders with him when he rejoined us on the road, and they
greeted us like old friends, with radiant happiness. It was inspiring to
see their simple, heartfelt piety and their absolute realisation of
Christian brotherhood. We chanced to come across them again a
year later on my return journey to the coast, and again I saw their
simple, joyous faith, the sincerity of which could not be doubted by
the most cynical sceptic. It was the one bright spot in an otherwise
very trying and anxious journey, for the country was much disturbed,
owing to the war with Japan, and one of our party was ill with fever—
a boy of seven—and growing daily worse, so that when we at last
reached Tientsin he had a temperature of 107°.
When we approached the province of Shansi we got into a hilly
district, and crossed several ridges called “the Heavenly Gates.” In
some cases the ascent was pretty steep (2860 feet), and there were
temples at the bottom where the coolies prayed for a safe journey
up. When I stopped to sketch it aroused much interest, and
spectators always treated me with respect. It was explained to them
that I desired to show my mother the beauties of their country, so I
became the type of English “filial piety”!
The dangers of the road are numerous, and crossing the rivers is
often a very perilous proceeding: sometimes it is possible to ford
them, but the river-beds are so changeable that it was usually
necessary to have the guidance of experienced men. Sometimes we
had to be carried across on men’s backs, and it is not altogether a
pleasant experience to cling on to a bare, greasy back in a kneeling
position, with your arms round a most unwashed neck! Sometimes
we were ferried over, which was much the safest and pleasantest
way of crossing, and the charge is infinitesimally small.
Another danger of the road arises from the nature of the soil,
which is largely a loess formation. The road runs through deep
gulleys, often over 100 feet deep and quite narrow, but the loess
walls are apt to give way, especially after rain. One day we were
walking quietly along under a high cliff, when a deafening
thunderclap close behind us made us start and look back, to see a
dense cloud of dust where the cliff had fallen right across the path
we had just traversed. We had a very close shave that time. About a
year later my cousin was killed by the similar breaking down of a
road alongside a river; she was riding in a cart, and was buried
under it in the river. A friend who was with her had just got out to
walk a little, and consequently escaped.
During the rains travellers are often drowned by the sudden rush
of water down the gullies, and there are places of refuge in the high
banks—little caves or hollows. In some of the villages where we had
to stop the night the houses were dug in these cliffs, and were really
caves. The smells were atrocious, as there was but little ventilation.
The chimneys form danger traps to the unwary traveller walking
along the top of the cliffs; he may easily step into one, if he is not
looking carefully where he is going.
The day before we reached Tai Yuänfu, the capital of Shansi, we
stopped at a mission station in the charge of a delightful, courtly old
Chinese evangelist, whose hospitality I enjoyed several times. He
treated us royally, cooking dinner for us in European style, and would
have been sorely grieved had we offered him any remuneration.
When the troubles came later, not only he but every member of his
little flock—forty-one in all—were “faithful unto death,” refusing to
accept life at the price of recantation.
The journey from the coast took altogether a fortnight, and I was
glad when at last we reached the wide plain in which Tai Yuänfu is
situated. In May it is a vision of loveliness with its crops of millet,
sorghum, and poppy—white and puce colour—but now it was one
monotonous expanse of dust. The dust storms which blow across
the plain are terribly trying; they are as bewildering and as blinding
as a fog, and they sometimes go on daily for weeks during the early
part of the year.
Shansi is one of the worst provinces of all as regards opium-
smoking, and the poppy is largely cultivated. In the accompanying
sketch a group of patients is seen, who have come to a mission
refuge to try and break off the habit. They are allowed to smoke
tobacco, but are mostly resting or sleeping on the khang; the brick
bed seen in every inn and in most private houses. On the floor in
front of it is seen a small round aperture, where the fire is fed, which
heats the whole khang. The present Governor of Shansi is taking
active steps to put down opium cultivation, and the prospect seems
hopeful. Revenons à nos moutons. When we reached the city gate
there was a slight delay, as carts are apt to get jammed in it. Though
the gateway is large it is considerably blocked by stones, set up by a
former governor to prevent carts of above a certain gauge from
entering the city: this was to encourage the trade of the
wheelwrights. Now there is a railway right up to the walls of the city,
but from what I have already said it will be easily understood how
difficult a task it has been to construct a safe line. The railway joins
the Péhan line at Cheng Ting.
OPIUM REFUGE
CHAPTER X
Taiyüanfu
T
AIYÜAN is surrounded by a lofty wall, with a gateway at each
of the four points of the compass. The Chinese always use
these terms when we should use “right” and “left”: they speak
of the position of furniture in a room, for instance, as being north,
south, east, or west, and can always tell you the relative positions of
places and things in that way. It is the seat of the Government of the
province, and was the first place in the Empire to have a Western
university after the 1900 troubles.
The finest of all its temples—whether Confucian, Buddhist,
Mohammedan, or Taoist—is the temple of Heaven and Hell. The
entrance is magnificent in colouring, with roof and walls covered with
turquoise-coloured tiles peculiar to this province, which make its
temples so much more beautiful than those in the west. There are
interesting but repulsive statues within, mostly depicting the torments
of hell. In one temple, however, there is a deity to which childless
women especially come to pray. She is a hideous figure about life
size, with a gaping mouth, into which they stuff raw eggs by way of
offering. On the adjoining wall is a fresco representing people
receiving babies out of a cash-bag full of them, which a man carries
over his shoulder.
I visited the temple at the time of a large fair, which was held in
its courtyards (a common custom in China), and had one of the
teachers in attendance, to his great disgust, as it is not the correct
thing for Chinese ladies to go to fairs, and European manners had
not yet penetrated to this part of the Empire. It was a very fine sight,
notwithstanding the absence of the élite, for the women and children
were most gaily attired—and then the setting! They were all perfectly
civil to us and ready to talk. A woman was feeding her five-year-old
baby, not yet weaned. Family parties kept arriving on donkeys, and
women had their feet tied up in bags to protect their dainty shoes
from the dust of the road. At one side theatricals were going on, to a
loud and ceaseless accompaniment of drums. The theatres are all
connected with the temples, a visible sign of their origin in the East
as well as in the West; and the theatre and temple dues are
collected together. Actors are looked down on, and none is allowed
to compete in the literary examinations; they are in the lowest grade
of society. The accompanying sketch gives some idea of the
beautiful colour scheme of temple and theatre eaves. It is the open-
air stage of a theatre at Showyang, about sixty miles from Taiyüan.
The little figures of beasts on the roof are a characteristic feature.
THEATRE STAGE
The stalls were full of interesting objects from all parts of the
province, and we went round buying various things that took our
fancy. There were handsome embroideries and lovely silks, and I
was surprised to find that we could take whatever we liked without
paying for it; it was sufficient to say, “Come to the mission hospital to-
morrow and the doctor will pay.” No Chinaman could have had better
credit, and few, I think, as good, in this city.
From the temple of Heaven and Hell we returned past the
barracks, and saw the men practising walking on stilts; apparently
that was part of their drill, as finally they all filed off into the yard on
them. The soldiers are quite a decent set of men, and one of the
officers frequently sent them to the hospital to be broken of the
opium habit. It is terribly common here. In a neighbouring town it is
estimated that 90 per cent. of the population (men, women, and
children) are smokers.
From Taiyüanfu we made an interesting little excursion to a place
to the south-west called Tsinssu, where there is a magnificent old
temple on the rocky hillside dominating the village. The temple is
overshadowed by hoary trees, and has remarkable golden dragons
twisted round the pillars of the façade. In the grounds are hot
springs, and the water flows under an ornamental bridge leading to
the terrace on which the temple stands. Had it not been for the hot
water it would have been impossible to sketch, as the water froze on
the surface of the paper, and every few minutes I had to put my
paint-box in the stream to thaw the coating of ice formed on the
colours. The subject, however, was so charming that I could not
waste the one chance I had of sketching, and in the afternoon I
made a rapid drawing of a pagoda, with the little bells hung on each
story tinkling in the breeze; an adjacent tower looked precisely like
an English church, but its real use was as a granary. The hot springs
are valuable in enabling the people to grow rice, which is not grown
elsewhere so far north, and it is the motive-power of many paper-
mills in the district. In a recent expedition roe-deer, leopards, boars,
and David squirrels have been found in this neighbourhood, but we
saw nothing more interesting than a beautiful pastoral scene—a
shepherd lad piping a melancholy ditty to his sheep under the clear
blue sky. I should like to have sketched him, but the shadows were
already lengthening, and we had to hasten our return before the city
gates were closed.
PAGODA
We attended a review one day, and saw the old régime in its full
glory, now already a thing of the past. We started at 7 a.m. in the
cart, and although the parade-ground was only a quarter of a mile
away we were none too early. The soldiers were already mustered,
and two gorgeously arrayed officials were seated in state under a
canopy waiting for the Governor, with a fine sort of helmet on a stand
behind them. He arrived shortly after we did, and although there was
a drizzling rain the numberless banners looked lovely, bowing down
while the Governor passed, and then floating proudly up again. Many
of them were pale-blue silk and carried on long bamboo rods. There
were a good many soldiers mounted on smart ponies that
scampered along bravely; but the black turbans surmounting the
blue or red uniforms made them look rather like women. Some of
them were armed with bows and arrows, slung on their backs; others
had prehistoric guns which required two men to work them, one to
hold and the other to fire off by means of a lighted stick of incense,
which at other times was thrust (lighted) into the soldier’s chest,
where also he carried his powder!
One regiment was a great contrast to the others—the celebrated
tiger braves. They were clad cap-à-pie in yellow cloth striped with
black, even the boots and cap being of the same material. The latter
was most cunningly made, with little pink-lined ears which stood
erect, and ferocious black eyes, and white fangs, and a red tongue
hanging out. This alarming costume was supposed to render all
further equipment unnecessary, and I asked one of the “braves” if he
had no weapon, on which he showed me merely an ordinary knife
stuck in his waistband. I asked if he would sell me his uniform, but as
he could not do that he lent it, and I had an exact copy made. On my
return home Mr. Chamberlain saw it, and was struck with the idea
that the braves scared away the enemy by their uniform and their
roaring, and made a telling use of it later on in describing the tactics
of “the opposition”!
Yet a step farther back in history, it is interesting to learn how the
soldiers used to travel in earlier times. A model has recently been
constructed (by Professor Hopkinson) of the chariot used to convey
eighteen soldiers. This chariot was in use about a thousand years
ago in China, and registered distance, a gong sounding at the end of
every “li” (about one-third of a mile), and a bell at the end of every
ten “li.” This vehicle was called the “measure-mile drum carriage,”
and it is from the description of the mechanism given in the writings
of the period that the professor has made his model. An ode was
written in its honour. The chariot was drawn by four horses.
TIGER BRAVE
The main features of the review were the sword exercises,
varied with turning somersaults, the charging of soldiers with two-
pronged pikes, accompanied by roaring—and various feats of
horsemanship. The men rode about clinging to their horses from
underneath, or jumped on them going at full gallop. The review
lasted all day, and we got tired long before it was over. The military
examinations of officers were on the old lines, and success in getting
promotion depended on the strength shown in drawing a bow, or
lifting a weight. Two officers came to hospital for treatment on
account of having overstrained themselves by their exertions, and
were anxious lest they should be disqualified in consequence. Now
everything is changed. There are military colleges springing up,
where everything is modelled on the military systems of the West,
and students go in increasing numbers to Europe to study these at
first hand. The Ministry of War has decided to adopt the same
gradations of rank as those of the British army and navy
respectively; thus a second lieutenant in the navy will be of equal
rank with a senior lieutenant in the army, and so on. In the past,
military service was one of the two only ways in which it was
possible in China to climb the social ladder.
In September 1904 I saw one of the last great triennial
examinations, to which students came from all parts of the province.
It opened with a great procession, headed by the Governor and
examiners who had come from Peking. Some of the big men rode in
chairs, preceded by scarlet umbrellas, and boys carrying boards
enjoining silence, many banners and discordant drums. It seemed as
if all the rag-tag and bobtail of the city had been collected to grace
the occasion; they were decked out in magenta felt hats and scarlet
cloaks which by no means covered their rags and dirt. Some wore
scarlet and gilt, others green and gilt caps, but no shoes on their
feet. The three principal men were carried on chairs, raised on little
platforms and covered with yellow rugs, supposed to represent the
imperial dragon. The imperial letters were carried (wrapped in yellow
cloth) across the shoulders of men on horseback, and the imperial
seals under gay canopies. The examination buildings are extensive,
and are well seen from the city wall. There are 10,000 cells,
arranged in rows of 100 each in alleys closed by a door. Each cell is
about 6 feet high, 4 feet wide, and 5 feet deep, and is provided with
a sliding seat and a board for writing on, which the student can slide
into the same groove as the seat to curl up on at night, for he has to
spend three days and nights without leaving it. The cell is open in
front, and an invigilator walks up and down to see that no cheating
goes on. If the student is taken ill he may not leave, and if he dies
(not an infrequent occurrence at examination times) his body is
simply put over the wall at the outside end of the alley. These
examinations are competitive, and there may be only thirty or forty
vacancies for thousands of students. At Canton there are 25,000
cells in the examination hall, and each province has its own
examination, to which students of other provinces may not come.
There are characters at the end of the rows of cells, drawn from one
of the classics, which are used as numerals, to distinguish the rows
from one another.
It is interesting to observe what supreme importance is attached
by the Chinese to learning and to morals. Learning is the main road
to eminence; the only other one—the military service—is quite
subsidiary. The highest grade of the people is the Sze, the scholar,
and from it all public servants are drawn. There is no bar to prevent
men of other grades passing into this class, provided they fit
themselves to do so and pass the necessary examinations. There
are six examinations possible.
OLD EXAMINATION BUILDINGS
The first examination is held yearly by the district magistrate; it

lasts for three days, and the candidate has to write two essays, one
on poetry. The second examination is held (generally a few months
later) in a prefectural town, and is therefore called Fu Kau, or country
examination. The students who pass this examination are called Shu
Tsai. The third examination (only open to those who have passed the
previous one) is the triennial one, which takes place in the capital of
each province, as above described, and is called the Ju Jen degree.
This time the candidate has to write several more essays than for the
Shu Tsai degree; the quality most valued in these essays is skill in
quotation, both as to the number of quotations made from the
classics and the way in which they are combined—this might aptly
be compared to a string of pearls. The candidates who obtain the Ju
Jen degree are alone eligible for the degree of Tsin Sze. This fourth
examination takes place triennially at Peking. The candidate is
confined for nine days in a small compartment in the examination
building. No matter how great the discomfort of this confinement may
be, he has to write nine essays. I obtained the most fascinating little
crib containing the whole classics, not larger than one inch square,
which would offer a severe temptation under such circumstances to
the most conscientious student! If the candidate is successful with
his nine essays he receives the title of Tsin Sze, but if not, he may be
appointed to a clerkship of a more or less important nature,
according to the merit of his essays.
A yet higher degree may be obtained called the Tien Sze,
because it is held in one of the buildings of the Imperial Palace. The
student at the head of the list is called Cheong Yuan; the second is
Paun Yien; the third is called Tua Hwa, and the fourth Chuan Lo To.
Their official title, which is also given to other successful candidates
in this examination, is Han Lin Yuan Shu Chi Sze, and they are
obliged to study for the next three years at the Han Lin Yuan for the
next examination. The successful candidates are retained at the Han
Lin, and the unsuccessful ones receive posts of lesser importance,
such as magistracies and other civil appointments. They are
6
considered to have a first claim to all such appointments.
This old examination system is being replaced by one in which
Western subjects are to a large extent taking the place of the
classics. Since 1904 the degrees of the Ju Jen and Han Lin have
been granted in this way to students educated abroad and examined
on their return to China. At the present time there are about 300
Chinese students in England, studying mainly law, medicine,
engineering, and manufactures: some are still in public schools,
grammar schools, &c.; others are at the English or Scotch
universities.

PDF Test Bank For An Introduction To Management Science Quantitative Approach 15Th Edition David R Anderson Online Ebook Full Chapter

Uploaded by

Copyright:

Available Formats

You might also like

PDF Test Bank For An Introduction To Management Science Quantitative Approach 15Th Edition David R Anderson Online Ebook Full Chapter

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

PDF Test Bank For An Introduction To Management Science Quantitative Approach 15Th Edition David R Anderson Online Ebook Full Chapter

Uploaded by

Copyright:

Available Formats

Test Bank for An Introduction to

Management Science: Quantitative

Test Bank for An Introduction to Management Science:

Test Bank for An Introduction to Management Science

Solution Manual for An Introduction to Management

Test Bank for An Introduction to Management Science

Test Bank for Strategic Management: A Competitive

Solution Manual for Strategic Management: A Competitive

Social Science An Introduction to the Study of Society

Test Bank for Strategic Management: A Competitive

Test Bank for An Introduction to Management

To download the complete and accurate content document, go to:

Visit TestBankBell.com to get complete for all chapters

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

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

20. In an assignment problem, one agent can be assigned to several tasks.

© Cengage. Testing Powered by Cognero. Page 5

© Cengage. Testing Powered by Cognero. Page 6

26. The objective of the transportation problem is to

27. We represent the number of units shipped from origin i to destination j by

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

31. The assignment problem is a special case of the

34. Arcs in a transshipment problem

35. Constraints in a transshipment problem

36. In a transshipment problem, shipments

38. The shortest-route problem finds the shortest route

40. In a maximal flow problem,

© Cengage. Testing Powered by Cognero. Page 11

42. Which of the following is NOT a characteristic of assignment problems?

Subjective Short Answer

44. Write the LP formulation for this transportation problem.

s.t. X1A + X1B ≤ 100

45. Draw the network for this transportation problem.

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

s.t. XAX + XAY + XAZ ≤ 500

© Cengage. Testing Powered by Cognero. Page 13

© Cengage. Testing Powered by Cognero. Page 14

s.t. XAX + XAY + XAZ ≤ 200

TOTAL TRANSPORTATION COST OR REVENUE IS 358

ORIGIN EXCESS SUPPLY

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

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

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

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

49. Draw the network for this assignment problem.

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

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

© Cengage. Testing Powered by Cognero. Page 17

SUMMARY OF UNIT COST OR REVENUE DATA

51. 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. Testing Powered by Cognero. Page 20

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. Testing Powered by Cognero. Page 21