Operational Research (O.R.) case studies www.theorsociety.com.

Slides:



Advertisements
Similar presentations
Operational Research (O.R.) case studies. What’s the problem?
Advertisements

Vertex-Edge Graphs.
Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,
A GUIDE TO AS AND A2 OPTIONS For Year 11 Pupils and Parents.
Data Structures Chapter 12 Graphs Andreas Savva. 2 Definition A graph consists of a set of vertices together with a set of edges. If e = (v,w) is an edge.
Operational Research (O.R.) case studies
Randomized Algorithms for the Loop Cutset Problem Author: Ann Becker, Beuven Bar-Yehuda Dan Geiger Beuven Bar-Yehuda Dan Geiger Class presentation for.
What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.
Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.
The Travelling Salesman Algorithm A Salesman has to visit lots of different stores and return to the starting base On a graph this means visiting every.
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
From 14 to 18 From 11 to 13 From 6 to 10 From 3 to 5 Education in Italy is compulsory from 6 to 16. Compulsory school includes Primary School, Middle School.
EXAMPLE 4 Use Pascal’s triangle School Clubs The 6 members of a Model UN club must choose 2 representatives to attend a state convention. Use Pascal’s.
Year 10 Parents Curriculum Information Evening Welcome.
Operational Research (O.R.) case studies. What’s the problem?
Operational Research (O.R.) case studies
Operational Research (O.R.) case studies. What’s the problem?
Do Now: Review 10.4 Multiple Choice 1.) What does mean? a.) b.) c.) Short Answer 2.) Find the number of arrangements of 3 #’s for a locker with a total.
Welcome to the Year 9 Options Evening April 1 st 2015 “Working together for the best in everyone”
NCVPS Math I Website Support Zebulon B. Vance High School.
6-1 Lesson 6-1 Example 1 Find the number of faces, vertices, and edges. Identify the figure. 1.How many faces? Example
AP Review #4: Sampling & Experimental Design. Sampling Techniques Simple Random Sample – Each combination of individuals has an equal chance of being.
WK15. Vertex Cover and Approximation Algorithm By Lin, Jr-Shiun Choi, Jae Sung.
EMIS 8373: Integer Programming Combinatorial Relaxations and Duals Updated 8 February 2005.
Counting Techniques. Multiplication Principle (also called the Fundamental Counting Principle) Combinations Permutations Number of subsets of a given.
Working in Partnership North Somerset CTPLD Housing Options Presentation 13/10/08 North Somerset CTPLD Housing Options Conference Presentation.
Mr InglisHeadteacher Mrs GibsonDepute Headteacher S2 S3 Options Presentation.
Operational Research (O.R.) case studies. What’s the problem?
Visit:
6/9/2016MATH 106, Section 51 Section 5 Combinations Questions about homework? Submit homework!
Multiply By 2-Digit Numbers (B) Unit 2 Lesson 6. Objectives:
Honors Stats 3 Day 5. Do Now 1) Round 2 Match game! Turn all the cards over and match the examples to the bias 2) Check your HW: Questions??
A Centre of all round Educational Excellence for the Community Welcome to our Year 8 Options Information Evening.
Moving On Next steps towards your future…. It’s time to think about next year We need to know what you want to do.
Middle School Task Force Licensure & Staffing Chair: Greg Lawrence Co-Chair: Jeanette Brethour Angie Gunion Nancy Sims-West.
A Centre of all round Educational Excellence for the Community Welcome to our Year 8 Options Information Evening.
–every possible sample of size n has an equal chance of being selected –Randomly select subjects Simple Random Sample (SRS) Suppose we were to take an.
High School Transition Lesson Class of 2021!
3RD FORM GCSE SUBJECT CHOICES 2018
YEAR NINE OPTIONS 2017.
Submodularity Reading Group More Examples of Matroids
Godrej Prakriti Sodepur | Godrej Prakriti Kolkata
YEAR 8-9 MFL In Year 8, all students will be given the option to state a preference for the language(s) which they will continue to study in Year 9. Deciding.
Lecture 16 Bipartite Matching
What is the next line of the proof?
Redraw this PCB in such a way that no wires cross.
Year 9: Guidance For Choosing Your Options
Review: Mini-Quiz Matching
Business Management Courses Gives Competitive Edge.
HCA 230 Competitive Success-- snaptutorial.com
NETW 561Competitive Success/snaptutorial.com
HCA 230 Education for Service-- snaptutorial.com
Giftalove Best Cake Offers
HCA 230 Teaching Effectively-- snaptutorial.com
HCA 230 Inspiring Innovation-- snaptutorial.com
Changes to GCSE (starting Sept and First Examined 2017)
Discrete Math: Hamilton Circuits
4 Probability Lesson 4.8 Combinations and Probability.
Decision Maths Dijkstra’s Algorithm.
Properties of Numbers Use mental math to simplify –2 • 13 • 5.
Understanding Proportions
and 2 units to the left of point B. Count down 5 units from point B
Year 8 specialism Making the right Choices Attend, Aspire, Achieve.
10:00.
Science At Northwick Park.
Year 10 GCSE SUBJECT CHOICES 2019
Distribute and combine like terms
Options in Year 9 February
Combinations Practical Applications from
Visit us:
Presentation transcript:

Operational Research (O.R.) case studies

What’s the problem?

You are choosing your AS courses… You want to study AS Levels in Maths, Physics, French and Philosophy You also want to attend Basketball Club Each of these is available in one or more of 6 different option blocks

How do you decide if your combination of courses is possible?

And what to take in each Option Block?

Let’s summarise the problem We have a set of subjects and a set of option blocks with each subject available in one or more of the option blocks

We want to match up our chosen subjects with possible option blocks in a systematic way

This is an example of a

Matchings Problems We have two distinct sets of vertices with some edges between the two sets but no edges within a set

We want to find as large as possible a subset of the edges with no two edges sharing a vertex

Another example where this is used British Airways rostering their staff deciding who will work, when, where…

Over the next few lessons we will learn how to find the best possible matching…

To learn more about O.R. visit