IDEAS home Printed from https://ideas.repec.org/p/osf/osfxxx/v6eua_v1.html
   My bibliography  Save this paper

Alternative Approach to Solving Linear Programming Problems Using Binary Search

Author

Listed:
  • Ordobaev, Amirhan

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.

Suggested Citation

  • Ordobaev, Amirhan, 2025. "Alternative Approach to Solving Linear Programming Problems Using Binary Search," OSF Preprints v6eua_v1, Center for Open Science.
    • Handle: RePEc:osf:osfxxx:v6eua_v1
    DOI: 10.31219/osf.io/v6eua_v1
    as

    Download full text from publisher

    File URL: https://osf.io/download/67e3c9ceccb5e970c06b4358/
    Download Restriction: no
    File URL: https://libkey.io/10.31219/osf.io/v6eua_v1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:osf:osfxxx:v6eua_v1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: OSF (email available below). General contact details of provider: https://osf.io/preprints/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.