#include <ufl.hpp>
Definition at line 31 of file ufl.hpp.
◆ UFL()
◆ ~UFL()
◆ compute_rc()
compute reduced costs
- Parameters
-
u | (IN) the dual variables |
rc | (OUT) the reduced cost with respect to the dual values |
Implements VOL_user_hooks.
◆ solve_subproblem()
Solve the subproblem for the subgradient step.
- Parameters
-
dual | (IN) the dual variables |
rc | (IN) the reduced cost with respect to the dual values |
lcost | (OUT) the lagrangean cost with respect to the dual values |
x | (OUT) the primal result of solving the subproblem |
v | (OUT) b-Ax for the relaxed constraints |
pcost | (OUT) the primal objective value of x |
Implements VOL_user_hooks.
◆ heuristics()
Starting from the primal vector x, run a heuristic to produce an integer solution
- Parameters
-
x | (IN) the primal vector |
heur_val | (OUT) the value of the integer solution (return DBL_MAX here if no feas sol was found |
Implements VOL_user_hooks.
◆ fcost
◆ dist
◆ fix
◆ ncust
◆ nloc
◆ ix
◆ icost
The documentation for this class was generated from the following file: