Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is there a way to get the branch and bound algorithm to converge to a solution "close" to an initial value?

One way I can think of, is to adding a "distance from initial value" term to the cost function. However, this makes the linear problem quadratic.

To give you a brief understanding of the problem I am working on:

Machines are to be allocated to various factories in certain packaging formats. Thus when the required capacity increases, my code throws up solutions where too many machines get relocated.

How do I get to the optimum solution which is closest to the current machine configuration?

share|cite|improve this question

migrated from May 3 '12 at 19:26

This question came from our site for professional and enthusiast programmers.

up vote 2 down vote accepted

You can keep the linearity. Just minimize the sum of the absolute values the differences. Instead of

min abs(x)


min (zp + zm)
    x = zp - zm
    zp >= 0
    zm >= 0
share|cite|improve this answer
Thanks for the idea. Also found a useful bag of tricks on the AIMMS website – Shamps May 4 '12 at 12:00
Yes, that is a good document. This trick with the absolute values is 6.1 in it. Anyway, good luck! – Ali May 4 '12 at 14:16

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.