BUS 461 WEEK 3 QUIZ

BUS 461 WEEK 3 QUIZ
Question 1 A bi directional arc in a shortest path problem can be modeled as two unidirectional arcs. (True, easy)

 	 	  True
 			  False

				

 	


Question 2.	Question :	Minimal spanning tree problems do not lend themselves to a convenient linear programming formulation. (True, medium)

 	 	  True
 			  False

				

 	


Question 3.	Question :	In the standard assignment problem where, for example, workers are being assigned tasks, which of the following situations would preclude the application of the assignment approach (the Hungarian algorithm)?

	  A worker may be assigned to more than one job.

 			  A worker may be unable to perform a certain job.

 		 	  The number of workers does not equal the number of jobs.

 		 	  Workers may perform fractional parts of jobs.



 	



Question 4.	Question :	The earliest start (ES) time for an activity is the latest earliest finish (EF) time of all its immediate predecessors.

 	 	  True
 			  False

				

 	


Question 5.	Question :	The assumptions underlying the application of the basic transportation model do not include:

	  any node may represent either a source or a destination.

 		 	  unit shipping costs may be constant or declining (i.e., 
quantity discounts) but not increasing with volume.
 		 	  all shipments must occur in the same time frame.

 			  shipments may not be sent back from a destination to a source.



 	


Question 6.	Question :	A model which matches salespeople to retail customers based on estimated profit potential of each salesperson-retail customer match, where each salesperson is to be matched with at most 25 retail customers, could be modeled as which network models?

 	  Either as a shortest path or a traveling salesman model.

 			  Either as a minimal spanning tree or a maximal flow model.

 		 	  Either as a maximization assignment model or a maximization 
transportation model.
 			  Either as a capacitated transshipment model or a direct 
enumeration model.


 	



Question 7.	Question :	In addressing and solving a maximal flow problem, flow capacities between adjacent nodes must be equal in both directions. (False, easy)

 	 	  True
 		 	  False

				



Question 8.	Question :	In network flow models, all arcs are generally assumed to be directed. In connectivity models, all arcs are generally assumed to be undirected.

 	 	  True
 			  False

				



Question 9.	Question :	A transportation model has been selected to represent the production schedule of a product to meet demand over a twelve month planning horizon with 12 production nodes, on each of which is defined the production capacity for each month, and 12 demand nodes, on each of which is defined the demand for each month. If goods can be stored a maximum of 3 months, which of the following statements is not true?

	  There should be no arc from production node 1 to demand node 
5.
 			  There should be no arc from production node 5 to demand node 1.
 		 	  There will be no feasible solution if demand in any one month cannot exceed the production capacity for that month.
 		 	  There will be no feasible solution if the total demand of the first m months cannot exceed the total production capacity for the first m months.


 	
Question 10.	Question :	The optimal solution to an assignment model can be obtained by solving the problem as each of the following models except:

 	 	  a traveling salesman model.

 			  a transportation model.

 			  a binary integer programming model.

 			  a linear programming model.