Linear programming

Steps

1. Define variables: let x = number of item A, y = number of item B.

2. Form inequalities from the constraints (money, space, time, minimum numbers).

3. Draw each boundary line; shade the unwanted region (KCSE convention), leaving the feasible region clear.

4. Objective function: what to maximise or minimise, e.g. profit P = 50x + 80y.

5. Test the vertices of the feasible region (or use a search line) to find the best value.