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 : 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 : 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 : Initial feasible solution to a transportation Problem can be found out by ......................... a. VAM b. MODI Method c. Both a and b d. None of these
Last Answer : a. VAM
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 : 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 : 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 : 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 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 : 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 : 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 : 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 : 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 : .................... 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
Last Answer : 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 : 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 : In queuing theory, ............................ stands for mean service rate. a. μ b. λ c. t d. none of these
Last Answer : a. μ
Description : In queuing theory, ............................ stands for mean arrival rate of customers. a. μ b. λ c. t d. none of these
Last Answer : b. λ
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 : 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
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 : 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 : 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 : 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 : Operations Research cannot give perfect .................. to the problem. a. Answers b. Solutions c. Both a and b d. Decisions
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
Description : Hungarian method was developed by ........................ a. T C Koopman b. F L Hitchcock c. D Konig d. George B Dantzig
Last Answer : c. D Konig
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 : 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 : ...................... is a method of analysing the current movement of the some variable in an effort to predict the future movement of the same variable. a. Goal programming b. Queuing theory c. Markov Analysis d. Replacement theory
Last Answer : c. Markov Analysis
Description : Which of the following method is used to solve mixed strategy problems: a. Probability method b. Graphic method c. Linear Programming method d. All of the above
Description : ........................ is applied to determine optimal solution. a. NWCR b. VAM c. MODI Method d. None of these
Last Answer : c. MODI Method
Description : The graphical method if LPP uses: a. Linear equations b. Constraint equations c. Objective function d. All of the above
Description : In simplex method, ........................ should be selected when there is tie between slack/surplus variable and decision variable. a. Slack variable b. Decision variable c. Surplus variable d. None of these
Last Answer : b. Decision variable
Description : In simplex method, we add .......................... in the case of constraints with sign “=” a. Surplus variable b. Artificial variable c. Slack variable d. None of these
Last Answer : b. Artificial variable
Description : ........................may be defined as a method of determining an optimal program of interdependent activities in view of available resources. a. Goal programming b. Linear programming c. Decision making d. None of these
Last Answer : b. Linear programming
Description : Shadow price is also called ...................... a. Dual price b. Unit price c. Total cost d. None of these
Last Answer : a. Dual price
Description : A matrix which shows the gains and losses resulting from moves and counter moves is called.................................. a. Cost matrix b. Pay off matrix c. Both a and b d. None of these
Last Answer : b. Pay off matrix
Description : PERT emphasises on ........................... a. Activity b. Time c. Cost d. None of these
Last Answer : b. Time
Description : The O R technique which helps in minimising total waiting and service cost is: a. Game theory b. Queuing theory c. Both a and b d. Decision theory
Last Answer : b. Queuing theory
Description : Compute the lowest common multiple (LCM) of numbers in Python -Web-Development
Last Answer : answer:
Description : If a simplex table shows the values 2, -3, 0 against “θ”, which should be taken as the replacement ratio. a. 2 b. -3 c. 0 d. None of these
Last Answer : c. 0
Description : Controllable variables are also called.................................. a. Slack variables b. Surplus variables c. Artificial variable d. Decision variables
Last Answer : d. Decision variables
Description : The variables which cannot be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these
Last Answer : b. Uncontrollable variables