A+ » VCE » Further Maths U3 & 4 Master Notes » OA4 Graphs and Relations » 2.5 Integer Solutions for Linear Programming Problems

2.5 Integer Solutions for Linear Programming Problems

Note: if you cannot remember how to analyse linear programming problems using graphical methods, revise notes for 2.4 Graphical Method for Solving Linear Programming Problems.

Integer Solutions for Linear Programming Problems

  • When using graphical methods for solving linear programming problems, we are presented with a region which encompasses all possible solutions. If the decision variables are continuous any point within this region it corresponds to a feasible solution. However, if we are dealing with discrete variables, only a finite number of points within this region will correspond to values the variables can actually take on.
  • If the region is sufficiently small, it is possible for us to find all possible solutions for a linear programming problem with integer solutions.
This content is for Master Notes FM members only. Unlock the content by signing up for a membership level - quick and easy!
Log InSign Up