Prior content: None
Previous Section: The Travelling Salesman Problem*
Next Section: The Simplex Algorithm*
Contents
- Whole Topic Notes
- 6A Linear Programming Problems
- 6B Graphical Methods
- 6C Locating the Optimal Point
- 6D Solutions with Integer Values
- Whole Topic Summary Resources (Including Past Paper Questions)
Whole Topic Notes
Full Notes to Accompany Examples
Dr Frost
- Dr Frost Decision 1 Linear Programming Section
- Dr Frost Decision 1 Linear Programming Slides
FMSP Whole Chapter Videos
- FMSP Decision 1 (AS) playlist (Courtesy of MEI)
6A Linear Programming Problems
Textbook resources
FMSP Video Courtesy of MEI
Dr Frost resources
No Live Lesson Video Yet
Download Slides
Key Skills
Note all numbers are subject to change and will be updated once all key skills have been finished by Dr Frost
- 924a: Understand terms such as decision variables, objective function and constraints in a linear programming problem.
- 924b: Form an inequality in two variables as the constraint of a linear programming problem.
- 924c: Form multiple inequalities in two variables as the constraint of a linear programming problem.
- 924d: Form an expression for the objective function of a linear programming problem.
- 924: Exam Practice: Linear programming
6B Graphical Methods
Textbook resources
FMSP Video Courtesy of MEI
Dr Frost resources
No Live Lesson Video Yet
Download Slides
Key Skills
Note all numbers are subject to change and will be updated once all key skills have been finished by Dr Frost
6C Locating the Optimal Point
Textbook resources
FMSP Video Courtesy of MEI
Dr Frost resources
No Live Lesson Video Yet
Download Slides
Key Skills
Note all numbers are subject to change and will be updated once all key skills have been finished by Dr Frost
- 924f: State the maximum or minimum value of the objective function and the values of the decision variables which achieve this.
- 924g: Use the vertex testing method with a given feasible region to maximise or minimise the objective function.
- 924h: Use an objective line with a given feasible region to maximise or minimise the objective function.
- 924i: Solve a linear programming problem from a modelled context.
- 924: Exam Practice: Linear programming
6D Solutions with Integer Values
Textbook resources
FMSP Video Courtesy of MEI
Dr Frost resources
No Live Lesson Video Yet
Download Slides
Key Skills
Note all numbers are subject to change and will be updated once all key skills have been finished by Dr Frost
Whole Topic Summary Resources (Including Past Paper Questions)
External whole topic past paper style questions
- WW Dr Frost Style QQQs (Version 1) Word Doc, PDF (Q’s Only) or PDF (Q’s & Sol.)
- WW Dr Frost Style QQQs (Version 2) Word Doc, PDF (Q’s Only) or PDF (Q’s & Sol.)