620-362 Applied Operations Research

Note

Students may only gain credit for one of 620-361, 618-361 (1997 Handbook), 618-360 (1996 handbook).

Credit Points

Coordinator

Prerequisites

620-361 (1997 Handbook 618-361) Also recommended are one of 620-131 or 617-141 (1997 Handbook) or Computer Science 433-141; and 620-262 (1997 Handbook 618-262).

Semester

Contact

Subject Description

Students completing this subject should comprehend

• the technical issues involved in applying operations research principles, methods, and algorithms in the solution of real-world problems;
• the practical aspects of group projects in operations research;

have developed the ability to

• apply various operations research methods, algorithms and software in the solution of practical problems;
• participate successfully in group projects in operations research, including preparing reports and giving presentations;

and appreciate

• the scope and limitation of operations research methods, algorithms and software as far as solving practical problems is concerned;
• the practical issues and difficulties involved in group projects in operations research.

Practical and technical aspects of various operations research methods for linear programming, integer programming and combinatorial optimisation, including selected topics from complexity, interior point methods, cutting planes, branch-and-bound, meta-heuristics, special heuristics and constraint logic programming. Applications in vehicle routing, facility location, cutting stock, manpower planning, and machine scheduling and other logistics problems. Familiarisation with operations research software.

Assessment

Up to 100 pages of project reports and written assignments, and up to two hours mid-semester test.