Question 1

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

Accepted Answer

A) True 
 B)False

Question 2

A transshipment constraint must contain a variable for every arc entering or leaving the node.

Accepted Answer

A) True 
 B)False

Question 3

RVW (Restored Volkswagens) buys 15 used VW's at each of two car auctions each week held at different locations. It then transports the cars to repair shops it contracts with. When they are restored to RVW's specifications, RVW sells 10 each to three different used car lots. There are various costs associated with the average purchase and transportation prices from each auction to each repair shop. Also there are transportation costs from the repair shops to the used car lots. RVW is concerned with minimizing its total cost given the costs in the table below.

Accepted Answer

​
a. @#IMG-DLM& B.Denote A1 as node 1, A2 as node

Question 4

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 5

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 6

​Define the variables and constraints necessary in the LP formulation of the maximal flow problem.

Accepted Answer

The maximal flow problem is a classic op

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

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

Question 9

Find the maximal flow from node 1 to node 7 in the following network.

Accepted Answer

Decision variables: x_ij = amount of flow f

Question 10

​How is the shortest-route problem like the transshipment problem?

Accepted Answer

The shortest-route problem and the trans

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

A transshipment constraint must contain a variable for every arc entering or leaving the node.

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.

Constraints in a transshipment problem

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

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

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

Find the maximal flow from node 1 to node 7 in the following network.

How is the shortest-route problem like the transshipment 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

Time Series Analysis and 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 Models

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

A transshipment constraint must contain a variable for every arc entering or leaving the node.

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.

Constraints in a transshipment problem

​Define the variables and constraints necessary in the LP formulation of the maximal flow problem.

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

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

Find the maximal flow from node 1 to node 7 in the following network.

​How is the shortest-route problem like the transshipment 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

Time Series Analysis and 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

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

How is the shortest-route problem like the transshipment problem?