X - UWSpace - University of Waterloo

short
UpperBound (LpSubProb "LpSub)
.... RECEIVE NECESSARY OTHZR LINKING VARIABLES' DATA .....
.... DELETE UNNECESSARY ROWS FOR THIS Sü1BPROBLEM AND ADD COLUMNS FOR ARTIFICIAL
VARIXBES. U SO, ADD NECESSARY COLüMNS FOR OTHER PART'S LINKING VARIABLES ..-.
status = USetaddcols (LpSub, env. lp) ;
.... OPTIMIZE THE PROBLEM OF THE FIRST ITEIMTION, OBTAIN SOLUTIONS AND WRITE THEM
TO OUTPUT FILE ....
status = CP-Ynewrows (env, Lp, 1, &Lam_rhs, &Lam_sense, WLL, NULL);
while ((iter-counccl50) && (objval[2] - objvai[ll > toi 1 )
(
iter-count = Lter-counc - 1;
..., COMPUTE CX ....
.... S m PRIMAL INFORKATION ?O ;WD RECEIVE DUAL INFORMATION FROM THE AûGEGATED
LOWER BOUND SUSPROBLEM (PROCESSOR I AND 3 1 . . . .
l * find proper dual information adding each information coming frcrn
aggregated lower bound subprobLi (processors 1 and 3 ) */
LpSub[lj->?iS = Lpsub[I]->Pi3 + LpSub[3]->~ia ;
'* Lelste coiumtls for priinai informition of previouç lower level iteration */
scatus = CPXdelcols (env, Ip,
SCb-z[c~r-SiockI~LSPbbn[2]+f,SPbbn[J]+LS?bn[I]LS?bn[3+l, cur-nucols-LI;
scatus = Acidcxts (SpSub, env, Ip, lev2,covmt, Fter,countl ;