Linear Programming with Uncertain Data: Some Extensions to Robust Optimization

Full text for this resource is not available from the Research Repository.

Craven, Bruce Desmond and Islam, Sardar M. N (2012) Linear Programming with Uncertain Data: Some Extensions to Robust Optimization. Journal of Optimization Theory and Applications, 155 (2). pp. 673-679. ISSN 0022-3239 (print), 1573-2878 (online)


An optimization problem often has some uncertain data, and the optimum of a linear program can be very sensitive to small changes in the data. Such a problem can often be modified to a robust program, which is more stable to such changes. Various methods for this are compared, including requiring all versions of the data to be satisfied together (but they may be inconsistent), worst-case MAX–MIN model, and various models where deviations incur penalty costs. Existing methods require substantial computation. It is shown here that smaller computations often suffice; not all cases need be considered. Other penalty methods are suggested, using different norms. Moreover, perturbations of constraint coefficients can be represented by suitable perturbations of a requirement vector.

Dimensions Badge

Altmetric Badge

Item type Article
DOI 10.1007/s10957-012-0035-4
Official URL
Subjects Historical > FOR Classification > 0103 Numerical and Computational Mathematics
Historical > Faculty/School/Research Centre/Department > Centre for Strategic Economic Studies (CSES)
Keywords ResPubID25756, ResPubID26504, optimisation, mathematical models
Citations in Scopus 6 - View on Scopus
Download/View statistics View download statistics for this item

Search Google Scholar

Repository staff login