Chapter 6 - Linear Programming

• To solve a linear programming problem you need to find the point which maximises/minimises the objective function
• Ruler Method - Draw the objective function as a line and see where in the feasible region it is maximised or minimised
• Vertex Testing Method - Find the coordinates of each vertex in the feasible region, evaluate the objective function at these points and pick the vertex that gives the optimal solution