Modelling with Linear Relationships
The feasible region: Introduction (Fete stall series Part 1)

Modelling with Linear Relationships

Linear Algebra Skills

• Finding the gradient between coordinates
• Graphing linear equations (slope-intercept form)
• Graphing linear equations (general form)
• Vertical and horizontal lines
• Finding equations of linear graphs in slope-intercept form (part 1)
• Finding equations of linear graphs in slope-intercept form (part 2)
• Finding equations of linear graphs in general form

Solving Simultaneous Equations (Cycling Puzzle Series)

• Introduction (Cycling Puzzle Part 1)
• Graphical solution (Cycling Puzzle Part 2)
• Solution by substitution (Cycling Puzzle Part 3)
• ​Solution by elimination (Cycling Puzzle Part 4)​

 ​The Feasible Region (Fete Stall Series)

• Introduction (Fete Stall Part 1)
• Graphing the feasible region (Fete Stall Part 2)
• Defining the feasible region (Fete Stall Part 3)
• Setting up additional constraints (Fete Stall Part 4)

​​Linear Programming Skills

• Constructing constraints
• Graphing constraints
• Finding the optimal solution
• Considering Wastage
• Dealing with Discrete Only Solutions

Linear programming is a method of solving problems where at least two people or products compete for limited resources. From the constraints imposed by the limited resources, we can determine a set of feasible solutions to the problem. We can then use an algorithm to identify the optimal solution(s) according to a particular objective, such as maximising or minimising cost. In this series of videos we will explore how we go about this.