AGEC 3413 Exam 3 ch. 6

REFER TO #107 Write the constraints for the 3 distribution centers

x1A + x1B +x1c - 500y1 ≤ 0 x2A + x2B +x2c - 500y2 ≤ 0 x3A + x3B +x3c - 500y3 ≤ 0

REFER TO #84 If the optimal solution includes x11 = 100 and x22 = 200, determine the remaining shipments that will result in a minimum cost of $1700.

x31 = 150, x42 = 50

REFER TO #116 What are the objective function terms that involve the demand locations?

$4DF + $4DG + $4DH + $10EF + $9EG + $8EH

REFER TO #118

...

REFER TO #88, #89, #90, #91,

...

REFER TO #83 How many demand-side constraints are there? Write the demand-side constraints.

2 demand-side constraints x11 + x21 + x31 + x41 = 250 x12 + x22 + x32 + x42 = 250

REFER TO #114 Write every constraint that involves Company A.

A's supply constraint is AD + AE = 200 D's balance constraint is AD + BD + CD - DF - DG - DH = 0 E's balance constraint is AE + BE + CE - EF - EG - EH = 0

In a balanced transportation model where supply equals demand: A) all constraints are equalities. B) none of the constraints are equalities. C) all constraints are inequalities. D) none of the constraints are inequalities.

A. all constraints are equalities

REFER TO #117 How would the transshipment location constraints read if it was OK to store product there on a temporary basis?

AD + BD + CD - DF - DG - DH ≥ 0 AE + BE + CE - EF - EG - EH ≥ 0

REFER TO #72 What is the optimal solution to the Mantastic problem? A) $30,028 B) $30,820 C) $32,280 D) $32,820

B. $30,820

REFER TO #69 The constraint for the quantity shipped from Atlanta is: A) X23 + X 24 = 1000. B) X23 + X 24 ≤ 1000. C) X23 + X 24 ≥ 1000. D) X13 + X 14 - X34 = 1000.

B. X23 + X 24 ≤ 1000

In an assignment problem: A) one agent can do parts of several tasks. B) one task can be done by only one agent. C) each agent is assigned to its own best task. D) several agents can do parts of one task

B. one task can be done by only one agent.

A prohibited route in a transportation model should be assigned a value of zero

False

In order to model a "prohibited route" in a transportation or transshipment problem, the route should be omitted from the linear program

False

REFER TO #115 What is the complete linear model for this scenario?

Min Z = $3AD + $3AE + $4BD + $3BE + $5CD + $3CE + $4DF + $4DG + $4DH + $10EF + $9EG + $8EH AD + AE = 200 BD + BE = 300 CD + CE = 500 DF + EF = 350 DG + EG = 450 EF + EH = 200 AD + BD + CD - DF - DG - DH = 0 AE + BE + CE - EF - EG - EH = 0 AD + BD + CD ≤ 600 AE + BE + CE ≤ 700

REFER TO #106 Write the objective function for this problem

Min Z = 1x1A + 3x1B + 3x1C + 2x1D + 2x2A + 4x2B + 1x2C + 3x2D + 3x3A + 2x3B + 2x3C + 3x3D + 500y1 + 600y2 + 525y3

REFER TO #87 What are the linear programming constraints for mucking and Thel?

Mucking: XMB + XMD + XMJ + XMP+ XMT = 1 Thel: XRT+ XCT+ XMT+ XPT+ XST= 1

REFER TO #113 What special case of linear programming should be used to model this situation?

The scenario gives the appearance that it is an assignment model waiting to happen up until the point that six sections of Introduction to Operations are needed and the professors are responsible for two to three sections each. The easiest way to model this is by declaring it a transportation model with the six sections of Introduction to Operations as traveling to the same destination. However, if each of those six sections is a node unto itself, and if each professor is separated into three possible sources of teaching, then this would fit the assignment model. The problem with solving the scenario with an assignment model is that the number of decision variables increases from 24 to 132 and the constraints increase from 10 to 23.

