Two TOPSIS-Based Approaches for Multi-Choice Rough Bi-Level Multi-Objective Nonlinear Programming Problems

Abstract

The multi-choice rough bi-level multi-objective nonlinear programming problem (MR-BLMNPP) has noticeably risen in various real applications. In the current model, the objective functions have a multi-choice parameter, and the constraints are represented as a rough set. In the first phase, Newton divided differences (NDDs) are utilized to formulate a polynomial of the objective functions. Then, based on the rough set theory, the model is converted into an Upper Approximation Model (UAM) and Lower Approximation Model (LAM). In the second phase, two Technique of Order Preferences by Similarity to Ideal Solution (TOPSIS)-based models are presented to solve the MR-BLMNPP. A TOPSIS-based fuzzy max–min and fuzzy goal programming (FGP) model are applied to tackle the conflict between the modified bi-objective distance functions. An algorithm for solving MR-BLNPP is also presented. The applicability and efficiency of the two TOPSIS-based models suggested in this study are presented through an algorithm and a numerical illustration. Finally, the study presents a bi-level production planning model (BL-PPM) as an illustrative application.