Question 1

Which of the following is not a characteristic of assignment problems?​

Accepted Answer

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 < 
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 <

Question 2

​Is it a coincidence to obtain integer solutions to network problems? Explain.

Accepted Answer

In the context of network problems, whic

Question 3

In a transshipment problem,shipments

Accepted Answer

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. 
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.

Question 4

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.
 $$\begin{array} { l c } 
\text { Path } & \text { Distance } \
\hline 1 \text { to } 2 & 6 \
1 \text { to } 3 & 10 \
1 \text { to } 4 & 7 \
2 \text { to } 3 & 4 \
2 \text { to } 5 & 5 \
3 \text { to } 4 & 5 \
3 \text { to } 5 & 2 \
3 \text { to } 6 & 4 \
4 \text { to } 6 & 8 \
5 \text { to } 7 & 7 \
6 \text { to } 7 & 5
\end{array}$$

Accepted Answer

​
 @#IMG-DLM& \[\begin{array}{l}
\text { Min } 6 \

Question 5

The difference between the transportation and assignment problems is that

Accepted Answer

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 
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

Question 6

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.
​

Accepted Answer

​
 \[\begin{array}{l}
\operatorname { Mi

Question 7

After some special presentations,the employees of the AV Center have to move projectors back to classrooms.The table below indicates the buildings where the projectors are now (the sources),where they need to go (the destinations),and a measure of the distance between sites.
​
   a. If you were going to write this as a linear programming model, how many decision variables would there be, and how many constraints would there be?
The solution to this problem is shown below. Use it to answer the questions b - e.
TRANSPORTATION PROBLEM

TOTAL TRANSPORTATION COST OR REVENUE IS 358
NOTE: THE TOTAL SUPPLY EXCEEDS THE TOTAL DEMAND BY 13
  
b. How many projectors are moved from Baker to Business?
c. How many projectors are moved from Tirey to Parsons?
d. How many projectors are moved from the Arena to Education?
e. Which site(s) has (have) projectors left?

Accepted Answer

a. 12 decision vari

Question 8

​Define the variables and constraints necessary in the LP formulation of the maximal flow problem.

Accepted Answer

The maximal flow problem is a classic op

Question 9

Find the maximal flow from node 1 to node 7 in the following network.

Accepted Answer

Decision variables:x_ij = amount of flow fr

Question 10

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.
​

Accepted Answer

​
 \[\begin{array}{l}
\text { Min } 3 \m

Question 11

The following table shows the unit shipping cost between cities,the supply at each source city,and the demand at each destination city.The Management Scientist solution is shown.Report the optimal solution.
​
   TRANSPORTATION PROBLEM
*****************************

Accepted Answer

Ship 10 from St.Louis to Indianapolis,45

Question 12

In a capacitated transshipment problem,some or all of the transfer points are subject to capacity restrictions.

Accepted Answer

A) True 
 B)False

Question 13

RVW (Restored Volkswagens)buys 15 used VW's at each of two car auctions each week held at different locations.It then transports the cars to repair shops it contracts with.When they are restored to RVW's specifications,RVW sells 10 each to three different used car lots.There are various costs associated with the average purchase and transportation prices from each auction to each repair shop.Also there are transportation costs from the repair shops to the used car lots.RVW is concerned with minimizing its total cost given the costs in the table below.
 a. Given the costs below, draw a network representation for this problem.
  
b. Formulate this problem as a transshipment linear programming model.

Accepted Answer

​
 a. 
@#IMG-DLM& 
b. Denote @#LAT-DLM& as node @#LAT-DLM& as node @#LAT-DLM& as

Question 14

A transportation problem with 3 sources and 4 destinations will have 7 variables in the objective function.

Accepted Answer

A) True 
 B)False

Question 15

In the general linear programming model of the assignment problem,

Accepted Answer

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. 
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.

Question 16

Draw the network for this transportation problem.
 $$\begin{array} { l l } 
\text { Min } & 2 X _ { A X } + 3 X _ { A Y } + 5 X _ { A Z } + 9 X _ { B X } + 12 X _ { B Y } + 10 X _ { B Z } \
\text { s.t. } & X _ { A X } + X _ { A Y } + X _ { A Z } \leq 500 \
& X \mathrm { BX } + X _ { B Y } + X _ { B Z } \leq 400 \
& X _ { A X } + X _ { B X } \quad = 300 \
& X _ { A Y } + X _ { B Y } \quad = 300 \
& X _ { A Z } + X _ { B Z } \quad = 300 \
& \quad X _ { \mathrm { B } } \geq 0
\end{array}$$

Accepted Answer

The answer of Draw the network for this transportation problem.
...

Question 17

The assignment problem constraint x31 + x32 + x33 + x34 ≤ 2 means

Accepted Answer

