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

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
by

1 Answer

Answer :

b. Objectives
by

Related questions

In maximisation cases, ....................... are assigned to the artificial variables as their coefficients in the objective function. a. + m b. – m c. 0 d. None of these

Description : In maximisation cases, ....................... are assigned to the artificial variables as their coefficients in the objective function. a. + m b. – m c. 0 d. None of these

Last Answer : a. + m

For a minimisation Transportation Problem, the objective is to minimise: a. Profit b. Cost c. Solution 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

In a maximisation assignment problem, the objective is to maximise ............................. a. Profit b. Cost c. Optimisation d. None of these

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

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

A manufacturer has decided to improve its inventory management by maintaining low inventory levels and waiting to purchase materials until right before they are needed in production. This inventory management technique is called A)just -in -time (JIT). B)inventory minimisation. C)economic order quantity.D)reorder point maximisation.

Description : A manufacturer has decided to improve its inventory management by maintaining low inventory levels and waiting to purchase materials until right before they are needed in production. This inventory ... time (JIT). B)inventory minimisation. C)economic order quantity.D)reorder point maximisation.

Last Answer : D)reorder point maximisation.

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

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

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

Non-negativity constraints are written as ...................... a. Equality b. Non-equality c. Greater than or equal to d. Less than or equal to

Description : Non-negativity constraints are written as ...................... a. Equality b. Non-equality c. Greater than or equal to d. Less than or equal to

Last Answer : c. Greater than or equal to

Straight lines shown in a linear programming graph indicates ........................... a. Objective function b. Constraints c. Points d. All of the above

Description : Straight lines shown in a linear programming graph indicates ........................... a. Objective function b. Constraints c. Points d. All of the above

Last Answer : b. Constraints

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

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

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

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

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

All the parameters in the linear programming model are assumed to be ..................... a. Variables b. Constraints c. Functions d. None of these

Description : All the parameters in the linear programming model are assumed to be ..................... a. Variables b. Constraints c. Functions d. None of these

Last Answer : b. Constraints

Which one of the following pricing objectives is rarely operational because its achievement is difficult to measure? A)Return on investment B)Cash flow C)Profit maximisation D)Market share E)Survival

Description : Which one of the following pricing objectives is rarely operational because its achievement is difficult to measure? A)Return on investment B)Cash flow C)Profit maximisation D)Market share E)Survival

Last Answer : C)Profit maximisation

42. _____ assumption means the prior knowledge of all the coefficients in the objective function , the coefficients of the constraints and the resource values a. Proportionality b. Certainty c. Finite choices d. Continuity

Description : 42. _____ assumption means the prior knowledge of all the coefficients in the objective function , the coefficients of the constraints and the resource values a. Proportionality b. Certainty c. Finite choices d. Continuity

Last Answer : b. Certainty

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

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

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

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

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

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

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

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

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

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

Every Linear Programming Problem is related to another Linear Programming Problem, called .......................... a. Primal b. Dual c. Non-linear Programming d. None of these

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

In Linear Programming Problem, degeneracy occurs in ................. stages. a. One b. Two c. Three d. Four

Description : In Linear Programming Problem, degeneracy occurs in ................. stages. a. One b. Two c. Three d. Four

Last Answer : b. Two

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

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

If the feasible region of a linear programming problem is empty, the solution is .................... a. Unbounded b. Infeasible c. Infeasible d. Alternative

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

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

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

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

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

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

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

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

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

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

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

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