Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
lpsolution.h
Go to the documentation of this file.
1
30#pragma once
31
33
34namespace abacus {
35
36
37class Master;
38class Sub;
39template<class BaseType, class CoType> class Active;
40template<class CoType,class BaseType> class Separator;
41
42template <class BaseType, class CoType>
43class LpSolution;
44
45template <class BaseType, class CoType>
46std::ostream &operator<< (std::ostream &out, const LpSolution<BaseType, CoType> &rhs);
47
48
50
63template <class BaseType, class CoType>
64class LpSolution : public AbacusRoot {
65
66 friend class Separator< CoType, BaseType>;
67
68public:
69
71
81
83
87
89
93
96
98
104 friend std::ostream &operator<< <> (std::ostream &out, const LpSolution<BaseType, CoType> &rhs);
105
107 int nVarCon() const;
108
110 double *zVal();
111
113 const double *zVal() const;
114
117
119 int idSub() const;
120
122 int idLp() const;
123
124
125protected:
127
129 int idSub_;
130 int idLp_;
131
134
135private:
138};
139
140
141}
142
Base class of all other classes of ABACUS.
Definition abacusroot.h:68
Implements the sets of active constraints and variables which are associated with each subproblem.
Definition active.h:62
LP solutions.
Definition lpsolution.h:64
Array< double > zVal_
The primal/dual variables of the LP solution.
Definition lpsolution.h:132
int idSub_
The Id of the subproblem in which the LP solution was generated.
Definition lpsolution.h:129
int nVarCon_
The number of variables/constraints.
Definition lpsolution.h:128
LpSolution(Master *master)
The constructor.
~LpSolution()
The destructor.
LpSolution(Sub *sub, bool primalVariables, Active< BaseType, CoType > *active)
The constructor.
LpSolution(const LpSolution< BaseType, CoType > &rhs)
The copy constructor.
Active< BaseType, CoType > * active()
Returns the active variables/constraints.
const LpSolution< BaseType, CoType > & operator=(const LpSolution< BaseType, CoType > &rhs)
Active< BaseType, CoType > * active_
The active variables/constraints.
Definition lpsolution.h:133
Master * master_
A pointer to the corresponding master of the optimization.
Definition lpsolution.h:126
const double * zVal() const
Returns the primal/dual variables of the LP solution.
int nVarCon() const
Returns the number of variables (if BaseType is Variable) or the number of constraints (if BaseType i...
int idLp() const
Returns the Id of the LP in which the LP solution was generated.
double * zVal()
Returns the primal/dual variables of the LP solution.
int idLp_
The Id of the LP in which the LP solution was generated.
Definition lpsolution.h:130
int idSub() const
Returns the Id of the subproblem in which the LP solution was generated.
The master of the optimization.
Definition master.h:69
Separators.
Definition separator.h:66
The subproblem.
Definition sub.h:68
The parameterized class Array implements dynamic arrays of type E.
Definition Array.h:214
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
std::ostream & operator<<(std::ostream &out, const Active< BaseType, CoType > &rhs)