Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

SOR1311

LINEAR PROGRAMMING

Lecturer: Credits: Prerequisites:

Dr. J. Sklenar 2 Pure or Applied Mathematics at the level requested for entry to engineering and technology courses

Lectures: 1 hour per week for 14 hours + tutorials and computer lab sessions Course held during: Semester 2
CONTENT

Problem formulation Simplex Method Duality Sensitivity Analysis Network Problems (Transportation and Assignment) Integer Linear Programming Modeling and LP Software Packages

The emphasis during this study unit will be on the practical aspects of the linear programming problem. More time will be dedicated to problem formulation and numerical solution rather than the mathematical background.

Method of Assessment: Test

Suggested Texts: 1. Bazaraa, M.S., Jarvis, J.J. and Sherali, H.D. ( 1990 ) Linear Programming and Network Flows, John Wiley & Sons. 2. Ahuja, R.K., Magnanti, T.L., Orlin, J.B. ( 1993 ) Network Flows - Theory, Algorithms, and Applications, Prentice-Hall. 3. Nemhauser, G.L., Wolsey,L.A. ( 1999 ) Integer and Combinatorial Optimization, John Wiley & Sons. 4. Williams, H.P. ( 1999 ) Model Building in Mathematical Programming, John Wiley & Sons. 5. Lucey, T. ( 1996 ) Quantitative Techniques, DP Publications. 6. Lofti, V., Pegels, C.C ( 1996 ) Decision Support Systems for Operations Management and Management Science, IRWIN. 7. Eppen, G.D., Gould, F. J. and Schmidt, C.P. ( 1996 ) Introductory Management Science, Prentice-Hall.

You might also like