Question 1

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

Accepted Answer

A)  5 constraints 
B)  9 constraints 
C)  18 constraints 
D)  20 constraints 
A)  5 constraints 
B)  9 constraints 
C)  18 constraints 
D)  20 constraints

Question 2

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

Accepted Answer

A) True 
 B)False

Question 3

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

Accepted Answer

A) True 
 B)False

Question 4

A transshipment problem is a generalization of the transportation problem in which certain nodes are neither supply nodes nor destination nodes.

Accepted Answer

A) True 
 B)False

Question 5

The maximal flow problem can be formulated as a capacitated transshipment problem.

Accepted Answer

A) True 
 B)False

Question 6

In the LP formulation of a maximal flow problem, a conservation-of-flow constraint ensures that an arc's flow capacity is not exceeded.

Accepted Answer

A) True 
 B)False

Question 7

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 8

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.
   Shipping costs are:

Accepted Answer

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

Question 9

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

Accepted Answer

A) True 
 B)False

Question 10

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 11

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 12

When a route in a transportation problem is unacceptable, the corresponding variable can be removed from the LP formulation.

Accepted Answer

A) True 
 B)False

Question 13

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.

Question 14

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.

Accepted Answer

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

Question 15

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

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

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

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

A transshipment problem is a generalization of the transportation problem in which certain nodes are neither supply nodes nor destination nodes.

The maximal flow problem can be formulated as a capacitated transshipment problem.

In the LP formulation of a maximal flow problem, a conservation-of-flow constraint ensures that an arc's flow capacity is not exceeded.

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. Shipping costs are:

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

In the general linear programming model of the assignment problem,

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

When a route in a transportation problem is unacceptable, the corresponding variable can be removed from the LP formulation.

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

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.

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

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

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

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

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

A transshipment problem is a generalization of the transportation problem in which certain nodes are neither supply nodes nor destination nodes.

The maximal flow problem can be formulated as a capacitated transshipment problem.

In the LP formulation of a maximal flow problem, a conservation-of-flow constraint ensures that an arc's flow capacity is not exceeded.

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. Shipping costs are:

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

In the general linear programming model of the assignment problem,

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

When a route in a transportation problem is unacceptable, the corresponding variable can be removed from the LP formulation.

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

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.

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

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