Robust Linear Programming with Norm Uncertainty

Lei Wang and Hong Luo

Journal of Applied Mathematics, 2014, vol. 2014, 1-7

Abstract:

We consider the linear programming problem with uncertainty set described by -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 uncertain coefficients obey independent and identically distributed normal distributions.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2014/209239.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2014/209239.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnljam:209239

DOI: 10.1155/2014/209239

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().