โ† Operations Research learning path
Operations Research ยท Module 2 of 10

Linear programming formulation

Writing problems as linear models.

๐Ÿ“– Key ideas

  1. Linear programming (LP) has a linear objective and linear constraints.
  2. Standard form: maximise or minimise c1x1 + c2x2 subject to constraints and x >= 0.
  3. Non-negativity constraints ensure quantities are not negative.
  4. Assumptions: proportionality, additivity, divisibility and certainty.
  5. 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