Revised simplex method: Standard form I and II, Computational procedure, Bounded variable problems in linear programming, Dual simplex method.

Integer linear programming: Gomory’s cutting plane method for all integer and mixed integer, Branch and bound algorithm.

Goal programming: Definition, Formulation and graphical solution of goal programming models, Methodology of solution procedure of goal programming algorithm, Extended simplex method.

Dynamic demand models (IV and V), Deterministic model with price break: one, two and any price break.

Probabilistic inventory models: Instantaneous demand and no set up cost model, Uniform demand and no setup cost model, Probabilistic order level system with constant lead time, Multi period probabilistic model with constant lead time.