Subject Search
MA3212 - Optimisation and Operations Research
| Credit points: | 3 |
| Year: | 2022 |
| Student Contribution Band: | Band 1 |
| Administered by: |
This subject covers linear programming (formulations, graphical solutions); the Simplex Method for solving Linear Programs; duality; network optimisation (link and path flow formulations for networks); shortest-path algorithms; integer optimisation (formulations); introduction to non-linear optimisation.
Learning Outcomes
- formulate a problem as a linear programming model;
- solve a linear programming problem with a graphical method and the simplex algorithm;
- formulate linear programs for networks, as well as the shortest path algorithm;
- formulate simple integer programming models;
- apply the Karush-Kuhn-Tucker condition to find the properties of the optimal solution to a non-linear optimisation problem;
- use MATLAB to solve optimisation problems.
Subject Assessment
- Written > Examination (centrally administered) - (50%) - Individual
- Written > Test/Quiz 1 - (20%) - Individual
- Written > Problem task - (30%) - Individual.
| Prerequisites: | MA2000 AND (MA2210 OR MA2201) |
Availabilities |
|
| Townsville, Study Period 2, Internal | |
| Census Date 25-Aug-2022 | |
| Coord/Lect: | Assoc. Professor Wayne Read. |
| Workload expectations: |
The student workload for this 3 credit point subject is approximately 130 hours.
|
Note: Minor variations might occur due to the continuous Subject quality improvement process, and in case of minor variation(s) in assessment details, the Subject Outline represents the latest official information.