Computational Methods for Solving Large-Scale Linear Programming Problems: A Comparative Study

Abstract

Linear programming problems play a crucial role in optimization and decision-making across various domains. Solving large-scale linear programming problems efficiently remains a significant computational challenge. This paper presents a comprehensive comparative study of various computational methods used for solving large-scale linear programming problems. Through empirical analysis and performance evaluation, we assess the strengths and limitations of different approaches, providing insights into their applicability and efficiency in practical problem-solving scenarios.