Alternative Approach to Solving Linear Programming Problems Using Binary Search

Linear programming (LP) problems play a central role in optimization theory and have significant importance across various fields, fromeconomics to engineering. Among the numerous methods proposedfor solving these problems, the Simplex method remains one of themost well-known and widely used. However, despite its efficiency, thismethod has certain limitations, particularly in terms of high computational costs and slow convergence when dealing with large or sparsedata. In response to these challenges, this article proposes an alternative approach based on binary search, which could significantly improve the efficiency of solving linear programming problems. This approach was developed during the study of the ”Operations Research”course and represents an interesting attempt to propose an alternativeto classical methods.