×

zbMATH — the first resource for mathematics

Robust regret for uncertain linear programs with application to co-production models. (English) Zbl 1292.90195
Summary: This paper considers the regret optimization criterion for linear programming problems with uncertainty in the data inputs. The problems of study are more challenging than those considered in previous works that address only interval objective coefficients, and furthermore the uncertainties are allowed to arise from arbitrarily specified polyhedral sets. To this end a safe approximation of the regret function is developed so that the maximum regret can be evaluated reasonably efficiently by leveraging on previous established results and solution algorithms. The proposed approach is then applied to a two-stage co-production newsvendor problem that contains uncertainties in both supplies and demands. Computational experiments demonstrate that the proposed regret approximation is reasonably accurate, and the corresponding regret optimization model performs competitively well against other optimization approaches such as worst-case and sample average optimization across different performance measures.

MSC:
90C05 Linear programming
90B30 Production models
PDF BibTeX XML Cite
Full Text: DOI