Home > Operation Research calculators > Branch and Bound method calculator

 
Solve the Linear programming problem using
Branch and Bound method calculator
Type your linear programming problem


OR
Total Variables :   Total Constraints :    
Click On Generate
Mode :
  1. MAX Z = 100x1 + 150x2
    subject to
    8000x1 + 4000x2 <= 40000
    15x1 + 30x2 <= 200
    and x1,x2 >= 0
  2. MAX Z = 7x1 + 9x2
    subject to
    -x1 + 3x2 <= 6
    7x1 + x2 <= 35
    x2 <= 7
    and x1,x2 >= 0
  3. MAX Z = 3x1 + 5x2
    subject to
    2x1 + 4x2 <= 25
    x1 <= 8
    2x2 <= 10
    and x1,x2 >= 0
  4. MIN Z = 3x1 + 2.5x2
    subject to
    x1 + 2x2 >= 20
    3x1 + 2x2 >= 50
    and x1,x2 >= 0
  5. MAX Z = 2x1 + 3x2
    subject to
    4x1 + 12x2 <= 33
    10x1 + 4x2 <= 35
    and x1,x2 >= 0
 
SolutionHelpBranch and Bound method

 
Copyright © 2018. All rights reserved. Terms, Privacy