Research Repository

Linear Programming with Uncertain Data: Some Extensions to Robust Optimization

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)

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

Abstract

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.

Item Type: Article
Uncontrolled Keywords: ResPubID25756, ResPubID26504, optimisation, mathematical models
Subjects: FOR Classification > 0103 Numerical and Computational Mathematics
Faculty/School/Research Centre/Department > Centre for Strategic Economic Studies (CSES)
Depositing User: Yimin Zeng
Date Deposited: 23 Dec 2013 22:38
Last Modified: 03 Feb 2015 23:44
URI: http://vuir.vu.edu.au/id/eprint/23214
DOI: https://doi.org/10.1007/s10957-012-0035-4
ePrint Statistics: View download statistics for this item
Citations in Scopus: 1 - View on Scopus

Repository staff only

View Item View Item

Search Google Scholar