................................is that element of the simplex table which lis both in the key row and key column. a. Key element b. Pivot element c. Both a and b d. None of these

................................is that element of the simplex table which lis both in the key row and
key column.
a. Key element
b. Pivot element
c. Both a and b
d. None of these
by

1 Answer

Answer :

c. Both a and b
by

Related questions

Any column or row of a simplex table is known as ......................... a. Key column b. Key row c. Vector d. None of these

Description : Any column or row of a simplex table is known as ......................... a. Key column b. Key row c. Vector d. None of these

Last Answer : c. Vector

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

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

The position in the pay off matrix where the maximin coincides with the minimax. a. Saddle point b. Break even point c. Pivot point d. None of the above

Description : The position in the pay off matrix where the maximin coincides with the minimax. a. Saddle point b. Break even point c. Pivot point d. None of the above

Last Answer : a. Saddle point

An assignment problem can be solved by ......................... a. Simplex method b. Transportation method c. Both a and b d. None of these

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

.................... is the popular method for solving an assignment problem. a. Hungarian Method b. Enumeration Method c. Simplex Method d. None of the above

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

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 : 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

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

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

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

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

A tuple is 1) - 1) Column of a Table 2) Two dimensional Table 3) Row of a Table 4) key of a Table

Description : A tuple is 1) - 1) Column of a Table 2) Two dimensional Table 3) Row of a Table 4) key of a Table

Last Answer : 3) Row of a Table

The allocated cells in the transportation table are called .............................. a. Occupied cells b. Empty cells c. Unoccupied cells d. None of these

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

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

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

The variables which can be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these

Description : The variables which can 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 : a. Controllable variables

Excess of service facilities over and above the number of customers results: a. Idleness of service capacity b. Queues c. Both a and b d. None of these

Description : Excess of service facilities over and above the number of customers results: a. Idleness of service capacity b. Queues c. Both a and b d. None of these

Last Answer : a. Idleness of service capacity

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

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

In queuing theory, ...................... refers to those waiting in a queue or receiving service. a. Service provider b. Customer c. Both a and b d. None of these

Description : In queuing theory, ...................... refers to those waiting in a queue or receiving service. a. Service provider b. Customer c. Both a and b d. None of these

Last Answer : b. Customer

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

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

.......................... is the duration by which an activity can be delayed without delaying the project. a. Slack b. Total float c. Both a and b d. None of these

Description : .......................... is the duration by which an activity can be delayed without delaying the project. a. Slack b. Total float c. Both a and b d. None of these

Last Answer : b. Total float

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

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

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

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

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

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

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

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

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

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

Operations Research is a ................................ a. Science b. Art c. Both a and b d. None of these

Description : Operations Research is a ................................ a. Science b. Art c. Both a and b d. None of these

Last Answer : c. Both a and b

Operations Research uses models to help the management in determining its .................... scientifically. a. Policies b. Actions c. Both a and b d. None of these

Description : Operations Research uses models to help the management in determining its .................... scientifically. a. Policies b. Actions c. Both a and b d. None of these

Last Answer : c. Both a and b

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 : 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

Last Answer : c. Both a and b

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

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

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

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

..................... are expressed in the form of equations a. Objectives b. Constraints c. Both a and b d. None of these

Description : ..................... are expressed in the form of equations a. Objectives b. Constraints c. Both a and b d. None of these

Last Answer : b. Constraints

........................ models assume that the values of the variables do not change with time during a particular period. a. Dynamic b. Static c. Both a and b d. None of these

Description : ........................ models assume that the values of the variables do not change with time during a particular period. a. Dynamic b. Static c. Both a and b d. None of these

Last Answer : b. Static

......................are representations of reality. a. Phases b. Models c. Both a and b d. None of these

Description : ......................are representations of reality. a. Phases b. Models c. Both a and b d. None of these

Last Answer : b. Models

The word .................. may be defined as some actions that we apply to some problems or hypothesis. a. Research b. Operations c. Both a and b d. None of these

Description : The word .................. may be defined as some actions that we apply to some problems or hypothesis. a. Research b. Operations c. Both a and b d. None of these

Last Answer : b. Operations

......................... models involve more risks and uncertainties. a. Probabilistic b. Deterministic c. Both a and b d. None of these

Description : ......................... models involve more risks and uncertainties. a. Probabilistic b. Deterministic c. Both a and b d. None of these

Last Answer : a. Probabilistic

In .................. models, everything is defined and the results are certain. a. Probabilistic b. Deterministic c. Both a and b d. None of these

