Question 1

The cost of an arc in a shortest path problem is equal to the distance of the arc.

Accepted Answer

A) True 
 B)False

Question 2

The objective in transportation problems is typically to:

Accepted Answer

A)  maximize profits 
B)  maximize revenue 
C)  minimize costs 
D)  maximize feasibility 
A)  maximize profits 
B)  maximize revenue 
C)  minimize costs 
D)  maximize feasibility

Question 3

For all routes with positive flows in an optimized transportation problem,the reduced cost will be:

Accepted Answer

A)  zero 
B)  how much less shipping costs would have to be for shipments to occur along that route 
C)  how much more shipping costs would have to be for shipments to occur along that route 
D)  how much the capacity is along that shipping route 
A)  zero 
B)  how much less shipping costs would have to be for shipments to occur along that route 
C)  how much more shipping costs would have to be for shipments to occur along that route 
D)  how much the capacity is along that shipping route

Question 4

The decision variables in transportation problems are:

Accepted Answer

A)  profits 
B)  costs 
C)  flows 
D)  capacities 
A)  profits 
B)  costs 
C)  flows 
D)  capacities

Question 5

A particularly useful Excel function in the formulation of transportation problems is the:

Accepted Answer

A)  IF function 
B)  SUMIF function 
C)  SUMPRODUCT function 
D)  NPV function 
A)  IF function 
B)  SUMIF function 
C)  SUMPRODUCT function 
D)  NPV function

Question 6

A minimum cost network flow model (MCNFM)has the following advantage relative to the special case of a simple transportation model:

Accepted Answer

A)  a MCNFM does not require capacity restrictions on the arcs of the network 
B)  the flows in a general MCNFM don't all necessarily have to be from supply locations to demand locations 
C)  a MCNFM is generally easier to formulate and solve 
D)  All of these options 
A)  a MCNFM does not require capacity restrictions on the arcs of the network 
B)  the flows in a general MCNFM don't all necessarily have to be from supply locations to demand locations 
C)  a MCNFM is generally easier to formulate and solve 
D)  All of these options

Question 7

Exhibit 5-2
A small engineering firm employs one civil engineer,two engineering technicians,and one summer intern.The types of projects the firm does includes surveys (typically 7 per month),designs (5 per month),and construction project plans (four per month).The times,in hours,required for each employee to complete teach type of project are shown below.Based on their capabilities and time spent on travel and administrative tasks,the engineer,tech 1,tech 2,and intern can handle 5,4,4,and 3 projects per month,respectively.
  
-Refer to Exhibit 5-2.Implement a LP model in Solver and determine the optimal monthly assignment plan for the firm.What is the total number of hours that will be assigned to projects each month?

Accepted Answer

The optimized model

Question 8

Transshipment points are locations where goods neither originate nor end up,but goods are allowed to enter such points to be shipped out to their eventual destinations.

Accepted Answer

A) True 
 B)False

Question 9

Exhibit 5-3
Steve the auto parts salesman is trying to navigate his way between the rural west Texas towns of Jonestown and Upland.The possible routes for this trip are shown below,along with the mileage along each route.    
-Refer to Exhibit 5-3.Implement the appropriate model in Solver and determine the shortest path for Steve.How many total miles will he travel on his trip?

Accepted Answer

The optimized shortest path mo

Question 10

In transportation problems,shipments between supply points or between demand points are possible.

Accepted Answer

A) True 
 B)False

The cost of an arc in a shortest path problem is equal to the distance of the arc.

The objective in transportation problems is typically to:

For all routes with positive flows in an optimized transportation problem,the reduced cost will be:

The decision variables in transportation problems are:

A particularly useful Excel function in the formulation of transportation problems is the:

A minimum cost network flow model (MCNFM)has the following advantage relative to the special case of a simple transportation model:

Transshipment points are locations where goods neither originate nor end up,but goods are allowed to enter such points to be shipped out to their eventual destinations.

In transportation problems,shipments between supply points or between demand points are possible.

Introduction to Modeling

Introduction to Spreadsheet Modeling

Introduction to Optimization Modeling

Linear Programming Models

Optimization Models With Integer Variables

Nonlinear Optimization Models

Evolutionary Solver: an Alternative Optimization Procedure

Decision Making Under Uncertainty

Introduction to Simulation Modeling

Simulation Models

Inventory Models

Queuing Models

Regression and Forecasting Models

Filters

Exam 5: Network Models

The cost of an arc in a shortest path problem is equal to the distance of the arc.

The objective in transportation problems is typically to:

For all routes with positive flows in an optimized transportation problem,the reduced cost will be:

The decision variables in transportation problems are:

A particularly useful Excel function in the formulation of transportation problems is the:

A minimum cost network flow model (MCNFM)has the following advantage relative to the special case of a simple transportation model:

Transshipment points are locations where goods neither originate nor end up,but goods are allowed to enter such points to be shipped out to their eventual destinations.

In transportation problems,shipments between supply points or between demand points are possible.

Introduction to Modeling

Introduction to Spreadsheet Modeling

Introduction to Optimization Modeling

Linear Programming Models

Optimization Models With Integer Variables

Nonlinear Optimization Models

Evolutionary Solver: an Alternative Optimization Procedure

Decision Making Under Uncertainty

Introduction to Simulation Modeling

Simulation Models

Inventory Models

Queuing Models

Regression and Forecasting Models

Filters