Week 3 - Linear Programming

Question 1

What is Linear Programming?

Answer 1

An optimisation technique used by businesses to make business decisions.

Question 2

When does linear programming apply to problems?

Answer 2

• Objectives and constraints are linear.
• Variables are continuous.
• Deterministic problem (no randomness).

Question 3

What are the 3 steps to completing a Linear Programme for 2 variables?

Answer 3

1. Define the variables (Standard desks and Compact desks).
2. Write the objective in terms of variables. (Maximise profit: £20s+£10c).
3. Write the constraints in terms of the variables. (Assembly = 4hourss+3hoursc) (Finishing = 8hourss+2c)

Question 4

What is the process for plotting constrain lines on a graph?

Answer 4

1. Plot the constraint when one of the variables is equal to 0.
2. Plot the other constraint when the other variable is equal to 0.
3. Draw line between points.

Question 5

How do you find the gradient of a line from the constraint function?

Answer 5

Assembly:
4s+3c = 120

= -4/3

Question 6

What makes a constraint binding?

Answer 6

A constraint is binding if the optimal solution lies on the constraint line.

A binding constraint is a variable that is used up completely with no room to spare.

The constraint has been completely used up.

Question 7

What makes a constraint non-binding?

Answer 7

A constraint is non-binding if the optimal solution does not lie on the constraint line.

• Not all of it has been used up.
• Doesn’t impact upon the production limit.

Question 8

What does ‘P.E.R.T’ stand for?

Answer 8

Program Evaluation and Review Techniques