|
Go to the documentation of this file.
30 #define MAXIMUM(x,y) ((x)>(y) ? (x) : (y))
193 << static_cast<const char*>((tp == LEAVE)
194 ? "leaving" : "entering")
195 << " algorithm" << std::endl; )
450 while (newsize-- > 0)
534 s << "Basis is singular (numerical troubles, feastol = " << feastol() << ", opttol = " << opttol() << ")";
568 MSG_DEBUG( std::cout << "DSOLVE21 fVec: " << ftmp. length() << std::endl; )
578 MSG_DEBUG( std::cout << "DSOLVE23 coPvec: " << ctmp. length() << std::endl; )
588 MSG_DEBUG( std::cout << "DSOLVE24 pVec: " << ptmp. length() << std::endl; )
615 #ifdef ENABLE_ADDITIONAL_CHECKS
631 for ( int i = 0; i < dim(); i++)
643 for ( int i = 0; i < dim(); i++)
650 for ( int i = 0; i < coDim(); i++)
652 if ((* thePvec)[i] > (*theUbound)[i])
654 else if ((* thePvec)[i] < (*theLbound)[i])
668 #ifndef ADDITIONAL_CHECKS
678 for (i = nCols() - 1; i >= 0; --i)
697 for (i = nRows() - 1; i >= 0; --i)
718 for (i = nCols() - 1; i >= 0; --i)
736 for (i = nRows() - 1; i >= 0; --i)
759 for (i = nCols() - 1; i >= 0; --i)
777 for (i = nRows() - 1; i >= 0; --i)
797 #ifdef ADDITIONAL_CHECKS
800 MSG_ERROR( std::cerr << "stored nonbasic value: " << m_nonbasicValue << ", correct nonbasic value: " << val << std::endl; )
844 << ": updated objValue: " << objChange
1157 , theType(base.theType)
1158 , thePricing(base.thePricing)
1159 , theRep(base.theRep)
1160 , timerType(base.timerType)
1161 , theCumulativeTime(base.theCumulativeTime)
1162 , maxIters(base.maxIters)
1163 , maxTime(base.maxTime)
1164 , nClckSkipsLeft(base.nClckSkipsLeft)
1165 , nCallsToTimelim(base.nCallsToTimelim)
1166 , objLimit(base.objLimit)
1167 , m_status(base.m_status)
1168 , m_nonbasicValue(base.m_nonbasicValue)
1169 , m_nonbasicValueUpToDate(base.m_nonbasicValueUpToDate)
1170 , m_entertol(base.m_entertol)
1171 , m_leavetol(base.m_leavetol)
1172 , theShift(base.theShift)
1173 , lastShift(base.lastShift)
1174 , m_maxCycle(base.m_maxCycle)
1175 , m_numCycle(base.m_numCycle)
1176 , initialized(base.initialized)
1178 , solveVector2rhs(base.solveVector2rhs)
1180 , solveVector3rhs(base.solveVector3rhs)
1182 , coSolveVector2rhs(base.coSolveVector2rhs)
1184 , coSolveVector3rhs(base.coSolveVector3rhs)
1185 , instableLeaveNum(base.instableLeaveNum)
1186 , instableLeave(base.instableLeave)
1187 , instableLeaveVal(base.instableLeaveVal)
1188 , instableEnterId(base.instableEnterId)
1189 , instableEnter(base.instableEnter)
1190 , instableEnterVal(base.instableEnterVal)
1191 , displayLine(base.displayLine)
1192 , displayFreq(base.displayFreq)
1193 , sparsePricingFactor(base.sparsePricingFactor)
1194 , unitVecs(base.unitVecs)
1195 , primRhs(base.primRhs)
1196 , primVec(base.primVec)
1197 , dualRhs(base.dualRhs)
1198 , dualVec(base.dualVec)
1199 , addVec(base.addVec)
1200 , theURbound(base.theURbound)
1201 , theLRbound(base.theLRbound)
1202 , theUCbound(base.theUCbound)
1203 , theLCbound(base.theLCbound)
1204 , theUBbound(base.theUBbound)
1205 , theLBbound(base.theLBbound)
1206 , theCoTest(base.theCoTest)
1207 , theTest(base.theTest)
1208 , primalRay(base.primalRay)
1209 , dualFarkas(base.dualFarkas)
1210 , leaveCount(base.leaveCount)
1211 , enterCount(base.enterCount)
1212 , primalCount(base.primalCount)
1213 , boundflips(base.boundflips)
1214 , totalboundflips(base.totalboundflips)
1215 , infeasibilities(base.infeasibilities)
1216 , infeasibilitiesCo(base.infeasibilitiesCo)
1217 , isInfeasible(base.isInfeasible)
1218 , isInfeasibleCo(base.isInfeasibleCo)
1219 , sparsePricingLeave(base.sparsePricingLeave)
1220 , sparsePricingEnter(base.sparsePricingEnter)
1221 , sparsePricingEnterCo(base.sparsePricingEnterCo)
1222 , hyperPricingLeave(base.hyperPricingLeave)
1223 , hyperPricingEnter(base.hyperPricingEnter)
1224 , remainingRoundsLeave(base.remainingRoundsLeave)
1225 , remainingRoundsEnter(base.remainingRoundsEnter)
1226 , remainingRoundsEnterCo(base.remainingRoundsEnterCo)
1227 , spxout(base.spxout)
1310 #ifdef ENABLE_CONSISTENCY_CHECKS
1359 reinterpret_cast<const SVSet*>(static_cast<const LPRowSet*>( this))
1361 reinterpret_cast<const SVSet* >( static_cast<const LPColSet* >( this))
1378 != reinterpret_cast<const SVSet*>(static_cast<const LPColSet*>( this))
1380 != reinterpret_cast<const SVSet*>(static_cast<const LPRowSet*>( this))
1429 if( p_iteration < 0 )
1446 if( maxTime < 0 || maxTime >= infinity )
1516 MSG_ERROR( std::cerr << "ESOLVE26 ERROR: unknown basis status (" << stat << ")"
1531 assert( rhs(row) == lhs(row));
1536 rstat = lhs(row) < rhs(row)
1542 rstat = lhs(row) < rhs(row)
1554 if ( lhs(row) == rhs(row) )
1575 MSG_ERROR( std::cerr << "ESOLVE27 ERROR: unknown VarStatus (" << int(stat) << ")"
1592 else if ( maxObj(col) > 0.0)
1640 MSG_ERROR( std::cerr << "ESOLVE28 ERROR: unknown VarStatus (" << int(stat) << ")"
1649 assert( 0 <= row && row < nRows() );
1655 assert( 0 <= col && col < nCols() );
1664 assert(rowsSize < 0 || rowsSize >= nRows());
1665 assert(colsSize < 0 || colsSize >= nCols());
1668 for (i = nCols() - 1; i >= 0; --i)
1672 for (i = nRows() - 1; i >= 0; --i)
1687 for ( int row = nRows()-1; row >= 0; --row )
1692 else if ( p_rows[row] == BASIC )
1699 if ( (p_rows[row] == FIXED && lhs(row) != rhs(row))
1706 for ( int col = nCols()-1; col >= 0; --col )
1711 else if ( p_cols[col] == BASIC )
1725 if ( basisdim != dim() )
1741 for(i = 0; i < nRows(); i++)
1744 for(i = 0; i < nCols(); i++)
1815 os << "NO_RATIOTESTER";
1827 os << "ABORT_CYCLING";
1836 os << "ABORT_VALUE";
|