Operations Research

201. The purpose of the stepping-stone method is to

1. develop the initial solution to the transportation problem.
2. assist one in moving from an initial feasible solution to the optimal solution.
3. determine whether a given solution is feasible or not.
4. identify the relevant costs in a transportation problem.

202. The smallest quantity is chosen at the corners of the closed path with negative sign to be assigned at unused cell because

1. It improve the total cost
2. It does not disturb rim conditions
3. It ensure feasible solution
4. All of the above

203. The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are

1. m+n
2. m*n
3. m+n-1
4. m+n+1

204. The transportation method assumes that

1. there are no economies of scale if large quantities are shipped from one source to one destination.
2. the number of occupied squares in any solution must be equal to the number of rows in the table plus the number of columns in the table plus 1.
3. there is only one optimal solution for each problem.
4. the number of dummy sources equals the number of dummy destinations.

205. What enables us to determine the earliest and latest times for each of the events and activities and thereby helps in the identification of the critical path?

1. Programme Evaluation
2. Review Technique (PERT)
3. Both A and B
4. Deployment of resources

206. What have been constructed from OR problems an methods for solving the models that are available in many cases?

1. Scientific Models
2. Algorithms
3. Mathematical Models
4. None of the above

207. What is the difference between minimal cost network flows and transportation problems?

1. The minimal cost network flows are special cases of transportation problems
2. The transportation problems are special cases of the minimal cost network flows
3. There is no difference
4. The transportation problems are formulated in terms of tableaus, while the minimal cost network flows are formulated in terms of graphs

208. What is the objective function in linear programming problems?

1. A constraint for available resource
2. An objective for research and development of a company
3. A linear function in an optimization problem
4. A set of non-negativity conditions

209. When total supply is equal to total demand in a transportation problem, the problem is said to be

1. Balanced
2. Unbalanced
3. Degenerate
4. None of the above

210. Which of the following is a method for improving an initial solution in a transportation problem?

1. northwest-corner
2. intuitive lowest-cost
3. southeast-corner rule
4. stepping-stone