Question 1

The decision variables in transportation problems are:

Accepted Answer

A)  profits 
B)  costs 
C)  flows 
D)  capacities 
A)  profits 
B)  costs 
C)  flows 
D)  capacities C

Question 2

Transshipment points are locations where goods neither originate nor end up,but goods are allowed to enter such points to be shipped out to their eventual destinations.

Accepted Answer

A) True 
 B)False  True

Question 3

Exhibit 5-1
Sinclair Plastics operates two chemical plants which produce polyethylene; the Ohio Valley plant which can produce up to 10,000 tons per month and the Lakeview plant which can produce up to 7,000 tons per month. Sinclair sells its polyethylene to three different auto manufacturing plants, Grand Rapids (demand = 3000 tons per month), Blue Ridge (demand = 5000 tons per month), and Sunset (demand = 4000 tons per month). The costs of shipping between the respective plants is shown in the table below:
 $$\begin{array} { | l | l | l | l | } 
\hline & \text { Grand Rapids } & \text { Blue Ridge } & \text { Sunset } \
\hline \text { Ohio Valley } & 50 & 40 & 100 \
\hline \text { Lakeview } & 60 & 50 & 75 \
\hline
\end{array}$$
-Refer to Exhibit 5-1.Implement the LP model in Solver and obtain the optimal shipping plan.What is the optimized cost

Accepted Answer

The optimized model below shows the shipping plan,which results in a total cost of $650,000.​

Question 4

Exhibit 5-3
Steve the auto parts salesman is trying to navigate his way between the rural west Texas towns of Jonestown and Upland. The possible routes for this trip are shown below, along with the mileage along each route.
   $\begin{array}{lrcc}
\text { Origin } & & \text { Destination } & \text { Distance (miles) } \
\text { Jonestown } & \text { to } & \text { Haleyville } & 25 \
\text { Jonestown } & \text { to } & \text { Krickburg } & 55 \
\text { Jonestown } & \text { to } & \text { Karn City } & 35 \
\text { Haleyville } & \text { to } & \text { Mart } & 50 \
\text { Haleyville } & \text { to } & \text { Krickburg } & 25 \
\text { Haleyville } & \text { to } & \text { Karn City } & 30 \
\text { Karn City } & \text { to } & \text { Mart } & 50 \
\text { Karn City } & \text { to } & \text { Baker } & 65 \
\text { Krickburg } & \text { to } & \text { Karn City } & 20 \
\text { Krickburg } & \text { to } & \text { Baker } & 30 \
\text { Krickburg } & \text { to } & \text { Mart } & 45 \
\text { Mart } & \text { to } & \text { Baker } & 20 \
\text { Mart } & \text { to } & \text { Upland } & 40 \
\text { Baker } & \text { to } & \text { Upland } & 30
\end{array}$
-Refer to Exhibit 5-3.What general type of LP model can be applied to this problem
 What modifications to the general type are required for this problem

Accepted Answer

The problem can be formulated

Question 5

In network models of transportation problems,arcs represent the routes for getting a product from one node to another.

Accepted Answer

A) True 
 B)False

Question 6

Which of the following is not an example of a condition that a more complex logistics model might include

Accepted Answer

A)  Multiple products 
B)  Multiple modes of transportation 
C)  Multiple time periods 
D)  Multiple objectives 
A)  Multiple products 
B)  Multiple modes of transportation 
C)  Multiple time periods 
D)  Multiple objectives

Question 7

Exhibit 5-2
A small engineering firm employs one civil engineer, two engineering technicians, and one summer intern. The types of projects the firm does includes surveys (typically 7 per month), designs (5 per month), and construction project plans (four per month). The times, in hours, required for each employee to complete teach type of project are shown below. Based on their capabilities and time spent on travel and administrative tasks, the engineer, tech 1, tech 2, and intern can handle 5, 4, 4, and 3 projects per month, respectively.
 ​  
