Description : Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: a. NWCM b. LCM c. VAM d. None of these
Last Answer : c. VAM
Description : Matrix Minima Method to find initial feasible solution to a TP is also called ....................... a. NWCM b. LCM c. VAM d. None of these
Description : ........................ is applied to determine optimal solution. a. NWCR b. VAM c. MODI Method d. None of these
Last Answer : c. MODI Method
Description : MODI Method to test the optimality of a feasible solution to TP is also called............... a. Stepping Stone Method b. u. v. Method c. both a and b d. none of these
Last Answer : b. u. v. Method
Description : Consider the following transportation problem: The initial basic feasible solution of the above transportation problem using Vogel's Approximation Method(VAM) is given below: The solution of the ... degenerate solution (B) is optimum solution (C) needs to improve (D) is infeasible solution
Last Answer : (B) is optimum solution
Description : VAM is also called........................ a. Matrix Minima Method b. Penalty Method c. MODI Method d. None of these
Last Answer : b. Penalty Method
Description : The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the number of positive allocations are: a. m + n b. m x n c. m +n – 1 d. m +n + 1
Last Answer : c. m +n – 1
Description : In transportation Problems, VAM stands for ......................... a. Value Addition Method b. Vogel’s Approximation Method c. Virgenean Approximation Method d. None of these
Last Answer : b. Vogel’s Approximation Method
Description : The method used for solving an assignment problem is: a. Reduced matrix method b. MODI method c. Hungarian method d. None of these
Last Answer : c. Hungarian method
Description : Which of the following is a characteristic of a dual problem: a. Dual of a dual is primal b. If dual has a finite optimal solution, then the primal also has finite optimal solution c. If dual has no feasible solution, then the primal also has no feasible solution d. All of the above
Last Answer : d. All of the above
Description : When at least one of the basic variables is zero, then the basic feasible solution to a Linear Programming Problem is said to be .............................. a. Infeasible b. Unbounded c. Degenerate d. Non-degenerate
Last Answer : c. Degenerate
Description : If the feasible region of a linear programming problem is empty, the solution is .................... a. Unbounded b. Infeasible c. Infeasible d. Alternative
Last Answer : b. Infeasible
Description : The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel’s Approximation method is (A) 76 (B) 80 (C) 90 (D) 96
Last Answer : (B) 80
Description : Consider the following transportation problem : The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel’s Approximation method is : (A) 1450 (B) 1465 (C) 1480 (D) 1520
Last Answer : (B) 1465
Description : The Hungarian method for solving an assignment problem can also be used to solve: a. A transportation problem b. A travelling salesman problem c. A linear programming problem d. Both a and b
Last Answer : b. A travelling salesman problem
Description : An assignment problem can be solved by ......................... a. Simplex method b. Transportation method c. Both a and b d. None of these
Last Answer : c. Both a and b
Description : For a minimisation Transportation Problem, the objective is to minimise: a. Profit b. Cost c. Solution d. None of these
Last Answer : b. Cost
Description : The dummy source/destination in a transportation problem is added to ........................ a. Satisfy rim constraints b. Prevent solution from becoming degenerate c. Ensure total cost does not exceed a limit d. None of the above
Last Answer : a. Satisfy rim constraints
Description : A LPP model doesnot contain: a. Decision b. Constraints c. Feasible solution d. Spread Sheet
Last Answer : d. Spread Sheet
Description : Operations Research techniques help to find ................... solution. a. Feasible solution b. Infeasible solution c. Optimal solution d. None of these
Last Answer : c. Optimal solution
Description : An optimal solution is considered as the ................... among the feasible solutions. a. Worst b. Best c. Ineffective d. None of these
Last Answer : b. Best
Description : In Transportation Problem, LCM stands for ............................. a. Lowest Common Multiplier b. Least Cost Method c. Lowest Cell Method d. None of these
Last Answer : b. Least Cost Method
Description : In Transportation Problem, NWCM stands for ............................. a. North West Cost Method b. Net Worth Corner Method c. North West Corner Method d. None of these
Last Answer : c. North West Corner Method
Description : Consider the following conditions : (a) The solution must be feasible, i.e. it must satisfy all the supply and demand constraints. (b) The number of positive allocations must be equal to m+n-1, where m is the number of rows and n is ... B) (a) and (c) only (C) (b) and (c) only (D) (a), (b) and (c)
Last Answer : (D) (a), (b) and (c)
Description : A Transportation Problem is said to be unbalanced when total supply is not equal to ............ a. Total cost b. Total demand c. Both a and b d. None of these
Last Answer : b. Total demand
Description : The assignment problem is: a. Requires that only one activity be assigned to each resource b. Is a special case of transportation problem c. Can be used to maximise resource d. All the above
Last Answer : d. All the above
Description : While solving a LPP graphically, the area bounded by constraints is called ................. a. Feasible region b. Infeasible region c. Unbounded region d. None of these
Last Answer : a. Feasible region
Description : Transportation model was first introduced by ........................ in the year 1941. a. T C Koopman b. George B Dantzig c. Von-neumann d. F L Hitchcock
Last Answer : d. F L Hitchcock
Description : ......................... is a series of activities related to a project. a. Network b. Transportation Model c. Assignment model d. None of these
Last Answer : a. Network
Description : The allocated cells in the transportation table are called .............................. a. Occupied cells b. Empty cells c. Unoccupied cells d. None of these
Last Answer : a. Occupied cells
Description : A basic feasible solution to a m-origin, n-destination transportation problem is said to be ................... if the number of positive allocations are less than m + n – 1. (A) degenerate (B) non-degenerate (C) unbounded (D) unbalanced
Last Answer : (A) degenerate
Description : Operations Research does not give perfect solution to a problem, but it helps to improve the ......................... of the solution. a. Quality b. Clarity c. Look d. None of these
Last Answer : a. Quality
Description : .................... is the popular method for solving an assignment problem. a. Hungarian Method b. Enumeration Method c. Simplex Method d. None of the above
Last Answer : a. Hungarian Method
Description : Which of the following methods is used to solve an assignment problem: a. Enumeration Method b. Hungarian Method c. Simplex Method d. All of the above
Description : ........................... method is used to solve an assignment problem. a. American method b. Hungarian method c. German method d. British method
Last Answer : b. Hungarian method
Description : Graphic method can be applied to solve a liner programming problem when there are only ........................... variables a. A one b. Two c. Three d. More than three
Last Answer : b. Two
Description : Activities that cannot be started until one or more of the other activities are completed, are called.......................................... a. Dummy activities b. Initial activities c. Successor activities d. Predecessor activities
Last Answer : c. Successor activities
Description : The initial basic feasible solution of the following transportion problem : then the minimum cost is (A) 76 (B) 78 (C) 80 (D) 82
Last Answer : (A) 76
Description : Constraints in an LPP are treated as active, if they: a. Do not consume all the available resources at optimality b. Represent optimal solution c. Both a and b d. None of these
Last Answer : b. Represent optimal solution
Description : Which of the following is true with regard to a Linear Programming Model? a. No guarantee to get integer valued solution b. The relationship among decision variables is liner c. Both a and b d. None of the these
Last Answer : d. None of the these
Description : Operations Research makes a ...................... attack on complex problems to arrive at optimal solution. a. Scientific b. Systematic c. Both a and b d. None of these
Description : A minimisation problem can be connected into maximisation problem by changing the signs of coefficients in the ........................... a. Constraints b. Objectives c. Both a and b d. None of these
Last Answer : b. Objectives
Description : Operations Research cannot give perfect .................. to the problem. a. Answers b. Solutions c. Both a and b d. Decisions
Description : In an LPP, if the solution of a variable can be made infinitely large without violating the constraints, then the solution is .............................. a. Infeasible b. Alternative c. Unbounded d. Unique
Last Answer : c. Unbounded
Description : If there are more than one optimal solutions for the decision variables, the solution is ........... a. Infeasible b. Unbounded c. Alternative d. None of these
Last Answer : c. Alternative
Description : At which of the following stage(s), the degeneracy do not occur in transportation problem? (m, n represents number of sources and destinations respectively) (a) While the values of dual variables ui and vj cannot be computed. (b) While ... and (d) (3) (a) and (d) (4) (a), (b), (c) and (d)
Last Answer : (3) (a) and (d)
Description : In a maximisation assignment problem, the objective is to maximise ............................. a. Profit b. Cost c. Optimisation d. None of these
Last Answer : a. Profit
Description : Every Linear Programming Problem is related to another Linear Programming Problem, called .......................... a. Primal b. Dual c. Non-linear Programming d. None of these
Last Answer : b. Dual
Description : In Linear Programming Problem, degeneracy occurs in ................. stages. a. One b. Two c. Three d. Four
Description : Who defined Operations Research as scientific approach to problem solving for executive management. a. E L Arnoff b. H M Wagner c. Churchman d. None of these
Last Answer : b. H M Wagner