NOTE: Attempt any FIVE questions selecting at least TWO questions from each section.

Section-I (5/9)

Linear Programming

•    Linear programming, Formulations and graphical solution

•    Simplex method

•    M-Technique and two-phase technique

•    Special cases

Duality and Sensitivity Analysis

•    The dual problem, Primal-dual relationships

•    Dual simplex method

•    Sensitivity and postoptimal analysis

Transportation Models

•    North-West corner

•    Least-Cost and Vogel’s approximations methods

•    The method of multipliers

•    The assignment model

•    The transhipment model

•    Hungarian method



Section-II (4/9)

Net work Minimization and Integer Programming

•    Network minimization

•    Shortest-Route algorithms for acyclic networks

•    Maximal-flow problem

•    Matrix definition of LP problem

•    Revised simplex method, Bounded variables

•    Decomposition algorithm

•    Parametric linear programming

•    Applications of integer programming

•    Cutting-plane algorithms

•    Branch-and-bound method

•    Elements of dynamic programming

•    Programmes by dynamic programming