Surrogate “level-based” lagrangian relaxation for mixed-integer linear programming

HIGHLIGHTS

SUMMARY

    The Lagrangian multipliers ("dual" variables) are the decision variables with respect to the dual problem, and it is assumed that the set of optimal solutions is not empty. The multipliers are subsequently projected onto the positive orthant delineated by restrictions ≥ 0. To overcome the first two of the difficulties above, the Surrogate Subgradient method was developed ­by23 whereby the exact optimality of the relaxed problem (or even subproblems) is not required. Unlike that in Polyak`s formula, parameter γ is less than 1 to guarantee that q( * ) > L(x̃ k, ỹ k, k ) so that . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?