Exam 6: Distribution and Network Models

Converting a transportation problem LP from cost minimization to profit maximization requires only changing the objective function; the conversion does not affect the constraints.

(True/False)

4.9/5

(31)

Question 41

Peaches are to be transported from three orchard regions to two canneries.Intermediate stops at a consolidation station are possible. Shipment costs are shown in the table below.Where no cost is given,shipments are not possible.Where costs are shown,shipments are possible in either direction.Draw the network model for this problem.

(Essay)

5.0/5

(31)

Question 42

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.

(Essay)

4.7/5

(31)

Question 43

The objective of the transportation problem is to

(Multiple Choice)

4.9/5

(25)

Question 44

The problem that deals with the distribution of goods from several sources to several destinations is a(n)

(Multiple Choice)

4.9/5

(38)

Question 45

The parts of a network that represent the origins are called

(Multiple Choice)

4.9/5

(29)

Question 46

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:

(Essay)

4.9/5

(28)

Question 47

In a transportation problem with total supply equal to total demand,if there are four origins and seven destinations,and there is a unique optimal solution,the optimal solution will utilize 11 shipping routes.

(True/False)

4.9/5

(27)

Question 48

When a transportation problem has capacity limitations on one or more of its routes,it is known as a capacitated transportation problem.

(True/False)

4.9/5

(42)

Question 49

A computer manufacturing company wants to develop a monthly plan for shipping finished products from three of its manufacturing facilities to three regional warehouses.It is thinking about using a transportation LP formulation to exactly match capacities and requirements.Data on transportation costs (in dollars per unit),capacities,and requirements are given below. Warehouse Plant 1 2 3 Capacities A 2.41 1.63 2.09 4,000 B 3.18 5.62 1.74 6,000 C 4.12 3.16 3.09 3,000 Requirement 8,000 2,000 3,000 a.How many variables are involved in the LP formulation? b.How many constraints are there in this problem? c.What is the constraint corresponding to Plant B? d.What is the constraint corresponding to Warehouse 3?

(Essay)

4.9/5

(41)

Question 50

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

(True/False)

4.8/5

(32)

Question 51

Which of the following is NOT true regarding the linear programming formulation of a transportation problem?

(Multiple Choice)

4.8/5

(43)

Question 52

Consider the following shortest-route problem involving seven cities.The distances between the cities are given below.Draw the network model for this problem and formulate the LP for finding the shortest route from City 1 to City 7.

(Essay)

4.8/5

(33)

Question 53

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

(True/False)

4.9/5

(34)

Question 54

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

(True/False)

4.9/5

(41)

Question 55

Write the LP formulation for this transportation problem.

(Essay)

4.8/5

(34)

Question 56

Which of the following is NOT a characteristic of assignment problems?

(Multiple Choice)

4.9/5

(31)

Question 57

We represent the number of units shipped from origin i to destination j by

(Multiple Choice)

4.9/5

(31)

Question 58

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

(True/False)

4.9/5

(37)

Question 59

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

(Multiple Choice)

4.9/5

(42)

Question 60

Showing 41 - 60 of 62

Converting a transportation problem LP from cost minimization to profit maximization requires only changing the objective function; the conversion does not affect the constraints.

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 objective of the transportation problem is to

The problem that deals with the distribution of goods from several sources to several destinations is a(n)

The parts of a network that represent the origins are called

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:

In a transportation problem with total supply equal to total demand,if there are four origins and seven destinations,and there is a unique optimal solution,the optimal solution will utilize 11 shipping routes.

When a transportation problem has capacity limitations on one or more of its routes,it is known as a capacitated transportation problem.

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

Which of the following is NOT true regarding the linear programming formulation of a transportation problem?

Consider the following shortest-route problem involving seven cities.The distances between the cities are given below.Draw the network model for this problem and formulate the LP for finding the shortest route from City 1 to City 7.

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

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

Write the LP formulation for this transportation problem.

Which of the following is NOT a characteristic of assignment problems?

We represent the number of units shipped from origin i to destination j by

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

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

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, finance, and OM

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

Converting a transportation problem LP from cost minimization to profit maximization requires only changing the objective function; the conversion does not affect the constraints.

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 objective of the transportation problem is to

The problem that deals with the distribution of goods from several sources to several destinations is a(n)

The parts of a network that represent the origins are called

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: ​

In a transportation problem with total supply equal to total demand,if there are four origins and seven destinations,and there is a unique optimal solution,the optimal solution will utilize 11 shipping routes.

When a transportation problem has capacity limitations on one or more of its routes,it is known as a capacitated transportation problem.

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

Which of the following is NOT true regarding the linear programming formulation of a transportation problem?

Consider the following shortest-route problem involving seven cities.The distances between the cities are given below.Draw the network model for this problem and formulate the LP for finding the shortest route from City 1 to City 7.

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

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

Write the LP formulation for this transportation problem.

Which of the following is NOT a characteristic of assignment problems?

We represent the number of units shipped from origin i to destination j by

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

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

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, finance, and OM

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

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.

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: