Free Printable OT- Units-4,5,6 quiz

1.

In any balanced transportation problem with m sources n destinations, there have to be ___ basic cells

a)

$m+n-2$

b)

$m-n+1$

c)

$m+n-1$

d)

$m+n+1$

2.

Other name of Least Cost Entry Method

a)

Matrix Method

b)

Maxima Method

c)

Vogel’s Approximation Method

d)

Matrix Minima Method

3.

The given transportation problem is said to be unbalanced when

a)

b)

c)

d)

4.

Other name of MODI method

a)

u-u method

b)

u-v method

c)

v-v method

d)

None

5.

Identify special case of transportation problem

a)

North-West corner rule

b)

Degeneracy

c)

Vogel’s Approximation Method

d)

Least Cost Entry Method

6.

Identify Fibonacci Series

a)

1,2,3,4,5,………

b)

1,1,2,4,8,16,…..

c)

1,1,2,3,5,8,….

d)

0,1,1,2,3,5,….

7.

Other name of steepest descent method

a)

Powell’s Method

b)

Cauchy’s Method

c)

Fibonacci Method

d)

Univariate Method

8.

Identify the interpolation method

a)

Penalty Method

b)

Powell’s Method

c)

Univariate Method

d)

Quadratic

9.

SUMT are also known as

a)

Gradient Methods

b)

Non-Gradient Methods

c)

Penalty Method

d)

None

10.

a)

Interior

b)

Exterior

c)

Mixed

d)

None

11.

Find the 2 missing Fibonacci numbers between 5 and 21

a)

13,17

b)

13,18

c)

7,19

d)

8,13

12.

Fibonacci Search is a

a)

One –dimensional elimination method

b)

one-dimensional substitution method

c)

two–dimensional elimination method

d)

two-dimensional substitution method

13.

Powell’s method uses

a)

No derivatives

b)

First derivatives

c)

Second derivatives

d)

Partial derivatives

14.

The sub problem of a main problem in a Dynamic Programming Problem is said to be

a)

State

b)

Function

c)

Recursion

d)

Stage

15.

Final stage decision is first solved in _______ Recursion

a)

Forward

b)

Backward

c)

Upward

d)

Downward

16.

Which of the following is considered as recursive optimization ?

a)

Linear programming problem

b)

$Dynamic\Pr ogrammig\ \Pr oblem$

c)

Assignment Problem

d)

Transportation Problem

17.

The optimality principle to solve Dynamic Programming Problem is given by

a)

Dantzig

b)

Richard Brown

c)

Richard Bellman

d)

Kimball

18.

An ________ means a set of decisions at a given stage

a)

state

b)

stage

c)

$optimal\ policy$

d)

$problem$

19.

An Linear Programming Problem solved by using dynamic programming problem method assumes the variables as........

a)

States

b)

$stages$

c)

Recursions

d)

Return Functions

20.

Dynamic Programming problem cannot applied to

a)

Production scheduling problems

b)

Inventory problems

c)

Network Analysis

d)

Behavioral problems

OT- Units-4,5,6 quiz

Total questions: 20

Worksheet time: 20mins

Similar Resources on Wayground