-Refer to Exhibit 5-2.Based on their salaries,the engineer,tech 1,tech 2,and intern earn $90,$65,$65,and $45 per hourly,respectively.Change the firm's objective function to minimize staff costs and find the optimal assignment plan.Does it change from the base case

Accepted Answer

The assignment plan may change

Question 8

In an assignment model of machines to jobs,the machines are analogous to which of the following in a transportation problem

Accepted Answer

A)  Suppliers 
B)  Customers 
C)  Flows 
D)  Unit capacities 
A)  Suppliers 
B)  Customers 
C)  Flows 
D)  Unit capacities

Question 9

A typical shortest path problem is a special case of the general network flow model.

Accepted Answer

A) True 
 B)False

Question 10

Exhibit 5-1
Sinclair Plastics operates two chemical plants which produce polyethylene; the Ohio Valley plant which can produce up to 10,000 tons per month and the Lakeview plant which can produce up to 7,000 tons per month. Sinclair sells its polyethylene to three different auto manufacturing plants, Grand Rapids (demand = 3000 tons per month), Blue Ridge (demand = 5000 tons per month), and Sunset (demand = 4000 tons per month). The costs of shipping between the respective plants is shown in the table below:
 $$\begin{array} { | l | l | l | l | } 
\hline & \text { Grand Rapids } & \text { Blue Ridge } & \text { Sunset } \
\hline \text { Ohio Valley } & 50 & 40 & 100 \
\hline \text { Lakeview } & 60 & 50 & 75 \
\hline
\end{array}$$
-Refer to Exhibit 5-1.Suppose the Lakeview plant was required to run at capacity.How much more would the shipping plan cost Sinclair

Accepted Answer

The optimized model below show

Question 11

In an optimized shipping plan,most of the shipments occur on the low-cost routes,but this is not always the case.

Accepted Answer

A) True 
 B)False

Question 12

The objective in transportation problems is typically to:

Accepted Answer

A)  maximize profits 
B)  maximize revenue 
C)  minimize costs 
D)  maximize feasibility 
A)  maximize profits 
B)  maximize revenue 
C)  minimize costs 
D)  maximize feasibility

Question 13

A particularly useful Excel function in the formulation of transportation problems is the:

Accepted Answer

A)  IF function 
B)  SUMIF function 
C)  SUMPRODUCT function 
D)  NPV function 
A)  IF function 
B)  SUMIF function 
C)  SUMPRODUCT function 
D)  NPV function

Question 14

In transportation problems,shipments between supply points or between demand points are possible.

Accepted Answer

A) True 
 B)False

Question 15

Problems which deal with the direct distribution of products from supply locations to demand locations are called:

Accepted Answer

A)  transportation problems 
B)  assignment problems 
C)  network problems 
D)  transshipment problems 
A)  transportation problems 
B)  assignment problems 
C)  network problems 
D)  transshipment problems

Question 16

It is useful to model network problems by listing all of the arcs and their corresponding flows in one long,comprehensive list.

Accepted Answer

A) True 
 B)False

Question 17

In a general logistics model that minimizes the cost of network flow,the flow balance constraint for each supply node has the form

Accepted Answer

A)  Flow in ≥ Flow out + Net supply 
B)  Flow out ≥ Flow in + Net demand 
C)  Flow in = Flow out 
D)  Flow out ≤ Flow in + Net supply 
E)  Flow in ≤ Flow out + Net demand 
A)  Flow in ≥ Flow out + Net supply 
B)  Flow out ≥ Flow in + Net demand 
C)  Flow in = Flow out 
D)  Flow out ≤ Flow in + Net supply 
E)  Flow in ≤ Flow out + Net demand

Question 18

The network model representation of the transportation problem has the following advantage relative to the special case of a simple transportation model:

Accepted Answer

