This class was created by Brainscape user Mohammad Kiani. Visit their profile to learn more about the creator.
By:
Mohammad Kiani
- decks
- flashcards
- learners
Decks in this class (23)
Linear Programming
What goes on in linear programming,
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,
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 about
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
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 maximisewhat...,
How to interpret with results given
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
5
cards
5) Allocation Problem
What is it asking to do,
How to do what to minimiseare we ...,
How to do
4
cards
6) Transportation Porblmes
What is the probelem,
How to start with minimiseare we ...,
How to constraint
3
cards
How To Do All Reformulating
Shortest part,
Longest path,
Maximum flow no indicator why con...
6
cards
Complexitiesof Of Algorithms
0
cards
Critical path Analysis
What is the precedence table how ...,
How to simplify precedence tables,
How to convert the precedence tab...
28
cards
Newtork Flows
0
cards
Chapter 1 Algorithms
Definition of an algorithm,
What are the three things an algo...,
What is the most typical problem ...
11
cards
Chapter 1 Algorithms : Packing
What is packing problem,
How to calauclte the lower bound ...,
Why need to roundup when finding ...
16
cards
Chapter 1 Algorithms : Sorting Algo
How to do quick sort,
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
20
cards
Chapter 3 Network Algorithms : MST Kruskal And Prim
Why are kruskal and prims bith gr...,
How to do kruskal algorithm,
For keuskal how to record
11
cards
Chapter 3 Newtork Algorithms : SHORTEST PATH (Dijkstra )
What does dijkstras algorithm do,
2 steps to doing dijskrta,
What goes in a label for a vertex
7
cards
Chapter 4 More Networks : Critical Path Analysis
What is cpa all about,
How to do precedence tsble,
If last task in lrecedence table ...
36
cards
Chapter 4 More Networks: Network Flows (min Max Cuts Etc )
What are network flows all about ...,
So what is a network flow,
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?
CLR110 Clarity Data Model Fundamentals
- 6 decks
- 145 flashcards
- 136 learners
Decks:
Investigating Chronicles, Investigating Clarity 1 Of 2, Investigating Clarity 2 Of 2, And more!
SHHS - GCSE Maths
- 14 decks
- 471 flashcards
- 1678 learners
Decks:
Decimal Equivalents, Circle Theorems, Prime Numbers, And more!
