Which optimisation algorithms use or rely on the dual of a linear program?
I know that Benders decomposition uses the dual of the subproblem to derive additional constraints, but I would like to find more examples.
Which optimisation algorithms use or rely on the dual of a linear program?
I know that Benders decomposition uses the dual of the subproblem to derive additional constraints, but I would like to find more examples.
Copyright © 2021 JogjaFile Inc.