Estb. 1882

University of the Punjab

MATH-412 Operations Research-I

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
 Network minimization
Credit hours/ Marks:- 3

Reference Books

Download Course-Outline