A) agent 3 can be assigned to 2 tasks. 
B) agent 2 can be assigned to 3 tasks. 
C) a mixture of agents 1,2,3,and 4 will be assigned to tasks. 
D) there is no feasible solution. 
A) agent 3 can be assigned to 2 tasks. 
B) agent 2 can be assigned to 3 tasks. 
C) a mixture of agents 1,2,3,and 4 will be assigned to tasks. 
D) there is no feasible solution.

Question 18

Write the linear program for this transshipment problem.

Accepted Answer

\[\begin{array} { l l } 
\text { Min } &

Question 19

Converting a transportation problem LP from cost minimization to profit maximization requires only changing the objective function;the conversion does not affect the constraints.

Accepted Answer

A) True 
 B)False

Question 20

​Explain how the general linear programming model of the assignment problem can be modified to handle problems
involving a maximization function,unacceptable assignments,and supply not equally demand.

Accepted Answer

The general linear programming model of

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

Is it a coincidence to obtain integer solutions to network problems? Explain.

In a transshipment problem,shipments

The difference between the transportation and assignment problems is that

Define the variables and constraints necessary in the LP formulation of the maximal flow problem.

Find the maximal flow from node 1 to node 7 in the following network.

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.

The following table shows the unit shipping cost between cities,the supply at each source city,and the demand at each destination city.The Management Scientist solution is shown.Report the optimal solution. TRANSPORTATION PROBLEM *****************************

In a capacitated transshipment problem,some or all of the transfer points are subject to capacity restrictions.

A transportation problem with 3 sources and 4 destinations will have 7 variables in the objective function.

In the general linear programming model of the assignment problem,

Draw the network for this transportation problem. Min 2+3+5+9+12+10 s.t. ++\leq500 X++\leq400 +=300 +=300 +=300 \geq0

The assignment problem constraint x₃₁ + x₃₂ + x₃₃ + x₃₄ ≤ 2 means

Write the linear program for this transshipment problem.

Converting a transportation problem LP from cost minimization to profit maximization requires only changing the objective function;the conversion does not affect the constraints.

Explain how the general linear programming model of the assignment problem can be modified to handle problems involving a maximization function,unacceptable assignments,and supply not equally demand.

Introduction

Introduction to Probability

Probability Distributions

Decision Analysis

Utility Game Theory

Time Series Analysis Forecasting

Intro to Linear Programming

LP Sensitivity Analysis

LP Applications

Integer Linear Programming

Advanced Optimization Applications

Project Scheduling

Inventory Models

Waiting Line Models

Simulation

Markov Processes

Filters

Exam 10: Distribution Network Models

Which of the following is not a characteristic of assignment problems?​

​Is it a coincidence to obtain integer solutions to network problems? Explain.

In a transshipment problem,shipments

The difference between the transportation and assignment problems is that

​Define the variables and constraints necessary in the LP formulation of the maximal flow problem.

Find the maximal flow from node 1 to node 7 in the following network.

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. ​

The following table shows the unit shipping cost between cities,the supply at each source city,and the demand at each destination city.The Management Scientist solution is shown.Report the optimal solution. ​ TRANSPORTATION PROBLEM *****************************

In a capacitated transshipment problem,some or all of the transfer points are subject to capacity restrictions.

A transportation problem with 3 sources and 4 destinations will have 7 variables in the objective function.

In the general linear programming model of the assignment problem,

Draw the network for this transportation problem. Min 2+3+5+9+12+10 s.t. ++\leq500 X++\leq400 +=300 +=300 +=300 \geq0

The assignment problem constraint x31 + x32 + x33 + x34 ≤ 2 means

Write the linear program for this transshipment problem.

Converting a transportation problem LP from cost minimization to profit maximization requires only changing the objective function;the conversion does not affect the constraints.

​Explain how the general linear programming model of the assignment problem can be modified to handle problems involving a maximization function,unacceptable assignments,and supply not equally demand.

Introduction

Introduction to Probability

Probability Distributions

Decision Analysis

Utility Game Theory

Time Series Analysis Forecasting

Intro to Linear Programming

LP Sensitivity Analysis

LP Applications

Integer Linear Programming

Advanced Optimization Applications

Project Scheduling

Inventory Models

Waiting Line Models

Simulation

Markov Processes

Filters

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

Is it a coincidence to obtain integer solutions to network problems? Explain.

Define the variables and constraints necessary in the LP formulation of the maximal flow problem.

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.

The following table shows the unit shipping cost between cities,the supply at each source city,and the demand at each destination city.The Management Scientist solution is shown.Report the optimal solution. TRANSPORTATION PROBLEM *****************************

The assignment problem constraint x₃₁ + x₃₂ + x₃₃ + x₃₄ ≤ 2 means

Explain how the general linear programming model of the assignment problem can be modified to handle problems involving a maximization function,unacceptable assignments,and supply not equally demand.