INDE3000 (v.1) Industrial Modelling and Optimisation
| Area: | Department of Mathematics and Statistics |
|---|---|
| Credits: | 25.0 |
| Contact Hours: | 4.0 |
| TUITION PATTERNS: | The tuition pattern provides details of the types of classes and their duration. This is to be used as a guide only. Precise information is included in the unit outline. |
| Lecture: | 1 x 3 Hours Weekly |
| Tutorial: | 1 x 1 Hours Weekly |
| Equivalent(s): |
310299 (v.1)
Industrial Modelling and Optimisation 301
|
| Prerequisite(s): |
MATH2011 (v.1)
Operations Research
or any previous version
OR MATH2010 (v.1) Linear Algebra or any previous version |
| UNIT REFERENCES, TEXTS, OUTCOMES AND ASSESSMENT DETAILS: | The most up-to-date information about unit references, texts and outcomes, will be provided in the unit outline. |
| Syllabus: | The core aspect of this unit is the mathematical modelling of industrial systems. We then study the fundamental features of mathematical models. Several background notions of matrix analysis and linear algebra will be given in the first part of this unit. In the second part, this unit will deal with complex optimisation problems. The main topic of this part is the Integer Linear Programming problem. This is addressed using two fundamental algorithms: Gomory Cutting Planes and Branch-and-Bound. Both of these methods use the Dual Simplex Algorithm. In the last part of this unit, Branch-and-Bound Algorithms will be treated from a more general perspective. Moreover, some examples of industrial models will be presented. If there is time, some notions of computational complexity will also be presented. This until will consider problems arising in business and industry. The students will learn the necessary skills to model and solve such problems through mathematical modelling and operations research techniques with a focus on using binary and integer variables. The topics covered will include: Industrial Modelling: In this part of the unit, several examples of mathematical models will be presented and analysed. Dual Simplex Algorithms: the Simplex and the Dual Simplex Algorithms used for linear programming problems will be revised and analysed from a different perspective. Their features will be thoroughly investigated. This part is crucial to the development of the second part of this unit ie; Integer Linear Programming. Integer Linear Programming: The Simplex Algorithm and the Dual Simplex Algorithm studied in the first part of the unit will be used as the building blocks of more complex algorithms to solve Linear Programming Problems where all or some of the variables are constrained to be integer. Two methods will be presented: the Gomory Cuts and the Branch-and-Bound Algorithms. Branch-and-Bound Algorithms: In this part of the subject, Branch-and-Bound Algorithms will be addressed from a more general perspective, to the end of solving other Integer Linear Programming problems, including the Knapsack Problem 0-1. |
| Field of Education: | 030703 Industrial Engineering |
| Result Type: | Grade/Mark |
Availability
| Year | Location | Period | Internal | Partially Online Internal | Area External | Central External | Fully Online |
|---|---|---|---|---|---|---|---|
| 2015 | Bentley Campus | Semester 1 | Y |
Area External refers to external course/units run by the School or Department or offered by research.
Central External refers to external and online course/units run through the Curtin Bentley-based Distance Education Area
Partially Online Internal refers to some (a portion of) learning provided by interacting with or downloading pre-packaged material from the Internet but with regular and ongoing participation with a face-to-face component retained. Excludes partially online internal course/units run through the Curtin Bentley-based Distance Education Area which remain Central External
Fully Online refers to the main (larger portion of) mode of learning provided via Internet interaction (including the downloading of pre-packaged material on the Internet). Excludes online course/units run through the Curtin Bentley-based Distance Education Area which remain Central External
Handbook
The Courses Handbook is the repository of Curtin University ("Curtin") course information. While Curtin makes all reasonable endeavours to keep this handbook up to date, information on this website is subject to change from time to time. Curtin reserves the right to change the: course structure and contents, student assessment, tuition fees and to: withdraw any course or its components which it offers, impose limitations on enrolment in any unit or program, and/or vary arrangements for any course without notification via the website.
For course and enrolment information please visit our Future Students website.
