 |
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
34 #pragma GCC visibility push(default)
40 template<
class BaseType,
class CoType>
class Active;
41 template<
class CoType,
class BaseType>
class Separator;
43 template <
class BaseType,
class CoType>
46 template <
class BaseType,
class CoType>
64 template <
class BaseType,
class CoType>
114 const double *
zVal()
const;
145 #pragma GCC visibility pop
Implements the sets of active constraints and variables which are associated with each subproblem.
LpSolution(Sub *sub, bool primalVariables, Active< BaseType, CoType > *active)
The constructor.
~LpSolution()
The destructor.
Active< BaseType, CoType > * active_
The active variables/constraints.
const LpSolution< BaseType, CoType > & operator=(const LpSolution< BaseType, CoType > &rhs)
int idLp() const
Returns the Id of the LP in which the LP solution was generated.
Active< BaseType, CoType > * active()
Returns the active variables/constraints.
std::ostream & operator<<(std::ostream &out, const Active< BaseType, CoType > &rhs)
int nVarCon_
The number of variables/constraints.
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.
Master * master_
A pointer to the corresponding master of the optimization.
Base class of all other classes of ABACUS.
int idSub() const
Returns the Id of the subproblem in which the LP solution was generated.
The parameterized class Array implements dynamic arrays of type E.
Array< double > zVal_
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 idSub_
The Id of the subproblem in which the LP solution was generated.
The master of the optimization.