REFER TO #105 Define the decision variables for this situation

y1 = 1 if DC1 is selected, 0 otherwise y2 = 1 if DC2 is selected, 0 otherwise y3 = 1 if DC3 is selected, 0 otherwise x1A = quantity shipped from DC 1 to Region A x1B = quantity shipped from DC 1 to Region B x1C = quantity shipped from DC 1 to Region C x1D = quantity shipped from DC 1 to Region D x2A = quantity shipped from DC 2 to Region A x2B = quantity shipped from DC 2 to Region B x2C = quantity shipped from DC 2 to Region C x2D = quantity shipped from DC 2 to Region D x3A = quantity shipped from DC 3 to Region A x3B = quantity shipped from DC 3 to Region B x3C = quantity shipped from DC 3 to Region C x3D = quantity shipped from DC 3 to Region D

In a transshipment problem, items may be transported from one source to another

True

In a transshipment problem, items may be transported from one transshipment point to another

True

In a transshipment problem, items may be transported from sources through transshipment points on to destinations

True

Networks may be used to represent assignment problems

True

The linear programming model for a transportation problem has constraints for supply at each source and demand at each destination

True

REFER TO #111 The department chair is eager to motivate the senior faculty to consider retirement and wants to burden them as much as possible. What should the model look like that otherwise meets departmental objectives?

Using the scheme Professor:Subject for decision variables, e.g. SI is Saba teaches Intro to Ops, Max Z = 3SI + 10SP + 12SQ + 16SC + 12SL + 7SM + 4GI + 19GP + 2GQ + 10GC + 8GL + 18GM + 5TI + 11TP + 4TQ + 14TC + 14TL + 3TM + 4DI + 11DP + 4DQ + 15DC + 17DL + 15DM SI + SP + SQ + SC + SL + SM = 3 GI + GP + GQ + GC + GL + GM = 3 TI + TP + TQ + TC + TL + TM = 3 DI + DP + DQ + DC + DL + DM = 3 SI + GI + TI + DI ≥ 6 SP + GP + TP + DP = 1 SQ + GQ + TQ+ DQ = 1 SC + GC + TC + DC = 1 SL + GL + TL+ DL = 1 SM + GM + TM + DM = 1 The difference between this model and the benevolent chair model is that this is formulated to maximize prep time and assigns each professor a three-course load. The benevolent chair model minimizes prep time and allows for a two-course teaching load.

REFER TO #112 The department chair looks at past course evaluations and realizes that if she wants to attract students to the Operations and Supply Chain major, it would be best if Geoff were never assigned to teach that class. How can her standard model be modified to ensure that Geoff cannot scare away students from the major?

Using the scheme Professor:Subject for decision variables, e.g. SI is Saba teaches Intro to Ops, these additions should be made to the base model. SI + TI + DI ≥ 6 GI = 0 The difference between this model and the base is that this assigns Geoff to no sections of Introduction to Operations, while maintaining he number of sections at six or greater among the other three faculty members. This model's objective is still to minimize the number of prep hours. As luck would have it, this model performs as well as the base model, which didn't have any sections of Intro assigned to Geoff.

REFER TO #110 Take note of the phrase in the scenario that reads "Naturally, every professor in the department had his own pet course..." Provide an example of a constraint that makes sure a professor gets to teach his favorite course

Using the scheme Professor:Subject for decision variables, e.g. SI is Saba teaches Intro to Ops, we can ensure that Saba is assigned to Intro to Operations by entering the constraint: SI ≥ 2 along with the other constraints in the model. If Geoff likes Logistics, then GL = 1 would assign that professor the logistics class.

REFER TO #108 What is an appropriate objective function for this scenario?

Using the scheme Professor:Subject for decision variables, e.g. SI is Saba teaches Intro to Ops: Min Z = 3SI + 10SP + 12SQ + 16SC + 12SL + 7SM + 4GI + 19GP + 2GQ + 10GC + 8GL + 18GM + 5TI + 11TP + 4TQ + 14TC + 14TL + 3TM + 4DI + 11DP + 4DQ + 15DC + 17DL + 15DM

