Limbo
|
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 More... | |
bool | is_lower_bounded () const |
check if the variable is lower bounded More... | |
bool | is_upper_bounded () const |
check if the variable is upper bounded More... | |
bool | is_bounded () const |
check if the variable is bounded More... | |
Public Attributes | |
string | name |
name of variable | |
pair< value_type, value_type > | range |
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 | |
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.
|
inline |
constructor
n | name |
l | lower bound of range, i.e., \(l_i\) |
r | upper bound of range, i.e., \(u_i\) |
w | weight in the objective, i.e., \(c_i\) |
v | solved value |
Definition at line 186 of file LpDualMcf.h.
|
inline |
check if the variable is bounded
Definition at line 201 of file LpDualMcf.h.
|
inline |
check if the variable is lower bounded
Definition at line 195 of file LpDualMcf.h.
|
inline |
check if the variable is upper bounded
Definition at line 198 of file LpDualMcf.h.