Notes
Slide Show
Outline
1
Linear Programming Graph:
an automated presentation
  • © Duncan Williamson
  • April 2002
2
The Problem We’re Solving
  • The problem that this presentation is designed to help you solve is to


  • Maximise π = 4a + 3b
  • Subject to: 21a + 16b ≤ 336
  •                         13a + 25b ≤ 325
  •                         15a + 18b ≤ 270
  •                          a, b ≥ 0
3
 
4
 
5
 
6
The results mean …
  • The optimum level of output, therefore, is


  • 16 units of a
  • 0 units of b


  • giving the maximum profit of 64
7
Add a contribution line
8
That’s all folks!
  • That’s my introduction to the graphical solution to a two variable, three constraint Linear Programming problem


  • You can replay the demonstration as much as you like, of course.


  • © Duncan Williamson April 2002