Finding the dual of the inner problem in robust linear optimization

155 Views Asked by At

I am trying to understand robust linear program, specifically the dual of the inner program. Can somebody help me understand the equality, in the dual for the inner maximization problem. Since, in duality >= is replaced by <= and vice versa.

Robust inner LP Dual