Question 1

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 2

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 3

Write the LP formulation for this transportation problem.

Accepted Answer

None

Question 4

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 5

Transshipment problem allows shipments both in and out of some nodes while transportation problems do not.

Accepted Answer

A) True 
 B)False

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

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

Accepted Answer

A) True 
 B)False

Question 8

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

Accepted Answer

A) True 
 B)False

The assignment problem is a special case of the

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

Write the LP formulation for this transportation problem.

We assume in the maximal flow problem that

Transshipment problem allows shipments both in and out of some nodes while transportation problems do not.

Constraints in a transshipment problem

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

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

Introduction

Introduction to Probability

Probability Distributions

Decision Analysis

Utility Game Theory

Time Series Analysis Forecasting

Intro to Linear Programming

LP Sensitivity Analysis

LP Applications

Integer Linear Programming

Advanced Optimization Applications

Project Scheduling

Inventory Models

Waiting Line Models

Simulation

Markov Processes

Filters

Exam 10: Distribution Network Models

The assignment problem is a special case of the

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

Write the LP formulation for this transportation problem.

We assume in the maximal flow problem that

Transshipment problem allows shipments both in and out of some nodes while transportation problems do not.

Constraints in a transshipment problem

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

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

Introduction

Introduction to Probability

Probability Distributions

Decision Analysis

Utility Game Theory

Time Series Analysis Forecasting

Intro to Linear Programming

LP Sensitivity Analysis

LP Applications

Integer Linear Programming

Advanced Optimization Applications

Project Scheduling

Inventory Models

Waiting Line Models

Simulation

Markov Processes

Filters