Linear programming problems + Graphical methods
- Decision variables in a linear programming problem are the numbers of each of the things that can be varied.
- Constraints are the things that will prevent you from making, or using, an infinite number of each of the variables. (i.e. quantity of raw material, time available)
- A feasible solution is one where the values of the decision variable satisfy the constraints.
- In a graphical linear programming problem, the feasible solutions (values that satisfy the constraints) lie in the feasible region. The feasible region is unshaded.
- There can be more than one optimal solution.
- To formulate a problem as a linear programming problem:
- Define the decision variable
- State the objective (maximise or minimise with the objective function)
- Write the constraints as inequalities.
