Limbo 3.5.4
Loading...
Searching...
No Matches
limbo::solvers::lpmcf::LpDualMcf< T >::variable_type Class Reference

variable \(x_i\) in the primal linear programming problem. standard format: \(l_i \le x_i \le u_i\) maps to node \(i\), arcs from node \(i\) to node \(st\). More...

#include <LpDualMcf.h>

Public Member Functions

 variable_type (string const &n, value_type const &l=0, value_type const &r=std::numeric_limits< value_type >::max(), value_type const &w=0, value_type const &v=0)
 constructor
bool is_lower_bounded () const
 check if the variable is lower bounded
bool is_upper_bounded () const
 check if the variable is upper bounded
bool is_bounded () const
 check if the variable is bounded

Public Attributes

string name
 name of variable
pair< value_type, value_typerange
 pair of \((l_i, u_i)\)
value_type weight
 weight in the objective, i.e., \(c_i\)
value_type value
 solved value
node_type node
 node \(i\) in the graph

Detailed Description

template<typename T = int64_t>
class limbo::solvers::lpmcf::LpDualMcf< T >::variable_type

variable \(x_i\) in the primal linear programming problem. standard format: \(l_i \le x_i \le u_i\) maps to node \(i\), arcs from node \(i\) to node \(st\).

Definition at line 172 of file LpDualMcf.h.

Constructor & Destructor Documentation

◆ variable_type()

template<typename T = int64_t>
limbo::solvers::lpmcf::LpDualMcf< T >::variable_type::variable_type ( string const & n,
value_type const & l = 0,
value_type const & r = std::numeric_limits<value_type>::max(),
value_type const & w = 0,
value_type const & v = 0 )
inline

constructor

Parameters
nname
llower bound of range, i.e., \(l_i\)
rupper bound of range, i.e., \(u_i\)
wweight in the objective, i.e., \(c_i\)
vsolved value

Definition at line 186 of file LpDualMcf.h.

Member Function Documentation

◆ is_bounded()

template<typename T = int64_t>
bool limbo::solvers::lpmcf::LpDualMcf< T >::variable_type::is_bounded ( ) const
inline

check if the variable is bounded

Returns
true if the variable is eitehr lower bounded or upper bounded

Definition at line 201 of file LpDualMcf.h.

◆ is_lower_bounded()

template<typename T = int64_t>
bool limbo::solvers::lpmcf::LpDualMcf< T >::variable_type::is_lower_bounded ( ) const
inline

check if the variable is lower bounded

Returns
true if the variable has a lower bound

Definition at line 195 of file LpDualMcf.h.

◆ is_upper_bounded()

template<typename T = int64_t>
bool limbo::solvers::lpmcf::LpDualMcf< T >::variable_type::is_upper_bounded ( ) const
inline

check if the variable is upper bounded

Returns
true if the variable is an upper bound

Definition at line 198 of file LpDualMcf.h.

Member Data Documentation

◆ name

template<typename T = int64_t>
string limbo::solvers::lpmcf::LpDualMcf< T >::variable_type::name

name of variable

Definition at line 174 of file LpDualMcf.h.

◆ node

template<typename T = int64_t>
node_type limbo::solvers::lpmcf::LpDualMcf< T >::variable_type::node

node \(i\) in the graph

Definition at line 178 of file LpDualMcf.h.

◆ range

template<typename T = int64_t>
pair<value_type, value_type> limbo::solvers::lpmcf::LpDualMcf< T >::variable_type::range

pair of \((l_i, u_i)\)

Definition at line 175 of file LpDualMcf.h.

◆ value

template<typename T = int64_t>
value_type limbo::solvers::lpmcf::LpDualMcf< T >::variable_type::value

solved value

Definition at line 177 of file LpDualMcf.h.

◆ weight

template<typename T = int64_t>
value_type limbo::solvers::lpmcf::LpDualMcf< T >::variable_type::weight

weight in the objective, i.e., \(c_i\)

Definition at line 176 of file LpDualMcf.h.


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