Q1. Illustrate the standard form of linear programming problem and describe how do you get it? As well describe special cases which occur in the application of simplex method.
Q2. Illustrate the different algorithms for determining initial basic solution for a transportation problem? Describe them.
Q3. prepare down the different algorithms for solving an Integer Linear programming problem? Describe branch and bound technique in detail.
Q4. Describe in detail the different parameters for designing and assessing a simulation based experiments.
Q5. Describe the Hungarian Assignment algorithm in detail.
Q6. prepare a detail note on any three of the given:
b) Degeneracy in Transportation Problem.
c) Sensitivity and Parametric Analysis.
d) Monte Carlo Method.