REFER TO #109 Write the model that is suitable for this scenario

Using the scheme Professor:Subject for decision variables, e.g. SI is Saba teaches Intro to Ops: Min Z = 3SI + 10SP + 12SQ + 16SC + 12SL + 7SM + 4GI + 19GP + 2GQ + 10GC + 8GL + 18GM + 5TI + 11TP + 4TQ + 14TC + 14TL + 3TM + 4DI + 11DP + 4DQ + 15DC + 17DL + 15DM SI + SP + SQ + SC + SL + SM ≤ 3 SI + SP + SQ + SC + SL + SM ≥ 2 GI + GP + GQ + GC + GL + GM ≤ 3 GI + GP + GQ + GC + GL + GM ≥ 2 TI + TP + TQ + TC + TL + TM ≤ 3 TI + TP + TQ + TC + TL + TM ≥ 2 DI + DP + DQ + DC + DL + DM ≤ 3 DI + DP + DQ + DC + DL + DM ≥ 2 SI + GI + TI + DI ≥ 6 SP + GP + TP + DP = 1 SQ + GQ + TQ+ DQ = 1 SC + GC + TC + DC = 1 SL + GL + TL+ DL = 1 SM + GM + TM + DM = 1

REFER TO #96 What is the constraint for the transshipment node in Philadelphia for the Mantastic problem?

X13 + X23 + X43 — X34 - X35 - X36 - X37 = 0

REFER TO #92 State the constraint for intermediate node 4.

X14 + X24 + X34 - X46 - X47 = 0

REFER TO #104 You formulate this as an assignment model and review the Zoe section of the sensitivity analysis with Mondo. Provide him with an interpretation

Zoe is assigned to wear the gown and will add 9 points to the overall fabulosity score. Even if Zoe's rating in the gown was up to 3 points lower, she would still be assigned to wear the gown. The overall score would be lower, but this would still be her assignment. Normally, the reduced cost entries speak to the change in objective coefficients before the assignment changes. As the model was presented, the coefficient for Zoe in the Leisure outfit was 4, with a reduced cost of -2, so a change in excess of 4 to 4- -2 = 6 would cause the Leisure outfit assignment to be optimal. As this is a balanced model, we cannot make that statement

REFER TO #85 Using the data in the table: a) How many supply-side constraints are needed? b) How many demand-side constraints are needed? c) How many decision variables are involved in this assignment method?

a. 5, b. 5, c. 25

The cost to send a unit of product from supply source A to demand location B would be represented in the ________ of the linear programming statements.

objective function

In an assignment problem, all demand and supply values are equal to ________.

one

In a linear programming formulation of a transportation model, each of the possible combinations of supply and demand locations is a(n) ________.

decision variable

In a(n) ________ problem, items are allocated from sources to destinations at a minimum cost.

transportation

An appropriate choice of a model for analyzing the best shipping routes for a supply chain consisting of a manufacturer, warehouse, and retailer would be the ________ model.

transshipment

An example of a(n) ________ point is a distribution center or warehouse located between plants and stores.

transshipment

The ________ model is an extension of the transportation model in which intermediate points are added between the sources and destinations,

transshipment

If the number of sources is greater than the number of destinations, then we have a(n) ________ assignment problem.

unbalanced

In most real-world cases, the supply capacity and demanded amounts result in a(n) ________ transportation model

unbalanced

In an unbalanced transportation problem, if supply exceeds demand, the shadow price for at least one of the supply constraints will be equal to ________.

zero

REFER TO #86 If the optimal assignments include raking to Dolly, cooking to PJ, and mucking to Billy, what tasks are assigned to Jeffy and Thel?

Jeffy is assigned to the slaughter task and Thel receives the plucking task

