Linear programming

Linear programming Flashcards

IB MYP Maths Extended: 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 is a constraint in linear programming?
A limit in the problem, written as a linear inequality.
How do you write 'at most' and 'at least'?
At most: ≤\le. At least: ≥\ge.
Write 'y is at most three times x'.
y≤3xy\le3x
Why do we usually add x≥0x\ge0 and y≥0y\ge0?
Quantities such as numbers of items cannot be negative.
When is a boundary line solid and when dashed?
Solid for ≤\le or ≥\ge. Dashed for << or >>.
How do you decide which side of a line to shade?
Test a point such as (0,0)(0,0) in the inequality. If it is true, shade that side.
What is the feasible region?
The area where all the constraints are satisfied at once.
How do you find a vertex of the feasible region?
Solve the equations of the two boundary lines that meet there, or use the axes.
What is an objective function?
The quantity to maximise or minimise, such as P=30x+20yP=30x+20y.
Where does the optimal solution lie?
At a vertex of the feasible region (or along an edge if two vertices tie).
What are the steps to find the optimum?
Find all vertices, evaluate the objective function at each, then choose the largest (maximise) or smallest (minimise).
What if the objective line is parallel to an edge?
Two vertices give the same best value, so every point on that edge is optimal.
How do you check that a point is feasible?
Substitute it into every constraint; all must be true.

Flashcards