Search | Previous : 618-361 | Next : 618-381
Handbook 1997 : Faculty of Science : Mathematics

618-362 Applied Operations Research

Credit Points:

15.0

Coordinator:

Dr N Boland

Prerequisite/s:

Mathematics 618-361. Also recommended are one of Mathematical Sciences 617-141 or 617-160 (1995 Handbook); or Computer Science 433-141; and Mathematics 618-262.

Timetable:

Semester 2

Contact:

39 lectures (three a week)

Objectives:

On completion of this subject, students should:

Comprehend:

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

  • the technical issues involved in using and developing operations research software for practical problems;

  • the practical aspects of group projects in operations research.

Have developed:

  • skills to apply various operations research methods and algorithms in the solution of practical problems;

  • skills to participate successfully in group projects in operations research, including preparing reports and giving presentations;

  • skills to use commercial operations research software in the solution of practical problems.

Appreciate:

  • the scope and limitation of operations research methods and algorithms as far as solving practical problems is concerned;

  • the scope and limitations of commercial operations research software as far as solving practical operations research problems is concerned.

  • the practical issues and difficulties involved in group projects in operations research.

Content:

Operations Research Methods and Techniques: Practical 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. Issues involved in their application, including: selection of method, pricing rules, singularities, degeneracy, formulation, branching rules, variable priorities and primal heuristics. Applications: vehicle routing, facility location, cutting stock, manpower planning, and machine scheduling problems. Principles of computerised mathematical modelling: selected topics from mathematical modelling languages, matr ix generators, array oriented languages, and constraint logic programming. Software: familiarisation with operations research software in the solution of practical problems covering a selection from: linear, integer, and nonlinear programming; network optimisation, logistics and constraint logic programming

Assessment:

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

Search | Previous : 618-361 | Next : 618-381
Handbook 1997 : Faculty of Science : Mathematics
Status:                   OFFICIAL 1997
Last Modified:            Wednesday March 12 3:36 pm
SGML to HTML Conversion:  Information Technology Services
Authorised by:            Academic Registrar
Email Enquiries:          Course_Information@registrar.unimelb.edu.au
Copyright © University of Melbourne 1997.