REFER TO #95 What is the objective function for the Mantastic problem? Use the notation Xij, where i and j correspond to the node numbers indicated in the diagram.

MIN 4X13 + 25X14 + 22X23 + 3X24 + 3X34 + 3X43 + 20X35 + 30X36 + 40X37 + 6X45 + 15X46 + 20X47

REFER TO #103 Mondo has never heard of linear programming and you don't have your laptop handy. Provide him with a "best case" total fabulosity number

The greatest possible value is 45, since there are 5 scores that will be chosen and the scores range from 1 to 9.

REFER TO #99 What is the optimal solution for the Mantastic problem?

The lowest total cost is $30,820. X13=710, X24 = 900, X34 = 710, X45 = 450, X46 = 550, X47 = 610

REFER TO #101 How many constraints does this model have? Provide a description in English for each one, without writing it mathematically

The model has r + c or 10 constraints, not counting the nonnegativity constraint. The row constraints could be summarized as "Each model must wear one outfit," and the column constraints can be summarized as "Each outfit must be worn by a model." Individually, the constraints would be articulated as: Zoe must wear one outfit. Yvette must wear one outfit. Xena must wear one outfit. Whisper must wear one outfit. Vajay must wear one outfit. The gown must be worn. The sport outfit must be worn. The couture must be worn. The avant-garde must be worn. The prêt-à-porter outfit must be worn.

REFER TO #98 What is the total number of constraints for the Mantastic problem? How many decisions variables does it have?

There are seven constraints and twelve decision variables

A prohibited route in a transportation model should be assigned an arbitrarily high cost coefficient

True

An assignment problem is a special form of transportation problem where all supply and demand values equal 1

True

Assignment linear programs always result in integer solutions

True

For most real-world applications, an unbalanced transportation model is a more likely occurrence than a balanced transportation model

True

In a balanced transportation model where supply equals demand, all constraints are equalities

True

In a transportation problem, items are allocated from sources to destinations at a minimum cost.

True

In a transshipment problem, items may be transported directly from sources to destinations

True

In a transshipment problem, items may be transported from destination to destination and from source to source

True

In a transshipment problem, items may be transported from one destination to another

True

The transshipment model includes intermediate points between the sources and destinations

True

REFER TO #82 How many supply-side constraints are there? Write the supply-side constraints.

4 supply-side constraints x11 + x12 = 100 x21 + x22 = 200 x31 + x32 = 150 x41 + x42 = 50

A form of the transportation problem in which all supply and demand values equal 1 is the ________ problem.

assignment

A plant has four jobs to be assigned to four machines, and each machine has different manufacturing times for each product. The production manager wants to determine the optimal assignments of four jobs to four machines to minimize total manufacturing time. This problem can be most efficiently solved using the ________ model.

assignment

REFER TO #78 Which of these constraints allows for some inventory to be held at one of the crossdock facilities? A) AD + BD + CD - DF - DG - DH ≥ 0 B) AD + BD + CD - DF - DG - DH = 600 C) AD + BD + CD = DF - DG - DH = 600 D) AD + BD + CD + DF + DG + DH = 600

A. AD + BD + CD - DF - DG - DH ≥ 0

REFER TO SEMESTER PREP 47. Which constraint ensures that Introduction to Operations is offered according to the scenario? A) SI + GI + TI + DI ≥ 6 B) SI + GI + TI + DI ≤ 6 C) SI + SP + SQ + SC + SL + SM ≤ 6 D) SI + SP + SQ + SC + SL + SM ≥ 6

A. SI + GI + TI + DI ≥ 6

The constraint for Knoxville is: A) X14 + X24 + X34 - X43 - X45 - X46 - X47 = 0. B) X13 + X23 - X35 - X36 - X37 ≥ 0. C) X14 + X24 + X34 - X45 - X46 - X47 = 0. D) X14+ X24+ X34+ X43+ X45+ X46+ X47≥ 0.

A. X14 + X24 + X34 - X43 - X45 - X46 - X47 = 0

