Consider the following conditions:(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns.(c)All the positive allocations must be in independent positions.The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:Codes:(A) (a) and (b) only(B) (a) and (c) only(C) (b) and (c) only(D) (a), (b) and (c)

Consider the following conditions:(a)The solution must be feasible, i.

1.	Consider the following conditions:(a)The solution must be feasible, i.e. it must satisfy all the supply and demand constraints.(b)The number of positive allocations must be equal to m1n21, where m is the number of rows and n is the number of columns.(c)All the positive allocations must be in independent positions.The initial solution of a transportation problem is said to be non-degenerate basic feasible solution if it satisfies:Codes:(A) (a) and (b) only(B) (a) and (c) only(C) (b) and (c) only(D) (a), (b) and (c)
Answer»

Discussion

No Comment Found

Related InterviewSolutions

There are exactly __________ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state.(A) 64(B) 56(C) 1024(D) 5832
The language of all non-null strings of a’s can be defined by a context free grammar as follow:S → aS|Sa|aThe word a3 can be generated by __________ different trees.(A) two(B) three(C) four(D) five
What will be the output at PORT1 if the following program is executed ?MVI B, 82HMOV A, BMOV C, AMVI D, 37HOUT PORT1HLT(A) 37H(B) 82H(C) B9H(D) 00H
Match the following:(A) (1)(B) (2)(C) (3)(D) (4)
Given two sequences X and Y :X = &lt a, b, c, b, d, a, b &gtY = &lt b, d, c, a, b, a &gt .The longest common subsequence of X and Y is :(A) &lt b, c, a&gt(B) &lt c, a, b&gt(C) &lt b, c, a, a&gt(D) &lt b, c, b, a&gt
If there are n integers to sort, each integer has d digits and each digit is in the set {1, 2, …, k}, radix sort can sort the numbers in :(A) O(d n k)(B) O(d nk)(C) O((d +n) k)(D) O(d (n + k))
Floyd-Warshall algorithm utilizes __________ to solve the all-pairs shortest paths problem on a directed graph in __________ time.(A) Greedy algorithm, θ (V3)(B) Greedy algorithm, θ (V2 lgn)(C) Dynamic programming, θ (V3)(D) Dynamic programming, θ (V2 lgn)
The three outputs x1x2x3 from the 8 X 3 priority encoder are used to provide a vector address of the form 101x1x2x300. What is the second highest priority vector address in hexadecimal if the vector addresses are starting from the one with the highest priority ?(A) BC(B) A4(C) BD(D) AC
The family of context sensitive languages is __________ under union and __________ under reversal.(A) closed, not closed(B) not closed, not closed(C) closed, closed(D) not closed, closed
The solution of the recurrence relationT(n) ≤ { θ(1) if n ≤ 80T(n) ≤ { T(n / s) + T((7n / 10) + 6) + O(n) if n ≥ 80is :(A) O(lg n)(B) O(n)(C) O(n lg n)(D) None of the above

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment