linear-programming pulp coin-or-cbc coin-or-clp

Objective Lower Bound command? Using PULP with COIN_CMD/CBC/CLP

I'm using PULP to solve an LP with CBC with a fracgap(epgap) of 0.01 (99.99%). Is there a command to return the best lower bound found after the solver finishes? So, whatever the solver is comparing the objective value to in order to know its within 0.01 and it can stop.

Solution

Sorry but Pulp does not return the best bound of the solution, with COIN_CMD(). I think it is printed to stdout if msg=1 is used if you just what to see what it is.

How to add a rounding constraint which takes floor value of 2 floats decision variable - Gurobi
How to solve linear optimization problems with 1D-array constrain in scipy?
Determine allocation of values - Python
How to create a binary on-off switch for 2 variables using glpk linear programming?
Python Pulp linear programming with dynamic constraint
Solving linear system of equations with constraints on unknowns
Why does cv::solveLP() impose the constraint x>=0 and what to do if your solution space can be negative?
How many decision variables can be solved for Mixed Integer Programming?
Limit Coin-OR CLP variables to integers
How to ensure that a value is a member of a set of decision variables in ortools
Use min/max operator inside integer linear programming constraint
how to implement alldifferent constraint except 0 in ortools
linprog doesn't match expected output
How to get final attempted solutions from scipy.optimize.linprog when problem is infeasible
Minimizing the L1 norm of Ax - b using scipy.optimize.linprog
Schedule Optimization Problem don't know a better way to present the solution - Python / Gekko
Pyomo: Why is the solver finding a value outside the specified domain?
Assignment problem using scipy optimize linprog to solve in Python
In an ILP problem, is it possible to constrain/penalize the number of decision variables used?
Linear Programming problem with variable multi-way duty swap
Distribute a list of positive numbers into a desired number of sets, aiming to have sums as close as possible between them
Simultaneous Spacing and Duration Constraints with time gaps in Gekko
Linear Programming - variable that equals the sign of an expression
Linear program solver CBC seems to give 'optimal' solutions with different objective for the exact same problem (and code)
PYOMO: LP Heat storage optimalization problem, I want to define the domain of a variable with discrete floats
Time-based spacing constraints in Gekko
Dealing with Non-Optimal Solutions from Gekko
How to use layered conditional constraints in Gekko
How to enforce specific elements in a vector to be in an optimization solution in Gekko
How to handle optimizing across vectors in Gekko