Description : 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 m+n-1, where m is the number of rows and n is ... B) (a) and (c) only (C) (b) and (c) only (D) (a), (b) and (c)
Last Answer : (D) (a), (b) and (c)
Description : A basic feasible solution of a linear programming problem is said to be ............... if at least one of the basic variable is zero. (A) degenerate (B) non-degenerate (C) infeasible (D) unbounded
Last Answer : (A) degenerate
Description : When at least one of the basic variables is zero, then the basic feasible solution to a Linear Programming Problem is said to be .............................. a. Infeasible b. Unbounded c. Degenerate d. Non-degenerate
Last Answer : c. Degenerate
Description : The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the number of positive allocations are: a. m + n b. m x n c. m +n – 1 d. m +n + 1
Last Answer : c. m +n – 1
Description : Consider the following transportation problem: The initial basic feasible solution of the above transportation problem using Vogel's Approximation Method(VAM) is given below: The solution of the ... degenerate solution (B) is optimum solution (C) needs to improve (D) is infeasible solution
Last Answer : (B) is optimum solution
Description : At which of the following stage(s), the degeneracy do not occur in transportation problem? (m, n represents number of sources and destinations respectively) (a) While the values of dual variables ui and vj cannot be computed. (b) While ... and (d) (3) (a) and (d) (4) (a), (b), (c) and (d)
Last Answer : (3) (a) and (d)
Description : 62. If one of the constraint of an equation in an LP problem has an unbounded solution, then a. Solution to such LP problem must be degenerate b. Feasible region should have a line segment c. Alternative solutions exists d. None of the above
Last Answer : b. Feasible region should have a line segment
Description : If the primal Linear Programming problem has unbounded solution, then it’s dual problem will have (A) feasible solution (B) alternative solution (C) no feasible solution at all (D) no bounded solution at all
Last Answer : (C) no feasible solution at all
Description : Given the following statements with respect to linear programming problem: S1: The dual of the dual linear programming problem is again the primal problem S2: If either the primal or the dual problem has an unbounded objective function ... S1 and S2 (B) S1 and S3 (B) S2 and S3 (D) S1, S2 and S2
Last Answer : (D) S1, S2 and S2
Description : The following transportation problem: The above solution of a given transportation problem is (A) infeasible solution (B) optimum solution (C) non-optimum solution (D) unbounded solution
Last Answer : (B) optimum solution
Description : A BFS of a LPP is said to be ______ if at least one of the basic variable is zero a. Degenerate b. Non-degenerate c. Infeasible d. unbounded
Last Answer : a. Degenerate
Description : At any iteration of simplex method, if Δj (Zj – Cj) corresponding to any nonbasic variable Xj is obtained as zero, the solution under the test is (A) Degenerate solution (B) Unbounded solution (C) Alternative solution (D) Optimal solution
Last Answer : (C) Alternative solution
Description : The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel’s Approximation method is (A) 76 (B) 80 (C) 90 (D) 96
Last Answer : (B) 80
Description : Consider the following transportation problem : The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel’s Approximation method is : (A) 1450 (B) 1465 (C) 1480 (D) 1520
Last Answer : (B) 1465
Description : The dummy source/destination in a transportation problem is added to ........................ a. Satisfy rim constraints b. Prevent solution from becoming degenerate c. Ensure total cost does not exceed a limit d. None of the above
Last Answer : a. Satisfy rim constraints
Description : If in an assignment problem, number of rows is not equal to number of columns then a. Maximization problem b. Problem is unbalanced c. Problem is degenerate d. Optimum solution is not possible
Last Answer : c. Problem is degenerate
Description : If the feasible region of a linear programming problem is empty, the solution is .................... a. Unbounded b. Infeasible c. Infeasible d. Alternative
Last Answer : b. Infeasible
Description : The initial basic feasible solution of the following transportion problem : then the minimum cost is (A) 76 (B) 78 (C) 80 (D) 82
Last Answer : (A) 76
Description : 64. If the feasible region of a LPP is empty, the solution is _______ a. Infeasible b. Unbounded c. Alternative d. None of the above
Last Answer : a. Infeasible
Description : 58. While solving a LP model graphically, the area bounded by the constraints is called a. Feasible region b. Infeasible region c. Unbounded solution d. None of the above
Last Answer : a. Feasible region
Description : When a particular assignment in the given problem is not possible or restricted as a condition, it is called a __ problem a. Infeasible b. Degenerate c. Unbalanced d. Prohibited
Last Answer : d. Prohibited
Description : A Transportation Problem is said to be unbalanced when total supply is not equal to ............ a. Total cost b. Total demand c. Both a and b d. None of these
Last Answer : b. Total demand
Description : The region of feasible solution of a linear programming problem has a ............... property in geometry, provided the feasible solution of the problem exists. (A) concavity (B) convexity (C) quadratic (D) polyhedron
Last Answer : (B) convexity
Description : 55. If two constraints do not intersect in the positive quadrant of the graph, then a. The problem is infeasible b. The solution is unbounded c. One of the constraints is redundant d. None of the above
Last Answer : a. The problem is infeasible
Description : Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: a. NWCM b. LCM c. VAM d. None of these
Last Answer : c. VAM
Description : Initial feasible solution to a transportation Problem can be found out by ......................... a. VAM b. MODI Method c. Both a and b d. None of these
Last Answer : a. VAM
Description : While solving a LPP graphically, the area bounded by constraints is called ................. a. Feasible region b. Infeasible region c. Unbounded region d. None of these
Description : If no. of rows are not equal to number of columns and the matrix elements are profit elements then the problem is: a. Balanced and Maximization Transportation problem b. ... Transportation problem c. Balanced and Maximization Assignment problem d. Unbalanced and Maximization Assignment problem
Last Answer : a. Balanced and Maximization Transportation problem
Description : If no. of rows are equal to number of columns and the matrix elements are Time elements then the problem is: a. Balanced and Minimization Transportation problem b. ... Transportation problem c. Balanced and Minimization Assignment problem d. Unbalanced and Minimization Assignment problem
Last Answer : c. Balanced and Minimization Assignment problem
Description : A basic solution which also satisfies the condition in which all basic variables are non-negative is called ___ a. Basic feasible solution b. Feasible solution c. Optimal solution d. None of the above
Last Answer : a. Basic feasible solution
Description : 65. Any feasible solution which optimizes (minimizes or maximizes) the objective function of the LPP is called as _______ a. Optimal solution b. Non-basic variables c. Solution d. Basic Feasible solution
Last Answer : a. Optimal solution
Description : 57. The solution space(region) of an LP problem is unbounded due to a. An incorrect formulation of the LP model b. Objective function is unbounded c. Neither a nor b d. Both a & b
Last Answer : b. Objective function is unbounded c. Neither a nor b
Description : Genetic code is said to be degenerate because (A) It can undergo mutations (B) A large proportion of DNA is non-coding (C) One codon can code for more than one amino acids (D) More than one codons can code for the same amino acids
Last Answer : Answer : D
Description : 61. If a non-redundant constraint is removed from an LP problem then a. Feasible region will become larger b. Feasible region will become smaller c. Solution will become infeasible d. None of the above
Last Answer : a. Feasible region will become larger
Description : The purpose of a dummy row or column in an assignment problem is to a. Obtain balance between total activities and total resources b. Prevent a solution from becoming degenerate c. Provide a means of representing a dummy problem d. None of the above
Last Answer : a. Obtain balance between total activities and total resources
Description : Let P(m,n) be the statement m divides n where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions. (a) ∃m ∀n P(m,n) (b) ∀n P(1,n) ( ... -False (C) (a)-False; (b)-False; (c)-False (D) (a)-True; (b)-True; (c)-True
Last Answer : Answer: A
Description : The student marks should not be greater than 100. This is (A) Integrity constraint (B) Referential constraint (C) Over-defined constraint (D) Feasible constraint
Last Answer : (A) Integrity constraint
Description : BFS in LPP stands for: a. Best Feasible solution b. Better feasible solution c. Basic feasible solution d. None of the above
Last Answer : c. Basic feasible solution
Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n
Last Answer : (A) less than 1
Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than ................... (1) 1 (2) 1/n (3) 1/m (4) n/m
Last Answer : Answer: 1
Description : balanced vs unbalanced transportation models differentiated?
Last Answer : 17. What major benefits do corporations and investors enjoy because of the existence of organized security exchanges
Description : Consider the following statements: The genetic code said to be degenerate and universal which means that, (1) Amino afids may have more than one codon (2) All amino acids have mo than one codon (3) Codons are common for higher and lower organism (4) Codons are not found in bacteria
Last Answer : Ans. ((d))
Description : 5. Some amino acids are coded by more than one codon hence the codon is said to be a)Universal b)Degenerate c)Unambiguous d)Specific
Last Answer : b)Degenerate
Description : If there are more than one optimal solutions for the decision variables, the solution is ........... a. Infeasible b. Unbounded c. Alternative d. None of these
Last Answer : c. Alternative
Description : 49. A feasible solution to an LP problem a. Must satisfy all of the problem’s constraints simultaneously b. Need not satisfy all of the constraints, only some of them c. Must be a corner point of the feasible solution d. Must optimize the value of the objective function
Last Answer : a. Must satisfy all of the problem’s constraints simultaneously
Description : Which of the following is a characteristic of a dual problem: a. Dual of a dual is primal b. If dual has a finite optimal solution, then the primal also has finite optimal solution c. If dual has no feasible solution, then the primal also has no feasible solution d. All of the above
Last Answer : d. All of the above
Description : A tessellated model is said to be valid if there are ________ a.no missing facets b.no degenerate facets c.no overlapping facets d.all of the above
Last Answer : d.all of the above
Description : If in a LPP, the solution of a variable can be infinity large without violating the constraints, the solution is ___ a. Infeasible b. Unbounded c. Alternative d. None of the above
Last Answer : b. Unbounded
Description : 54. A constraint in an LP model becomes redundant because a. Two iso-profits may be parallel to each other b. The solution is unbounded c. This constraint is not satisfied by the solution values d. None of the above
Last Answer : d. None of the above
Description : 52. If an iso-profit yielding the optimal solution coincides with a constraint line, then a. The solution is unbounded b. The solution is infeasible c. The constraint which coincides is redundant d. None of the above