Linear Programming

Question 1

How do you form a linear programming problem?

Answer 1

• Define the decision variables (x y z)
• State the objective function (maximise or minimise)
• Write constraints (inequalities)

Question 2

What is the feasible region?

Answer 2

The area that satisfies all of the constraints

Question 3

How do you actually solve a linear programming problem?

Answer 3

Find the max/min point in the feasible region

Question 4

How do you find the max/min point?

Answer 4

• Use an objective line

- Use the vertex method

Question 5

What are the steps to finding the optimal point using the vertex method?

Answer 5

• Find the co-ordinates of all vertices of the feasible region
• Evaluate the objective function at each of these points
• Select the vertex that offers the most optimal value