Jeyakumar, V.; Li, G. - In: European Journal of Operational Research 207 (2010) 3, pp. 1203-1209
It is known that convex programming problems with separable inequality constraints do not have duality gaps. However, strong duality may fail for these programs because the dual programs may not attain their maximum. In this paper, we establish conditions characterizing strong duality for convex...