Robust Linear Programming with Norm Uncertainty
We consider the linear programming problem with uncertainty set described by p,w-norm. We suggest that the robust counterpart of this problem is equivalent to a computationally convex optimization problem. We provide probabilistic guarantees on the feasibility of an optimal robust solution when the...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2014/209239 |