I know there is a generic code for solving the lagrangian relaxation of an LP. However, for an integer program, sometimes you want some constraints relaxed, but not all. For example, I want the equality constraints dualized, but not the inequality constraints.

Is there existing code for solving the lagrangian dual of an Integer Program using the subgradient method, where only some of the constraints are dualized?

I'd like to be able to print out the dual and primal variables at each iteration.


1 Answer 1


One example of this would be the DSP software package developed at Argonne National Labs:



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.