Identify BFS methods of a transportation problem

Choose another name of the MODI(Modified Distribution) Method is

Show equation of No.of optimal cells of given transportation problem

Identify the transportation problem is a special class of the

Identify the transportation problem is a non-special class of the

List northwest corner rule requires that we start allocating units to shipping routes in the

Inspect to proceed with the Modified Distribution method algorithm for solving an transportation problem, the number of dummy allocations need to be added are______________.

Infer a transportation problem, when the number of occupied routes is less than the number of rows plus the number of columns -1, we say that the solution is

Choose only restriction we place on the initial solution of a transportation problem is that

Identify the allocation cells in the transportation table will be called ______________ cell

Infer to resolve degeneracy at the initial solution, a very small quantity is allocated in ______________ cell

Choose assignment problem is a particular case of ______________.

Realte if all incoming variable column is negative then the solution is

Identify One disadvantage of using North-West corner rule to find initial solution to the transportation problem is that

Show Which of the following method is used to verify the optimality of the current solution of the transportation problem

Choose the purpose of a dummy source or dummy destination in a transportation problem is to

Show Which of the following is NOT needed to use the transportation model?

Identify an artificial source added to a transportation table when total demand is greater than total supply is called ________.

Identify special case of transportation problem

Choose the given transportation problem is said to be balanced when

Choose the given transportation problem is said to be unbalanced when

Identify a solution to a transportation problem is a set of non-negative allocations, xij, that satisfies the rim (row and column) restrictions.

Choose a feasible solution (non necessarily basic) in which minimises (maximises) the transportation cost (profit).

Choose if the total demand is equal to total supply then transportation problem is called

Choose if the total demand is not equal to total supply then transportation problem is called

Choose Profit Maximization category as

Identify Degeneracy equation

Infer once an initial solution is obtained, the next step is to check its

Identify unused route

Identify used route

Identify Fibonacci Series

Identify the interpolation method

Relate Fibonacci Search is a

Examine the 2 missing Fibonacci numbers between 5 and 21

Choose Powell’s method requires

Choose Cauchy’s Steepest Descent Method requires

Identify ___________ optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets

Identify Direct Search Method

Identify Gradient Method

Choose step length in Quadratic Interpolation Algorithm

Choose If f2 < f1 in Quadratic Interpolation Algorithm

Choose if the objective function is strictly ......... then the problem has at most one optimal point

Identify every local minimum is a global minimum for........optimization

Categorize Steepest Descent Method is defined by

Identify the Elimination method

Choose search directtion of Si = -?f_i= -?f(x_i)

Identify Indirect search Method

Identify Non-Penalty Function category

Identify Descent Method

Choose Cauchy implemented negative gradient direction in

Identify the constrained nonlinear programming problem Direct method

Identify constrained nonlinear programming problem Indirect method

F0=F1=1 in

Show Fibonacci search is applicable

Identify Cubic method belongs to

Choose Golden Search method belongs to

Choose Dictomous method belongs to

Choose Approximate gradient is also known as

Identify x* = [(x1 + x2 )/2]-b/2c in

Choose fmin = min (f1 , f2, , f3)

Choose both a mathematical optimization method and a computer programming method

Identify basic principle of dynamic programming

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

Infer Final stage decision is first solved in _______ Recursion

Choose Which of the following is considered as recursive optimization ?

Identify the optimality principle to solve Dynamic Programming Problem is given

Relate ________ means a set of decisions at a given stage

Categorise Linear Programming Problem solved by using dynamic programming problem is said to be …………

Choose Dynamic Programming problem cannot applied to

Identify Non - Dynamic Programming Multistage Decision Processes – Types

Choose characteristic of Dynamic Programming Problem that each stage has a

Identify characteristic of Dynamic Programming Problem that each stage with ....... stages left

Inspect Minimum Path Problem

Identify Dynamic Programming Multistage Decision Processes – Types

Choose year dynamic programming problem was developed by Richard Bellman in

Refere dyanmic programming problem to

Choose Sub-problems in dyanmic programming problem is solved

Choose Dynamic programming divides problems into a number of

Relationship between stages of a dynamic programming problem is called a(n)

Choose In dynamic programming, the output to stage n become the input to

Choose If an optimal solution can be created for a problem by constructing optimal solutions for its subproblems, the problem possesses ..... property.

Categorize Which of the following is/are property/properties of a dynamic programming problem?

Choose If a problem can be broken into subproblems which are reused several times, the problem possesses ..... property.

If a problem can be solved by combining optimal solutions to non-overlapping problems, the strategy is called .....

Identify non-recursion method in dynamic programming problem

Choose........ is an optimization approach that transforms a complex problem into a sequence of simpler problems

Inspect Shortest Path Problem

Choose the principle of usually applies to optimization problems, but not always in a convenient way

Relate Chained Matrix Multiplication to

Relate the Knapsack Problem to