We have presented computational testing of the linear programming-based lower bound for the quadratic as- signment problem studied by Drezner. To solve the lin-ear programs we use the code first ...

can be solved by solving an equivalent linear complementarity problem when H is positive semidefinite. The approach is outlined in the discussion of the LCP subroutine in Chapter 17, "Language ...

This is a preview. Log in through your library . Abstract We provide an abstract principle aimed at proving that classes of optimization problems are typically well posed in the sense that the ...