BFS in LPP stands for: a. Best Feasible solution b. Better feasible solution c. Basic feasible solution d. None of the above

BFS in LPP stands for:
a. Best Feasible solution
b. Better feasible solution
c. Basic feasible solution
d. None of the above
by

1 Answer

Answer :

c. Basic feasible solution
by

Related questions

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

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

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

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

A set of values X1,X2……..Xn which satisfies the constraints of the LPP is called_______ a. Solution b. Variable c. Linearity d. None of the above

Description : A set of values X1,X2……..Xn which satisfies the constraints of the LPP is called_______ a. Solution b. Variable c. Linearity d. None of the above

Last Answer : a. Solution

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

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

61. If a non-redundant constraint is removed from an LP problem then a. Feasible region will become larger b. Feasible region will become smaller c. Solution will become infeasible d. None of the above

Description : 61. If a non-redundant constraint is removed from an LP problem then a. Feasible region will become larger b. Feasible region will become smaller c. Solution will become infeasible d. None of the above

Last Answer : a. Feasible region will become larger

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

49. A feasible solution to an LP problem a. Must satisfy all of the problem’s constraints simultaneously b. Need not satisfy all of the constraints, only some of them c. Must be a corner point of the feasible solution d. Must optimize the value of the objective function

Description : 49. A feasible solution to an LP problem a. Must satisfy all of the problem’s constraints simultaneously b. Need not satisfy all of the constraints, only some of them c. Must be a corner point of the feasible solution d. Must optimize the value of the objective function

Last Answer : a. Must satisfy all of the problem’s constraints simultaneously

Every LPP is associated with another LPP is called_____ a. Primal b. Dual c. Non-linear programming d. None of the above

Description : Every LPP is associated with another LPP is called_____ a. Primal b. Dual c. Non-linear programming d. None of the above

Last Answer : b. Dual

________ which is a subclass of a linear programming problem(LPP) a. Programming problem b. Transportation problem c. Computer problem d. All of the above

Description : ________ which is a subclass of a linear programming problem(LPP) a. Programming problem b. Transportation problem c. Computer problem d. All of the above

Last Answer : b. Transportation problem

Currently, LPP is used in solving a wide range of practical ___________ a. Business problems b. Agricultural problems c. Manufacturing problems d. None of the above

Description : Currently, LPP is used in solving a wide range of practical ___________ a. Business problems b. Agricultural problems c. Manufacturing problems d. None of the above

Last Answer : a. Business problems

LPP is exactly used in solving what kind of resource allocation problems? a. Production planning and scheduling b. Transportation c. Sales and advertising d. All of the above

Description : LPP is exactly used in solving what kind of resource allocation problems? a. Production planning and scheduling b. Transportation c. Sales and advertising d. All of the above

Last Answer : d. All of the above

_____ is another method to solve a given LPP involving some artificial variable? a. Big M method b. Method of penalties c. Two-phase simplex method d. None of the above

Description : _____ is another method to solve a given LPP involving some artificial variable? a. Big M method b. Method of penalties c. Two-phase simplex method d. None of the above

Last Answer : a. Big M method

How many methods are there to solve LPP? a. Three b. Two c. Four d. None of the above

Description : How many methods are there to solve LPP? a. Three b. Two c. Four d. None of the above

Last Answer : b. Two

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

63. Graphic method can be applied to solve a LPP when there are only ____ variable a. Four b. More than one c. Two d. three

Description : 63. Graphic method can be applied to solve a LPP when there are only ____ variable a. Four b. More than one c. Two d. three

Last Answer : Which oil is used in the floatation method for the purification of ores?

The second longest path in the network diagram is called a. Alternate b. Feasible c. Sub-critical d. Critical

Description : The second longest path in the network diagram is called a. Alternate b. Feasible c. Sub-critical d. Critical

Last Answer : c. Sub-critical

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

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

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

. 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

For a project manager to have an effective means of identifying and communicating the planned activities and their interrelationships, he must use a network technique. One of the network techniques is commonly known as PERT, what does PERT stands for? a. Project evaluation review technique b. Program evaluation review technique c. Path evaluation review technique d. Project execution review technique

Description : For a project manager to have an effective means of identifying and communicating the planned activities and their interrelationships, he must use a network technique. One of the network ... evaluation review technique c. Path evaluation review technique d. Project execution review technique

Last Answer : b. Program evaluation review technique

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

The basic difference between PERT and CPM is that a. PERT deals with events and CPM with activities b. Critical Path is determined in PERT only c. Costs are considered on CPM only d. Guessed times are used in PERT and evaluated times in CPM.

Description : The basic difference between PERT and CPM is that a. PERT deals with events and CPM with activities b. Critical Path is determined in PERT only c. Costs are considered on CPM only d. Guessed times are used in PERT and evaluated times in CPM.

Last Answer : a. PERT deals with events and CPM with activities

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

The purpose of a dummy row or column in an assignment problem is to a. Obtain balance between total activities and total resources b. Prevent a solution from becoming degenerate c. Provide a means of representing a dummy problem d. None of the above

Description : The purpose of a dummy row or column in an assignment problem is to a. Obtain balance between total activities and total resources b. Prevent a solution from becoming degenerate c. Provide a means of representing a dummy problem d. None of the above

Last Answer : a. Obtain balance between total activities and total resources

If in an assignment problem, number of rows is not equal to number of columns then a. Maximization problem b. Problem is unbalanced c. Problem is degenerate d. Optimum solution is not possible