REFER TO MONDO'S RUNWAY SHOW 39. What is an appropriate constraint for this scenario? A) ZG + YG + XG + WG + VG ≤ 1 B) ZG + YG + XG + WG + VG = 1 C) 9ZG + 3YG + 4XG + 1WG + 4VG ≥ 1 D) 9ZG + 3YG + 4XG + 1WG + 4VG = 1

A. ZG + YG + XG + WG + VG ≤ 1

REFER TO MONDO'S RUNWAY SHOW 38. What is an appropriate constraint for this scenario? A) ZG + ZS + ZC + ZA + ZP = 1 B) ZG + ZS + ZC + ZA + ZP ≤ 1 C) 9ZG + 9ZS + 4ZC + 4ZA + 2 ZP ≥ 1 D) 9ZG + 9ZS + 4ZC + 4ZA + 2 ZP = 1

A. ZG + ZS + ZC + ZA + ZP = 1

REFER TO MONDO'S RUNWAY SHOW 42. What is a reasonable conclusion that can be drawn from this section of the report? A) Zoe will contribute 9 points to the overall fabulosity score of the model. B) It doesn't matter whether Zoe wears the sport outfit or the gown. C) The sport outfit has a range of 5 in fabulosity. D) Wearing the cocktail dress would lower the overall fabulosity score by 5 points.

A. Zoe will contribute 9 points to the overall fabulosity score of the model

In an assignment problem all supply and demand values equal are: A) 0. B) 1. C) 2. D) greater than 1

B. 1

REFER TO #79 Which of these is notan element of the objective function? A) 4DF B) 600D C) 9EG D) 3CE

B. 600D

REFER TO #77 Which of these assignments is optimal? A) Dean 1 addresses Curriculum B) Dean 2 tackles Development C) Dean 3 solves Assessment D) Deans 2 and 3 both work on the Budget

B. Dean 2 tackles Development

Which of the following are assumptions or requirements of the transportation problem? A) There must be multiple sources. B) Goods are the same, regardless of source. C) There must be multiple destinations. D) There must be multiple routes between each source and each destination.

B. Goods are the same, regardless of source

REFER TO SEMESTER PREP 45. What is an appropriate objective function for this scenario? A) Max Z = 3SI + 10SP + 12SQ + 16SC + 12SL + 7SM + 4GI + 19GP + 2GQ + 10GC + 8GL + 18GM + 5TI + 11TP + 4TQ + 14TC + 14TL + 3TM + 4DI + 11DP + 4DQ + 15DC + 17DL + 15DM B) Min Z = 3SI + 10SP + 12SQ + 16SC + 12SL + 7SM + 4GI + 19GP + 2GQ + 10GC + 8GL + 18GM + 5TI + 11TP + 4TQ + 14TC + 14TL + 3TM + 4DI + 11DP + 4DQ + 15DC + 17DL + 15DM C) Min Z = SI + SP + SQ + SC + SL + SM + GI + GP + GQ + GC + GL + GM + TI + TP + TQ + TC + TL + TM + DI + DP + DQ + DC + DL + DM D) Max Z = SI + SP + SQ + SC + SL + SM + GI + GP + GQ + GC + GL + GM + TI + TP + TQ + TC + TL + TM + DI + DP + DQ + DC + DL + DM

B. Min Z = 3SI + 10SP + 12SQ + 16SC + 12SL + 7SM + 4GI + 19GP + 2GQ + 10GC + 8GL + 18GM + 5TI + 11TP + 4TQ + 14TC + 14TL + 3TM + 4DI + 11DP + 4DQ + 15DC + 17DL + 15DM

REFER TO #68 The transshipment locations are: A) Manhattan and Atlanta. B) Philadelphia and Knoxville. C) Manhattan, Atlanta, Philadelphia and Knoxville. D) Memphis, New Orleans, and El Paso.

B. Philadelphia and Knoxville.

