7.06a–7.06c - Formulating linear programmes
Turn a practical choice into a linear programme: define variables, write constraints and decide what to maximise or minimise. You will translate ratios, introduce slack variables and investigate numerical cases, so that every line of the model has a clear meaning.
Variables and the objective
A workshop earns more from each stool than from each shelf: could making fewer stools nevertheless earn more altogether? A stool earns £6 and a shelf earns £5, but they use different amounts of the workshop's limited resources. We will build a model that makes the trade-off visible.
You already know
A linear expression has variables only to the first power, with constant coefficients, such as . You can solve linear equations and inequalities, reversing the inequality sign when multiplying or dividing by a negative number.
Start by saying exactly what a variable counts. “Let be stools” is incomplete: is it the number made, their price or the time spent on them? Use “Let be the number of stools made in one day”. The time period matters because the resource limits must cover the same period.
Linear programme
A linear programme chooses values of decision variables to maximise or minimise a linear objective function, subject to linear constraints. For example, maximising subject to resource inequalities is linear. Maximising is not: the product of two decision variables is not linear.
The objective measures success. Its coefficients are the contribution from one unit of each variable; its units are the units of the total being optimised. The model must state the direction of optimisation as well as the expression.
Worked example 1: maximising profit
Question. A workshop makes stools and shelves. Each stool contributes £6 profit and each shelf contributes £5. Define two variables and write down the objective for the daily production plan.
Plan. Define daily quantities, then multiply each quantity by its profit per item.
Let be the number of stools made per day and the number of shelves made per day.
Why this step? The variables count items, so multiplying by pounds per item gives profit in pounds.
Answer. Maximise , where is daily profit in pounds.
Check. Making stools and shelves gives , or £27 profit.
The second example changes the quantity being optimised from profit to cost. The arithmetic is identical; the required direction is reversed.
Worked example 2: minimising cost
Question. Two feed mixtures cost £6 and £5 per kilogram respectively. A farmer must meet specified nutritional requirements. Define variables and write down the objective for the daily feed plan.
Plan. Measure both quantities in kilograms and add their daily costs.
Let and be the masses, in kilograms, of the first and second mixtures used per day.
Why this step? Meeting the requirements is compulsory, so the objective selects the cheapest plan among those that meet them.
Answer. Minimise , where is measured in pounds.
Check. Using and costs £27, but this calculation alone does not establish that the nutritional requirements are met.
A cheaper plan may be unacceptable, and a more profitable plan may be impossible. Constraints will distinguish what is desirable from what is allowed.
Exam tip
Write “Maximise” or “Minimise”. An expression such as , without its direction, does not fully specify the objective.
Now choose variables whose units fit the costs given.
Resource and demand constraints
A constraint turns a sentence about available resources or required output into a mathematical condition on the same decision variables.
For the workshop, suppose each stool uses hours of machine time and unit of timber; each shelf uses hours and units. The daily limits are machine hours and units of timber. A table keeps the contributions separate.
| Resource | One stool | One shelf | Daily availability |
|---|---|---|---|
| Machine time, hours | |||
| Timber, units |
Each row gives one inequality. The left side is the amount used, not the amount left over.
Feasible solution
A feasible solution satisfies every constraint, including the restrictions on the variables. For example, satisfies and ; does not satisfy the first inequality.
Non-negativity restrictions such as are called trivial constraints. The name does not make them optional. Whole items also require integer variables; masses and lengths may take non-integer values.
Worked example 3: limited resources
Question. Use the workshop table to formulate the resource constraints. Include the restrictions needed when stools and shelves are whole items.
Plan. Add the resource use in each row and require that it does not exceed availability.
Why this step? “Available” imposes an upper limit; it does not say that the workshop must use every resource completely.
Answer. The four displayed restrictions, together with maximising , form the production model.
Check. At , machine use is and timber use is , so the plan is feasible even though some resources remain.
The next example changes an upper resource limit into a minimum requirement. That changes the direction of the inequality.
Worked example 4: minimum requirements
Question. Each kilogram of feed A supplies units of nutrient U and unit of nutrient V. Feed B supplies and units respectively. A daily ration needs at least units of U and at least units of V. Formulate the constraints, where and are the kilograms of A and B used.
Plan. Form the nutrient totals and require each to reach its minimum.
Why this step? The left sides are nutrient supplied, so supplying more is permitted; supplying less is not.
Answer. , and . There is no integer restriction because the feed can be weighed out.
Check. supplies exactly units of U and of V. The zero ration fails both requirements.
An exact requirement gives an equality, for example when exactly items are required. If a formulation is requested using inequalities only, replace it by both and .
Watch out
Wrong: merely because machine hours are available. Right: . Equality would incorrectly exclude feasible plans that leave machine time unused.
Check the meaning of the left side before choosing its inequality sign.
Ratio and proportion constraints
A ratio condition compares quantities; it does not supply their total. Translate the comparison before cancelling denominators.
If at least twice as many stools as shelves must be made, then . Substituting a simple pair is a useful direction check: should pass, while should fail. These translation rules are not in the formula booklet: learn them by their meaning.
Worked example 5: a lower bound on a ratio
Question. A workshop makes stools and shelves. It must make at least twice as many stools as shelves. Write this as a linear inequality.
Plan. Compare the number of stools with twice the number of shelves.
Why this step? “Twice as many stools” refers to , so is compared with , not with .
Answer. .
Check. Six stools and two shelves satisfy ; two stools and six shelves fail .
The next example changes a comparison between the two types into a fraction of the total. The denominator must include both types.
Continue this lesson.
You’re previewing NovaLearn without an account. Create a free account to read the rest.
Create free account