1) Linear Programming Problem
i) Graphical Method.
ii) Simplex Method (Big M and Two Phase).
iii) Duality in L.P.P.
iv) Degeneracy in L.P.P.
2) Transportation Problem
i) North-West Corner Rule
ii)Least- Cost Method
iii)Vogel’s Approximation Method.
3) Assignment Problem.
4) Problems based on Game Theory: two person zero sum game
5)Sample Surveys: To draw a simple random sample (SRS) with & without replacement to obtain an estimate of the population mean along with estimate of their variances. To compare the efficiency of SRSWOR with respect to SRSWR.
6)To draw all the possible samples by SRS – technique and to show that expected value of the sample mean equals the population mean and to show the expected value of sample mean square is population mean square.
7) Stratified Sampling:
i) Estimate the sample sizes by proportional allocation and Neyman’s Optimum Allocation.
ii) Estimate the mean of the population under the above scheme.
iii) Calculation of the sampling variance.
iv) Computation of relative efficiencies of the allocation scheme among themselves as well as with SRS.
8) Systematic Sampling and its comparison with SRS and Stratified Sampling.
Note: Practical exercises will be conducted on computer by using MS-Excel.