blob: 8643a5716b53a509f5c95456df9939da3cfae996 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
|
// (C) Copyright International Business Machines Corporation 2007
// All Rights Reserved.
// This code is published under the Eclipse Public License.
//
// Authors :
// Pierre Bonami, International Business Machines Corporation
//
// Date : 04/23/2007
#ifndef BonAuxInfos_H
#define BonAuxInfos_H
#include <cstdlib>
#include <vector>
#include "OsiAuxInfo.hpp"
#include "CoinSmartPtr.hpp"
#include "BonTypes.hpp"
namespace Bonmin {
/** Bonmin class for passing info between components of branch-and-cuts.*/
class AuxInfo : public OsiBabSolver {
public:
/** Default constructor.*/
AuxInfo(int type);
/** Constructor from OsiBabSolver.*/
AuxInfo(const OsiBabSolver &other);
/** Copy constructor.*/
AuxInfo(const AuxInfo &other);
/** Destructor.*/
virtual ~AuxInfo();
/** Virtual copy constructor.*/
virtual OsiAuxInfo * clone() const;
/** Declare the node to be feasible.*/
void setFeasibleNode(){
infeasibleNode_ = false;}
/** Declare the node to be infeasible.*/
void setInfeasibleNode(){
infeasibleNode_ = true;}
/** Say if current node is found feasible by cut generators.*/
bool infeasibleNode(){
return infeasibleNode_;}
/** Get solution found by nlp solver (or NULL if none found).*/
const double * nlpSolution(){
if(hasNlpSolution_)
return nlpSolution_;
else
return NULL;
}
/** Get objective value of nlp solution found, or +infinity if none exists */
double nlpObjValue ();
/** Pass a solution found by an nlp solver.*/
void setNlpSolution(const double * sol, int numcols, double objValue);
/** Say if has an nlp solution*/
void setHasNlpSolution(bool b){
hasNlpSolution_ = b;}
/** get the best solution computed with alternative objective function.*/
const std::vector<double>& bestSolution2() const
{
return (*bestSolution2_)();
}
/** return objective value of the best solution computed with alternative
objective function.*/
double bestObj2() const
{
return (*bestObj2_)();
}
/** Set an alternate objective value.*/
void setBestObj2(double o)
{
(*bestObj2_)() = o;
}
void setBestSolution2(int n, double * d)
{
(*bestSolution2_)().clear();
(*bestSolution2_)().insert((*bestSolution2_)().end(),d, d+n);
}
protected:
/** Say if current node was found infeasible during cut generation*/
bool infeasibleNode_;
/** value of the objective function of this nlp solution */
double objValue_;
/** nlp solution found by heuristic if any.*/
double * nlpSolution_;
/** numcols_ gives the size of nlpSolution_.*/
int numcols_;
/** say if has a solution.*/
bool hasNlpSolution_;
/** Stores the solution with alternate objective.*/
Coin::SmartPtr< SimpleReferenced<std::vector<double> > > bestSolution2_;
/** Alternate solution objective value.*/
Coin::SmartPtr< SimpleReferenced<double> > bestObj2_;
};
}/* End namespace.*/
#endif
|
