Solving Multi-Objective Linear Programming Problem by Using Revised Simplex Method and S.N. Advanced Approach

Abstract

This study introduces a Revised Simplex approach for solving linear programming problems (SLPP) and proposes the Shaida, Nejmaddin, Advanced( S. N. Advanced Technique), which converts multi-objective linear programming problems (MOLPP) into single-objective linear programming problems (SOLPP). An algorithm was developed specifically for the S.N. Advanced Technique to address MOLPPs, and an updated version of Chandra Sen’s method was integrated with a new algorithm for solving such problems. This is the first time this road has been worked on, and the first time the algorithm for the Chandra Sen’s method has been developed. The proposed methods were validated through extensive numerical testing, demonstrating their effectiveness and competitiveness compared to existing approaches, highlighting their practicality and efficiency in addressing complex optimization challenges