Code: A-33
Subject: OPERATIONS RESEARCH
Time: 3 Hours
Max. Marks: 100
NOTE: There are 11 Questions in all.  
  • Question 1 is compulsory and carries 16 marks. Answer to Q. 1. must be written in the space provided for it in the answer book supplied and nowhere else.
  • Answer any THREE Questions each from Part I and Part II. Each of these questions carries 14 marks.
  • Any required data not explicitly given, may be suitably assumed and stated.
Q.1
Choose the correct or best alternative in the following: (2x8)
 
a.
A basic feasible solution to the LP problem is the one which satisfies the linear structural constraints and the non negativity constraints and the number of positive variables it contains is
(A) more than m           (B) less than m
(C) exactly m                (D) exactly n
where m = number of structural constraints and n = number of variables
 
b.
 The dual of the dual of a given primal of a LP problem is
(A) dual itself           (B) the primal
(C) degenerate         (D) None of the above
 
c.
 For a M/M/1 : /FCFS queue the expected queue length for a mean arrival rate  and mean service rate , is equal to
(A)   (B) 
(C)   (D)  
 
d.
 For a two person zero sum game, in the pay off matrix
the saddle point would occur at the position
(A) (1,1.)                  (B) (2,1.)
(C) (2,2.)                  (D) None.
1
   Index     Next>>