Registry

Module Specifications

Current Academic Year 2012 - 2013
Please note that this information is subject to change.

Module Title	Operations Research
Module Code	CA427
School	School of Computing
Online Module Resources
Module Co-ordinator	Semester 1: Liam Tuohey Semester 2: Liam Tuohey Autumn: Liam Tuohey
Module Teacher	Lynn Killen
NFQ level	8	Credit Rating	5
Pre-requisite	None
Co-requisite	None
Compatibles	None
Incompatibles	None

Description

To provide students with an understanding of fundamental principles of management science. To develop skills in formulating basic mathematical models and familiarise students with the main algorithms used in management science. To introduce some specialised software tool(s) for formulation and solution of large scale OR problems.

Learning Outcomes

1. Identify and formulate linear programming applications
2. Calculate the solutions to linear programming problems using the Simplex method for small scale problems and the "ampl" software tool for large scale problems.
3. Apply simple sensitivity analysis techniques to linear programming problems
4. Analyse applications of decision making under risk and uncertainty and identify optimal decision strategies
5. Draw network representations of projects and apply the CPM and PERT techniques
6. Analyse simple queuing systems
7. Calculate optimal order quantities for deterministic demand applications
8. Choose the most appropriate technique to apply in a decision making context

Workload	Full-time hours per semester
*Type*	*Hours*	*Description*
Lecture	24	No Description
Independent learning time	101	51
Total Workload: 125

All module information is indicative and subject to change. For further information,students are advised to refer to the University's Marks and Standards and Programme Specific Regulations at: http://www.dcu.ie/registry/examinations/index.shtml

Indicative Content and Learning Activities

Linear programming formulation and solution.
Elementary sensitivity analysis.

Use of "ampl" system for linear programming problems.
Project planning (CPM and PERT).

Decision theory.
Basic queueing models.

Deterministic inventory models.

Assessment Breakdown
Continuous Assessment	20%	Examination Weight	80%

Course Work Breakdown
Type	Description	% of total	Assessment Date

Reassessment Requirement
Resit arrangements are explained by the following categories; 1 = A resit is available for all components of the module 2 = No resit is available for 100% continuous assessment module 3 = No resit is available for the continuous assessment component
This module is category 1

Indicative Reading List

H Taha: 2003, Operations research An Introduction McMillan. Supplementary, Sixth, Prentice Hall,
Robert Fourer, David M. Gay, Brian W. Kernighan: 2003, AMPL, Thomson/Brooks/Cole, Pacific Grove, CA, 0534388094
David L. Applegate... [et al.]: 2006, The traveling salesman problem, Princeton University Press, Princeton, 0691129932
David J. Rader,: 0, Deterministic Operations Research, 0470484519
Bruce Bueno De Mesquita,: 0, The Predictioneer's Game, 1400067871
Michael Schrage: 2000, Serious play, Harvard Business School Press, Boston, 0875848141
David G. Luenberger: 0, Linear and nonlinear programming, Addison-Wesley, 0201157942

Other Resources

None

Array

Programme or List of Programmes

BSSA

Study Abroad (DCU Business School)

BSSAO

Study Abroad (DCU Business School)

ECSA

Study Abroad (Engineering & Computing)

ECSAO

Study Abroad (Engineering & Computing)