REFER TO MONDO'S RUNWAY SHOW 43. Mondo ran the problem in Excel but used "≤ 1" constraints everywhere instead of "= 1" constraints. The objective function is formulated correctly and the general structure of the constraints is also correct, except for the inequality. What is a reasonable conclusion that can be drawn from this formulation of the model? A) None of the outfits will be worn. B) There would be no difference in the model results from one with = constraints. C) A model may be assigned two different outfits. D) An outfit may be assigned to two different models.

B. There would be no difference in the model results from one with = constraints

REFER TO SEMESTER PREP 49. Copied below is a portion of the answer report that shows the constraints related to the faculty assignment. Which of these statements is best according to the answer report? A) Geoff is assigned to teach Introduction to Operations. B) Tim is assigned to teach two courses. C) David is assigned to teach Management Science. D) Saba is assigned to teach two courses.

B. Tim is assigned to teach two courses.

The assignment problem constraint x31 + x32 + x33 +x34 ≤2 means: A) agent 3 can be assigned to 2 tasks. B) agent 3 can be assigned to no more than 2 tasks. C) a mixture of agents 1, 2, 3 and 4 will be assigned to tasks. D) agents 1, 2, 3, and 4 can be assigned up to 2 tasks.

B. agent 3 can be assigned to no more than 2 tasks

The assignment problem constraint x41 + x42 + x43 + x44 ≤ 3 means: A) agent 3 can be assigned to 4 tasks. B) agent 4 can be assigned to 3 tasks. C) a mixture of agents 1, 2, 3 and 4 will be assigned to tasks 1, 2 or 3. D) There is no feasible solution.

B. agent 4 can be signed to 3 tasks

In a transportation problem, items are allocated from sources to destinations: A) at a maximum cost. B) at a minimum cost. C) at a minimum profit. D) at a minimum revenue.

B. at a minimum cost

REFER TO #73 Which of these changes in the original formulation of the Mantastic problem will result in no transfer of product from Philadelphia to Knoxville? A)increasing the cost to ship product from Philadelphia to Knoxville to $14 per unit. B)lowering the cost to ship product from Philadelphia to New Orleans to $12 per unit. C)increasing the cost to ship product from Philadelphia to Knoxville to $16 per unit. D)lowering the cost to ship product from Philadelphia to either New Orleans or Memphis to $12 per unit

B. lowering the cost to ship product from Philadelphia to New Orleans to $12 per unit

REFER TO #81 How many constraints are required to model this as a linear program? A) 8 B) 9 C) 10 D) 12

C. 10

REFER TO #74 How many tasks will be assigned to the assistant deans? A) 1 task B) 2 tasks C) 3 tasks D) 4 tasks

C. 3 tasks

REFER to MONDO'S RUNWAY SHOW 40. Which term does not belong in an objective function for this scenario? A) 9WP B) 4XG C) 6XC D) 9ZG

C. 6XC

REFER TO SEMESTER PREP 48. David is qualified to teach Management Science, but has misplaced his slide rule and doesn't feel he can complete the necessary calculations if he is assigned to teach it next semester. Which of these constraints would ensure that he isn't the instructor? A) DI + DP + DQ + DC + DL ≥ 2 B) SM + GM + TM + DM ≤ 1 C) DM = 0 D) DI + DP + DQ + DC + DL + DM ≤ 3

C. DM = 0

REFER TO SEMESTER PREP 50. Copied below is a portion of the answer report that shows the status of the variable cells related to the faculty assignment. Which of these statements is consistent with the answer report? A) Geoff is assigned to teach Introduction to Operations. B) Tim is assigned to teach two courses. C) David is assigned to teach Introduction to Operations D) Saba is assigned to teach two courses.

C. David is assigned to teach Introduction to Operations

REFER TO MONDO'S RUNWAY SHOW 44. What would happen if Mondo ran the model again, but this time changed the existing constraints to ≤ constraints and included a constraint that required Xena to model two separate looks? A) Xena would wear the pret-a-porter and the gown. B) Xena would wear the pret-a-porter and the cocktail. C) The overall fabulosity score would drop by 1. D) Xena would keep the same outfit.

