title: How to solve Linear Programming Problem with more than one optimal solution using pulp
body: <p>I want to solve an LPP which has more than one optimal solution. How can I do that?
  For Example:
  Maximize 2000x1 + 3000x2</p>
  
  <p>subject to</p>
  
  <p>6x1 + 9x2 ≤ 100
  2x1 + x2 ≤ 20</p>
  
  <p>x1, x2 ≥ 0</p>
  
  <p>In this LPP problem, there is more than one optimal solution i.e (0,100/9) and (20/3,20/3). When I solve this problem using the pulp library, it gives me only a (0,100/9) solution. I want all the possible solutions.</p>