An estimate of the rate of convergence of the discrepancy method for a linear programming problem with approximate data

The discrepancy method for the linear programming problem and its dual, with approximate data given in interval form, is considered. The method reduces to a regularized family of problems of the original type. The estimates obtained of the method's rates of convergence are of the same order as the order of the error levels of the input data.