Description : If in an assignment problem, number of rows is not equal to number of columns then a. Maximization problem b. Problem is unbalanced c. Problem is degenerate d. Optimum solution is not possible

Last Answer : c. Problem is degenerate

_____ refers to the combination of one or more inputs to produce a particular output a. Solution b. Variable c. Process d. None of the above

Description : _____ refers to the combination of one or more inputs to produce a particular output a. Solution b. Variable c. Process d. None of the above

Last Answer : c. Process

All the constraints are expressed as equations and the right hand side of each constraint and all variables are non-negative is called_______ a. Canonical variable b. Canonical form c. Canonical solution d. Both a & b

Description : All the constraints are expressed as equations and the right hand side of each constraint and all variables are non-negative is called_______ a. Canonical variable b. Canonical form c. Canonical solution d. Both a & b

Last Answer : b. Canonical form

57. The solution space(region) of an LP problem is unbounded due to a. An incorrect formulation of the LP model b. Objective function is unbounded c. Neither a nor b d. Both a & b

Description : 57. The solution space(region) of an LP problem is unbounded due to a. An incorrect formulation of the LP model b. Objective function is unbounded c. Neither a nor b d. Both a & b

Last Answer : b. Objective function is unbounded c. Neither a nor b

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

54. A constraint in an LP model becomes redundant because a. Two iso-profits may be parallel to each other b. The solution is unbounded c. This constraint is not satisfied by the solution values d. None of the above

Description : 54. A constraint in an LP model becomes redundant because a. Two iso-profits may be parallel to each other b. The solution is unbounded c. This constraint is not satisfied by the solution values d. None of the above

Last Answer : d. None of the above

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

50. Which of the following statements is true with respect to the optimal solution of an LP problem? a. Every LP problem has an optimal solution b. Optimal solution of an LP problem always occurs at an extreme point c. At optimum solution all resources are completely used d. If an optimal solution exists, there will always be at least one at a corner

Description : 50. Which of the following statements is true with respect to the optimal solution of an LP problem? a. Every LP problem has an optimal solution b. Optimal solution of an LP problem always occurs ... completely used d. If an optimal solution exists, there will always be at least one at a corner

Last Answer : d. If an optimal solution exists, there will always be at least one at a corner

. Operations Research involves _________ attacks of complex problems to arrive at the optimum solution a. Scientific b. Systematic c. Both a & b d. Statistical

Description : . Operations Research involves _________ attacks of complex problems to arrive at the optimum solution a. Scientific b. Systematic c. Both a & b d. Statistical

Last Answer : c. Both a & b

16. Operations Research simply helps in improving the ______ of the solution but does not result in a perfect solution a. Quality b. Clarity c. Lookd. None of the above

Description : 16. Operations Research simply helps in improving the ______ of the solution but does not result in a perfect solution a. Quality b. Clarity c. Look d. None of the above

Last Answer : a. Quality

. Operations Research techniques helps to find an ________ by taking into account all the factors a. Ultimate solution b. Alternate solution c. Optimum solution d. Maximise solution

Description : . Operations Research techniques helps to find an ________ by taking into account all the factors a. Ultimate solution b. Alternate solution c. Optimum solution d. Maximise solution

Last Answer : c. Optimum solution

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

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

Last Answer : d. All of the above

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

The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel’s Approximation method is (A) 76 (B) 80 (C) 90 (D) 96

Description : The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel’s Approximation method is  (A) 76 (B) 80 (C) 90 (D) 96

Last Answer : (B) 80

A basic feasible solution to a m-origin, n-destination transportation problem is said to be ................... if the number of positive allocations are less than m + n – 1. (A) degenerate (B) non-degenerate (C) unbounded (D) unbalanced

Description : A basic feasible solution to a m-origin, n-destination transportation problem is said to be ................... if the number of positive allocations are less than m + n – 1. (A) degenerate (B) non-degenerate (C) unbounded (D) unbalanced 

Last Answer : (A) degenerate

The initial basic feasible solution of the following transportion problem : Image then the minimum cost is (A) 76 (B) 78 (C) 80 (D) 82

Description : The initial basic feasible solution of the following transportion problem : then the minimum cost is (A) 76 (B) 78 (C) 80 (D) 82

Last Answer : (A) 76

Consider the following transportation problem: Image The initial basic feasible solution of the above transportation problem using Vogel’s Approximation Method(VAM) is given below: The solution of the above problem: (A) is degenerate solution (B) is optimum solution (C) needs to improve (D) is infeasible solution

Description : Consider the following transportation problem: The initial basic feasible solution of the above transportation problem using Vogel's Approximation Method(VAM) is given below: The solution of the ... degenerate solution (B) is optimum solution (C) needs to improve (D) is infeasible solution

Last Answer : (B) is optimum solution

Consider the following transportation problem : The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel’s Approximation method is : (A) 1450 (B) 1465 (C) 1480 (D) 1520

Description : Consider the following transportation problem :  The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel’s Approximation method is : (A) 1450 (B) 1465 (C) 1480 (D) 1520

Last Answer : (B) 1465

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 

Every combination of strategies determines an outcome known as _____ a. Regret b. Payoff c. Saddle point d. Profit matrix

Description : Every combination of strategies determines an outcome known as _____ a. Regret b. Payoff c. Saddle point d. Profit matrix

Last Answer : b. Payoff