Alternative Approach to Solving Linear Programming Problems Using Binary Search

Amirhan Ordobaev

No v6eua_v1, OSF Preprints from Center for Open Science

Abstract: Linear programming (LP) problems play a central role in optimization theory and have significant importance across various fields, from economics to engineering. Among the numerous methods proposed for solving these problems, the Simplex method remains one of the most well-known and widely used. However, despite its efficiency, this method has certain limitations, particularly in terms of high computational costs and slow convergence when dealing with large or sparse data. In response to these challenges, this article proposes an alternative approach based on binary search, which could significantly im prove 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 alternative to classical methods.

Date: 2025-03-25
References: Add references at CitEc
Citations:

Downloads: (external link)
https://osf.io/download/67e3c9ceccb5e970c06b4358/

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:osf:osfxxx:v6eua_v1

DOI: 10.31219/osf.io/v6eua_v1

Access Statistics for this paper

More papers in OSF Preprints from Center for Open Science
Bibliographic data for series maintained by OSF ().