Operations management stevenson 11th edition test bank ch8s

AACSB: Remember Blooms: Remember Difficulty: Medium Learning Objective: 08s-02 Set up transportation problems in the general linear programming format.. AACSB: Remember Blooms: Remember

Trang 1

Student: _

1 The transportation model assumes similar, homogeneous goods

True False

2 The transportation model assumes shipping cost per unit is the same regardless of the number of units shipped (there are no quantity discounts)

True False

3 The transportation model is a special type of linear regression model

True False

4 For a transportation model to be used, more than one location must be considered

True False

5 The linear programming model of a transportation problem has one goal - the maximization of its objective function

True False

6 Dummy rows or columns to equate supply and demand are available but not required in linear programming models of transportation problems

True False

7 The transportation model method for evaluating location alternatives minimizes total:

A sources

B destinations

C capacity

D demand

E shipping cost

Trang 2

8 An automobile manufacturer that has eight assembly plants and thousands of dealers throughout the United States can find the optimal distribution plan by using:

A linear programming model

B transportation model

C weighted factor rating

D either A or B

E Global Information Systems

9 Which of the following is not information needed to use the transportation model?

A capacity of the sources

B demand of the destinations

C unit shipping costs

D unit shipping distances

E all of the above are necessary

10 The transportation method is a linear programming technique Linearity is present in the following way:

A The cost of goods shipped from any source to any destination is a linear function of quantity shipped

B The cost of goods shipped from any source to any destination is a linear function of the cost per unit

C The total cost associated with a given plan is a linear function of shipping costs

D Cell evaluations require linear horizontal movements through the matrix

E Cell evaluations are linear

11 Which of the following are assumptions or requirements of the transportation method?

(I) Goods are the same, regardless of source

(II) There must be multiple sources

(III) Minimum quantities must be shipped from each source

(IV) Shipping costs per unit do not vary with the quantity shipped

A I and IV

B II and III

C I, II, and IV

D I and III

E I, II, III, and IV

12 Which of the following is not an assumption of the transportation model?

A Actual supply and demand must be equal

B Shipping costs per unit are constant per unit

C Items to be shipped are homogeneous

D There is only one transportation route between each source and destination

E There is only one transportation mode between each source and destination

Trang 3

13 Which of the following is the information needed to use the transportation model?

A A list of the sources and each one's capacity

B A list of the destinations and each one's demand

C The unit cost of shipping items from each source to each destination

D All of the above

E None of the above

A campaign manager for a political candidate must arrange the shipment of 150 cartons of campaign buttons from three button producers to three campaign headquarters The supplies and demands, and the per-carton transportation costs, are shown below:

14 Which of the following is an objective function for the problem?

A

B

C

D

E None of the above

15 Which of the following is a constraint for the suppliers (button producers)?

A

B

C

D

E all of the above

16 Which of the following is a constraint for the customer (campaign headquarters)?

A 2X11 + 9X21 + X31 = 20

B 5X12 + 3X22 + 8X32 = 70

C X11 + X12 + X13 = 50

D X12 + X22 + X32 = 70

E all of the above

Trang 4

17 In a transportation problem with three locations and two destinations, the objective function is as follows: Min 20X11 + 18X21 + 23 X31 + 16X12 + 14X22 + 12X32 How much does it cost to ship one unit from location 2 to destination 1?

A 18

B 12

C 23

D 16

E None of the above

A 18

B 12

C 23

D 16

E 14

19 This model indicates that it costs dollars to ship one unit from location(s) _ to location(s) _

A 60; I; A, B & C

B 30; I, II & III; A

C 5; II; B

D 9; II; A

E 7; III; C

Trang 5

20 Suppose the output from the above formulation is as follows:

How many units are shipped from location II to location C?

A 0

B 60

C 70

D 80

E None of the above

Trang 6

ch8s Key

1 The transportation model assumes similar, homogeneous goods

TRUE

Goods are treated as interchangeable

AACSB: Remember

Blooms: Remember

Difficulty: Medium

Learning Objective: 08s-01 Describe the nature of a transportation problem.

Stevenson - Chapter 08S #1

Topic Area: Introduction

2 The transportation model assumes shipping cost per unit is the same regardless of the number of units shipped (there are no quantity discounts)

TRUE

Shipping costs are assumed to be constant

AACSB: Remember

Blooms: Remember

Difficulty: Easy

3 The transportation model is a special type of linear regression model

FALSE

It's a special type of linear programming model

AACSB: Remember

Blooms: Remember

Trang 7

4 For a transportation model to be used, more than one location must be considered

TRUE

If there's only one location, no decision is necessary

AACSB: Remember

Blooms: Remember

Topic Area: Location Decisions

5 The linear programming model of a transportation problem has one goal - the maximization of its objective function

FALSE

Typically it's the minimization of the objective function

AACSB: Remember

Blooms: Remember

Learning Objective: 08s-02 Set up transportation problems in the general linear programming format.

Topic Area: Computer Solutions

