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.
14 cards
Tap a card to flip it. Swipe right if you knew it, left if not.
See all 14 cards
- What is the feasible region?
- The set of points satisfying every constraint.
- How are the coordinates of a vertex found exactly?
- Solve the equations of the two boundary lines that meet there.
- State the vertex method.
- Find all vertices, evaluate the objective function at each, choose the largest (or smallest).
- What is the gradient of the objective line ?
- Ruler method for maximising: which point is the optimum?
- The last point of the feasible region touched when sliding the ruler parallel to the objective line away from the origin.
- Ruler method for minimising: which point is the optimum?
- The first point of the feasible region touched when sliding the ruler away from the origin.
- In which direction does the ruler move?
- Parallel to the objective line, never perpendicular.
- What type of constraints do minimisation problems often have?
- constraints (requirements), so the region lies away from the origin.
- Where does the optimum of a linear program lie?
- At a vertex of the feasible region (or along an edge between two equally good vertices).
- What must you state at the end?
- The values of both variables and the optimal value of the objective function.
- What is an integer solution?
- A feasible point where every variable is a whole number.
- How do you find the optimal integer solution?
- Test integer points near the optimal vertex (or move the objective line back) checking every constraint.
- Why is rounding the optimal vertex unreliable?
- The rounded point may be infeasible or not the best integer point.
- Is the best integer value ever better than the non-integer optimum?
- No; it is equal or worse.