An optimal solution is considered as the ................... among the feasible solutions. a. Worst b. Best c. Ineffective d. None of these

An optimal solution is considered as the ................... among the feasible solutions.
a. Worst
b. Best
c. Ineffective
d. None of these
by

1 Answer

Answer :

b. Best
by

Related questions

An optimum solution is considered the _____ among feasible solutions a. Worst b. Best c. Ineffective d. None of the above

Description : An optimum solution is considered the _____ among feasible solutions a. Worst b. Best c. Ineffective d. None of the above

Last Answer : b. Best

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

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

Operations Research techniques help to find ................... solution. a. Feasible solution b. Infeasible solution c. Optimal solution d. None of these

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

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

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

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

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

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

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

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

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

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

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

When all the players of the game follow their optimal strategies, then the expected pay off of the game is called....................... a. Gain of the game b. Loss of the game c. Value of the game d. None of these

Description : When all the players of the game follow their optimal strategies, then the expected pay off of the game is called....................... a. Gain of the game b. Loss of the game c. Value of the game d. None of these

Last Answer : c. Value of the game

Linear Programming Technique helps to find an optimal use of: a. Machine b. Money c. Manpower d. All of the above

Description : Linear Programming Technique helps to find an optimal use of: a. Machine b. Money c. Manpower d. All of the above

Last Answer : d. All of the above

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

51. An iso-profit line represents a. An infinite number of solutions all of which yield the same profit b. An infinite number of solutions all of which incurs the same cost c. An infinite number of optimal solutions d. A boundary of the feasible region

Description : 51. An iso-profit line represents a. An infinite number of solutions all of which yield the same profit b. An infinite number of solutions all of which incurs the same cost c. An infinite number of optimal solutions d. A boundary of the feasible region

Last Answer : . An infinite number of solutions all of which yield the same profit

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

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

A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False

Description : A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False

Last Answer : a) True

A basic solution which also satisfies the condition in which all basic variables are non-negative is called ___ a. Basic feasible solution b. Feasible solution c. Optimal solution d. None of the above

Description : A basic solution which also satisfies the condition in which all basic variables are non-negative is called ___ a. Basic feasible solution b. Feasible solution c. Optimal solution d. None of the above

Last Answer : a. Basic feasible solution

65. Any feasible solution which optimizes (minimizes or maximizes) the objective function of the LPP is called as _______ a. Optimal solution b. Non-basic variables c. Solution d. Basic Feasible solution

Description : 65. Any feasible solution which optimizes (minimizes or maximizes) the objective function of the LPP is called as _______ a. Optimal solution b. Non-basic variables c. Solution d. Basic Feasible solution

Last Answer : a. Optimal solution

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

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

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

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

.................... is considered as the pioneer of Linear Programming Technique. a. churchman b. D W Miller c. James Lundy d. George B Dantzig

Description : .................... is considered as the pioneer of Linear Programming Technique. a. churchman b. D W Miller c. James Lundy d. George B Dantzig

Last Answer : d. George B Dantzig

62. If one of the constraint of an equation in an LP problem has an unbounded solution, then a. Solution to such LP problem must be degenerate b. Feasible region should have a line segment c. Alternative solutions exists d. None of the above

Description : 62. If one of the constraint of an equation in an LP problem has an unbounded solution, then a. Solution to such LP problem must be degenerate b. Feasible region should have a line segment c. Alternative solutions exists d. None of the above

Last Answer : b. Feasible region should have a line segment

An algorithm A is admissible if ___________ a) It is not guaranteed to return an optimal solution when one exists b) It is guaranteed to return an optimal solution when one exists c) It returns more solutions, but not an optimal one d) It guarantees to return more optimal solutions

Description : An algorithm A is admissible if ___________ a) It is not guaranteed to return an optimal solution when one exists b) It is guaranteed to return an optimal solution when one exists c) It returns more solutions, but not an optimal one d) It guarantees to return more optimal solutions

Last Answer : b) It is guaranteed to return an optimal solution when one exists

An objective function which states the determinants of the quantity to be either maximized or minimized is called_______ a. Feasible function b. Optimal function c. Criterion function d. None of the above

Description : An objective function which states the determinants of the quantity to be either maximized or minimized is called_______ a. Feasible function b. Optimal function c. Criterion function d. None of the above

Last Answer : b. Optimal function

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

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

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

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

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

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

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

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

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

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