1 aFURTHER MATHS modelling

This class was created by Brainscape user Mohammad Kiani. Visit their profile to learn more about the creator.

Decks in this class (23)

Linear Programming
What goes on in linear programming 1,
For standard lp where will the op...,
How else can you manually find pr...
14  cards
Simolex
What is the simplex algorithm and...,
What goes on in simplex then 2,
How to do 1 re write everyhting i...
12  cards
2 Stage Simplex
When do we have to use 2 stage si...,
When might it not be in standard ...,
What does normal simplex algorith...
16  cards
4) LP Cpa Minimum Project Time (rather Than Max Length)
If it s says complete in the mini...,
Why minimise t or whatever source...,
Athen what are the cinstraints ab...
7  cards
1) Shortest Corcuit Problems
What even is a shortest circuit p...,
How do we assign if we go through...,
How to start the lp 3
7  cards
2) longest Path Problem (not Flow = PATH ) = CPA
First thing is critical path anal...,
How to do longest path compared t...,
Why do we need an extra constrain...
8  cards
3) MAXIMUM FLOW Problem (not Longest Oath )
What s changed this time frim lon...,
So how to do what to maximise wha...,
How to interpret with results giv...
3  cards
4) Matchin Problem
What even is the problem in a mat...,
Okay so what do you want to maxim...,
How are we showing this down 3
5  cards
5) Allocation Problem
What is it asking to do 1,
How to do what to minimise 2,
How to do constraints 3
4  cards
6) Transportation Porblmes
What is the probelem 1,
How to start with minimise 2,
How to constraint 3
3  cards
How To Do All Reformulating
Shortest part 1,
Longest path 2,
Maximum flow no indicator 3
6  cards
Complexitiesof Of Algorithms
0  cards
Critical path Analysis
What is the precedence table 1,
How to simplify precedence tables 2,
How to convert the precedence tab...
28  cards
Newtork Flows
0  cards
Chapter 1 Algorithms
Definition of an algorithm 1,
What are the three things an algo...,
What is the most typical problem ...
11  cards
Chapter 1 Algorithms : Packing
What is packing problem 1,
How to calauclte the lower bound ...,
Why need to roundup when finding ...
16  cards
Chapter 1 Algorithms : Sorting Algo
How to do quick sort 1,
How to count the number of compar...,
What s worse case scenarios for t...
11  cards
Chapter 2 Graph Theory
What is definition of a connected...,
What are having multiple edges or...,
What is a simple graph 3
20  cards
Chapter 3 Network Algorithms : MST Kruskal And Prim
Why are kruskal and prims bith gr...,
How to do kruskal algorithm 2,
For keuskal how to record 3
11  cards
Chapter 3 Newtork Algorithms : SHORTEST PATH (Dijkstra )
What does dijkstras algorithm do 1,
2 steps to doing dijskrta 2,
What goes in a label for a vertex 3
7  cards
Chapter 4 More Networks : Critical Path Analysis
What is cpa all about 1,
How to do precedence tsble 2,
If last task in lrecedence table ...
36  cards
Chapter 4 More Networks: Network Flows (min Max Cuts Etc )
What are network flows all about 1,
So what is a network flow 2,
What s difference between feasibl...
26  cards
Importsnt Extra Stuff
When drawing a network what ti ma...,
What is rule about two arcs comin...,
What s the effect of reducing a n...
4  cards

More about
1 aFURTHER MATHS modelling

  • Class purpose General learning

Learn faster with Brainscape on your web, iPhone, or Android device. Study Mohammad Kiani's 1 aFURTHER MATHS modelling flashcards now!

How studying works.

Brainscape's adaptive web mobile flashcards system will drill you on your weaknesses, using a pattern guaranteed to help you learn more in less time.

Add your own flashcards.

Either request "Edit" access from the author, or make a copy of the class to edit as your own. And you can always create a totally new class of your own too!

What's Brainscape anyway?

Brainscape is a digital flashcards platform where you can find, create, share, and study any subject on the planet.

We use an adaptive study algorithm that is proven to help you learn faster and remember longer....

Looking for something else?

MFT Models
  • 13 decks
  • 238 flashcards
  • 394 learners
Decks: Bowen Intergenerational, Contextual Nagy, Object Relations Psychodynamic, And more!
Consulting Math
  • 31 decks
  • 7263 flashcards
  • 1229 learners
Decks: Consulting Math Flash Cards, Consulting Math Flash Cards Foundations, Times Tables, And more!
► German Vocab 1
  • 43 decks
  • 13451 flashcards
  • 8376 learners
Decks: Business, Employment, Finance, And more!
Make Flashcards