Question 1

For a network with n nodes, a spanning tree is

Accepted Answer

A)  a set of (n-1) arcs that connects all nodes and contains no loops 
B)  a set of dummy arcs 
C)  a set of n arcs that connects all nodes 
D)  a random subset of arcs covering all nodes 
A)  a set of (n-1) arcs that connects all nodes and contains no loops 
B)  a set of dummy arcs 
C)  a set of n arcs that connects all nodes 
D)  a random subset of arcs covering all nodes

Question 2

Solve the following minimal spanning tree problem starting at node 1.
​

Accepted Answer

The answer of Solve the following minimal spanning tree problem...

Question 3

What is the constraint for node 2 in the following maximal flow problem? ​   ​

Accepted Answer

A)  X12 − X23 − X24 = 0 
B)  X12 + X23 + X24 = 0 
C)  X12 ≤ 4 
D)  X12 + X13 − X23 = 0 
A)  X12 − X23 − X24 = 0 
B)  X12 + X23 + X24 = 0 
C)  X12 ≤ 4 
D)  X12 + X13 − X23 = 0

Question 4

A company needs to ship 100 units from Seattle to Denver at the lowest possible cost. The costs associated with shipping between the cities are listed below. Also, the decision variable associated with each pair of cities is shown next to the cost.   ​
Write out the LP formulation for this problem.

Accepted Answer

The answer of A company needs to ship 100 units...

Question 5

An oil company wants to produce lube oil, gasoline and diesel fuel at two refineries at the minimum cost. There are two sources of crude oil. The following network representation depicts this problem.
​   ​
Write out the LP formulation for this problem.

Accepted Answer

The answer of An oil company wants to produce lube...

Question 6

A maximal flow problem differs from other network models in which way?

Accepted Answer

A)  arcs are two directional 
B)  multiple supply nodes are used 
C)  arcs have limited capacity 
D)  arcs have unlimited capacity 
A)  arcs are two directional 
B)  multiple supply nodes are used 
C)  arcs have limited capacity 
D)  arcs have unlimited capacity

Question 7

​Most of the other types of network flow problems can be viewed as simple variations of the transshipment problem.

Accepted Answer

A) True 
 B)False

Question 8

Almost all network problems can be viewed as special cases of the

Accepted Answer

A)  transshipment problem. 
B)  shortest path problem. 
C)  maximal flow problem. 
D)  minimal spanning tree problem. 
A)  transshipment problem. 
B)  shortest path problem. 
C)  maximal flow problem. 
D)  minimal spanning tree problem.

Question 9

Joe Fix plans the repair schedules each day for the Freeway Airline. Joe has 3 planes in need of repair and 5 repair personnel at his disposal. Each plane requires a single repairperson, except plane 3, which needs 2 personnel. Anyone not assigned to maintaining an airplane works in the maintenance shop for the day (not modeled). Each repairperson has different likes and dislikes regarding the types of repairs they prefer. For each plane, Joe has pulled the expected maintenance and determined the total preference matrix for his repair personnel. The preference matrix is:   Draw the network flow for this assignment problem assuming Joe would like to maximize the total preference in his worker-to-aircraft schedule.

Accepted Answer

The answer of Joe Fix plans the repair schedules each...

Question 10

The following network depicts a transportation/distribution problem for Clifton Distributing. Formulate the LP for Clifton assuming they wish to minimize the total product-miles incurred.
​

Accepted Answer

The answer of The following network depicts a transportation/distribution problem...

Question 11

The demand nodes in the graphical representation of the transshipment problem:

Accepted Answer

A)  have all directed arcs originating at them 
B)  have all directed arcs terminating at them 
C)  have some unidirectional arcs 
D)  are greater than the demand nodes 
A)  have all directed arcs originating at them 
B)  have all directed arcs terminating at them 
C)  have some unidirectional arcs 
D)  are greater than the demand nodes

Question 12

Draw the network representation of this LP model. What type of problem is it?