A)  it does not require capacity restrictions on the arcs of the network 
B)  the flows in the network model don't all necessarily have to be from supply locations to demand locations 
C)  a network model representation is generally easier to formulate and solve 
D)  All of these options 
A)  it does not require capacity restrictions on the arcs of the network 
B)  the flows in the network model don't all necessarily have to be from supply locations to demand locations 
C)  a network model representation is generally easier to formulate and solve 
D)  All of these options

Question 19

In a typical network model representation of the transportation problem,the nodes indicate

Accepted Answer

A)  roads 
B)  rail lines 
C)  geographic locations 
D)  rivers 
A)  roads 
B)  rail lines 
C)  geographic locations 
D)  rivers

Question 20

The flow balance constraint for each transshipment node in a network flow model has the form Flow in = Flow out.

Accepted Answer

A) True 
 B)False

The decision variables in transportation problems are:

Transshipment points are locations where goods neither originate nor end up,but goods are allowed to enter such points to be shipped out to their eventual destinations.

In network models of transportation problems,arcs represent the routes for getting a product from one node to another.

Which of the following is not an example of a condition that a more complex logistics model might include

In an assignment model of machines to jobs,the machines are analogous to which of the following in a transportation problem

A typical shortest path problem is a special case of the general network flow model.

In an optimized shipping plan,most of the shipments occur on the low-cost routes,but this is not always the case.

The objective in transportation problems is typically to:

A particularly useful Excel function in the formulation of transportation problems is the:

In transportation problems,shipments between supply points or between demand points are possible.

Problems which deal with the direct distribution of products from supply locations to demand locations are called:

It is useful to model network problems by listing all of the arcs and their corresponding flows in one long,comprehensive list.

In a general logistics model that minimizes the cost of network flow,the flow balance constraint for each supply node has the form

The network model representation of the transportation problem has the following advantage relative to the special case of a simple transportation model:

In a typical network model representation of the transportation problem,the nodes indicate

The flow balance constraint for each transshipment node in a network flow model has the form Flow in = Flow out.

Introduction to Modeling

Introduction to Spreadsheet Modeling

Introduction to Optimization Modeling

Linear Programming Models

Optimization Models With Integer Variables

Nonlinear Optimization Models

Evolutionary Solver: An Alternative Optimization Procedure

Decision Making Under Uncertainty

Introduction to Simulation Modeling

Simulation Models

Queueing Models

Regression and Forecasting Models

Data Mining

Filters

Exam 5: Network Models

The decision variables in transportation problems are:

Transshipment points are locations where goods neither originate nor end up,but goods are allowed to enter such points to be shipped out to their eventual destinations.

In network models of transportation problems,arcs represent the routes for getting a product from one node to another.

Which of the following is not an example of a condition that a more complex logistics model might include

In an assignment model of machines to jobs,the machines are analogous to which of the following in a transportation problem

A typical shortest path problem is a special case of the general network flow model.

In an optimized shipping plan,most of the shipments occur on the low-cost routes,but this is not always the case.

The objective in transportation problems is typically to:

A particularly useful Excel function in the formulation of transportation problems is the:

In transportation problems,shipments between supply points or between demand points are possible.

Problems which deal with the direct distribution of products from supply locations to demand locations are called:

It is useful to model network problems by listing all of the arcs and their corresponding flows in one long,comprehensive list.

In a general logistics model that minimizes the cost of network flow,the flow balance constraint for each supply node has the form

The network model representation of the transportation problem has the following advantage relative to the special case of a simple transportation model:

In a typical network model representation of the transportation problem,the nodes indicate

The flow balance constraint for each transshipment node in a network flow model has the form Flow in = Flow out.

Introduction to Modeling

Introduction to Spreadsheet Modeling

Introduction to Optimization Modeling

Linear Programming Models

Optimization Models With Integer Variables

Nonlinear Optimization Models

Evolutionary Solver: An Alternative Optimization Procedure

Decision Making Under Uncertainty

Introduction to Simulation Modeling

Simulation Models

Queueing Models

Regression and Forecasting Models

Data Mining

Filters