Description : In .................. models, everything is defined and the results are certain. a. Probabilistic b. Deterministic c. Both a and b d. None of these

Last Answer : b. Deterministic

Operations Research cannot give perfect .................. to the problem. a. Answers b. Solutions c. Both a and b d. Decisions

Description : Operations Research cannot give perfect .................. to the problem. a. Answers b. Solutions c. Both a and b d. Decisions

Last Answer : c. Both a and b

Write the introduction of row and column of table ?

Description : Write the introduction of row and column of table ?

Last Answer : Tables are created to store any information in a special way. The horizontal position in the table is called row and the vertical position is called column .

The minimum number of rows and columns that a word table can have, is: a) Zero b) 1 Row and 1 Column c) 1 Row and 2 Columnsd) None of The Above

Description : The minimum number of rows and columns that a word table can have, is: a) Zero b) 1 Row and 1 Column c) 1 Row and 2 Columns d) None of The Above

Last Answer : b) 1 Row and 1 Column

Maximization problem, then convert into minimization table through _________ a. Row minimization b. Column minimization c. Regret matrix d. Profit matrix

Description : Maximization problem, then convert into minimization table through _________ a. Row minimization b. Column minimization c. Regret matrix d. Profit matrix

Last Answer : c. Regret matrix

An optimal solution of an assignment problem can be obtained only if a. Each row & column has only one zero element b. Each row & columns has at least one zero element c. The data is arrangement in a square matrix d. None of the above

Description : An optimal solution of an assignment problem can be obtained only if a. Each row & column has only one zero element b. Each row & columns has at least one zero element c. The data is arrangement in a square matrix d. None of the above

Last Answer : d. None of the above

Controllable variables are also called.................................. a. Slack variables b. Surplus variables c. Artificial variable d. Decision variables

Description : Controllable variables are also called.................................. a. Slack variables b. Surplus variables c. Artificial variable d. Decision variables

Last Answer : d. Decision variables

The outlet where the services are being provided to the customers is called................. a. Waiting line b. Service facility c. Idle facility d. Traffic intensity

Description : The outlet where the services are being provided to the customers is called................. a. Waiting line b. Service facility c. Idle facility d. Traffic intensity

Last Answer : b. Service facility

Hungarian method was developed by ........................ a. T C Koopman b. F L Hitchcock c. D Konig d. George B Dantzig

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

VAM is also called........................ a. Matrix Minima Method b. Penalty Method c. MODI Method d. None of these

Description : VAM is also called........................ a. Matrix Minima Method b. Penalty Method c. MODI Method d. None of these

Last Answer : b. Penalty Method

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

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

Shadow price is also called ...................... a. Dual price b. Unit price c. Total cost d. None of these

Description : Shadow price is also called ...................... a. Dual price b. Unit price c. Total cost d. None of these

Last Answer : a. Dual price

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 : 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

Game theory became popular when the book “Theory of Games and Economic Behaviour” was published in 1944 by .............................. a. Von Neumann b. Mc Closky c. Von-Neumann and Mc Closky d. Von-neumann and Morgenstern

Description : Game theory became popular when the book “Theory of Games and Economic Behaviour” was published in 1944 by .............................. a. Von Neumann b. Mc Closky c. Von-Neumann and Mc Closky d. Von-neumann and Morgenstern

Last Answer : d. Von-neumann and Morgenstern

Traffic intensity is computed by using the formula: a. λ/μ b. μ/λ c. 1- λ/μ d. 1- μ/λ

Description : Traffic intensity is computed by using the formula: a. λ/μ b. μ/λ c. 1- λ/μ d. 1- μ/λ

Last Answer : a. λ/μ

Traffic intensity in Queuing Theory is also called........................... a. Service factor b. Arrival factor c. Utilisation factor d. None of these

Description : Traffic intensity in Queuing Theory is also called........................... a. Service factor b. Arrival factor c. Utilisation factor d. None of these

Last Answer : c. Utilisation factor

..............................was the first person who developed a viable queueing theory a. Von Neumann b. Morgenstern c. H M Wagner d. Simeon Dennis Poisson

Description : ..............................was the first person who developed a viable queueing theory a. Von Neumann b. Morgenstern c. H M Wagner d. Simeon Dennis Poisson

Last Answer : d. Simeon Dennis Poisson

............................refers to the manner in which the customers behave while being in the queue. a. Service pattern b. Service pattern c. Queue discipline d. None of these

Description : ............................refers to the manner in which the customers behave while being in the queue. a. Service pattern b. Service pattern c. Queue discipline d. None of these

Last Answer : c. Queue discipline