Abstract
The values of optimal solutions to the various dual relaxations of integer programs can be viewed as functions of their multipliers. Successful search procedures have been developed for optimal lagrangian (piecewise linear concave) and surrogate (quasi-concave) multipliers. This note demonstrates that the composite and multiple surrogate dual functions lack quasi-concavity and may possess “false optima.” For the composite dual, complementary and alternate optimization over lagrangian and surrogate multipliers are shown to be nonoptimal techniques. However, some promising computational results, based on closing part of the gap between the surrogate dual and the primal, are reported for the alternating approach.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
