On: Solving a linear optimization problem on incentive allocation

[LolWolf]

Turning a problem into a dual version is mostly a mechanical thing—you can immediately write it down in the case of LPs, for example[0], and many other convex cases [1].

——

[0] https://en.m.wikipedia.org/wiki/Dual_linear_program

[1] http://www.seas.ucla.edu/~vandenbe/236C/lectures/conj.pdf slide 23 on down.

[joker3 → LolWolf]

The procedure is mechanical, but understanding why it works is quite a bit harder.

[LolWolf → joker3]

Oh sure, I agree with that. For more context, I highly recommend chapter 5 in B&V.[0]

——

[0] http://web.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf#page229