6 Dummy rows or columns to equate supply and demand are available but not required in linear programming models of transportation problems

TRUE

Dummy rows or columns are only needed if supply and demand are not equal

AACSB: Remember

Blooms: Remember

7 The transportation model method for evaluating location alternatives minimizes total:

A sources

B destinations

C capacity

D demand

E shipping cost

Trang 8

The goal is to minimize shipping costs.

AACSB: Remember

Blooms: Remember

Topic Area: Location Decisions

8 An automobile manufacturer that has eight assembly plants and thousands of dealers throughout the United States can find the optimal distribution plan by using:

A linear programming model

B transportation model

C weighted factor rating

D either A or B

E Global Information Systems

Either the linear programming model or the transportation model can be used to optimize distribution plans

AACSB: Remember

Blooms: Remember

Topic Area: Other Applications

9 Which of the following is not information needed to use the transportation model?

A capacity of the sources

B demand of the destinations

C unit shipping costs

D unit shipping distances

E all of the above are necessary

Differences in costs should reflect differences in distance

AACSB: Remember

Blooms: Remember

Trang 9

10 The transportation method is a linear programming technique Linearity is present in the following way:

A The cost of goods shipped from any source to any destination is a linear function of quantity shipped.

B The cost of goods shipped from any source to any destination is a linear function of the cost per unit

C The total cost associated with a given plan is a linear function of shipping costs

D Cell evaluations require linear horizontal movements through the matrix

E Cell evaluations are linear

Costs are assumed to rise linearly with the quantity that is shipped

AACSB: Remember

Blooms: Remember

Difficulty: Hard

11 Which of the following are assumptions or requirements of the transportation method?

(I) Goods are the same, regardless of source

(II) There must be multiple sources

(III) Minimum quantities must be shipped from each source

(IV) Shipping costs per unit do not vary with the quantity shipped

A I and IV

B II and III

C I, II, and IV

D I and III

E I, II, III, and IV

If quantity minimums are required, then the linear programming model must be used

AACSB: Remember

Blooms: Understand

Trang 10

12 Which of the following is not an assumption of the transportation model?

A Actual supply and demand must be equal.

B Shipping costs per unit are constant per unit

C Items to be shipped are homogeneous

D There is only one transportation route between each source and destination

E There is only one transportation mode between each source and destination

Supply and demand can be imbalanced

AACSB: Remember

13 Which of the following is the information needed to use the transportation model?

A A list of the sources and each one's capacity

B A list of the destinations and each one's demand

C The unit cost of shipping items from each source to each destination

D All of the above

E None of the above

All apply

AACSB: Remember

Blooms: Remember

A campaign manager for a political candidate must arrange the shipment of 150 cartons of campaign buttons from three button producers to three campaign headquarters The supplies and demands, and the per-carton transportation costs, are shown below:

Stevenson - Chapter 08S

Trang 11

14 Which of the following is an objective function for the problem?

A

B

C

D

E None of the above

Match up the coefficients in the objective function with the coefficients in the matrix, and remember this is a minimization problem

AACSB: Remember

Difficulty: Hard

15 Which of the following is a constraint for the suppliers (button producers)?

A

B

C

D

E all of the above

The suppliers can ship no more than they can produce

AACSB: Remember

Difficulty: Hard

Trang 12

16 Which of the following is a constraint for the customer (campaign headquarters)?

A 2X11 + 9X21 + X31 = 20

B 5X12 + 3X22 + 8X32 = 70

C X11 + X12 + X13 = 50

D X12 + X22 + X32 = 70

E all of the above

The customer can't be shipped more than it wants

AACSB: Remember

Difficulty: Hard

A 18

B 12

C 23

D 16

E None of the above

The first three coefficients involve shipments to destination 1

AACSB: Remember

Difficulty: Hard

Trang 13

A 18

B 12

C 23

D 16

E 14

The second three coefficients involve shipments to destination 2

AACSB: Remember

Difficulty: Hard

Stevenson - Chapter 08S

Trang 14

19 This model indicates that it costs dollars to ship one unit from location(s) _ to location(s) _

A 60; I; A, B & C

B 30; I, II & III; A

C 5; II; B

D 9; II; A

E 7; III; C

It costs 9 dollars to ship one unit from location II to location A

AACSB: Remember

Learning Objective: 08s-03 Interpret computer solutions.

Trang 15

20 Suppose the output from the above formulation is as follows:

How many units are shipped from location II to location C?

A 0

B 60

C 70

D 80

E None of the above

The final value for units shipped from location II to location C is 0

AACSB: Remember

Difficulty: Easy

Learning Objective: 08s-03 Interpret computer solutions.

Trang 16

ch8s Summary

Category # of Questions

Learning Objective: 08s-01 Describe the nature of a transportation problem 7 Learning Objective: 08s-02 Set up transportation problems in the general linear programming format 11 Learning Objective: 08s-03 Interpret computer solutions 2

Định dạng
Số trang	16
Dung lượng	500,7 KB