Which variables are fictitious and cannot have any physical meaning? a. Optimal variable b. Decision variable c. Artificial variable d. None of the above

Which variables are fictitious and cannot have any physical meaning?
a. Optimal variable
b. Decision variable
c. Artificial variable
d. None of the above
by

1 Answer

Answer :

c. Artificial variable
by

Related questions

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

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

An assumption that implies that finite numbers of choices are available to a decision-maker and the decision variables do not assume negative values is known as _______ a. Certainty b. Continuity c. Finite choices d. None of the above

Description : An assumption that implies that finite numbers of choices are available to a decision-maker and the decision variables do not assume negative values is known as _______ a. Certainty b. Continuity c. Finite choices d. None of the above

Last Answer : c. Finite choices

40. Which of the following is a limitation associated with an LP model a. The relationship among decision variables is linear b. No guarantee to get integer valued solutions c. No considerations of effect of time & uncertainty on LP model d. All of the above

Description : 40. Which of the following is a limitation associated with an LP model a. The relationship among decision variables is linear b. No guarantee to get integer valued solutions c. No considerations of effect of time & uncertainty on LP model d. All of the above

Last Answer : d. All of the above

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

2. Non-Negativity condition is an important component of L P model because a. Variables value should remain under the control of the decision-maker b. Value of variables make sense & correspond to real-world problemsc. Variables are interrelated in terms of limited resources d. None of the above

Description : 2. Non-Negativity condition is an important component of L P model because a. Variables value should remain under the control of the decision-maker b. Value of variables make sense & correspond to real-world problems c. Variables are interrelated in terms of limited resources d. None of the above

Last Answer : b. Value of variables make sense & correspond to real-world problems

30. The distinguishing feature of an LP model is a. Relationship among all variables is linear b. It has single objective function & constraints c. Value of decision variables is non-negative d. All of the above

Description : 30. The distinguishing feature of an LP model is a. Relationship among all variables is linear b. It has single objective function & constraints c. Value of decision variables is non-negative d. All of the above

Last Answer : a. Relationship among all variables is linear

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

_____ 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

An assignment problem is a special case of transportation problem, where a. Number of rows equals number of columns b. All rim conditions are 1 c. Values of each decision variable is either 0 or 1

Description : An assignment problem is a special case of transportation problem, where a. Number of rows equals number of columns b. All rim conditions are 1 c. Values of each decision variable is either 0 or 1

Last Answer : D.variable is either 0 or 1

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

35. Which of the following is not a characteristic of the L P model a. Alternative courses of actions b. An objective function of maximization type c. Limited amount of resources d. Non-negativity condition on the value of decision variable

Description : 35. Which of the following is not a characteristic of the L P model a. Alternative courses of actions b. An objective function of maximization type c. Limited amount of resources d. Non-negativity condition on the value of decision variable

Last Answer : b. An objective function of maximization type

29. A constraint in an LP model restricts a. Value of objective function b. Value of a decision variable c. Use of the available resources d. All of the above

Description : 29. A constraint in an LP model restricts a. Value of objective function b. Value of a decision variable c. Use of the available resources d. All of the above

Last Answer : d. All of the above

25. Operations Research models in which some or all values of variables are random in nature are called _____ a. Physical b. Symbolic c. Deterministic d. Probabilistic

Description : 25. Operations Research models in which some or all values of variables are random in nature are called _____ a. Physical b. Symbolic c. Deterministic d. Probabilistic

Last Answer : d. Probabilistic

Operations Research models in which values of all variables and all possible outcomes are known with certainty are called _____ a. Physical b. Symbolic c. Deterministic d. Probabilistic

Description : Operations Research models in which values of all variables and all possible outcomes are known with certainty are called _____ a. Physical b. Symbolic c. Deterministic d. Probabilistic

Last Answer : c. Deterministic

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

An optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of a. Rows or columns b. Rows & columns c. Rows + columns -1 d. None of the above

Description : An optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of a. Rows or columns b. Rows & columns c. Rows + columns -1 d. None of the above

Last Answer : b. Rows & columns

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

56. Constraints in LP problem are called active if they a. Represent optimal solutions b. At optimality do not consume all the available resources c. Both a & b d. None of the above

Description : 56. Constraints in LP problem are called active if they a. Represent optimal solutions b. At optimality do not consume all the available resources c. Both a & b d. None of the above

Last Answer : a. Represent optimal solutions

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

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

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

36. The best use of linear programming technique is to find an optimal use of a. Money b. Manpower c. Machine d. All of the above

Description : 36. The best use of linear programming technique is to find an optimal use of a. Money b. Manpower c. Machine d. All of the above

Last Answer : . All of the above

A linear programm A linear programming model CANNOT be used when whic ing model CANNOT be used when which of the followin h of the following are true? g are true? a)An optimal production plan is desired b)The values of decision variables are fractional c)A set of linear constraints may be defined d)Cross product relationships exist between two or more decision variables