C. The overall fabulosity score would drop by 1

REFER TO #61 Which constraint represents transshipment through the distribution center? A) 2X13 + 3X23 = 900 B) 2X13 + 3X23 + 5X34 + 4X35 + 3X36 = 0 C) X13 + X23 - X34 - X35 - X36 = 0 D) X13 + X23 - X34 - X35 - X36 ≥ 0

C. X13 + X23 - X34 - X35 - X36 = 0

REFER TO #58 The constraint that represents the quantity supplied by DC 1 is: A) 4X1A + 6X1B + 8X1C ≤ 500. B) 4X1A + 6X1B + 8X1C = 500. C) X1A + X1B + X1C ≤ 500. D) X1A+ X1B+ X1C= 500

C. X1A + X1B + X1C ≤ 500

REFER TO #75 Which of the following constraints represents the assignment for assistant dean 2? A) X2A + X2B + X2C + X2D ≤ 1 B) X2A + X2B + X2C + X2D = 0 C) X2A + X2B + X2C + X2D = 1 D) X2A + X2B + X2C + X2D ≥ 0

C. X2A + X2B + X2C + X2D = 1

The difference between the assignment and the transportation problem is that: A) total supply must equal total demand in the assignment 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) both A and B

C. each supply and demand value is 1 in the assignment problem.

In the process of evaluating location alternatives, the transportation model method minimizes the: A) total demand. B) total supply. C) total shipping cost. D) number of destinations

C. total shipping cost

The problem that deals with the distribution of goods from several sources to several destinations is the: A) network problem. B) assignment problem. C) transportation problem. D) transshipment problem.

C. transportation problem

REFER TO #80 How many decision variables are in this problem? A) 8 B) 9 C) 10 D) 12

D. 12

REFER TO MONDO'S RUNWAY SHOW 41. What is the best overall fabulosity score that Mondo can hope for? A) 9 B) 25 C) 36 D) 45

D. 45

Which of the following assumptions is not an assumption of the transportation model? A) Shipping costs per unit are constant. B) There is one transportation route between each source and destination. C) There is one transportation mode between each source and destination. D) Actual total supply and actual total demand must be equal.

D. Actual total supply and actual total demand must be equal.

In the linear programming formulation of a transportation network: A) there is one variable for each arc. B) there is one constraint for each node. C) the sum of variables corresponding to arcs out of a source node is constrained by the supply at that node. D) All of these statements are correct for the linear programming formulation

D. All of these statements are correct for the linear programming formulation

REFER TO #71 The objective function is: A) MAX 4X13 + 25X14 + 22X23 + 3X24 - 3X34 - 3X43 - 20X35 - 30X36 - 40X37 - 6X45 - 15X46 - 20X47. B) MIN 4X13 + 25X14 + 22X23 + 3X24 - 3X34 - 3X43 - 20X35 - 30X36 - 40X37 - 6X45 - 15X46 - 20X47. C) MAX 4X13 + 25X14 + 22X23 + 3X24 + 3X34 + 3X43 + 20X35 + 30X36 + 40X37 + 6X45 + 15X46 + 20X47. D) MIN 4X13+ 25X14+ 22X23+ 3X24+ 3X34+ 3X43+ 20X35+ 30X36+ 40X37+ 6X45+ 15X46+ 20X47.

D. MIN 4X13+ 25X14+ 22X23+ 3X24+ 3X34+ 3X43+ 20X35+ 30X36+ 40X37+ 6X45+ 15X46+ 20X47

REFER TO SEMESTER PREP 46. Which constraint is appropriate for this scenario? A) DI + DP + DQ + DC + DL + DM = 2 B) SI + GI + TI + DI ≤ 6 C) SM + GM + TM + DM ≥ 1 D) SI + SP + SQ + SC + SL + SM ≤ 3

