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

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
by

1 Answer

Answer :

b. Decision variable
by

Related questions

In simplex method, if there is tie between a decision variable and a slack (or surplus) variable, ______ should be selected a. Slack variable b. Surplus variable c. Decision variable d. None of the above

Description : In simplex method, if there is tie between a decision variable and a slack (or surplus) variable, ______ should be selected a. Slack variable b. Surplus variable c. Decision variable d. None of the above

Last Answer : c. 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

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

........................variables are fictitious and cannot have any physical meaning. a. Slack variables b. Surplus variables c. Artificial variables d. Decision variables

Description : ........................variables are fictitious and cannot have any physical meaning. a. Slack variables b. Surplus variables c. Artificial variables d. Decision variables

Last Answer : c. Artificial variables

In simplex method, we add _______ variables in the case of “=” a. Slack variable b. Surplus variable c. Artificial variable d. None of the above

Description : In simplex method, we add _______ variables in the case of “=” a. Slack variable b. Surplus variable c. Artificial variable d. None of the above

Last Answer : c. Artificial variable

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

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

. In simplex algorithm, which method is used to deal with the situation where an infeasible starting basic solution is given? a. Slack variable b. Simplex method c. Big M Method d. None of the above

Description : . In simplex algorithm, which method is used to deal with the situation where an infeasible starting basic solution is given? a. Slack variable b. Simplex method c. Big M Method d. None of the above

Last Answer : b. Simplex method

A constraint in a Linear Programming Model restricts: a. Value of objective function b. Value of decision variable c. Use of available resources d. All of the above

Description : A constraint in a Linear Programming Model restricts: a. Value of objective function b. Value of decision variable c. Use of available resources d. All of the above

Last Answer : d. All of the above

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

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

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

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

Last Answer : c. Both a and b

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

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

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

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

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

66. Which method is an iterative procedure for solving LPP in a finite number of steps? a. Simplex algorithm b. Slack variablec. Big M method d. Simplex method

Description : 66. Which method is an iterative procedure for solving LPP in a finite number of steps? a. Simplex algorithm b. Slack variable c. Big M method d. Simplex method

Last Answer : d. Simplex method

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

Decision making under certainty refers to .............................. situation. a. Deterministic b. Probabilistic c. Competitive d. None of these

Description : Decision making under certainty refers to .............................. situation. a. Deterministic b. Probabilistic c. Competitive d. None of these

Last Answer : a. Deterministic

A LPP model doesnot contain: a. Decision b. Constraints c. Feasible solution d. Spread Sheet

Description : A LPP model doesnot contain: a. Decision b. Constraints c. Feasible solution d. Spread Sheet

Last Answer : d. Spread Sheet

....................... is an important Operations Research Technique to analyse the queuing behaviour. a. Game theory b. Waiting line theory c. Decision theory d. Simulation

Description : ....................... is an important Operations Research Technique to analyse the queuing behaviour. a. Game theory b. Waiting line theory c. Decision theory d. Simulation

Last Answer : b. Waiting line theory

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

Before formulating a formal L P model, it is better to: a. Verbally identify decision variables b. Express the objective function in words c. Express each constraint in words d. All of the above

Description : Before formulating a formal L P model, it is better to: a. Verbally identify decision variables b. Express the objective function in words c. Express each constraint in words d. All of the above

Last Answer : d. All of the above

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

....................... deals with the concepts such as critical path, float, events, etc. a. Game theory b. Decision theory c. Queuing theory d. Network analysis

Description : ....................... deals with the concepts such as critical path, float, events, etc. a. Game theory b. Decision theory c. Queuing theory d. Network analysis

Last Answer : d. Network analysis

......................... deals with making sound decisions under conditions of certainty, risk and uncertainty. a. Game theory b. Network analysis c. Decision theory d. None of these

Description : ......................... deals with making sound decisions under conditions of certainty, risk and uncertainty. a. Game theory b. Network analysis c. Decision theory d. None of these

Last Answer : c. Decision theory

The quantitative approach to decision analysis is a .......................... a. Logical approach b. Rational approach c. Scientific approach d. All of the above

Description : The quantitative approach to decision analysis is a .......................... a. Logical approach b. Rational approach c. Scientific approach d. All of the above

Last Answer : c. Scientific approach

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

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

............................ models involve the allocation of resources to activities in such a way that some measure of effectiveness is optimised. a. Sequencing b. Allocation c. Queuing theory d. Decision theory

Description : ............................ models involve the allocation of resources to activities in such a way that some measure of effectiveness is optimised. a. Sequencing b. Allocation c. Queuing theory d. Decision theory

Last Answer : b. Allocation

Operations Research is a very powerful tool for ........................ a. Operations b. Research c. Decision making d. None of these

Description : Operations Research is a very powerful tool for ........................ a. Operations b. Research c. Decision making d. None of these

Last Answer : c. Decision making

While solving an LPP, infeasibility may be removed by: a. Removing a variable b. Removing a constraint c. Adding a variable d. Adding a constraint

Description : While solving an LPP, infeasibility may be removed by: a. Removing a variable b. Removing a constraint c. Adding a variable d. Adding a constraint

Last Answer : b. Removing a constraint

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

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

.......................models consider time as one of the important variable. a. Dynamic b. Static c. Botha and b d. None of these

Description : .......................models consider time as one of the important variable. a. Dynamic b. Static c. Botha and b d. None of these

Last Answer : a. Dynamic

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

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

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 : Matrix Minima Method to find initial feasible solution to a TP is also called ....................... a. NWCM b. LCM c. VAM d. None of these

Last Answer : c. VAM

In Transportation Problem, LCM stands for ............................. a. Lowest Common Multiplier b. Least Cost Method c. Lowest Cell Method d. None of these

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

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

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

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

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

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

Last Answer : d. All of the above

........................ is applied to determine optimal solution. a. NWCR b. VAM c. MODI Method 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

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

In transportation Problems, VAM stands for ......................... a. Value Addition Method b. Vogel’s Approximation Method c. Virgenean Approximation Method d. None of these

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

........................... method is used to solve an assignment problem. a. American method b. Hungarian method c. German method d. British method

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

The graphical method if LPP uses: a. Linear equations b. Constraint equations c. Objective function d. All of the above

Description : The graphical method if LPP uses: a. Linear equations b. Constraint equations c. Objective function d. All of the above

Last Answer : d. All of the above

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

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

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

The method used for solving an assignment problem is: a. Reduced matrix method b. MODI method c. Hungarian method d. None of these

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