Linear Programming: the theory and applications of linear programming including the simplex algorithm, duality theorem, postoptimality analysis and a discussion of the types of problems that lead to linear programming problems.Transportation Problems: the transportation algorithm with application to network flows, assignment problems, shortest-route problems and critical path scheduling. Integer Programming: a study of the situations leading to integer-programming problems; branch and bound algorithm for solving such problems. Dynamic Programming: an introduction to the concepts of dynamic programming with a discussion of typical problems and their solutions.
The text will be H.A. Taha, Operations Research, An Introduction,5th ed. (MacMillan),
The final grade may be based on class tests, computer assignments, problem assignments and a final examination.