124 references j lf t hermansson and r sderberg chase

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: zs < z*, record Xs as the best solution found so far and set z* := zs c. else if zs < z*, repeat from 2. with P := Ps and X := Xs 5. return X* 0. 1. 2. 3. 122 J. Lööf, T. Hermansson and R. Söderberg The algorithm terminates when an optimal solution is encountered. The Dual Simplex Method [Nash and Sofer, 1996] solves the dual LPs in each step. Since adding a constraint in the primal LP corresponds to adding a variable in the dual LP, the solution to the previous dual LP is still a basic feasible solution. Hence, the initialization step of Simplex, namely finding a basic solution, is already done (a ‘warm start’). This results in heavily reduced computational time. Branching in a more sophisticated way can further reduce the time. One example of that is considering the sub-problem with greatest bound z first. The proposed algorithm has been implemented in C++ as a module coupled with commercial CAT software [RD&T, 2002]. 4.3. Test results and discussion The module has been tested on a real car model (Figure 1). This te...
View Full Document

This note was uploaded on 08/03/2010 for the course DD 1234 taught by Professor Zczxc during the Spring '10 term at Magnolia Bible.

Ask a homework question - tutors are online