School: Science

This unit information may be updated and amended immediately prior to semester. To ensure you have the correct outline, please check it again at the beginning of semester.

  • Unit Title

    Optimisation and Networks
  • Unit Code

    MAT2438
  • Year

    2016
  • Enrolment Period

    1
  • Version

    1
  • Credit Points

    15
  • Full Year Unit

    N
  • Mode of Delivery

    On Campus

Description

This unit introduces the basic deterministic algorithms that can assist in the analysis of deterministic optimisation problems and their use in decision making and planning. The topics covered are linear programming; dynamic programming and network analysis.

Prerequisite Rule

Students must pass 1 unit from BES1200, MAT1163

Learning Outcomes

On completion of this unit students should be able to:

  1. Communicate their understanding of concepts in linear optimisation and explain their solutions to problems involving deterministic optimisation techniques in written form.
  2. Construct networks and analyse them.
  3. Formulate and solve dynamic programming problems.
  4. Formulate and solve linear programming problems.
  5. Recognise the "standard" deterministic models in operations research.
  6. Use an appropriate software package to solve optimisation problems.

Unit Content

  1. Dynamic Programming: Characteristics; solution and applications of dynamic programming models.
  2. Linear Programming: Graphical solution techniques; simplex method; dual problem; sensitivity analysis.
  3. Network Analysis: Shortest path problem; minimal spanning tree problem; maximal flow problem; critical path problem; PERT.
  4. Special Types of Linear Programs: transportation and assignment problems.

Additional Learning Experience Information

Lectures, tutorials and workshops.

Assessment

GS1 GRADING SCHEMA 1 Used for standard coursework units

Students please note: The marks and grades received by students on assessments may be subject to further moderation. All marks and grades are to be considered provisional until endorsed by the relevant Board of Examiners.

ON CAMPUS
TypeDescriptionValue
AssignmentAssignment 140%
TestMid-semester test20%
ExaminationEnd of semester examination40%

Text References

  • ^ Hillier, F.S., & Lieberman, G.J. (2010). Introduction to operations research (9th ed.). New York: McGraw-Hill.
  • Winston, W.L. (2003). Operations research, applications and algorithms (4th ed.). Belmont: Duxbury Press.
  • Taha, H.A. (2010). Operations research. An introduction (9th ed.). Saddle River: Pearson Education.

^ Mandatory reference


Disability Standards for Education (Commonwealth 2005)

For the purposes of considering a request for Reasonable Adjustments under the Disability Standards for Education (Commonwealth 2005), inherent requirements for this subject are articulated in the Unit Description, Learning Outcomes and Assessment Requirements of this entry. The University is dedicated to provide support to those with special requirements. Further details on the support for students with disabilities or medical conditions can be found at the Access and Inclusion website.

Academic Misconduct

Edith Cowan University has firm rules governing academic misconduct and there are substantial penalties that can be applied to students who are found in breach of these rules. Academic misconduct includes, but is not limited to:

  • plagiarism;
  • unauthorised collaboration;
  • cheating in examinations;
  • theft of other students' work;

Additionally, any material submitted for assessment purposes must be work that has not been submitted previously, by any person, for any other unit at ECU or elsewhere.

The ECU rules and policies governing all academic activities, including misconduct, can be accessed through the ECU website.

MAT2438|1|1

School: Science

This unit information may be updated and amended immediately prior to semester. To ensure you have the correct outline, please check it again at the beginning of semester.

  • Unit Title

    Optimisation and Networks
  • Unit Code

    MAT2438
  • Year

    2016
  • Enrolment Period

    2
  • Version

    1
  • Credit Points

    15
  • Full Year Unit

    N
  • Mode of Delivery

    On Campus

Description

This unit introduces the basic deterministic algorithms that can assist in the analysis of deterministic optimisation problems and their use in decision making and planning. The topics covered are linear programming; dynamic programming and network analysis.

Prerequisite Rule

Students must pass 1 unit from BES1200, MAT1163

Learning Outcomes

On completion of this unit students should be able to:

  1. Communicate their understanding of concepts in linear optimisation and explain their solutions to problems involving deterministic optimisation techniques in written form.
  2. Construct networks and analyse them.
  3. Formulate and solve dynamic programming problems.
  4. Formulate and solve linear programming problems.
  5. Recognise the "standard" deterministic models in operations research.
  6. Use an appropriate software package to solve optimisation problems.

Unit Content

  1. Dynamic Programming: Characteristics; solution and applications of dynamic programming models.
  2. Linear Programming: Graphical solution techniques; simplex method; dual problem; sensitivity analysis.
  3. Network Analysis: Shortest path problem; minimal spanning tree problem; maximal flow problem; critical path problem; PERT.
  4. Special Types of Linear Programs: transportation and assignment problems.

Additional Learning Experience Information

Lectures, tutorials and workshops.

Assessment

GS1 GRADING SCHEMA 1 Used for standard coursework units

Students please note: The marks and grades received by students on assessments may be subject to further moderation. All marks and grades are to be considered provisional until endorsed by the relevant Board of Examiners.

ON CAMPUS
TypeDescriptionValue
AssignmentAssignment 140%
TestMid-semester test20%
ExaminationEnd of semester examination40%

Text References

  • ^ Hillier, F.S., & Lieberman, G.J. (2010). Introduction to operations research (9th ed.). New York: McGraw-Hill.
  • Winston, W.L. (2003). Operations research, applications and algorithms (4th ed.). Belmont: Duxbury Press.
  • Taha, H.A. (2010). Operations research. An introduction (9th ed.). Saddle River: Pearson Education.

^ Mandatory reference


Disability Standards for Education (Commonwealth 2005)

For the purposes of considering a request for Reasonable Adjustments under the Disability Standards for Education (Commonwealth 2005), inherent requirements for this subject are articulated in the Unit Description, Learning Outcomes and Assessment Requirements of this entry. The University is dedicated to provide support to those with special requirements. Further details on the support for students with disabilities or medical conditions can be found at the Access and Inclusion website.

Academic Misconduct

Edith Cowan University has firm rules governing academic misconduct and there are substantial penalties that can be applied to students who are found in breach of these rules. Academic misconduct includes, but is not limited to:

  • plagiarism;
  • unauthorised collaboration;
  • cheating in examinations;
  • theft of other students' work;

Additionally, any material submitted for assessment purposes must be work that has not been submitted previously, by any person, for any other unit at ECU or elsewhere.

The ECU rules and policies governing all academic activities, including misconduct, can be accessed through the ECU website.

MAT2438|1|2