Management and Information Technology


IMMG 12043

Operations Research 1

Status : Core Pre-requisite : G.C.E. (A/L) Co-requisite : None


 On completion of this course, the student should be able to:

  • identify and analyze business problems and formulate decision problems as mathematical programmes
  • apply appropriate quantitative techniques and perform sensitivity analysis in managerial decision-making.
  • identify and use the right software to solve complicated problems.

 Linear Programming: Introduction to Operations Research and Linear Programming (LP). Applications of LP; problem formulation, algebraic representation, graphical method of solving LP problems, in-depth look at the simplex method, duality and economic interpretation, dual simplex method, sensitivity analysis. Use of computers in solving LP problems. Special types of LP Problems: Transportation problems. Assignment problems. Network Modeling: Introduction, solution techniques for various classes of network problems: minimal-cost, network flow, maximal flow and shortest path problems.
 Lectures, tutorials and practical sessions of OR software ‘Solver’ to solve large-scale linear programs.
 End-of-semester examination, practical tests, group assignments, and in-class assessments.

  1. Anderson D R, Williams T A and Sweeney S J, “An Introduction to Management Science: Quantitative Approaches to Decision Making”, 11th Edition, South western college Pub.
  2. Fedrick F. Hiller. “Introduction to operations research”, 8th edition, 2004, McGraw-Hill Professional.
  3. Hamady A. Taha, “Operations Research in Introduction”, 6th edition, 1996, Prentice Hall.
  4. Barry Render and Ralph M Stair, “Quantitative analysis for Management” 8th Edition Prentice Hall.