Graphical solution of linear programs

Graphical solution of linear programs Flashcards

Spec 5.2 · Edexcel 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.

12 cards

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

See all 12 cards
What is the feasible region?
The set of points that satisfy all the constraints.
How do you decide which side of a constraint line to shade out?
Test a point such as (0,0)(0,0) in the inequality.
Where does the optimum of a linear objective lie?
At a vertex of the feasible region.
What is the objective line?
A line of constant objective value, e.g. 5x+4y=k5x+4y=k, slid parallel across the region.
Gradient of 5x+4y=k5x+4y=k?
−54-\frac54
Which vertex does the objective line method choose when maximising?
The last vertex touched as the line moves away from the origin.
How do you find the vertex where two constraint lines meet?
Solve their equations simultaneously.
What does it mean if the objective line is parallel to a boundary edge?
Every point on that edge is optimal, so there are many optimal solutions.
Why is rounding an LP optimum risky for integer problems?
The rounded point may be infeasible or not the best integer point.
What is the method for an integer solution?
Find the LP optimum, then compare feasible whole-number points near it.
If the coefficients of PP are whole numbers and x,yx,y are whole numbers, what is PP?
A whole number, so P≤19.5P\le19.5 means P≤19P\le19.
Vertex of 2x+y=122x+y=12 and x+2y=10x+2y=10?
(143,83)\left(\frac{14}{3},\frac83\right)

Flashcards