Handling uncertainty is important in decision making, especially for SDGs problems. Robust Optimization (RO) is an applied optimization method that can be employed to handle optimization under uncertain data. With SDGs problems, many uncertain data have been considered in decision making. With RO, the data uncertainties are assumed to lay within a compact, convex continuous set. There are three special sets that can be used to represent the data, i.e., box, ellipsoidal, or polyhedral uncertainty sets. These special sets lead the SDGs problems to a computationally tractable optimization model, such that the global optimal solution is attained. However, literature reviews on the application of RO in SDGs decision-making is sparse, especially during the COVID-19 pandemic period. This paper examines the following topics: (1) the purposes of studies of RO and SDGs during the COVID-19 pandemic, (2) the state-of-the-art in RO-SDGs to determine the research objectives, and (3) the SDGs type of problems that have been modeled using RO. A systematic literature review is conducted in this paper, wherein discussion is based on a PRISMA (Preferred Reporting Items for Systematic Review and Meta-Analyses) flowchart. To this end, the database reference searching conducted on the Scopus, Science Direct, and SAGE databases, is completed using the help RStudio software. The analysis was carried out on two datasets, assisted by the output visualization using RStudio software with the “bibliometrix” package, and using the ‘biblioshiny()’ command to create a link to the “shiny web interface”. In this paper, the research gap on application of RO to SDGs problems is analyzed in order to identify the research objectives, methods, and specific RO-SDGs problems. As a result, the application of RO to SDGs problems is rare; this finding provides a motivation to conduct a further study of RO and SDGs during the COVID-19 pandemic. An expansion is presented using the key phrase “Operations Research and Optimization Modeling”, or “OROM”. SDGs in Indonesia may be referenced as an example of the capacity building available through RO/OROM.

Multi-objective integer optimization model that contain uncertain parameter can be handled using the Adjustable Robust Counterpart (ARC) methodology with Polyhedral Uncertainty Set. The ARC method has two stages of completion, so completing the second stage can be assisted by the Benders Decomposition. This paper discusses the systematic review on this topic using the Preferred Reporting Items for Systematic Reviews and Meta-Analysis (PRISMA). PRISMA presents a database mining algorithm for previous articles and related topics sourced from Scopus, Science Direct, Dimensions, and Google Scholar. Four stages of the algorithm are used, namely Identification, Screening, Eligibility, and Included. In the Eligibility stage, 16 articles obtained and called Dataset 1, used for bibliometric mapping and evolutionary analysis. Moreover, in the Included stage, six final databases obtained and called Dataset 2, which was used to analyze research gaps and novelty. The analysis was carried out on two datasets, assisted by the output visualisation using RStudio software with the " bibliometrix" package, then we use the command 'biblioshiny()' to create a link to the “shiny web interface”. At the final stage of the article using six articles analysis, it is concluded that there is no research on the ARC multi-objective integer optimization model with Polyhedral Uncertainty Sets using the Benders Decomposition Method, which focuses on discussing the general model and its mathematical analysis. Moreover, this research topic is open and becomes the primary references for further research in connection.

In this paper, the implementation of the Benders decomposition method to solve the Adjustable Robust Counterpart for Internet Shopping Online Problem (ARC-ISOP) is discussed. Since the ARC-ISOP is a mixed-integer linear programming (MILP) model, the discussion begins by identifying the linear variables in the form of continuous variables and nonlinear variables in the form of integer variables. In terms of Benders decomposition, the ARC-ISOP model can be solved by partitioning them into smaller subproblems (the master problem and inner problem), which makes it easier for computational calculations. Pseudo-codes in Python programming language are presented in this paper. An example case is presented for the ARC-ISOP to determine the optimal total cost (including product price and shipping cost) and delivery time. Numerical simulations were carried out using Python programming language with case studies in the form of five products purchased from six shops.