Application of robust optimization for a linear model of operation of a small enterprise

Iryna V. Alieksieieva, Tetiana I. Perevozniuk

Abstract


In this paper the modern approach of solving linear optimization problems with uncertainty is presented. It involves the construction of a robust counterpart of the initial deterministic problem.

Depending on the uncertainty sets, a robust optimization problem is brought either to a standard linear programming problem, or to a more complex nonlinear problem. Using the robust linear model, the problem of finding the income of a small enterprise for various types of uncertainty sets is solved. Numerical realization of solutions is made using the package of MATLAB applications.

Keywords


Optimization problem; Robust optimization; Robust counterpart; Uncertainty set.

References


Ben-Tal, A., & Nemirovski, A. (1998). Robust convex optimization. Mathematics of operations research, 23 (4), 769–805. https://doi.org/10.1287/moor.23.4.769

Ben-Tal, A., & Nemirovski, A. (2002). Robust optimization–methodology and applications. Mathematical Programming, 92 (3), 453–480. https://doi.org/10.1007/s101070100286

Bertsimas, D., & Sim, M. (2004). The price of robustness. Operations research, 52 (1), 35–53. https://doi.org/10.1287/opre.1030.0065

Goryashko, A. P., & Nemirovski, A. S. (2014). Robust energy cost optimization of water distribution system with uncertain demand. Automation and Remote Control, 75 (10), 1754–1769. https:/doi.org/10.1134/S000511791410004X

Li, Z., Ding, R., & Floudas, C. A. (2011). A comparative theoretical and computational study on robust counterpart optimization: I. robust linear optimization and robust mixed integer linear optimization. Industrial & engineering chemistry research, 50 (18), 10567–10603. https://doi.org/10.1021/ie200150p

Li, Z., Tang, Q., & Floudas, C. A. (2012). A comparative theoretical and computational study on robust counterpart optimization: II. Probabilistic guarantees on constraint satisfaction. Industrial & engineering chemistry research, 51 (19), 6769–6788. https://doi.org/10.1021/ie201651s

Soyster, A. L. (1973). Convex programming with set-inclusive constraints and applications to inexact linear programming. Operations research, 21 (5), 1154–1157. https://doi.org/10.1287/opre.21.5.1154






Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.