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
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 : 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 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 : In transportation Problems, VAM stands for ......................... a. Value Addition Method b. Vogel’s Approximation Method c. Virgenean Approximation Method d. None of these
Last Answer : b. Vogel’s Approximation Method
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 : A basic feasible solution to a m-origin, n-destination transportation problem is said to be ................... if the number of positive allocations are less than m + n – 1. (A) degenerate (B) non-degenerate (C) unbounded (D) unbalanced
Last Answer : (A) degenerate
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 : 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
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 : 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 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 : 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 : Matrix Minima Method to find initial feasible solution to a TP is also called ....................... a. NWCM b. LCM c. VAM d. None of these
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 : 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 : Which of the following statement(s) is/are correct with reference to curve generation? I. Hermite curves are generated using the concepts of interpolation. II. Bezier curves are generated using the concepts of approximation. III. The ... (B) II and III only (C) I and II only (D) I, II and III only
Last Answer : (D) I, II and III only
Description : Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is : 1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 ... to fill available page frames with pages): (A) 9 and 6 (B) 10 and 7 (C) 9 and 7 (D) 10 and 6
Last Answer : (B) 10 and 7
Description : Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space. Given the initial state which of the following state cannot be reached?
Last Answer : Answer: C
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 : 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 : 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 : 65% of 70% of 4/5 of 3750 = ? a) 1389 b) 1465 c) 1365 d) 1265 e) 2750
Last Answer : 65% of 70% of 4/5 of 3750 = ? Sol: 0.65 x 0.7 x 0.8 x 3750 = ? ? = 1365 Answer: c)
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 : 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 : 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 : 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 : MODI Method to test the optimality of a feasible solution to TP is also called............... a. Stepping Stone Method b. u. v. Method c. both a and b d. none of these
Last Answer : b. u. v. Method
Description : How to write 1480 in Expanded Form?
Last Answer : 1000 + 400 + 80Hope this helped
Description : The transition temperature at which all the ferromagnetic materials become paramagnetic materials is termed as the 'Curie temperature'. Its value for cobalt is __________ °C. (A) 768 (B) 1127 (C) 1359 (D) 1480
Last Answer : (B) 1127
Description : Consider the following statements for priority queue: S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations. S2: The elements of a priority queue ... . (C) SI is incorrect and S2 is correct. (D) Both S1 and S2 are correct.
Last Answer : (D) Both S1 and S2 are correct.
Description : How do you use three unit multipliers to convert 1520 meters to feet?
Last Answer : Why would you want to use three unit multipliers when the singlemultiplier: 3.2808 does the trick?
Description : What is the resistance of a coil which draws 10 A and dissipates 1520 W? A) 152 Ω B) 15.2 Ω C) 1.52 Ω D) None of these
Last Answer : What is the resistance of a coil which draws 10 A and dissipates 1520 W? A) 152 Ω B) 15.2 Ω C) 1.52 Ω D) None of these
Description : For a minimisation Transportation Problem, the objective is to minimise: a. Profit b. Cost c. Solution d. None of these
Last Answer : b. Cost
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 : In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of: (A) rows or columns (B) rows+columns (C) rows+columns-1 (D) rows+columns+1
Last Answer : (A) rows or columns
Description : In Transportation Problem, LCM stands for ............................. a. Lowest Common Multiplier b. Least Cost Method c. Lowest Cell Method d. None of these
Last Answer : b. Least Cost Method
Description : In Transportation Problem, NWCM stands for ............................. a. North West Cost Method b. Net Worth Corner Method c. North West Corner Method d. None of these
Last Answer : c. North West Corner Method
Description : Consider a single perception with weights as given in the following figure: The above perception can solve (A) OR problem (B) AND problem (C) XOR problem (D) All of the above
Last Answer : (B) AND problem
Description : Consider the following statements: (a) Revised simplex method requires lesser computations than the simplex method. (b) Revised simplex method automatically generates the inverse of the current basis matrix. (c) Less number of entries are needed ... c) only (C) (b) and (c) only (D) (a), (b) and (c)
Description : A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False
Last Answer : a) True
Description : Beam-penetration and shadow-mask are the two basic techniques for producing color displays with a CRT. Which of the following is not true ? I. The beam-penetration is used with random scan monitors. II. Shadow-mask is used ... -penetration method. (A) I and II (B) II and III (C) III only (D) IV only
Last Answer : (C) III only
Description : What capital city is 1450 miles northeast of Hanoi Vietnam and 500 miles west Pyongyang North Korea?
Last Answer : Beijing
Description : If a circular grass lawn of 35 m in radius has a path 7 m wide running around it on the outside, then the area of the path is (a) 1450 m 2 (b) 1576 m 2 (c) 1694 m 2 (d) 3368 m 2
Last Answer : (c) 1694 m 2
Description : Fusion zone in the electric furnace used for reduction of phosphate rock to elemental phosphorous is maintained at __________ °C. (A) 250-300 (B) 500-750 (C) 950-1050 (D) 1400-1450
Last Answer : (D) 1400-1450
Description : The G.T. road from Lahore to Calcutta in undivided India, was constructed during (A) 3495-3500 BC (B) 265-270 BC (C) 1540-1545 AD (D) 1440-1450 AD
Last Answer : Answer: Option C