BUAL 5380 EXAM 2 QUESTIONS AND ANSWERS WITH COMPLETE SOLUTIONS VERIFIED LATEST UPDATE

BUAL 5380 EXAM 2 QUESTIONS AND ANSWERS WITH COMPLETE SOLUTIONS VERIFIED LATEST UPDATE 8 studiers today 4.9 (7 reviews) Many organizations must determine how to schedule employees to provide adequate service. If we assume that an organization faces the same situation each week, this is referred to as a. static scheduling problem b. dynamic scheduling problem c. transportation scheduling problem d. All of these options a. static scheduling problem Which of the following does not represent a broad class of applications of linear programming models? a. Blending models b. Financial portfolio models c. Logistics models d. Set covering models e. Forecasting models e. Forecasting models Which of the following is true regarding multiple optimal solutions? a. All solutions have the same values for the decision variables b. All solutions have the same value for the objective function c. All solutions have the same shadow prices d. All of these options b. All solutions have the same value for the objective function Rounding the solution of a linear programming to the nearest integer values provides a(n) a. integer solution that is optimal b. integer solution that may be neither feasible nor optimal c. feasible solution that is not necessarily optimal d. infeasible solution b. integer solution that may be neither feasible nor optimal The problem which deals with the direct distribution of products from supply locations to demand locations is called a(n) a. transportation problem b. assignment problem c. network problem d. transshipment problem a. transportation problem The objective in transportation problems is typically to: a. maximize profits b. maximize revenue c. minimize costs d. maximize feasibility c. minimize costs A typical transportation problem requires which of the following sets of input numbers: a. Capacities, demands and flows b. Capacities, demands and unit shipping costs c. Supplies, demands and flows d. Supplies, demands and arcs b. Capacities, demands and unit shipping costs In a network representation of a transportation problem, the arcs generally represent: a. warehouses b. geographic locations c. flows d. capacities c. flows The flow balance constraint for each transshipment node, in a minimum cost network flow model, takes the form a. Flow in Flow out + Net supply b. Flow out Flow in + Net supply c. Flow in = Flow out d. Flow out Flow in + Net supply e. Flow in Flow out + Net demand c. Flow in = Flow out