Results 1 to 2 of 2

Math Help - Branch and Bound

  1. #1
    Member
    Joined
    Oct 2008
    Posts
    156

    Branch and Bound

    I have a general question: In the branch and bound method for solving integer programming problems, you can have more than one optimal solution right?

    E.g I had as possible optimal solutions:  (x_{1}, x_{2}) = (5,1) where  z = 6 and  (x_{1}, x_{2}) = (6,1) where  z = 6 . These are both leaf nodes. This is for a maximization problem.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Member
    Joined
    Oct 2008
    Posts
    156
    Also if you find two adjacent leaves, are these most likely the optimal solutions?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 0
    Last Post: February 19th 2010, 02:06 AM
  2. greatest least bound and least upper bound proof
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: November 4th 2009, 05:44 PM
  3. branch-and-bound tree for solving IPs
    Posted in the Pre-Calculus Forum
    Replies: 3
    Last Post: April 26th 2009, 06:36 AM
  4. Integer Programming - Branch-and-Bound
    Posted in the Advanced Algebra Forum
    Replies: 2
    Last Post: May 17th 2008, 06:35 AM
  5. least upper bound and greatest lower bound
    Posted in the Calculus Forum
    Replies: 2
    Last Post: September 22nd 2007, 10:59 AM

Search Tags


/mathhelpforum @mathhelpforum