Scribd
Upload
5 views2 pages

Linear Programming Summary

linear programming summary notes o level

Uploaded by

austrapaul
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views2 pages

Linear Programming Summary

linear programming summary notes o level

Uploaded by

austrapaul
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

■ O Level Mathematics – Linear Programming Summary

1. Key Concepts

• Decision variables: Unknowns you want to find (x, y).


• Constraints: Inequalities (e.g., 2x + y ≤ 10).
• Feasible region: Common shaded area that satisfies all constraints.
• Objective function: Expression to maximize or minimize (e.g., Profit = 5x + 3y).

2. Standard Steps

• Define variables clearly.


• Write down inequalities from word problem.
• Draw graph of inequalities (shade unwanted side).
• Identify feasible region (overlap of inequalities).
• Find corner points.
• Substitute corner points into objective function.
• Choose maximum/minimum.

3. Inequalities in Graphs

• ≤ or ≥ → solid line (boundary included).


• < or > → dashed line (boundary not included).
• Shading: test a point (e.g., (0,0)) to decide side.

4. Corner Point Principle

• Maximum or minimum of objective function always occurs at a corner point.

5. Common Exam Types

• Production problems: maximize profit / minimize cost.


• Resource problems: restrictions on materials, labour, or time.
• Transport/Allocation problems: decide how many of each item to use.

6. Quick Exam Tips

• Label axes clearly.


• Mark feasible region with shading or outline.
• Check inequality direction carefully.
• Write final answer as: 'Maximum profit is … at (x,y)=…'.
• If integers required, test nearest integer points.

You might also like