Handbook 1996 : Faculty of Science (Volume 4 page 215)
Mathematics subject : Next:618-380 | Prev:618-361 | Search | Help
618-362 "Operations Research B" appears differently in several places - choose the one you want:
1. Mathematics, Faculty of Science (v4, p215) : Next:618-380 | Prev:618-361
Credit points: 15.0
Coordinator: Dr D Ralph.
Prerequisite: Mathematics 618-361. Also recommended are one of Mathematical Sciences 617-141, 617-142 or 617-160 (1995 Handbook); or Computer Science 433-141; Mathematics 618-262; and Statistics 619-230 and 360
Contact: 39 lectures (three a week)
Timetable: Second semester
Objectives:
On completion of this subject, students should:Comprehend:
- the basic principles and theory underlying various operations research optimization methods, algorithms, and models;
- the extensions and advanced features of a variety of operations research methods and algorithms;
- the inherent difficulties associated with the solution of some major classes of operations research problems;
- the modelling issues associated with the use of operations research methods and techniques;
- the computational aspects of various operations research algorithms.
Have developed:
- the ability to solve a variety of optimization problems using operations research methods and algorithms;
- skills to tackle various modelling issues associated with the use of operations research models and algorithms;
- skills to use operations research software.
Appreciate:
- the complexities of operational research problems and the methods available for solving them, including the scope and limitations of various optimization methods and algorithms;
- the central role that mathematical modelling plays in the formulation and modelling of operations research problems.
Content:
Selected topics from linear programming, quadratic programming, dynamic programming, fractional programming, composite concave programming, nonlinear optimization, parametric optimization, global optimization, combinatorial optimization, branch and bound, and simulation.
Assessment:
Up to 52 pages of written assignments and up to three hours of end-of-semester written examination.
1. Mathematics, Faculty of Science (v4, p215) : Next:618-380 | Prev:618-361
2. Math. & Stats., Faculty of Educ(Parkville) (v5, p150) : Next:618-380 | Prev:618-361
Note: It is not possible to gain credit for both 618-362 and the Mathematical Sciences subject 617-362 taught in previous years.
Credit points: 15.0
Coordinator: Dr D Ralph.
Prerequisite: Mathematics 618-361. Also recommended are one of Mathematical Sciences 617-141, 617-142 or 617-160 (1995 Handbook); or Computer Science 433-141; Mathematics 618-262; and Statistics 619-230 and 360
Contact: 39 lectures (three each week)
Timetable: Second semester.
Objectives:
On completion of this subject, students should:Comprehend:
- the basic principles and theory underlying various operations research optimization methods, algorithms, and models;
- the extensions and advanced features of a variety of operations research methods and algorithms;
- the inherent difficulties associated with the solution of some major classes of operations research problems;
- the modelling issues associated with the use of operations research methods and techniques;
- the computational aspects of various operations research algorithms.
Have developed:
- the ability to solve a variety of optimization problems using operations research methods and algorithms;
- skills to tackle various modelling issues associated with the use of operations research models and algorithms;
- skills to use operations research software.
Appreciate:
- the complexities of operational research problems and the methods available for solving them, including the scope and limitations of various optimization methods and algorithms;
- the central role that mathematical modelling plays in the formulation and modelling of operations research problems.
Content:
Selected topics from linear programming, quadratic programming, dynamic programming, fractional programming, composite concave programming, nonlinear optimization, parametric optimization, global optimization, combinatorial optimization, branch and bound, and simulation.
Assessment:
Up to 52 pages of written assignments and up to three hours of end-of-semester written examination.
* Note that CONTACT, NOTE differs from the maintainer's version above. A log of variations is available.
2. Math. & Stats., Faculty of Educ(Parkville) (v5, p150) : Next:618-380 | Prev:618-361
Status: Official 1996 Date created: Oct 9 1995 Last modified: Oct 9 1995 Authorised by: Academic Registrar Email enquiries: Course_Information@registrar.unimelb.edu.au
Maintained by: Dept. of Mathematics, Faculty of Science.
Copyright © University of Melbourne 1995,1996.