Description : A linear programm A linear programming model CANNOT be used when whic ing model CANNOT be used when which of the followin h of the following are true? g are true? a)An optimal ... set of linear constraints may be defined d)Cross product relationships exist between two or more decision variables

Last Answer : d)Cross product relationships exist between two or more decision variables

. Non-negativity condition in an LP model implies a. A positive coefficient of variables in objective function b. A positive coefficient of variables in any constraint c. Non-negative value of resources d. None of the above

Description : . Non-negativity condition in an LP model implies a. A positive coefficient of variables in objective function b. A positive coefficient of variables in any constraint c. Non-negative value of resources d. None of the above

Last Answer : d. None of the Above

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 choice of the strategy is made by both the _________ simultaneously a. Decision maker b. Manager c. Competitor d. Player

Description : The choice of the strategy is made by both the _________ simultaneously a. Decision maker b. Manager c. Competitor d. Player

Last Answer : Player

A ______ occurs when each player selects one of his strategies a. Profit b. Decision c. Play d. Game

Description : A ______ occurs when each player selects one of his strategies a. Profit b. Decision c. Play d. Game

Last Answer : c. Play

45. LP is a major innovations since _______ in the field of business decision-making, particularly under conditions of certainty a. Industrial Revolution b. World War I c. World War II d. French Revolution

Description : 45. LP is a major innovations since _______ in the field of business decision-making, particularly under conditions of certainty a. Industrial Revolution b. World War I c. World War II d. French Revolution

Last Answer : c. World War II

27. The mathematical model of an LP problem is important because a. It helps in converting the verbal description & numerical data into mathematical expression b. Decision-makers prefer to work with formal models c. It captures the relevant relationship among decision factors d. It enables the use of algebraic technique

Description : 27. The mathematical model of an LP problem is important because a. It helps in converting the verbal description & numerical data into mathematical expression b. Decision-makers prefer to ... captures the relevant relationship among decision factors d. It enables the use of algebraic technique

Last Answer : a. It helps in converting the verbal description & numerical data into mathematical expression

_____ are technique applied in project management a. CPM b. Assignment c. Transportation d. Decision theory

Description : ______ are technique applied in project management a. CPM b. Assignment c. Transportation d. Decision theory

Last Answer : a. CPM

Operations Research, which is a very powerful tool for _____ a. Research b. Decision-Making c. Operations d. None of the above

Description : Operations Research, which is a very powerful tool for _____ a. Research b. Decision-Making c. Operations d. None of the above

Last Answer : Decision-Making

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

_____ 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

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

. 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

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?

60. While solving a LP problem, infeasibility may be removed by a. Adding another constraint b. Adding another variablec. Removing a constraint d. Removing a variable

Description : 60. While solving a LP problem, infeasibility may be removed by a. Adding another constraint b. Adding another variable c. Removing a constraint d. Removing a variable

Last Answer : c. Removing a constraint

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

An activity whose start or end cannot be delay without affecting total project completion time is called ______ activity a. Dummy b. Non-critical c. Critical d. Important

Description : An activity whose start or end cannot be delay without affecting total project completion time is called ______ activity a. Dummy b. Non-critical c. Critical d. Important

Last Answer : c. Critical

Operations Research techniques cannot be applied to _____ a. Managerial judgement b. Business initiatives c. Customer perceptions d. All of the above

Description : Operations Research techniques cannot be applied to _____ a. Managerial judgement b. Business initiatives c. Customer perceptions d. All of the above

Last Answer : c. Customer perceptions

13. Operations Research cannot give perfect _____ to problems a. Answers b. Solutions c. Both a & b d. Decisions

Description : 13. Operations Research cannot give perfect _____ to problems a. Answers b. Solutions c. Both a & b d. Decisions

Last Answer : c. Both a & b

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

A ______ is the one in which the player selects more than one strategy with fixed probabilities before playing the game. a. Mixed strategy b. Pure strategy c. Complete strategy d. Impure strategy

Description : A ______ is the one in which the player selects more than one strategy with fixed probabilities before playing the game. a. Mixed strategy b. Pure strategy c. Complete strategy d. Impure strategy

Last Answer : d. Impure strategy

A _______ provides a complete definition of how a player will play a game a. Mixed strategy b. Pure strategy c. Complete strategy d. Impure strategy

Description : A _______ provides a complete definition of how a player will play a game a. Mixed strategy b. Pure strategy c. Complete strategy d. Impure strategy

Last Answer : c. Complete strategy

The various alternatives or courses of actions available to each player in a game are called as ____ a. Saddle points b. Strategies c. Pay-off d. Gains

Description : The various alternatives or courses of actions available to each player in a game are called as ____ a. Saddle points b. Strategies c. Pay-off d. Gains

Last Answer : b. Strategies