Karteikarten
D1 Linear Programming
Karten in diesem Stapel (9)
- 1Linear Programming?- Graphical method
- Simplex - 2What is the graphical method of optimisation?- only works with 2 variables
- draw the equations of the line of the constraints and shade out the side you DON'T WANT
- area left in between the lines is the feasible region - 3what do you do with the feasible region?- optimum solution likely to be one of the vertices
- calculate value of objective function at each of vertices to see which is best - 4What must you find to formulate Linear Programming problems?- constraints (inequalities)
- objective function
- control variables - 5How should control variables be defined?like 'X is the NUMBER OF ..'
- 6Constraints?- said in words, change to inequalities
- remember TRIVIAL CONSTRAINTS - ones that aren't stated, but are obvious, like
a => 0 - 7Objective Function?- Maximise/Minimise
- if it talks of wanting most profit - MAXIMISE
- e.g. Maximise P = 500a + 100b + 200c
^^ these are the prices in the Q - 8Variables?- the NUMBER of e.g.
k = the number of apples - 9Simplex?Remember:
- bring everything to left with objective function and make = to 0
- add slack variables
- put in context of question at end
- RHS column
LOOK AT SHEET FOR REST
Informationen
- Beschreibung
- A level Maths (D1) Karteikarten am D1 Linear Programming, erstellt von Maisie Carroll am 23/03/2017.
- Erstellt von
- Maisie Carroll
- Aufrufe
- 0
- Bewertung