X - UWSpace - University of Waterloo

END
- solve ; if it is infeasible or unbounded, send stop signal to SPI and stop. P is
-
infeasible or the Assumption is violated;
- if stop signal from SPI is received, stop, P is infeasible;
1 1
- otherwise. record optimal primal solution x? . y?
Step 1. Set k=k+l. exchange information. modify SP2 and solve it.
- set x:" = (xrk*'. xT1) and Y: - (y:-?,
k-1 -
k- 1 k- t k- l
- send (CR + drv2 ). LiLv2 and (B~.$' + L~v?"') to SPI;
- receive (ni%, + W~'-'L~~), ol"'~~~, and (irik'lbi + mik-%) from SPI;
-
k k k k k k k
- solve spi ; record optimal -2 . .rr . and irz , oz . pi , pz . pk-l ;
- send ::
k
and receive :I .
Step 1. Test for convergence: if rt - zik 5 E. go to step 3; othenuise. go to step 1.
Step 3. Send pk-' to and nceive hk-' h m SPI. Cdculate the optimal primal and dual
k k
Yote thût .p . y? and R:. would not actudly be passed because there cm be a more
h- t
efficient communication scheme by exchanging smailer size vectors such as Litvz , oi"'~12
4- 1 k- l
and cg: + drvz . etc. if there are some sood feasible solutions available to the original
problem. they may be used as a wum stan since they always satisfy the consuaints of spf - and
-
which don't have À nor 0, nor cuts, thus saving efforts to find initial feasible solutions for