What is the constraint associated with machine 2 for the following assignment problem? \[\begin{array} { l l l l l } & & { \text { Machine } } \\ & & { 1 } & { 2 } & { 3 } \\ & \text { A } & \$ 3 & \$ 4 & \$ 2 \\ \text { Job } & \text { B } & \$ 1 & \$ 3 & \$ 5 \\ & \text { C } & \$ 6 & \$ 4 & \$ 2 \end{array}\] Let X?? = 1 if job i is assigned to machine j,otherwise 0.

A) XA? + XB? + XC? = +1 B) XA? + XB? + XC? = 0 C) XA? + XB? + XC? = -1 D) 4XA? + 3XB? + 4XC? = +1 E) 4XA? + 3XB? + 4XC? = -1 A) XA? + XB? + XC? = +1 B) XA? + XB? + XC? = 0 C) XA? + XB? + XC? = -1 D) 4XA? + 3XB? + 4XC? = +1 E) 4XA? + 3XB? + 4XC? = -1

What is the constraint associated with job A for the following assignment problem? \[\begin{array} { l l l l l } & & { \text { Machine } } \\ & & { 1 } & { 2 } & { 3 } \\ & \text { A } & \$ 3 & \$ 4 & \$ 2 \\ \text { Job } & \text { B } & \$ 1 & \$ 3 & \$ 5 \\ & \text { C } & \$ 6 & \$ 4 & \$ 2 \end{array}\] Let X?? = 1 if job i is assigned to machine j,otherwise 0.

A) 3XA? + 4XA? + 2XA? = 1 B) 3XA? + 4XA? + 2XA? = 0 C) 3XA? + 4XA? + 2XA? = -1 D) XA? + XA? + XA? = -1 E) -XA? - XA? - XA? = -1 A) 3XA? + 4XA? + 2XA? = 1 B) 3XA? + 4XA? + 2XA? = 0 C) 3XA? + 4XA? + 2XA? = -1 D) XA? + XA? + XA? = -1 E) -XA? - XA? - XA? = -1

Exam 5: Transportation, Assignment, and Network Models

Use this information for the following questions. The following network describes the hourly volume of traffic that can flow between various communities in Dover County.Assume traffic can flow in both directions between each community at the same rate.What is the maximum flow of cars between Communities 1 and 6 in one hour? -Refer fo the network above and its associated Excel solution shown below. What values would you enter in the Solver Parameter dialog box for the Excel spreadsheet model? Set Target Cell: By Changing Cells: Subject to the Constraints:

(Essay)

4.8/5

(35)

Question 21

What is the constraint associated with machine 2 for the following assignment problem? Machine 1 2 3 A \ 3 \ 4 \ 2 Job B \ 1 \ 3 \ 5 C \ 6 \ 4 \ 2 Let X?? = 1 if job i is assigned to machine j,otherwise 0.

(Multiple Choice)

4.9/5

(37)

Question 22

In a maximal flow problem,the flow capacity on the dummy arc connecting the destination node to the source node should be set to a very large value.

(True/False)

4.8/5

(28)

Question 23

Use the information below to answer the following questions. Consider the following shortest path problem where node 1 is the starting node and node 6 is the destination node. -Refer to the figure.What is the constraint associated with node 1?

(Multiple Choice)

4.8/5

(35)

Question 24

An assignment model has three jobs and four machines.This problem would be referred to as a balanced assignment problem.

(True/False)

4.9/5

(39)

Question 25

Use the information below to answer the following questions. Consider the following shortest path problem where node 1 is the starting node and node 6 is the destination node. -Refer to the figure.What is the constraint associated with node 6?

(Multiple Choice)

4.7/5

(30)

Question 26

Use the information below to answer the following questions. Consider the following maximal flow problem where node 1 is the source and node 6 is the destination. -Refer to the figure.What is the constraint associated with node 2?

(Multiple Choice)

4.8/5

(41)

Question 27

The starting node of the shortest path problem has a supply value of -1.

(True/False)

4.8/5

(39)

Question 28

What is the constraint associated with job A for the following assignment problem? Machine 1 2 3 A \ 3 \ 4 \ 2 Job B \ 1 \ 3 \ 5 C \ 6 \ 4 \ 2 Let X?? = 1 if job i is assigned to machine j,otherwise 0.

(Multiple Choice)

4.7/5

(30)

Question 29

