A robust optimization framework for countably infinite linear programs (CILPs) is developed. It is shown that a particular robust counterpart of a nominal CILP can be reformulated as another CILP. A bound on the probability of constraint violation is derived. A convergent algorithm for solving this robust CILP is proposed.
['Archis Ghate']
Robust optimization in countably infinite linear programs