Chapter 20

Linear programming is:
1. An optimisation technique
2. A means of dealing with linear functions
3. A means of making production functions linear
4. All of these
Problem 1: A production process can make two products, A and B. A requires 2 hours and 1 kilo of mix, whilst B requires 3 hours and 3 kilos of mix. There is an agreement to make at least 3 of A. Profit is £4 for each A and £10 for each B. There are 100 hours per week and 60 kilos of mix available.

In Problem 1, the time constraint is:
1. A + 3B ≤ 60
2. A + 2B ≤ 100
3. 2A + 3B ≤ 60
4. 2A + 3B ≤ 100
In Problem 1 the mix constraint is:
1. A + 3B ≤ 60
2. A + 2B ≤ 100
3. 2A + 3B ≤ 60
4. 2A + 3B ≤ 100
In Problem 1 the profit function is:
1. 2A + 3B
2. 4A + 10B
3. 10A + 4B
4. 100A + 60B
In Problem 1 the other constraints are:
1. A ≥ 3, B ≥ 0
2. A ≤ 3, B ≥ 0
3. A ≤ 3, B ≤ 0
4. A ≥ 3, B ≤ 0
For Problem 1, the optimum solution is:
1. A = 0, B = 33
2. A = 3, B = 19
3. A = 40, B = 6.67
4. A = 50, B = 0
For Problem 1, the maximum profit is:
1. 200.0
2. 202.0
3. 226.7
4. 330.0
In Problem 1, if there is another constraint that B must be at least 10, how many A will be produced?
1. 20
2. 30
3. 40
4. 50