Use the information below to answer the following questions. Consider the following maximal flow problem where node 1 is the source and node 6 is the destination. -Refer to the figure.What is the maximum capacity associated with arc X₆₁?

(Multiple Choice)

4.8/5

(45)

Question 30

The objective function of an assignment problem may be either maximization or minimization.

(True/False)

4.8/5

(37)

Question 31

Use the information below to answer the following questions. Consider the following shortest path problem where node 1 is the starting node and node 6 is the destination node. -Refer to the figure.Excluding the non-negativity constraint,this model has:

(Multiple Choice)

4.9/5

(41)

Question 32

Use this information for the following questions. The following network describes the hourly volume of traffic that can flow between various communities in Dover County.Assume traffic can flow in both directions between each community at the same rate.What is the maximum flow of cars between Communities 1 and 6 in one hour? -Refer fo the network above and its associated Excel solution shown below. a.What equation should be entered in cell H4? b.What equation should be entered in cell B10? c.What equation should be entered in cell B25?

(Essay)

4.9/5

(35)

Question 33

In a transshipment problem,nodes are considered as either pure supply nodes or pure demand nodes.

(True/False)

4.8/5

(29)

Question 34

Every node in a network flow problem has a decision variable associated with it.

(True/False)

4.8/5

(37)

Question 35

Consider the following transshipment problem.The shipping cost per unit between nodes 1 and 2 is $10,while the shipping cost per unit between nodes 2 and 3 is $12.What is the objective function?

(Multiple Choice)

4.8/5

(33)

Question 36

Use this information for the following questions. The following network describes the hourly volume of traffic that can flow between various communities in Dover County.Assume traffic can flow in both directions between each community at the same rate.What is the maximum flow of cars between Communities 1 and 6 in one hour? -Refer to the network above.Formulate this problem as a linear programming problem.

(Essay)

4.9/5

(45)

Question 37

Showing 21 - 37 of 37

What is the constraint associated with machine 2 for the following assignment problem? Machine 1 2 3 A \ 3 \ 4 \ 2 Job B \ 1 \ 3 \ 5 C \ 6 \ 4 \ 2 Let X?? = 1 if job i is assigned to machine j,otherwise 0.

In a maximal flow problem,the flow capacity on the dummy arc connecting the destination node to the source node should be set to a very large value.

Use the information below to answer the following questions. Consider the following shortest path problem where node 1 is the starting node and node 6 is the destination node. -Refer to the figure.What is the constraint associated with node 1?

An assignment model has three jobs and four machines.This problem would be referred to as a balanced assignment problem.

Use the information below to answer the following questions. Consider the following shortest path problem where node 1 is the starting node and node 6 is the destination node. -Refer to the figure.What is the constraint associated with node 6?

Use the information below to answer the following questions. Consider the following maximal flow problem where node 1 is the source and node 6 is the destination. -Refer to the figure.What is the constraint associated with node 2?

The starting node of the shortest path problem has a supply value of -1.

What is the constraint associated with job A for the following assignment problem? Machine 1 2 3 A \ 3 \ 4 \ 2 Job B \ 1 \ 3 \ 5 C \ 6 \ 4 \ 2 Let X?? = 1 if job i is assigned to machine j,otherwise 0.

Use the information below to answer the following questions. Consider the following maximal flow problem where node 1 is the source and node 6 is the destination. -Refer to the figure.What is the maximum capacity associated with arc X₆₁?

The objective function of an assignment problem may be either maximization or minimization.

Use the information below to answer the following questions. Consider the following shortest path problem where node 1 is the starting node and node 6 is the destination node. -Refer to the figure.Excluding the non-negativity constraint,this model has:

In a transshipment problem,nodes are considered as either pure supply nodes or pure demand nodes.

Every node in a network flow problem has a decision variable associated with it.

Consider the following transshipment problem.The shipping cost per unit between nodes 1 and 2 is $10,while the shipping cost per unit between nodes 2 and 3 is $12.What is the objective function?

Introduction to Managerial Decision Making

Linear Programming Models: Graphical and Computer Methods

Linear Programming Modeling Applications with Computer Analyses in Excel

Linear Programming Sensitivity Analysis

Integer, Goal, and Nonlinear Programming Models

Project Management

Decision Analysis

Queuing Models

Simulation Modeling

Forecasting Models

Inventory Control Models

Filters