Question 1

Consider a shortest route problem in which a bank courier must travel between branches and the main operations center. When represented with a network,

Accepted Answer

A) the branches are the arcs and the operations center is the node. 
B) the branches are the nodes and the operations center is the source. 
C) the branches and the operations center are all nodes and the streets are the arcs. 
D) the branches are the network and the operations center is the node. 
A) the branches are the arcs and the operations center is the node. 
B) the branches are the nodes and the operations center is the source. 
C) the branches and the operations center are all nodes and the streets are the arcs. 
D) the branches are the network and the operations center is the node.

Question 2

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

The answer of A network of railway lines connects the...

Question 3

Arcs in a transshipment problem

Accepted Answer

A) must connect every node to a transshipment node. 
B) represent the cost of shipments. 
C) indicate the direction of the flow. 
D) All of the alternatives are correct. 
A) must connect every node to a transshipment node. 
B) represent the cost of shipments. 
C) indicate the direction of the flow. 
D) All of the alternatives are correct.

Question 4

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 5

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 $\ge$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 $\ge$form. 
C) All constraint left-hand side coefficient values are 1. 
D) All decision variable values are either 0 or 1.

Question 6

Constraints in a transshipment problem

Accepted Answer

A) correspond to arcs. 
B) include a variable for every arc. 
C) require the sum of the shipments out of an origin node to equal supply. 
D) All of the alternatives are correct. 
A) correspond to arcs. 
B) include a variable for every arc. 
C) require the sum of the shipments out of an origin node to equal supply. 
D) All of the alternatives are correct.

Question 7

A dummy origin in a transportation problem is used when supply exceeds demand.

Accepted Answer

A) True 
 B)False

Question 8

The network below shows the flows possible between pairs of six locations. Formulate an LP to find the maximal flow possible from Node 1 to Node 6.

Accepted Answer

The answer of The network below shows the flows possible...

Question 9

We assume in the maximal flow problem that

Accepted Answer

A) the flow out of a node is equal to the flow into the node. 
B) the source and sink nodes are at opposite ends of the network. 
C) the number of arcs entering a node is equal to the number of arcs exiting the node. 
D) None of the alternatives is correct. 
A) the flow out of a node is equal to the flow into the node. 
B) the source and sink nodes are at opposite ends of the network. 
C) the number of arcs entering a node is equal to the number of arcs exiting the node. 
D) None of the alternatives is correct.

Question 10

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) * (number of destinations). 
C) The number of constraints is (number of origins) * (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) * (number of destinations). 
C) The number of constraints is (number of origins) * (number of destinations). 
D) The constraints' left-hand side coefficients are either 0 or 1.

Question 11

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 } \
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& Min 6X₁₂ + 10X₁₃ + 7X₁₄ + 4X₂₃ + 5X₂₅ + 4X₃₂ + 5X₃₄ +

Question 12

Peaches are to be transported from three orchard regions to two canneries. Intermediate stops at a consolidation station are possible. $$\begin{array} { | l | c | l | l | 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 } & \text { 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 13

Show both the network and the linear programming formulation for this assignment problem. $$\begin{array} { c | c c c c } 
&  { \text { Task } } \
\text { Person } & \text { A } & \text { B } & \text { C } & \text { D } \
\hline 1 & 9 & 5 & 4 & 2 \
2 & 12 & 6 & 3 & 5 \
3 & 11 & 6 & 5 & 7
\end{array}$$

Accepted Answer

@#IMG-DLM& Let X_ij = 1 if person i is assigned to jo

Question 14

The capacitated transportation problem includes constraints which reflect limited capacity on a route.

Accepted Answer

A) True 
 B)False

Question 15

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} { l c } 
\text { Path } & \text { Distance } \
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 16

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

Accepted Answer

The transshipment problem involves deter

Question 17

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

Accepted Answer

A) True 
 B)False

Question 18

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 19

Consider the network below. Formulate the LP for finding the shortest-route path from node 1 to node 7.

Accepted Answer

The answer of Consider the network below. Formulate the LP...

Question 20

The number of units shipped from origin i to destination j is represented by

Accepted Answer

A) xij. 
B) xji. 
C) cij. 
D) cji. 
A) xij. 
B) xji. 
C) cij. 
D) cji.

Consider a shortest route problem in which a bank courier must travel between branches and the main operations center. When represented with a network,

Arcs in a transshipment problem

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

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

Constraints in a transshipment problem

A dummy origin in a transportation problem is used when supply exceeds demand.

The network below shows the flows possible between pairs of six locations. Formulate an LP to find the maximal flow possible from Node 1 to Node 6.

We assume in the maximal flow problem that

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

Show both the network and the linear programming formulation for this assignment problem. Task Person A B C D 1 9 5 4 2 2 12 6 3 5 3 11 6 5 7

The capacitated transportation problem includes constraints which reflect limited capacity on a route.

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

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

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

In a transshipment problem, shipments

Consider the network below. Formulate the LP for finding the shortest-route path from node 1 to node 7.

The number of units shipped from origin i to destination j is represented by

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance and Operations Management

Advanced Linear Programming Applications

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

Linear Programming: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters

Exam 6: Distribution and Network Problems

Consider a shortest route problem in which a bank courier must travel between branches and the main operations center. When represented with a network,

Arcs in a transshipment problem

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

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

Constraints in a transshipment problem

A dummy origin in a transportation problem is used when supply exceeds demand.

The network below shows the flows possible between pairs of six locations. Formulate an LP to find the maximal flow possible from Node 1 to Node 6.

We assume in the maximal flow problem that

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

Show both the network and the linear programming formulation for this assignment problem. Task Person A B C D 1 9 5 4 2 2 12 6 3 5 3 11 6 5 7

The capacitated transportation problem includes constraints which reflect limited capacity on a route.

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

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

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

In a transshipment problem, shipments

Consider the network below. Formulate the LP for finding the shortest-route path from node 1 to node 7.

The number of units shipped from origin i to destination j is represented by

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, Finance and Operations Management

Advanced Linear Programming Applications

Integer Linear Programming

Nonlinear Optimization Models

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

Linear Programming: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters