Operation Research (2171901) MCQs

MCQs of Linear Programming Problem

Showing 51 to 60 out of 64 Questions
3 4 5 6 7
51.

Primal of a dual is

(a)

Primal,
(b)

Dual
(c)

Prime dual,
(d)

Prime primal.
Answer:

Option (a)

52.

If Dual has a solution, then the primal will

(a)

Not have a solution
(b)

Have only basic feasible solution,
(c)

Have a solution
(d)

None of these
Answer:

Option (b)

53.

If Primal Problem is a maximization problem, then the dual will be

(a)

Maximization Problem
(b)

Minimization Problem
(c)

Mixed Problem
(d)

None of these
Answer:

Option (c)

54.

To get the Replacement ration column elements we have to

(a)

Divide Profit column elements by key number
(b)

The first column elements of identity is divided by key number
(c)

Divide the capacity column elements by a key number.
(d)

None of these
Answer:

Option (a)

55.

The cost coefficient of slack variable is

(a)

Zero
(b)

One,
(c)

> than one
(d)

< than one
Answer:

Option (c)

56.

The cost coefficient of the artificial surplus variable is

(a)

0
(b)

1
(c)

M
(d)

> than 1.
Answer:

Option (b)

57.

If the primal has an unbounded solution, then the dual has

(a)

Optimal solution
(b)

No feasible solution
(c)

Bound solution,
(d)

None of these
Answer:

Option (b)

58.

In Dynamic Programming Problems, the decisions are made in

(a)

Single stage
(b)

2-stages
(c)

Multi-stages
(d)

No decision making process
Answer:

Option (c)

59.

In dynamic programming problems, the main problem is divided into subproblems. Each  sub-problem is known as:

(a)

Part
(b)

Stage
(c)

State
(d)

Mini problem
Answer:

Option (b)

60.

The technique of Dynamic Programming problem is developed by:

(a)

Taylor
(b)

Gilberth
(c)

Richard Bellman
(d)

Bellman and Clarke
Answer:

Option (c)

Showing 51 to 60 out of 64 Questions
3 4 5 6 7