Ignore:
Timestamp:
Nov 8, 2006 9:59:09 AM (13 years ago)
Author:
forrest
Message:

isContinuousUnbounded

File:
1 edited

Legend:

Unmodified
Added
Removed
  • trunk/Cbc/src/CbcModel.cpp

    r480 r483  
    966966      if (!feasible) anyAction = -2 ; }
    967967      if (anyAction == -2||newNode->objectiveValue() >= cutoff)
    968       { delete newNode ;
     968      {
     969        if (anyAction != -2) {
     970          // zap parent nodeInfo
     971          newNode->nodeInfo()->nullParent();
     972        }
     973        delete newNode ;
    969974        newNode = NULL ;
    970975        feasible = false ; } } }
     
    977982  // Save address of root node as we don't want to delete it
    978983  CbcNode * rootNode = newNode;
    979 /*
     984/*g
    980985  The common case is that the lp relaxation is feasible but doesn't satisfy
    981986  integrality (i.e., newNode->variable() >= 0, indicating we've been able to
     
    15061511          // Reset bound anyway (no harm if not odd)
    15071512          solverCharacteristics_->setMipBound(-COIN_DBL_MAX);
     1513          //node->nodeInfo()->decrement();
    15081514        }
    15091515        // May have slipped through i.e. anyAction == 0 and objective above cutoff
     
    15121518        if ( anyAction >=0 ) {
    15131519          assert (newNode);
    1514           if (newNode->objectiveValue() >= getCutoff())
     1520          if (newNode->objectiveValue() >= getCutoff()) {
    15151521            anyAction = -2; // say bad after all
     1522#ifdef COIN_DEVELOP
     1523            printf("zapping2 CbcNodeInfo %x\n",newNode->nodeInfo()->parent());
     1524#endif
     1525            // zap parent nodeInfo
     1526            newNode->nodeInfo()->nullParent();
     1527          }
    15161528        }
    15171529/*
     
    31013113{
    31023114  if (!status_ && bestObjective_>=1.0e30)
     3115    return true;
     3116  else
     3117    return false;
     3118}
     3119// Was continuous solution unbounded
     3120bool
     3121CbcModel::isContinuousUnbounded() const
     3122{
     3123  if (!status_ && secondaryStatus_==7)
     3124    return true;
     3125  else
     3126    return false;
     3127}
     3128// Was continuous solution unbounded
     3129bool
     3130CbcModel::isProvenDualInfeasible() const
     3131{
     3132  if (!status_ && secondaryStatus_==7)
    31033133    return true;
    31043134  else
Note: See TracChangeset for help on using the changeset viewer.