Help shape GoConqr. What should we add next?

Flashcards

D1 Linear Programming

Maisie Carroll Maths A level English 9 cards

Cards in this deck (9)

  1. 1Linear Programming?- Graphical method
    - Simplex
  2. 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
  3. 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
  4. 4What must you find to formulate Linear Programming problems?- constraints (inequalities)
    - objective function
    - control variables
  5. 5How should control variables be defined?like 'X is the NUMBER OF ..'
  6. 6Constraints?- said in words, change to inequalities
    - remember TRIVIAL CONSTRAINTS - ones that aren't stated, but are obvious, like
    a => 0
  7. 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
  8. 8Variables?- the NUMBER of e.g.
    k = the number of apples
  9. 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

Information

Description
A level Maths (D1) Flashcards on D1 Linear Programming, created by Maisie Carroll on 23/03/2017.
Created by
Maisie Carroll
Views
0
Rating

More on Linear Programming

Feedback

What is it about?

What should we add next?