Adapted w.a.co. algorithm

(General loop)

While $r_{1} : 2 < r_{1} \leq m$ , $r_{2} : 2 < r_{2} \leq m$ , do

Select: m₁ = theconstraints of rnd1 set that their rank is $\geq r_{1}$

Select: m₂ = the constraints of rnd2 set that their rank is $\geq r_{2}$

If $m_{1} \cap m_{2} = \emptyset$ , then

use the subset $m_{1} \cup m_{2}$

If the problem (1) is feasible, then

solve the problem (1) using an LP method - STOP

else

select $r_{1}_n e w < r_{1}$ and $r_{2}_n e w < r_{2}$

solve the problem (1)

end second if

else

if $m_{1} \cap m_{2} = \emptyset$ & $m_{1} + m_{2} = m$ , then

solve the problem (1) using an LP method - STOP

end first if

p.bind, used, m₁, m₂, common

end while