| Term | Meaning | In the tailor problem |
|---|---|---|
| Decision variables | The unknown quantities to be decided; always non-negative | x shirts, y kurtas |
| Objective function | The linear function Z = ax + by to be maximised or minimised | Z = 100x + 180y |
| Constraints | Linear inequalities or equations that the variables must satisfy | 2x + 3y ≤ 60, x + 2y ≤ 35 |
| Non-negative restrictions | The conditions x ≥ 0, y ≥ 0 | Cannot make a negative number of garments |
| Optimal value | The maximum or minimum value of Z | To be found |
Parts of a linear programming problem
-
Decision variables
- x, y ≥ 0
- What we choose
-
Objective function
- Z = ax + by
- Maximise profit or minimise cost
-
Constraints
- Linear inequalities such as 2x + 3y ≤ 60
- Come from limited resources or requirements
An LPP: optimise a linear objective function Z = ax + by subject to linear constraints and x ≥ 0, y ≥ 0.
- An optimisation problem seeks the best value of a quantity under limits.
- In an LPP, the objective function and all constraints are linear, and the variables are non-negative.
- Decision variables are the quantities you choose; constraints come from limited resources or minimum requirements.
- 'At most' becomes ≤; 'at least' becomes ≥.
- Trying plans by hand shows the need for a systematic method, developed in the next lessons.