Question 1

Whenever total supply is less than total demand in a transportation problem, the LP model does not determine how the unsatisfied demand is handled.

Accepted Answer

A) True 
 B)False  True

Question 2

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

Question 3

Draw the network for this transportation problem.

Accepted Answer

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

Question 4

The objective of the transportation problem is to

Accepted Answer

A)  identify one origin that can satisfy total demand at the destinations and at the same time minimize total shipping cost. 
B)  minimize the number of origins used to satisfy total demand at the destinations. 
C)  minimize the number of shipments necessary to satisfy total demand at the destinations. 
D)  minimize the cost of shipping products from several origins to several destinations. 
A)  identify one origin that can satisfy total demand at the destinations and at the same time minimize total shipping cost. 
B)  minimize the number of origins used to satisfy total demand at the destinations. 
C)  minimize the number of shipments necessary to satisfy total demand at the destinations. 
D)  minimize the cost of shipping products from several origins to several destinations.

Question 5

Consider a maximal flow problem in which vehicle traffic entering a city is routed among several routes before eventually leaving the city. When represented with a network,

Accepted Answer

A)  the nodes represent stoplights. 
B)  the arcs represent one way streets. 
C)  the nodes represent locations where speed limits change. 
D)  None of the alternatives is correct. 
A)  the nodes represent stoplights. 
B)  the arcs represent one way streets. 
C)  the nodes represent locations where speed limits change. 
D)  None of the alternatives is correct.

Question 6

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 7

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

Accepted Answer

A) True 
 B)False

Question 8

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 9

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

Show both the network and the linear programming formulation for this assignment problem.

Accepted Answer

The answer of Show both the network and the linear...

Question 12

The problem which deals with the distribution of goods from several sources to several destinations is the

Accepted Answer

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

Question 13

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 14

A professor has been contacted by four not-for-profit agencies that are willing to work with student consulting teams. The agencies need help with such things as budgeting, information systems, coordinating volunteers, and forecasting. Although each of the four student teams could work with any of the agencies, the professor feels that there is a difference in the amount of time it would take each group to solve each problem. The professor's estimate of the time, in days, is given in the table below. Use the computer solution to see which team works with which project.
   ASSIGNMENT PROBLEM
************************
OBJECTIVE: MINIMIZATION
SUMMARY OF UNIT COST OR REVENUE DATA
*********************************************
   OPTIMAL ASSIGNMENTS COST/REVENUE
************************ ***************

Accepted Answer

Team A works with the forecast

Question 15

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

The answer of A beer distributor needs to plan how...

Question 16

The parts of a network that represent the origins are

Accepted Answer

A)  the capacities 
B)  the flows 
C)  the nodes 
D)  the arcs 
A)  the capacities 
B)  the flows 
C)  the nodes 
D)  the arcs

Question 17

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 18

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 19

The assignment problem constraint x31 + x32 + x33 + x34 $\le$ 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 20

Write the LP formulation for this transportation problem.

Accepted Answer

The answer of Write the LP formulation for this transportation...

Whenever total supply is less than total demand in a transportation problem, the LP model does not determine how the unsatisfied demand is handled.

Constraints in a transshipment problem

Draw the network for this transportation problem.

The objective of the transportation problem is to

Consider a maximal flow problem in which vehicle traffic entering a city is routed among several routes before eventually leaving the city. When represented with a network,

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.

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

The difference between the transportation and assignment problems is that

In a transshipment problem, shipments

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.

The problem which deals with the distribution of goods from several sources to several destinations is the

Arcs in a transshipment 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 parts of a network that represent the origins are

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.

The assignment problem is a special case of the

The assignment problem constraint x₃₁ + x₃₂ + x₃₃ + x₃₄ $\le$ 2 means

Write the LP formulation for this transportation problem.

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

Filters

Exam 6: Distribution and Network Models

Whenever total supply is less than total demand in a transportation problem, the LP model does not determine how the unsatisfied demand is handled.

Constraints in a transshipment problem

Draw the network for this transportation problem.

The objective of the transportation problem is to

Consider a maximal flow problem in which vehicle traffic entering a city is routed among several routes before eventually leaving the city. When represented with a network,

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.

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

The difference between the transportation and assignment problems is that

In a transshipment problem, shipments

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.

The problem which deals with the distribution of goods from several sources to several destinations is the

Arcs in a transshipment 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 parts of a network that represent the origins are

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.

The assignment problem is a special case of the

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

Write the LP formulation for this transportation problem.

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

Filters

The assignment problem constraint x₃₁ + x₃₂ + x₃₃ + x₃₄ $\le$ 2 means