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

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
by

1 Answer

Answer :

c. Alternative
by

Related questions

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

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

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

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

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

52. If an iso-profit yielding the optimal solution coincides with a constraint line, then a. The solution is unbounded b. The solution is infeasible c. The constraint which coincides is redundant d. None of the above

Description : 52. If an iso-profit yielding the optimal solution coincides with a constraint line, then a. The solution is unbounded b. The solution is infeasible c. The constraint which coincides is redundant d. None of the above

Last Answer : d. None of the above

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

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

Last Answer : b. Best

If in a LPP, the solution of a variable can be infinity large without violating the constraints, the solution is ___ a. Infeasible b. Unbounded c. Alternative d. None of the above

Description : If in a LPP, the solution of a variable can be infinity large without violating the constraints, the solution is ___ a. Infeasible b. Unbounded c. Alternative d. None of the above

Last Answer : b. Unbounded

64. If the feasible region of a LPP is empty, the solution is _______ a. Infeasible b. Unbounded c. Alternative d. None of the above

Description : 64. If the feasible region of a LPP is empty, the solution is _______ a. Infeasible b. Unbounded c. Alternative d. None of the above

Last Answer : a. Infeasible

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

At any iteration of simplex method, if Δj (Zj – Cj) corresponding to any nonbasic variable Xj is obtained as zero, the solution under the test is (A) Degenerate solution (B) Unbounded solution (C) Alternative solution (D) Optimal solution

Description : At any iteration of simplex method, if Δj (Zj – Cj) corresponding to any nonbasic variable Xj is obtained as zero, the solution under the test is (A) Degenerate solution (B) Unbounded solution (C) Alternative solution (D) Optimal solution

Last Answer : (C) Alternative solution

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

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

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

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

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

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

58. While solving a LP model graphically, the area bounded by the constraints is called a. Feasible region b. Infeasible region c. Unbounded solution d. None of the above

Description : 58. While solving a LP model graphically, the area bounded by the constraints is called a. Feasible region b. Infeasible region c. Unbounded solution d. None of the above

Last Answer : a. Feasible region

55. If two constraints do not intersect in the positive quadrant of the graph, then a. The problem is infeasible b. The solution is unbounded c. One of the constraints is redundant d. None of the above

Description : 55. If two constraints do not intersect in the positive quadrant of the graph, then a. The problem is infeasible b. The solution is unbounded c. One of the constraints is redundant d. None of the above

Last Answer : a. The problem is infeasible

A basic feasible solution of a linear programming problem is said to be ............... if at least one of the basic variable is zero. (A) degenerate (B) non-degenerate (C) infeasible (D) unbounded

Description : A basic feasible solution of a linear programming problem is said to be ............... if at least one of the basic variable is zero. (A) degenerate (B) non-degenerate (C) infeasible (D) unbounded

Last Answer : (A) degenerate 

The following transportation problem: The above solution of a given transportation problem is (A) infeasible solution (B) optimum solution (C) non-optimum solution (D) unbounded solution

Description : The following transportation problem:  The above solution of a given transportation problem is (A) infeasible solution (B) optimum solution (C) non-optimum solution (D) unbounded solution

Last Answer : (B) optimum solution

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

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

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

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

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

The variables whose coefficient vectors are unit vectors, are called ...................... a. Unit variables b. Basic variables c. Non-basic variables d. None of these

Description : The variables whose coefficient vectors are unit vectors, are called ...................... a. Unit variables b. Basic variables c. Non-basic variables d. None of these

Last Answer : b. Basic variables

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

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

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

Dual of the dual s a .......................... a. Dual b. Primal c. Alternative d. None of these

Description : Dual of the dual s a .......................... a. Dual b. Primal c. Alternative d. None of these

Last Answer : b. Primal

If the primal Linear Programming problem has unbounded solution, then it’s dual problem will have (A) feasible solution (B) alternative solution (C) no feasible solution at all (D) no bounded solution at all

Description : If the primal Linear Programming problem has unbounded solution, then it’s dual problem will have (A) feasible solution (B) alternative solution (C) no feasible solution at all (D) no bounded solution at all 

Last Answer : (C) no feasible solution at all

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

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

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

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

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

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

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