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

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

1 Answer

Answer :

b. Basic variables
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

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

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

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

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

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

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

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

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

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

Number of customers in the queue per unit of time is called ...................... a. Queuing system b. Length of queue c. Average length of queue d. None of these

Description : Number of customers in the queue per unit of time is called ...................... a. Queuing system b. Length of queue c. Average length of queue d. None of these

Last Answer : c. Average length of queue

In India, first Operations Research unit was set up at ................................. a. Regional Research Laboratory, Hyderabad b. Indian Statistical Institute, Kolkotha c. Indian Institute of Science and Technology, Bengaluru d. Indian Institute of Science and Technology, Mohali

Description : In India, first Operations Research unit was set up at ................................. a. Regional Research Laboratory, Hyderabad b. Indian Statistical Institute, Kolkotha c. Indian Institute of Science and Technology, Bengaluru d. Indian Institute of Science and Technology, Mohali

Last Answer : a. Regional Research Laboratory, Hyderabad

Activities lying on critical path are called ............................ a. Critical activities b. Non-critical activities c. Dummy activities d. None of these

Description : Activities lying on critical path are called ............................ a. Critical activities b. Non-critical activities c. Dummy activities d. None of these

Last Answer : a. Critical activities

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 a ........................game the amounts won by all winners together is equal to the sum of the amounts lost by all losers together. a. Non-zero sum game b. Zero sum game c. Rectangular game d. None of these

Description : In a ........................game the amounts won by all winners together is equal to the sum of the amounts lost by all losers together. a. Non-zero sum game b. Zero sum game c. Rectangular game d. None of these

Last Answer : b. Zero sum game

............................ is the sequence of activities which determines the total project duration. a. Critical path b. Network c. Non-critical activities d. None of these

Description : ............................ is the sequence of activities which determines the total project duration. a. Critical path b. Network c. Non-critical activities d. None of these

Last Answer : a. Critical path

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

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

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

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

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 customer’s behaviour of jumping from one queue to another is called ............................ a. Jockying b. Reneging c. Collusion d. Balking

Description : A customer’s behaviour of jumping from one queue to another is called ............................ a. Jockying b. Reneging c. Collusion d. Balking

Last Answer : a. Jockying

A customer’s behaviour of leaving the queue due to impatience is called ....................... a. Jockying b. Reneging c. Collusion d. Balking

Description : A customer’s behaviour of leaving the queue due to impatience is called ....................... a. Jockying b. Reneging c. Collusion d. Balking

Last Answer : b. Reneging

a customer’s behaviour of leaving the queue when he does not like to wait in the queue due to lack of time or space is called ..................... a. Jockying b. Reneging c. Collusion d. Balking

Description : a customer’s behaviour of leaving the queue when he does not like to wait in the queue due to lack of time or space is called ..................... a. Jockying b. Reneging c. Collusion d. Balking

Last Answer : d. Balking

The ration between mean arrival rate and mean service rate is called ................... a. Idle period b. Average length of queue c. Traffic intensity d. None of these

Description : The ration between mean arrival rate and mean service rate is called ................... a. Idle period b. Average length of queue c. Traffic intensity d. None of these

Last Answer : c. Traffic intensity

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

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

Each participant of the game is called................... a. Strategist b. Winner c. Player d. Loser

Description : Each participant of the game is called................... a. Strategist b. Winner c. Player d. Loser

Last Answer : c. Player

Activities that cannot be started until one or more of the other activities are completed, are called.......................................... a. Dummy activities b. Initial activities c. Successor activities d. Predecessor activities

Description : Activities that cannot be started until one or more of the other activities are completed, are called.......................................... a. Dummy activities b. Initial activities c. Successor activities d. Predecessor activities

Last Answer : c. Successor activities

An activity which does not consume either resource or time is called ............................. a. Predecessor activity b. Successor activity c. Dummy activity d. Terminal activity

Description : An activity which does not consume either resource or time is called ............................. a. Predecessor activity b. Successor activity c. Dummy activity d. Terminal activity

Last Answer : c. Dummy activity

An activity which must be completed before commencement of one or more other activities is called................................. a. Successor activity b. Predecessor activity c. Dummy activity d. None of these

Description : An activity which must be completed before commencement of one or more other activities is called................................. a. Successor activity b. Predecessor activity c. Dummy activity d. None of these

Last Answer : b. Predecessor activity

The allocated cells in the transportation table are called .............................. a. Occupied cells b. Empty cells c. Unoccupied cells d. None of these

Description : The allocated cells in the transportation table are called .............................. a. Occupied cells b. Empty cells c. Unoccupied cells d. None of these

Last Answer : a. Occupied cells

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

Probabilistic models are also called ........................... a. Deterministic models b. Dynamic models c. Stochastic models d. None of these

Description : Probabilistic models are also called ........................... a. Deterministic models b. Dynamic models c. Stochastic models d. None of these

Last Answer : c. Stochastic models

.........................are called mathematical models. a. Iconic models b. Symbolic models c. Analogue models d. None of these

Description : .........................are called mathematical models. a. Iconic models b. Symbolic models c. Analogue models d. None of these

Last Answer : b. Symbolic models

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

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

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

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

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. λ/μ

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

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