Operationsresearchapplicationsandalgorithms.docVIP

Philadelphia University Faculty of Information Technology Department of Computer Science Semester, 2007/2008 Course Syllabus Course code: 750471 Course Title: Operations Research Course prerequisite(s) and/or corequisite(s): 210103 + 21231 + 721112 Course Level: 4 Credit hours: 3 Lecture Time: Academic Staff Specifics E-mail Address Office Hours Office Number and Location Rank Name Course Description: Operations research helps in solving peoblems in diffenert environments that needs dicisions. The module conver topics that include: linear programming, Transportation, Assignment, and CPM/ MSPT techniques. Analytic techniques and computer packages will be used to solve problems facing business managers in decision environments. Course Objectives: This module aims to introduce students to use quantitive methods and techniques for effective decisions–making; model formulation and applications that are used in solving business decision problems. Course Components Introduction to Operations Research (OR) Introduction to Foundation mathematics and statistics Linear Programming (LP), LP and allocation of resources, LP definition, Linearity requirement Maximization Then Minimization problems. Graphical LP Minimization solution, Introduction, Simplex method definition, formulating the Simplex model. Linear Programming – Simplex Method for Maximizing. Simplex maximizing example for similar limitations, Mixed limitations Example containing mixed constraints, Minimization example for similar limitations. Sensitivity Analysis: Changes in Objective Function, Changes in RHS, The Transportation Model Basic Assumptions. Solution Methods: Feasible Solution: The Northwest Method, The Lowest Cost Method; Optimal Solution: The Stepping Stone Method, Modified; Distribution (MODI) Method. The Assignment Model:- Basic Assumptions Solution Methods:-Different Combinations Method, Short-Cut Method (Hungarian Method) MSPT:- The Dijkestra algorithm, and Floyd’s Algorithm {Sh