Top 150+ Solved Operations Research MCQ Questions Answer

From 16 to 30 of 125

Q. In case of a ‘ ’ constraint, the feasible region is a straight line.

a. less than or equal to

b. greater than or equal to

c. mixed

d. equal to

  • d. equal to

Q. In linear programming, unbounded solution means solution.

a. infeasible

b. infinite

c. unique

d. degenerate

  • b. infinite

Q. The incoming variable column in the simplex algorithm is called .

a. key column

b. incoming column

c. important column

d. variable column

  • a. key column

Q. The intersection value of key column and key row is called                

a. vital element

b. important element

c. basic element

d. key element

  • d. key element

Q. A resource which is completely utilized is called in simplex

a. null resource

b. scarce resource

c. abundant resource

d. zero resource

  • b. scarce resource

Q. In simplex, a minimization problem is optimal when all Delta J, i.e. Cj – Zj values are .

a. either zero or positive

b. either zero or negative

c. only positive

d. only negative

  • a. either zero or positive

Q. Probabilistic models are also known as

a. Deterministic Models

b. Stochastic Models

c. Dynamic Models

d. Static Models

  • b. Stochastic Models

Q. The quantitative approach to decision analysis is a

a. Logical approach

b. Rational approach

c. Scientific approach

d. All of the above

  • c. Scientific approach

Q. How many methods are there to solve LPP?

a. Three

b. Two

c. Four

d. None of the above

  • b. Two
Subscribe Now

Get All Updates & News