4
votes
Accepted
Can one strengthen the Lagrangian dual bound in column generation when there are multiple subproblems?
Yes, that bound is valid, and you can prove it by exhibiting a dual feasible solution with that objective value. I don’t have my copy handy, but Wolsey’s Integer Programming shows this. In fact, the ...
- 30.4k
3
votes
Accepted
Electricity market clearing price using fixed-MIP formulation?
I've gained sufficient information in last couple of weeks to write an answer myself.
As a prerequisite to the discussion, please note the difference between uniform vs non-uniform market clearing ...
- 189
1
vote
Accepted
Question about Pricing Problem in Column Generation
You don't really derive $y^\prime = c_B^\prime B^{-1}$, you just set $y$ to that expression. At every iteration but the last of the simplex method on the primal problem, $x_B = B^{-1}b$ and $x_N = 0$ ...
- 37.8k
Only top scored, non community-wiki answers of a minimum length are eligible