OR

PAPER-3
JUNE-12

1. The feasible region represented by the constraints x1 x2 1, x1 + x2 3, x1 0, x2 0 of the

objective function Max Z = 3x1 + 2x2 is
(A) A polygon (B) Unbounded feasible region
(C) A point (D) None of these

2. In any simplex table, if corresponding to any negative j, all elements of the column are negative or
zero, the solution under the test is
(A) degenerate solution (B) unbounded solution
(C) alternative solution (D) non-existing solution

3. The optimal solution of the following assignment problem using Hungarian method is

(A) (B) (C) (D)

(A) (I) (II) (III) (IV)
(B) (I) (III) (II) (IV)
(C) (I) (III) (IV) (II)
(D) (I) (IV) (II) (III)

DEC-12

4. In a Linear Programming Problem, suppose there are 3 basic variables and 2 non-basic variables, then
the possible number of basic solutions are
(A) 6 (B) 8 (C) 10 (D) 12

5. How many solutions do the following equation have x1 + x2 + x3 = 11 where x1 1, x2 2, x3 3

(A) C(7, 11) (B) C(11, 3) (C) C(14, 11) (D) C(7, 5)

6. If dual has an unbounded solution, then its corresponding primal has

(A) no feasible solution (B) unbounded solution
(C) feasible solution (D) none of these

7. The initial basic feasible solution to the following transportation problem using Vogels approximation
method is
 OR

JUNE-13

8. At any iteration of simplex method, if j (Zj Cj) corresponding to any non-basic variable Xj is
obtained as zero, the solution under the test is
(A) Degenerate solution (B) Unbounded solution
(C) Alternative solution (D) Optimal solution

9. 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

10. The total transportation cost in an initial basic feasible solution to the following transportation
problem using Vogels Approximation method is
 OR

DEC-13

11. If the primal Linear Programming problem has unbounded solution, then its dual problem will have
(A) feasible solution (B) alternative solution
(C) no feasible solution at all (D) no bounded solution at all

12.

13. The following Linear Programming problem has :

Max Z = x1 + x2
Subject to x1 x2 0
3x1 x2 3
and x1, x2 0
(A) Feasible solution (B) No feasible solution
(C) Unbounded solution (D) Single point as solution

JUNE-14

14. Which of the following special cases does not require reformulation of the problem in order to obtain
a solution?
(A) Alternate optimality (B) Infeasibility
(C) Unboundedness (D) All of the above

15. The given maximization assignment problem can be converted into a minimization problem by
(A) subtracting each entry in a column from the maximum value in that column.
(B) subtracting each entry in the table from the maximum value in that table.
(C) adding each entry in a column from the maximum value in that column.
(D) adding maximum value of the table to each entry in the table.

16. The initial basic feasible solution of the following transportion problem:
 OR

DEC-14

17.

18.

19.
 OR

JUNE-15

20.

21.

22.
 OR

DEC -15

23.

24.

25.

26.
 OR

ANSWERS:

Q Ans Q Ans
1 B 25 4
2 B 26 2
3 B 27
4 C 28
5 D 29
6 A 30
7 D 31
8 C 32
9 A 33
10 B 34
11 C 35
12 D 36
13 B 37
14 A 38
15 B 39
16 A 40
17 B 41
18 C 42
19 C 43
20 1 44
21 2 45
22 4 46
23 3 47
24 1 48