5: Linear Programming

Question 1

Formulation of Problems as Linear Programs (3)

Answer 1

1. Define the decision variables (x, y, z, etc.)
2. State the objective (maximise or minimise, together with an objective function)
3. Write the constraints as inequalities

Question 2

Feasible Region

Answer 2

The region of a graph that satisfies all the constraints of a linear programming problem

Question 3

Vertex Testing Method (3)

Answer 3

1. First find the coordinates of each vertex of the feasible region
2. Evaluate the objective function at each of these points
3. Select the vertex that gives the optimal value of the objective function