[Coin-lpsolver] optimality of a dual solution after rhs change

[Stefan Vigerske]

Hi,

I'm using CLP to generate cutting planes for a function which is the minimum 
of a linear program with varying right hand side.

I noticed that there are methods getReducedGradient and setObjectiveAndRefresh 
in OsiClpSolverInterface to check whether a primal solution (basis) is still 
optimal after a change of the objective function.
Similarly, I would like to know, if it is possible to check whether a dual 
solution is still optimal after a change of the right-hand-side of the primal 
problem.

Thanks a lot,
Stefan

-- 
Stefan Vigerske
Humboldt University Berlin, Numerical Mathematics
http://www.math.hu-berlin.de/~stefan