Question 1

Explain what adjustments are made to the transportation linear program when there are unacceptable routes.

Accepted Answer

When there are unacceptable routes in the transportation linear program, adjustments need to be made to ensure that the model reflects the reality of the situation. This may involve removing the unacceptable routes from the model and re-optimizing the transportation plan based on the remaining feasible routes. Alternatively, if the unacceptable routes are due to temporary issues such as road closures or maintenance, the model may need to be adjusted to account for these constraints and find alternative routes. In some cases, it may also be necessary to consider alternative modes of transportation or re-evaluate the supply and demand points to find a more feasible solution. Overall, the adjustments made to the transportation linear program when there are unacceptable routes aim to ensure that the model accurately represents the available transportation options and provides a realistic and efficient solution.

Question 2

Draw the network for this transportation problem.
 $$\begin{array} { 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. } \quad x _ { A X } + x _ { A Y } + x _ { A Z } \leq 500 \
x _ { \mathrm { BX } } + x _ { \mathrm { BY } } + x _ { \mathrm { BZ } } \leq 400 \
x _ { \mathrm { AX } } + x _ { \mathrm { BX } } \quad = 300 \
x _ { \mathrm { AY } } + x _ { \mathrm { BY } } \quad = 300 \
x _ { \mathrm { AZ } } + x _ { \mathrm { BZ } } \quad = 300 \
x _ { i j } \geq 0 \
\end{array}$$

Accepted Answer

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

Question 3

Which of the following is not true regarding an LP model of the assignment problem?

Accepted Answer

A) Costs appear in the objective function only. 
B) All constraints are of the F1F1F1S1F1F1F10 form. 
C) All constraint left-hand side coefficient values are 1. 
D) All decision variable values are either 0 or 1. 
A) Costs appear in the objective function only. 
B) All constraints are of the F1F1F1S1F1F1F10 form. 
C) All constraint left-hand side coefficient values are 1. 
D) All decision variable values are either 0 or 1. B

Question 4

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

Accepted Answer

A) True 
 B)False

Question 5

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 6

The assignment problem is a special case of the

Accepted Answer

A) transportation problem. 
B) transshipment problem. 
C) maximal flow problem. 
D) shortest-route problem. 
A) transportation problem. 
B) transshipment problem. 
C) maximal flow problem. 
D) shortest-route problem.

Question 7

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

Accepted Answer

The answer of Consider the following shortest-route problem involving six...

Question 8

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 9

In the general assignment problem,one agent can be assigned to several tasks.

Accepted Answer

A) True 
 B)False

Question 10

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.

Accepted Answer

A) True 
 B)False

Question 11

Peaches are to be transported from three orchard regions to two canneries.Intermediate stops at a consolidation station are possible. $$\begin{array} { | l | c | c | c | c | } 
\hline \text { Orchard } & \text { Supply } & \text { Station } & \text { Cannery } & \text { Capacity } \
\hline \text { Riverside } & 1200 & \text { Waterford } & \text { Sanderson } & 2500 \
\hline \text { Sunny Slope } & 1500 & \text { Northside } & \text { Millville } & 3000 \
\hline \text { Old Farm } & 2000 & & & \
\hline
\end{array}$$ 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. $$\begin{array} { | l | c | c | c | c | c | c | c | } 
\hline & \mathrm { R } & \mathrm { SS } & \mathrm { OF } & \mathrm { W } & \mathrm { N } & \mathrm { S } & \mathrm { M } \
\hline \text { Riverside } & & 1 & & 5 & & 3 & \
\hline \text { Sunny Side } & & & & 4 & 5 & & \
\hline \text { Old Farm } & & & & 6 & 3 & & \
\hline \text { Waterford } & & & & & 2 & 2 & 4 \
\hline \text { Northside } & & & & & & 5 & 9 \
\hline \text { Sanderson } & & & & & & & 2 \
\hline \text { Millville } & & & & & & & \
\hline
\end{array}$$

Accepted Answer

The answer of Peaches are to be transported from three...

Question 12

