Lines Matching refs:iBlock
134 int iBlock; in main() local
136 iBlock = rowBlock[iRow]; in main()
137 if (iBlock >= 0) in main()
138 rowBlock[iRow] = iBlock % 50; in main()
141 iBlock = columnBlock[iColumn]; in main()
142 if (iBlock >= 0) in main()
143 columnBlock[iColumn] = iBlock % 50; in main()
164 int iBlock; in main() local
165 for (iBlock = 0; iBlock < numberBlocks; iBlock++) { in main()
169 if (iBlock == rowBlock[iRow]) in main()
172 if (iBlock == columnBlock[iColumn]) in main()
174 sub[iBlock] = ClpSimplex(&model, numberRow2, whichRow, in main()
178 double * upper = sub[iBlock].columnUpper(); in main()
187 if (iBlock != columnBlock[iColumn]) in main()
190 top[iBlock] = matrix; in main()
228 int iBlock; in main() local
230 for (iBlock = 0; iBlock < numberBlocks; iBlock++) { in main()
231 int iRow = iBlock + numberMasterRows;; in main()
234 rowAdd[iBlock] = iRow; in main()
235 elementAdd[iBlock] = 1.0; in main()
236 objective[iBlock] = 1.0e9; in main()
237 columnAdd[iBlock+1] = iBlock + 1; in main()
238 when[iBlock] = -1; in main()
239 whichBlock[iBlock] = iBlock; in main()
310 for (iBlock = 0; iBlock < numberBlocks; iBlock++) { in main()
311 int numberColumns2 = sub[iBlock].numberColumns(); in main()
313 double * objective2 = sub[iBlock].objective(); in main()
316 top[iBlock].transposeTimes(dual, objective2); in main()
325 sub[iBlock].primal(); in main()
328 if (sub[iBlock].numberIterations() || !iPass) { in main()
332 if (sub[iBlock].isProvenOptimal()) { in main()
333 const double * solution = sub[iBlock].primalColumnSolution(); in main()
334 top[iBlock].times(solution, elementAdd + start); in main()
355 dj -= dual[numberMasterRows+iBlock]; in main()
356 rowAdd[number] = numberMasterRows + iBlock; in main()
361 iBlock, smallest, largest, dj); in main()
367 whichBlock[numberColumnsGenerated++] = iBlock; in main()
369 } else if (sub[iBlock].isProvenDualInfeasible()) { in main()
371 const double * solution = sub[iBlock].unboundedRay(); in main()
372 top[iBlock].times(solution, elementAdd + start); in main()
393 iBlock, smallest, largest, dj); in main()
399 whichBlock[numberColumnsGenerated++] = iBlock; in main()
440 for (iBlock = 0; iBlock < numberBlocks; iBlock++) { in main()
442 top[iBlock].reverseOrdering(); in main()
447 if (whichBlock[i-numberMasterColumns] == iBlock) in main()
462 sub[iBlock].addRows(numberMasterRows, lower, upper, in main()
463 top[iBlock].getVectorStarts(), in main()
464 top[iBlock].getVectorLengths(), in main()
465 top[iBlock].getIndices(), in main()
466 top[iBlock].getElements()); in main()
467 sub[iBlock].primal(); in main()
468 const double * subSolution = sub[iBlock].primalColumnSolution(); in main()
469 const double * subRowSolution = sub[iBlock].primalRowSolution(); in main()
473 if (columnBlock[iColumn] == iBlock) { in main()
474 model.setStatus(iColumn, sub[iBlock].getStatus(kColumn)); in main()
478 assert(kColumn == sub[iBlock].numberColumns()); in main()
481 if (rowBlock[iRow] == iBlock) { in main()
482 model.setRowStatus(iRow, sub[iBlock].getRowStatus(kRow)); in main()
486 assert(kRow == sub[iBlock].numberRows() - numberMasterRows); in main()