![]() |
THE UNIVERSITY of EDINBURGHDEGREE REGULATIONS & PROGRAMMES OF STUDY 2006/2007
|
|
Linear Programming & Graph Theory (U01461)? Credit Points : 10 ? SCQF Level : 8 ? Acronym : MAT-1-LPG First year course primarily for Honours Degrees in Mathematics and/or Statistics. Syllabus summary: (Linear programming - LP) Modelling using LP; solution of LP problems by the standard simplex method; fair prices and sensitivity for LP problems. (Graph theory) Introduction to graph theory; Euler graphs and Euler tours; minimum spanning tree; shortest path. Directed graphs; network simplex method for minimum cost network flow; Ford Fulkerson and flow augmenting path algorithms for maximum flow problems; max flow-min cut theorem; assignment problems. Entry Requirements? Pre-requisites : H-Grade Mathematics or equivalent Subject AreasHome subject areaSpecialist Mathematics & Statistics (Year 1), (School of Mathematics, Schedule P) Delivery Information? Normal year taken : 1st year ? Delivery Period : Semester 2 (Blocks 3-4) ? Contact Teaching Time : 2 hour(s) 30 minutes per week for 11 weeks All of the following classes
? Additional Class Information : Tutorials: F at 0900, 1000 and 1110. Summary of Intended Learning Outcomes
1. Ability to model simple continuous linear decision-making scenarios.
2. Mastery of the simplex method for linear programming and several simple algorithms in graph theory. Assessment Information
Coursework (which may include a Project): 15%; Degree Examination: 85%.
Exam times
Contact and Further InformationThe Course Secretary should be the first point of contact for all enquiries. Course Secretary Miss Louise Durie Course Organiser Dr Chris Smyth Course Website : http://student.maths.ed.ac.uk School Website : http://www.maths.ed.ac.uk/ College Website : http://www.scieng.ed.ac.uk/ |
|