Closed dxyzx0 closed 1 year ago
Run clp and then
primalweight?? or dualbound??
to get a brief description
@jjhforrest Thanks. I can understand the primal simplex, it's a composite simplex method. But I'm confused with the description in the dual simplex method.
If a problem has both upper and lower bounds then it is trivial to get dual feasible by setting non basic variables to correct bound. If the gap between the upper and lower bounds of a variable is more than the value of dualBound Clp introduces fake bounds so that it can make the problem dual feasible. This has the same effect as a composite objective function in the primal algorithm.
dualbound
?
In the doc and source code, it says CLP uses a one phase method.
Can you give some reference about this method? Is it a composite simplex method?