Revisiting the upper bounding process in a safe Branch and Bound algorithm

Details Revisiting the upper bounding process in a safe Branch and Bound algorithm Revisiting the upper bounding process in a safe Branch and Bound algorithm

2008-07-15

arxiv.org/abs/0807.2382v1

Computer Science

Numerical Analysis

Optimization, continuous domains, nonlinear constraint problems, safe constraint based approaches; 14th International Conferen

Scientific paper

Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce a new strategy to compute very accurate approximations of feasible points. This strategy takes advantage of the Newton method for under-constrained systems of equations and inequalities. More precisely, it exploits the optimal solution of a linear relaxation of the problem to compute efficiently a promising upper bound. First experiments on the Coconuts benchmarks demonstrate that this approach is very effective.

Affiliated with

Also associated with

No associations

Rating

Revisiting the upper bounding process in a safe Branch and Bound algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Revisiting the upper bounding process in a safe Branch and Bound algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Revisiting the upper bounding process in a safe Branch and Bound algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-596256