Graphical solution of linear programs 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 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. , slid parallel across the region.
- Gradient of ?
- 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 are whole numbers and are whole numbers, what is ?
- A whole number, so means .
- Vertex of and ?