โ Operations Research learning pathOperations Research ยท Module 2 of 10
Linear programming formulation
Writing problems as linear models.
๐ Key ideas
- Linear programming (LP) has a linear objective and linear constraints.
- Standard form: maximise or minimise c1x1 + c2x2 subject to constraints and x >= 0.
- Non-negativity constraints ensure quantities are not negative.
- Assumptions: proportionality, additivity, divisibility and certainty.
- Common uses: product mix, diet, blending and staff scheduling.
๐ก Real-life example: Like deciding how many chairs and tables to make with limited wood and labour to earn the most.
Linear programmingOptimisation with linear objective and constraints
Non-negativityVariables cannot be negative
Product mix problemChoosing quantities of products
DivisibilityVariables can take fractional values