The problem of applying Generalized Lagrange Multipliers (GLM) to 0-1 integer programming problems is investigated. It is shown that GLM can produce optimal solutions if and only if these solutions ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback