|
|
Just a pointer to model is kept
|
| | Idiot () |
| | Default constructor. More...
|
| |
| | Idiot (OsiSolverInterface &model) |
| | Constructor with model. More...
|
| |
| | Idiot (const Idiot &) |
| | Copy constructor. More...
|
| |
| Idiot & | operator= (const Idiot &rhs) |
| | Assignment operator. This copies the data. More...
|
| |
| | ~Idiot () |
| | Destructor. More...
|
| |
|
| void | solve () |
| | Get an approximate solution with the idiot code. More...
|
| |
| void | crash (int numberPass, CoinMessageHandler *handler, const CoinMessages *messages, bool doCrossover=true) |
| | Lightweight "crash". More...
|
| |
| void | crossOver (int mode) |
| | Use simplex to get an optimal solution mode is how many steps the simplex crossover should take to arrive to an extreme point: 0 - chosen,all ever used, all 1 - chosen, all 2 - all 3 - do not do anything - maybe basis. More...
|
| |
|
| OsiSolverInterface * | model_ |
| | Underlying model. More...
|
| |
| double | djTolerance_ |
| |
| double | mu_ |
| |
| double | drop_ |
| |
| double | muFactor_ |
| |
| double | stopMu_ |
| |
| double | smallInfeas_ |
| |
| double | reasonableInfeas_ |
| |
| double | exitDrop_ |
| |
| double | muAtExit_ |
| |
| double | exitFeasibility_ |
| |
| double | dropEnoughFeasibility_ |
| |
| double | dropEnoughWeighted_ |
| |
| int * | whenUsed_ |
| |
| int | maxBigIts_ |
| |
| int | maxIts_ |
| |
| int | majorIterations_ |
| |
| int | logLevel_ |
| |
| int | logFreq_ |
| |
| int | checkFrequency_ |
| |
| int | lambdaIterations_ |
| |
| int | maxIts2_ |
| |
| int | strategy_ |
| |
| int | lightWeight_ |
| |
| double | getStartingWeight () const |
| | Starting weight - small emphasizes feasibility, default 1.0e-4. More...
|
| |
| void | setStartingWeight (double value) |
| |
| double | getWeightFactor () const |
| | Weight factor - weight multiplied by this when changes, default 0.333. More...
|
| |
| void | setWeightFactor (double value) |
| |
| double | getFeasibilityTolerance () const |
| | Feasibility tolerance - problem essentially feasible if individual infeasibilities less than this. More...
|
| |
| void | setFeasibilityTolerance (double value) |
| |
| double | getReasonablyFeasible () const |
| | Reasonably feasible. More...
|
| |
| void | setReasonablyFeasible (double value) |
| |
| double | getExitInfeasibility () const |
| | Exit infeasibility - exit if sum of infeasibilities less than this. More...
|
| |
| void | setExitInfeasibility (double value) |
| |
| int | getMajorIterations () const |
| | Major iterations. More...
|
| |
| void | setMajorIterations (int value) |
| |
| int | getMinorIterations () const |
| | Minor iterations. More...
|
| |
| void | setMinorIterations (int value) |
| |
| int | getMinorIterations0 () const |
| |
| void | setMinorIterations0 (int value) |
| |
| int | getReduceIterations () const |
| | Reduce weight after this many major iterations. More...
|
| |
| void | setReduceIterations (int value) |
| |
| int | getLogLevel () const |
| | Amount of information - default of 1 should be okay. More...
|
| |
| void | setLogLevel (int value) |
| |
| int | getLightweight () const |
| | How lightweight - 0 not, 1 yes, 2 very lightweight. More...
|
| |
| void | setLightweight (int value) |
| |
| int | getStrategy () const |
| | strategy More...
|
| |
| void | setStrategy (int value) |
| |
| double | getDropEnoughFeasibility () const |
| | Fine tuning - okay if feasibility drop this factor. More...
|
| |
| void | setDropEnoughFeasibility (double value) |
| |
| double | getDropEnoughWeighted () const |
| | Fine tuning - okay if weighted obj drop this factor. More...
|
| |
| void | setDropEnoughWeighted (double value) |
| |
| void | setModel (OsiSolverInterface *model) |
| | Set model. More...
|
| |
| void | solve2 (CoinMessageHandler *handler, const CoinMessages *messages) |
| | Stuff for internal use. More...
|
| |
| IdiotResult | IdiSolve (int nrows, int ncols, double *rowsol, double *colsol, double *pi, double *djs, const double *origcost, double *rowlower, double *rowupper, const double *lower, const double *upper, const double *element, const int *row, const CoinBigIndex *colcc, const int *length, double *lambda, int maxIts, double mu, double drop, double maxmin, double offset, int strategy, double djTol, double djExit, double djFlag, CoinThreadRandom *randomNumberGenerator) |
| |
| int | dropping (IdiotResult result, double tolerance, double small, int *nbad) |
| |
| IdiotResult | objval (int nrows, int ncols, double *rowsol, double *colsol, double *pi, double *djs, const double *cost, const double *rowlower, const double *rowupper, const double *lower, const double *upper, const double *elemnt, const int *row, const CoinBigIndex *columnStart, const int *length, int extraBlock, int *rowExtra, double *solExtra, double *elemExtra, double *upperExtra, double *costExtra, double weight) |
| |
| int | cleanIteration (int iteration, int ordinaryStart, int ordinaryEnd, double *colsol, const double *lower, const double *upper, const double *rowLower, const double *rowUpper, const double *cost, const double *element, double fixTolerance, double &objChange, double &infChange, double &maxInfeasibility) |
| |
This class implements a very silly algorithm.
It has no merit apart from the fact that it gets an approximate solution to some classes of problems. Better if vaguely homogeneous. It works on problems where volume algorithm works and often gets a better primal solution but it has no dual solution.
It can also be used as a "crash" to get a problem started. This is probably its most useful function.
It is based on the idea that algorithms with terrible convergence properties may be okay at first. Throw in some random dubious tricks and the resulting code may be worth keeping as long as you don't look at it.
Definition at line 48 of file Idiot.hpp.
