Branch and Bound For Exact Solutions
As well as its uses in approximation, linear programming plays an important role in branch and bound algorithms for computing the true optimum solution to hard optimization problems.
If some variables in the optimal solution have fractional values, we may start a branch and bound type process, in which we recursively solve subproblems in which some of the fractional variables have their values fixed to either zero or one. In each step of an algorithm of this type, we consider a subproblem of the original 0-1 integer program in which some of the variables have values assigned to them, either 0 or 1, and the remaining variables are still free to take on either value. In subproblem i, let Vi denote the set of remaining variables. The process begins by considering a subproblem in which no variable values have been assigned, and in which V0 is the whole set of variables of the original problem. Then, for each subproblem i, it performs the following steps.
- Compute the optimal solution to the linear programming relaxation of the current subproblem. That is, for each variable xj in Vi, we replace the constraint that xj be 0 or 1 by the relaxed constraint that it be in the interval ; however, variables that have already been assigned values are not relaxed.
- If the current subproblem's relaxed solution is worse than the best integer solution found so far, backtrack from this branch of the recursive search.
- If the relaxed solution has all variables set to 0 or 1, test it against the best integer solution found so far and keep whichever of the two solutions is best.
- Otherwise, let xj be any variable that is set to a fractional value in the relaxed solution. Form two subproblems, one in which xj is set to 0 and the other in which xj is set to 1; in both subproblems, the existing assignments of values to some of the variables are still used, so the set of remaining variables becomes Vi \ {xj}. Recursively search both subproblems.
Although it is difficult to prove theoretical bounds on the performance of algorithms of this type, they can be very effective in practice.
Read more about this topic: Linear Programming Relaxation
Famous quotes containing the words branch, bound, exact and/or solutions:
“What can the dove of Jesus give
You now but wisdom, exile? Stand and live,
The dove has brought an olive branch to eat.”
—Robert Lowell (1917–1977)
“We that are bound by vows and by promotion,
With pomp of holy sacrifice and rites,
To teach belief in good and still devotion,
To preach of heaven’s wonders and delights—
Yet, when each of us in his own heart looks,
He finds the God there far unlike his books.”
—Fulke Greville (1554–1628)
“The first moments of sleep are an image of death; a hazy torpor grips our thoughts and it becomes impossible for us to determine the exact instant when the “I,” under another form, continues the task of existence.”
—Gérard De Nerval (1808–1855)
“The anorexic prefigures this culture in rather a poetic fashion by trying to keep it at bay. He refuses lack. He says: I lack nothing, therefore I shall not eat. With the overweight person, it is the opposite: he refuses fullness, repletion. He says, I lack everything, so I will eat anything at all. The anorexic staves off lack by emptiness, the overweight person staves off fullness by excess. Both are homeopathic final solutions, solutions by extermination.”
—Jean Baudrillard (b. 1929)