Solving Multi-ObjectiveeLinearrProgramminggProblem by Using Revised Simplex Method and N.S. Advanced Approach

Abstract

This study introduces a Revised Simplex approach for solving linear programming problems (SLPP) and proposes the S.N. Advanced Technique, which converts multi-objectiveilinear programminggproblems (MOLPP) into ssingle-objectivee linear programminggproblems (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. 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