Ignore:
Timestamp:
Aug 1, 2002 11:58:30 AM (18 years ago)
Author:
forrest
Message:

For infeasible problems

File:
1 edited

Legend:

Unmodified
Added
Removed
  • branches/devel-1/ClpSimplexPrimal.cpp

    r2 r7  
    584584          printf("** no column pivot\n");
    585585#endif
     586        if (nonLinearCost_->numberInfeasibilities())
     587          problemStatus_=-4; // might be infeasible
    586588        break;
    587589      }
     
    645647  int tentativeStatus = problemStatus_;
    646648
    647   if (problemStatus_>-3) {
     649  if (problemStatus_>-3||problemStatus_==-4) {
    648650    // factorize
    649651    // later on we will need to recover from singularities
     
    666668      changeMade_++; // say change made
    667669    }
    668     problemStatus_=-3;
     670    if (problemStatus_!=-4)
     671      problemStatus_=-3;
    669672  }
    670673  // at this stage status is -3 or -5 if looks unbounded
     
    687690  // we may wish to say it is optimal even if infeasible
    688691  bool alwaysOptimal = (specialOptions_&1)!=0;
    689   if (dualFeasible()) {
     692  if (dualFeasible()||problemStatus_==-4) {
    690693    if (nonLinearCost_->numberInfeasibilities()&&!alwaysOptimal) {
    691694      //may need infeasiblity cost changed
Note: See TracChangeset for help on using the changeset viewer.