Formulating and graphical solution of LPs

Formulating and graphical solution of LPs Flashcards

Spec DD1–DD2 · AQA A-Level Further Maths: Flashcards

Studying this course? Keep your progress in one place.

Flip each card. Be honest: the ones you mark Not yet come back first.

13 cards

Tap a card to flip it. Swipe right if you knew it, left if not.

See all 13 cards
What are the four steps in formulating an LP?
Define the decision variables, write the objective function, write the constraints as inequalities, and add the non-negativity constraints.
Translate 'at most' and 'at least' into inequalities.
'At most' is ≤\leq; 'at least' is ≥\geq.
Write 'at least twice as many chairs (yy) as tables (xx)'.
y≥2xy\geq2x.
What is the feasible region?
The set of points satisfying every constraint.
Which side of a boundary line do you shade?
The unwanted side, so that the feasible region is left unshaded.
How do you find a vertex of the feasible region?
From an axis intercept, or by solving two boundary equations simultaneously.
What is the gradient of the objective line ax+by=kax+by=k?
−ab-\frac ab.
How does the objective line method work for maximising?
Slide the line parallel to itself away from the origin to the last vertex it touches.
How does the objective line method work for minimising?
Slide the line parallel to itself towards the origin to the first vertex it touches.
Where does the optimal value of the objective always occur?
At a vertex of the feasible region.
Describe the vertex testing method.
Find every vertex, evaluate the objective at each, and choose the greatest or the least.
How do you check that a point is feasible?
Substitute it into every constraint, including x≥0x\geq0 and y≥0y\geq0.
What should a final answer include?
The values of the variables and the value of the objective, in context with units.

Flashcards