Accepted Answer

It is a ma

For a network with n nodes, a spanning tree is

Solve the following minimal spanning tree problem starting at node 1.

What is the constraint for node 2 in the following maximal flow problem?

A company needs to ship 100 units from Seattle to Denver at the lowest possible cost. The costs associated with shipping between the cities are listed below. Also, the decision variable associated with each pair of cities is shown next to the cost. Write out the LP formulation for this problem.

An oil company wants to produce lube oil, gasoline and diesel fuel at two refineries at the minimum cost. There are two sources of crude oil. The following network representation depicts this problem. Write out the LP formulation for this problem.

A maximal flow problem differs from other network models in which way?

Most of the other types of network flow problems can be viewed as simple variations of the transshipment problem.

Almost all network problems can be viewed as special cases of the

The following network depicts a transportation/distribution problem for Clifton Distributing. Formulate the LP for Clifton assuming they wish to minimize the total product-miles incurred.

The demand nodes in the graphical representation of the transshipment problem:

Draw the network representation of this LP model. What type of problem is it?

Introduction to Modeling and Decision Analysis

Introduction to Optimization and Linear Programming

Modeling and Solving Lp Problems in a Spreadsheet

Sensitivity Analysis and the Simplex Method

Integer Linear Programming

Goal Programming and Multiple Objective Optimization

Nonlinear Programming Evolutionary Optimization

Regression Analysis

Data Mining

Time Series Forecasting

Introduction to Simulation Using Analytic Solver Platform

Queuing Theory

Decision Analysis

Project Management Online

Filters

Exam 5: Network Modeling

For a network with n nodes, a spanning tree is

Solve the following minimal spanning tree problem starting at node 1. ​

What is the constraint for node 2 in the following maximal flow problem? ​ ​

A company needs to ship 100 units from Seattle to Denver at the lowest possible cost. The costs associated with shipping between the cities are listed below. Also, the decision variable associated with each pair of cities is shown next to the cost. ​ Write out the LP formulation for this problem.

An oil company wants to produce lube oil, gasoline and diesel fuel at two refineries at the minimum cost. There are two sources of crude oil. The following network representation depicts this problem. ​ ​ Write out the LP formulation for this problem.

A maximal flow problem differs from other network models in which way?

​Most of the other types of network flow problems can be viewed as simple variations of the transshipment problem.

Almost all network problems can be viewed as special cases of the

The following network depicts a transportation/distribution problem for Clifton Distributing. Formulate the LP for Clifton assuming they wish to minimize the total product-miles incurred. ​

The demand nodes in the graphical representation of the transshipment problem:

Draw the network representation of this LP model. What type of problem is it?

Introduction to Modeling and Decision Analysis

Introduction to Optimization and Linear Programming

Modeling and Solving Lp Problems in a Spreadsheet

Sensitivity Analysis and the Simplex Method

Integer Linear Programming

Goal Programming and Multiple Objective Optimization

Nonlinear Programming Evolutionary Optimization

Regression Analysis

Data Mining

Time Series Forecasting

Introduction to Simulation Using Analytic Solver Platform

Queuing Theory

Decision Analysis

Project Management Online

Filters

Solve the following minimal spanning tree problem starting at node 1.

What is the constraint for node 2 in the following maximal flow problem?

A company needs to ship 100 units from Seattle to Denver at the lowest possible cost. The costs associated with shipping between the cities are listed below. Also, the decision variable associated with each pair of cities is shown next to the cost. Write out the LP formulation for this problem.

An oil company wants to produce lube oil, gasoline and diesel fuel at two refineries at the minimum cost. There are two sources of crude oil. The following network representation depicts this problem. Write out the LP formulation for this problem.

Most of the other types of network flow problems can be viewed as simple variations of the transshipment problem.

The following network depicts a transportation/distribution problem for Clifton Distributing. Formulate the LP for Clifton assuming they wish to minimize the total product-miles incurred.