Decision Mathematics

Operational Research (O.R.) is the discipline of applying advanced analytical methods to help make better decisions. The O.R. approach often involves constructing and using mathematical models and problem structuring methods to represent the wide range of problems faced by organisations. The results of these models allow managers to make more informed decisions. The OR Society have developed ten problems for use in Decision mathematics lessons. Each problem consists of a PowerPoint presentation, a student worksheet and a suggested solution. The problems can be used as an introduction to a topic, part of the learning process or as a plenary exercise. The ten topics covered are: • Bin Packing • Critical Path Analysis • Dijkstra's Algorithm • Network Flow Problem • Linear Programming • Matching Problem • Minimum Spanning Tree • Planar Graphs • Route Inspection Problem • Travelling Salesperson Problem

Resources

Bin Packing

The purpose of bin packing is to pack a collection of objects into containers called bins. The bins are all the same size and the objects to be packed are different sizes. The aim is to pack the objects into the bins using the fewest possible bins. In this example students are asked to save computer files onto a CD...

Publication date:
2010 to date

3 files

0

0
Not yet rated

Critical Path Analysis

Critical path analysis is a project management technique and is used to lay out all of the activities which are needed to complete a task. Starting some activities will depend on completing others first, while independent activities can be started any time. Critical path analysis helps to predict the project...

Publication date:
2010 to date

3 files

0

0
Not yet rated

Dijkstra's Algorithm

Dijkstra's algorithm finds the shortest path for a given problem. Dijkstra's algorithm can be used to find the shortest route between two cities. This algorithm is so powerful that it not only finds the shortest path from a chosen source to a given destination, it also finds all of the shortest paths from the...

Publication date:
2010 to date

3 files

0

0
Not yet rated

Flows

The network flow problem involves finding the optimum route through a flow network; a directed graph where each arc has a capacity and each arc receives a flow. Typical examples include: evacuation plans and delivery services. The problem involves students analysing the plan of a school canteen and deciding whether...

Publication date:
2010 to date

3 files

0

0
Not yet rated

Pages

Published by

Actions

Share this resource

Collections

This resource is part of these collections

Lists that tag this content

You might also like

Resource
Resource collection
Resource collection
Resource collection

Comments

Add comment

Log in or register to post comments