Which of the following is not true regarding the linear programming formulation of a transportation problem?

Accepted Answer

A) Costs appear only in the objective function. 
B) The number of variables is (number of origins) x (number of destinations). 
C) The number of constraints is (number of origins) x (number of destinations). 
D) The constraints' left-hand side coefficients are either 0 or 1. 
A) Costs appear only in the objective function. 
B) The number of variables is (number of origins) x (number of destinations). 
C) The number of constraints is (number of origins) x (number of destinations). 
D) The constraints' left-hand side coefficients are either 0 or 1.

Question 13

The assignment problem constraint x31 + x32 + x33 + x34 F1F1F1S1F1F1F10 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 14

If a transportation problem has four origins and five destinations,the LP formulation of the problem will have nine constraints.

Accepted Answer

A) True 
 B)False

Question 15

The assignment problem is a special case of the transportation problem in which all supply and demand values equal one.

Accepted Answer

A) True 
 B)False

Question 16

Flow in a transportation network is limited to one direction.

Accepted Answer

A) True 
 B)False

Question 17

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.

Accepted Answer

A) True 
 B)False

Question 18

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. $$\begin{array} { c c | c c } 
\text { Source } & \text { Supply } & \text { Destination } & \text { Demand } \
\hline \text { A } & 200 & \mathrm { X } & 50 \
\text { B } & 100 & \mathrm { Y } & 125 \
\text { C } & 150 & Z & 125
\end{array}$$ Shipping costs are: $$\begin{array} { c | c c c } 
& &{ \text { Destination } } \
\text { Source } & \mathrm { Y } & \mathrm { Y } & \mathrm { Z } \
\hline \text { A } & 3 & 2 & 5 \
\text { B } & 9 & 10 & - \
\text { C } & 5 & 6 & 4 \
&& \text { (Source B cannot ship to destination Z) }
\end{array}$$

Accepted Answer

The answer of Canning Transport is to move goods from...

Question 19

A transportation problem with 3 sources and 4 destinations will have 7 decision variables.

Accepted Answer

A) True 
 B)False

Question 20

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

Explain what adjustments are made to the transportation linear program when there are unacceptable routes.

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

Which of the following is not true regarding an LP model of the assignment problem?

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

In the general linear programming model of the assignment problem,

The assignment problem is a special case of the

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

In a transshipment problem,shipments

In the general assignment problem,one agent can be assigned to several tasks.

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.

Which of the following is not true regarding the linear programming formulation of a transportation problem?

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

If a transportation problem has four origins and five destinations,the LP formulation of the problem will have nine constraints.

The assignment problem is a special case of the transportation problem in which all supply and demand values equal one.

Flow in a transportation network is limited to one direction.

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 transportation problem with 3 sources and 4 destinations will have 7 decision variables.

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

Introduction

Introduction to Probability

Probability Distributions

Decision Analysis

Utility and Game Theory

Times Series Analysis and Forecasting

Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance, and Operations Management

Integer Linear Programming

Advanced Optimization Applications

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Markov Processes

Filters

Exam 10: Distribution and Network Models

Explain what adjustments are made to the transportation linear program when there are unacceptable routes.

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

Which of the following is not true regarding an LP model of the assignment problem?

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

In the general linear programming model of the assignment problem,

The assignment problem is a special case of the

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

In a transshipment problem,shipments

In the general assignment problem,one agent can be assigned to several tasks.

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.

Which of the following is not true regarding the linear programming formulation of a transportation problem?

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

If a transportation problem has four origins and five destinations,the LP formulation of the problem will have nine constraints.

The assignment problem is a special case of the transportation problem in which all supply and demand values equal one.

Flow in a transportation network is limited to one direction.

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 transportation problem with 3 sources and 4 destinations will have 7 decision variables.

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

Introduction

Introduction to Probability

Probability Distributions

Decision Analysis

Utility and Game Theory

Times Series Analysis and Forecasting

Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance, and Operations Management

Integer Linear Programming

Advanced Optimization Applications

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Markov Processes

Filters

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