Area: |
Department of Mathematics and Statistics |
Credits: |
25.0 |
Contact Hours: |
3.0 |
| |
| ** The tuition pattern below provides details of the types of classes and their duration. This is to be used as a guide only. For more precise information please check your unit outline. ** |
| |
Lecture: |
3 x 1 Hours Weekly |
| |
Syllabus: |
Linear programming - duality, the dual simplex algorithm, the revised simplex algorithm, decomposition techniques for large scale LPs. Integer programming - applications, techniques of cutting planes, implicit enumeration, and Branch and Bound. Non-linear programming - introduction to basic theory. |
| |
| ** To ensure that the most up-to-date information about unit references, texts and outcomes appears, they will be provided in your unit outline prior to commencement. ** |
| |
Field of Education: |
20300 Information Systems (Narrow Grouping) |
HECS Band (if applicable): |
2 |
|
Extent to which this unit or thesis
utilises online information: |
Informational |
Result Type: |
Grade/Mark |
|
Availability |
| Year |
Location |
Period |
Internal |
Area External |
Central External |
| 2004 |
Bentley Campus |
Semester 1 |
Y |
|
|
Area
External |
refers to external course/units run by the School or Department, offered online or through Web CT, or offered by research. |
Central
External | refers to external course/units run through the Curtin Bentley-based Distance Education Area |
|