D. SI + SP + SQ + SC + SL + SM ≤ 3

REFER TO #59 The constraint that represents the quantity demanded by Customer B is: A) 6X1B + 2X2B + 8X3B ≤ 350. B) 6X1B + 2X2B + 8X3B = 350. C) X1B + X2B + X3B ≤ 350. D) X1B + X2B + X3B = 350.

D. X1B + X2B + X3B = 350

REFER TO #76 Which of the following constraints represents the assignment for the curriculum task? A) X1C + X2C + X3C ≥ 1 B) X1C + X2C + X3C = 0 C) X1C + X2C + X3C = 1 D) X1C + X2C + X3C ≤ 1

D. X1C + X2C + X3C ≤ 1

REFER TO #62 Which constraint represents the quantity shipped to retail outlet 6? A) X23 + X36 = 450 B) X23 + X36 + X26 = 450 C) X36 + X26 ≤ 450 D) X36 + X26 = 450 E) 3X36 + 5X26 = 450

D. X36 + X26 = 450

In a transshipment problem, items may be transported: A) from destination to destination. B) from one transshipment point to another. C) directly from sources to destinations. D) all of the above

D. all of the above

The linear programming model for a transportation problem has constraints for supply at each ________ and ________ at each destination. A) destination, source B) source, destination C) demand, source D) source, demand

D. source, demand

In a transportation problem, items are allocated from sources to destinations at a maximum value.

False

In a transshipment model, the supply at each source and demand at each destination are limited to one unit

False

In an unbalanced transportation model, all constraints are equalities

False

In an unbalanced transportation problem, if demand exceeds supply, the optimal solution will be infeasible

False

REFER TO #102 Help Mondo make the best choice of outfit for each model using linear programming.

Using a Model-Outfit sequence for the decision variables yields the following: Max Fabulosity = 9ZG + 9ZS + 4ZC + 4ZA + 2ZP + 3YG + 8YS + 3YC + 8YA + 9YP + 4XG + 7XS + 3XC + 7XA + 8XP + 1WG + 6WS + 5WC + 6WA + 9WP + 4VG + 9VS + 9VC + 6VA + 7VP Subject to: ZG + ZS + ZC + ZA + ZP = 1 YG + YS + YC + YA + YP = 1 XG + XS + XC + XA + XP = 1 WG + WS + WC + WA + WP = 1 VG + VS + VC + VA + VP = 1 ZG + YG + XG + WG + VG = 1 ZS + YS + XS +WS +VS = 1 ZC + YC + XC + WC + VC = 1 ZA + YA + XA + WA + VA = 1 ZP + YP + XP + WP + VP = 1 ZG, ZS, ZC, ZA, ZP, YG, YS, YC, YA, YP, XG, XS, XC, XA, XP, WG, WS, WC, WA, WP, VG, VS, VC, VA, VP ≥ 0

REFER TO #100 What is an appropriate objective function for this scenario?

Using a Model-Outfit sequence for the decision variables yields the following: Max Fabulosity = 9ZG + 9ZS + 4ZC + 4ZZA + 2ZP + 3YG + 8YS + 3YC + 8YA + 9YP + 4XG + 7XS + 3XC + 7XA + 8XP + 1WG + 6WS + 5WC + 6WA + 9WP + 4VG + 9VS + 9VC + 6VA + 7VP

REFER TO #93 If there are 300 units available at source 2, state the constraint for source node 2.

X24 + X25 = 300

REFER TO #97 What is the constraint for El Paso for the Mantastic problem?

X37 + X47 = 610

REFER TO #94 If there are 175 units demanded at destination 6, state the constraint for destination 6.

X46 + X56 = 175

In a(n) ________ transportation model where supply equals demand, all constraints are equalities.

balanced

In order to prevent the accumulation of inventory at transshipment points, they should be modeled as being ________ nodes.

balanced

In order to model a "prohibited route" in a transportation or transshipment problem, the cost assigned to the route should be ________.

high