CSEC Mathematics · relations, functions and graphs
Linear Programming
Before you start
To graph linear inequalities in two variables, replace the inequality sign with an equals sign to draw the boundary line, then test a coordinate such as (0,0) to decide which side satisfies the inequality.
1. Formulating Constraints and Graphing the Feasible Region
Linear programming is a mathematical method used by businesses and planners to make the best decisions—such as maximising profit or minimising cost—under limited resources. These limitations are called constraints, and they are written as linear inequalities in two variables, x and y.
Common wordings and their mathematical symbols:
- **At least k or a minimum of k**: ≥k
- **At most k or no more than k or cannot exceed k**: ≤k
- Non-negativity: In practical scenarios involving physical items (such as loaves of bread or cricket bats), quantities cannot be negative, so x≥0 and y≥0.
The feasible region (often labelled R) is the set of all points (x,y) that satisfy every constraint at the same time. On a graph, each constraint is represented by a solid boundary line (since inequalities are ≤ or ≥). The region where the shaded sides overlap represents all possible solutions.
Worked example
Ravi stocks two types of cricket jerseys: Standard (x) and Premium (y). The constraints governing his stock are:
1. He must stock at least 2 Standard jerseys: x≥2.
2. He must stock at least 1 Premium jersey: y≥1.
3. He has storage for at most 10 jerseys in total: x+y≤10.
4. The number of Premium jerseys cannot exceed the number of Standard jerseys: y≤x.
Plot the boundary lines on the grid, identify the feasible region R, and state the coordinates of its four vertices.
- Draw the boundary line x=2 vertically through 2 on the x-axis; the required side is to the right (x≥2).
- Draw the boundary line y=1 horizontally through 1 on the y-axis; the required side is above (y≥1).
- Draw x+y=10 by joining (0,10) and (10,0); test (0,0): 0+0≤10 is true, so the required side is below the line.
- Draw y=x passing through (0,0),(2,2),(5,5); test (2,1): 1≤2 is true, so the required side lies below the line.
- Label the enclosed overlapping polygon R and locate where adjacent lines intersect.
- Intersection of x=2 and y=1 gives (2,1).
- Intersection of y=1 and x+y=10 gives x=10−1=9, so (9,1).
- Intersection of x+y=10 and y=x gives x+x=10⟹2x=10⟹x=5,y=5, so (5,5).
- Intersection of x=2 and y=x gives (2,2).
Answer: The feasible region R is the quadrilateral with vertices (2,1), (9,1), (5,5), and (2,2).
Quick check
Which inequality represents the statement: 'Mr Alleyne must bake no more than 15 cassava cakes each morning', where y represents the number of cassava cakes?
2. The Objective Function and Finding the Optimum Value
Once the feasible region is found, we want to find the best possible outcome. The quantity to be maximised (such as profit) or minimised (such as cost) is defined by an objective function:
The Fundamental Principle of Linear Programming states that the maximum or minimum value of a linear objective function over a feasible region always occurs at one of the vertices (corner points) of the region.
To find the optimum solution:
1. List the coordinates (x,y) of every corner vertex of the feasible region.
2. Substitute the x and y values of each vertex into the objective function.
3. Compare the resulting values: select the highest value for maximum profit, or the lowest value for minimum cost.
Worked example
Using the feasible region from the previous example with vertices (2,1), (9,1), (5,5), and (2,2):
Ravi makes a profit of \15oneachStandardjersey(x)and\25 on each Premium jersey (y).
(a) Write an expression for the total profit, P, in terms of x and y.
(b) Evaluate the profit at each vertex.
(c) Determine the number of each type of jersey Ravi should stock to maximise his profit, and state this maximum profit.
- Write the profit function: P=15x+25y.
- Test vertex (2,1): P=15(2)+25(1)=30+25=55.
- Test vertex (9,1): P=15(9)+25(1)=135+25=160.
- Test vertex (5,5): P=15(5)+25(5)=75+125=200.
- Test vertex (2,2): P=15(2)+25(2)=30+50=80.
- Compare the profit values: \55,\160, \200,and\80. The largest value is \200atthevertex(5, 5)$.
Answer: Ravi should stock 5 Standard jerseys and 5 Premium jerseys to achieve a maximum profit of \$200.
Quick check
A feasible region has vertices at (0,4), (3,6), (5,2), and (1,1). Find the minimum value of the cost function C=4x+3y.
3. Testing Feasibility and Integer Solutions
CSEC exam questions often ask practical follow-up questions about points inside or outside the feasible region:
- Checking if a combination is possible (feasible): A point (x,y) is only possible if it satisfies all the given constraints. If it breaks even one condition, it lies outside region R and is not feasible.
- Discrete items (integers): Because you cannot manufacture or sell a fraction of a jersey, cake, or phone, solutions in word problems must be whole numbers (x,y∈W).
- Finding maximum total items: If asked for the maximum total number of items, examine the expression x+y at the vertices.
Worked example
A vendor sells mangoes (x) and pineapples (y). The constraints governing her daily stock are:
- x≥10 (at least 10 mangoes)
- y≤20 (no more than 20 pineapples)
- 2x+5y≤120 (total cost constraint)
(a) Show whether it is possible for the vendor to stock 35 mangoes and 12 pineapples on the same day.
(b) What is the maximum number of pineapples she can stock if she stocks the minimum number of mangoes?
- For part (a), test the coordinate (35,12) against all three constraints.
- Check x≥10: 35≥10 is satisfied.
- Check y≤20: 12≤20 is satisfied.
- Check 2x+5y≤120: 2(35)+5(12)=70+60=130.
- Since 130>120, the cost constraint is violated. Therefore, (35,12) is not possible.
- For part (b), the minimum number of mangoes is x=10.
- Substitute x=10 into the cost constraint: 2(10)+5y≤120⟹20+5y≤120⟹5y≤100⟹y≤20.
- Since the pineapple constraint also states y≤20, the maximum number of pineapples is 20.
Answer: (a) It is not possible because the cost of \130exceedsthe\120 limit; (b) 20 pineapples.
Quick check
A student club purchases x vegetable patties and y fruit juices. The budget constraint is 3x+2y≤60. Using substitution, show whether the club can afford 15 patties and 10 juices.
Common mistakes
- Reversing the inequality signs for 'at least' and 'no more than'. Remember that 'at least k' means ≥k (greater than or equal to) and 'no more than k' means ≤k (less than or equal to).
- Omitting the non-negativity constraints x≥0 and y≥0 when writing out inequalities for real-world items that cannot take negative values.
- Reading coordinates off a graph by eye rather than verifying them algebraically using the equations of the intersecting boundary lines.
In the exam
- Always write the equation of each line next to it on your graph (e.g. x+y=10) and clearly label the feasible region with the letter stated in the question (usually R).
- Show a neat table or list of all vertex calculations for the objective function. CSEC awards method marks for systematically substituting each vertex into the profit or cost equation.
- State both the maximum value and the combination that achieves it (e.g. 'A maximum profit of \200isobtainedwhenx = 5andy = 5$').
Key terms
- Linear Programming
- A mathematical technique used to find the best outcome (maximum profit or minimum cost) subject to a set of linear constraints.
- Constraint
- A restriction or condition given in a problem, written as a linear inequality.
- Feasible Region
- The area on a graph containing all the points that satisfy every constraint simultaneously.
- Objective Function
- The linear formula representing the quantity to be maximised or minimised, typically of the form ax+by.
- Vertex
- A corner point where two boundary lines of the feasible region intersect.
Practice
Easier to harder. Use paper for your working.
Practice 1
A shopkeeper sells two types of fans: Table fans (x) costing \40eachandStandingfans(y)costing\70 each. Which inequality represents the condition: 'The total cost of the fans cannot exceed \$560'?
Practice 2
A feasible region has corner vertices at P(2,0), Q(8,0), R(6,4), and S(2,6). Find the maximum value of the profit function P=5x+3y.
Practice 3
A carpenter makes x small benches and y large benches. The feasible region for bench production has vertices (0,0), (12,0), (6,6), and (0,10). If the profit is \8persmallbenchand\14 per large bench:
(a) Identify which vertex yields the maximum profit.
(b) State the maximum profit.
Now try real past-paper questions
3 Paper 2 questions on this topic. Quelpr marks your working point by point, like an examiner.
- CSEC Mathematics · 2022 · Paper 2 · Q8 8(c) · 5 marksOn the grid below, plot the four lines associated with the inequalities in (a) and (b). Shade and label the region that satisfies ALL four inequalities R.
- CSEC Mathematics · 2021 · Paper 2 · Q8 8(a)(iv) · 1 markMarla buys 2 types of mobile phones, B-Flo and C-Flex, from a company to retail. One B-Flo mobile phone costs 60whileoneC−Flexcosts80. She buys x number of B-Flo phones…
- Mathematics Q8 8(b)(iii) · 1 markMr Thomas makes x bottles of juice and y cakes each day. He makes at least 20 bottles of juice and no more than 15 cakes each day. The cost to make a bottle of juice is…
Finished the lesson?
0 of 6 checks right on this device.
Read more
- CSEC Maths Study Guide - Maths Crash Course, p. 196
- CXC Study Guide - Mathematics for CSEC, pp. 126, 127
- Mathematics for CSEC, p. 377
- Collins - Concise Revision Course for CSEC Mathematics, p. 364