Math-LP-Solve
view release on metacpan or search on metacpan
the start index of the next Eta column */
short bb_rule; /* what rule for selecting B&B variables */
short break_at_int; /* TRUE if stop at first integer better than
break_value */
double break_value;
double obj_bound; /* ## Objective function bound for speedup of
B&B */
int iter; /* The number of iterations in the simplex
solver (LP) */
int total_iter; /* The total number of iterations (B&B)
(ILP) */
int max_level; /* The Deepest B&B level of the last solution */
int total_nodes; /* total number of nodes processed in b&b */
double *solution; /* sum_alloc+1 :The Solution of the last LP,
0 = The Optimal Value,
1..rows The Slacks,
rows+1..sum The Variables */
double *best_solution; /* " " :The Best 'Integer' Solution */
double *duals; /* rows_alloc+1 :The dual variables of the
last LP */
( run in 3.171 seconds using v1.01-cache-2.11-cpan-71847e10f99 )