Transportation and Assignment Models
True / False Questions
1) Transportation models may be used when a firm is trying to decide where to locate a new
2) In a transportation problem, each destination must be supplied by one and only one source.
3) One of the advantages of the stepping-stone method is that if, at a particular iteration, we accidentally choose a route that is not the best, the only penalty is to perform additional iterations.
4) The transportation algorithm can be used to solve both minimization problems and maximization problems.
5) In the assignment problem, the costs for a dummy row will be equal to the lowest cost of the column for each respective cell in that row.
Multiple Choice Questions:
6) Which of the following techniques can be used for moving from an initial feasible solution to an optimal solution in a transportation problem? A) Hungarian method
B) stepping-stone method
C) northwest corner rule
D) Vogel's approximation method
E) All of the above
7) After testing each unused cell by the stepping-stone method in the transportation problem and finding only one cell with a negative improvement index, A) once you make that improvement, you would definitely have an optimal solution. B) you would make that improvement and then check all unused cells again. C) you could stop because you already had the optimal solution. D) you should check to be sure that you don't have to add a dummy source or dummy destination. E) None of the above
8) If we want to quickly arrive at a "feasible," but not necessarily "optimal" solution to the transportation problem, we will use the A) stepping-stone method.
B) northwest corner rule.
C) Vogel's approximation method.
D) MODI method.
E) Any of the above
9) If the total supply from the sources does not equal the total demand from the destinations in the transportation problem, A) and if supply is greater than demand, add a dummy source or factory. B) the amount put in a dummy source or destination should make supply and demand equal. C) and if demand is greater than supply, add a dummy destination or warehouse. D) All of the above
E) None of the above
Analytical Type Questions:
1) Problem 9-11 – 11th. Edition; (Chapter 10-11 in the 9th. Edition) 2) Problem 9-13 – 11th. Edition; (Chapter 10-13 in the 9th. Edition) 3) Problem 9-16 – 11th., Edition; (Chapter 10-15in the 9th. Edition)
Integer Programming, Goal Programming, and
1) An integer programming solution can never produce a greater profit objective than the LP solution to the same problem
2) The following objective function is nonlinear: Max 5X + (1/8)Y - Z.
3) The following objective function is nonlinear: Max 5X - 8YZ.
4) In goal programming, our goal is to drive the deviational variables in the objective function as close to zero as possible.
5) A 0-1 programming representation could be used to assign sections of a course to specific classrooms.
6) A model containing a linear objective function and linear constraints but requiring that one or more of the decision variables take on an integer value in the final solution is called ________ A) a goal programming problem.
B) an integer programming problem.
C) a nonlinear programming...