ClpSimplexProgress Class Reference

For saving extra information to see if looping. More...

#include <ClpSimplex.hpp>

List of all members.

Public Member Functions
Constructors and destructor and copy
	ClpSimplexProgress ()
	Default constructor.
	ClpSimplexProgress (ClpSimplex *model)
	Constructor from model.
	ClpSimplexProgress (const ClpSimplexProgress &)
	Copy constructor.
ClpSimplexProgress &	operator= (const ClpSimplexProgress &rhs)
	Assignment operator. This copies the data.
	~ClpSimplexProgress ()
	Destructor.
Check progress
int	looping ()
void	startCheck ()
	Start check at beginning of whileIterating.
int	cycle (int in, int out, int wayIn, int wayOut)
	Returns cycle length in whileIterating.
double	lastObjective (int back=1) const
	Returns previous objective (if -1) - current if (0).
void	modifyObjective (double value)
	Modify objective e.g. if dual infeasible in dual.
int	lastIterationNumber (int back=1) const
	Returns previous iteration number (if -1) - current if (0).
void	newOddState ()
	Odd state.
void	endOddState ()
void	clearOddState ()
int	oddState () const
int	badTimes () const
	number of bad times
void	clearBadTimes ()
Public Attributes
Data
double	objective_ [CLP_PROGRESS]
	Objective values.
double	infeasibility_ [CLP_PROGRESS]
	Sum of infeasibilities for algorithm.
double	obj_ [CLP_CYCLE]
	For cycle checking.
int	in_ [CLP_CYCLE]
int	out_ [CLP_CYCLE]
char	way_ [CLP_CYCLE]
ClpSimplex *	model_
	Pointer back to model so we can get information.
int	numberInfeasibilities_ [CLP_PROGRESS]
	Number of infeasibilities.
int	iterationNumber_ [CLP_PROGRESS]
	Iteration number at which occurred.
int	numberTimes_
	Number of times checked (so won't stop too early).
int	numberBadTimes_
	Number of times it looked like loop.
int	oddState_
	If things are in an odd state.

---

Detailed Description

For saving extra information to see if looping.

Definition at line 968 of file ClpSimplex.hpp.

---

Member Function Documentation

int ClpSimplexProgress::looping (   )

Returns -1 if okay, -n+1 (n number of times bad) if bad but action taken, >=0 if give up and use as problem status Definition at line 4731 of file ClpSimplex.cpp. References ClpSimplex::algorithm(), ClpSimplex::currentDualTolerance(), ClpSimplex::currentPrimalTolerance(), ClpSimplex::dualBound(), ClpSimplex::forceFactorization(), infeasibility_, ClpSimplex::infeasibilityCost(), iterationNumber_, CoinMessageHandler::logLevel(), CoinMessageHandler::message(), ClpModel::messageHandler(), ClpModel::messages(), model_, ClpSimplex::nonLinearCost(), numberBadTimes_, ClpSimplex::numberDualInfeasibilities(), ClpNonLinearCost::numberInfeasibilities(), numberInfeasibilities_, ClpModel::numberIterations(), ClpSimplex::numberPrimalInfeasibilities(), numberTimes_, objective_, ClpSimplex::progressFlag(), ClpSimplex::rawObjectiveValue(), ClpSimplex::setCurrentDualTolerance(), ClpSimplex::setCurrentPrimalTolerance(), ClpSimplex::setDualBound(), ClpSimplex::setInfeasibilityCost(), ClpSimplex::sumDualInfeasibilities(), and ClpSimplex::sumPrimalInfeasibilities(). Referenced by ClpSimplexDual::statusOfProblemInDual(), ClpSimplexPrimalQuadratic::statusOfProblemInPrimal(), and ClpSimplexPrimal::statusOfProblemInPrimal(). { if (!model_) return -1; double objective = model_->rawObjectiveValue(); double infeasibility; int numberInfeasibilities; int iterationNumber = model_->numberIterations(); if (model_->algorithm()<0) { // dual infeasibility = model_->sumPrimalInfeasibilities(); numberInfeasibilities = model_->numberPrimalInfeasibilities(); } else { //primal infeasibility = model_->sumDualInfeasibilities(); numberInfeasibilities = model_->numberDualInfeasibilities(); } int i; int numberMatched=0; int matched=0; int nsame=0; for (i=0;i<CLP_PROGRESS;i++) { bool matchedOnObjective = equalDouble(objective,objective_[i]); bool matchedOnInfeasibility = equalDouble(infeasibility,infeasibility_[i]); bool matchedOnInfeasibilities = (numberInfeasibilities==numberInfeasibilities_[i]); if (matchedOnObjective&&matchedOnInfeasibility&&matchedOnInfeasibilities) { matched |= (1<<i); // Check not same iteration if (iterationNumber!=iterationNumber_[i]) { numberMatched++; // here mainly to get over compiler bug? if (model_->messageHandler()->logLevel()>10) printf("%d %d %d %d %d loop check\n",i,numberMatched, matchedOnObjective, matchedOnInfeasibility, matchedOnInfeasibilities); } else { // stuck but code should notice nsame++; } } if (i) { objective_[i-1] = objective_[i]; infeasibility_[i-1] = infeasibility_[i]; numberInfeasibilities_[i-1]=numberInfeasibilities_[i]; iterationNumber_[i-1]=iterationNumber_[i]; } } objective_[CLP_PROGRESS-1] = objective; infeasibility_[CLP_PROGRESS-1] = infeasibility; numberInfeasibilities_[CLP_PROGRESS-1]=numberInfeasibilities; iterationNumber_[CLP_PROGRESS-1]=iterationNumber; if (nsame==CLP_PROGRESS) numberMatched=CLP_PROGRESS; // really stuck if (model_->progressFlag()) numberMatched=0; numberTimes_++; if (numberTimes_<10) numberMatched=0; // skip if just last time as may be checking something if (matched==(1<<(CLP_PROGRESS-1))) numberMatched=0; if (numberMatched) { model_->messageHandler()->message(CLP_POSSIBLELOOP,model_->messages()) <<numberMatched <<matched <<numberTimes_ <<CoinMessageEol; numberBadTimes_++; if (numberBadTimes_<10) { // make factorize every iteration model_->forceFactorization(1); if (model_->algorithm()<0) { // dual - change tolerance model_->setCurrentDualTolerance(model_->currentDualTolerance()*1.05); // if infeasible increase dual bound if (model_->dualBound()<1.0e17) { model_->setDualBound(model_->dualBound()*1.1); } } else { // primal - change tolerance if (numberBadTimes_>3) model_->setCurrentPrimalTolerance(model_->currentPrimalTolerance()*1.05); // if infeasible increase infeasibility cost if (model_->nonLinearCost()->numberInfeasibilities()&& model_->infeasibilityCost()<1.0e17) { model_->setInfeasibilityCost(model_->infeasibilityCost()*1.1); } } return -2; } else { // look at solution and maybe declare victory if (infeasibility<1.0e-4) { return 0; } else { model_->messageHandler()->message(CLP_LOOP,model_->messages()) <<CoinMessageEol; #ifndef NDEBUG abort(); #endif return 3; } } } return -1; }

---

The documentation for this class was generated from the following files:

• ClpSimplex.hpp
• ClpSimplex.cpp

---