It is shown that the surrogate dual of a 0-1 programming problem can be solved by 0(m3) knapsack calls, if m denotes the number of constraints.
All Science Journal Classification (ASJC) codes
- Management Science and Operations Research
- 0-1 programming
- ellipsoid algorithm
- surrogate constraints
- surrogate dual