IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v486y2025ics0096300324005058.html
   My bibliography  Save this article

Linear programming with infinite, finite, and infinitesimal values in the right-hand side

Author

Listed:
  • Cococcioni, Marco
  • Fiaschi, Lorenzo

Abstract

The goal of this work is to propose a new type of constraint for linear programs: inequalities having infinite, finite, and infinitesimal values in the right-hand side. Because of the nature of such constraints, the feasible region polyhedron becomes more complex, since its vertices can be represented by non-purely finite coordinates, and so is the optimum of the problem. The introduction of such constraints enlarges the class of linear programs, where those described by finite values only become a special case. To tackle optimization problems over such polyhedra, there is a need for an ad-hoc solving routine: this work proposes a generalization of the Simplex algorithm, which is able to solve common linear programs as corner cases. Finally, the study presents three relevant applications that can benefit from the use of these novel constraints, making the use of the extended Simplex algorithm essential. For each application, an exemplifying benchmark is solved, showing the effectiveness of the proposed routine.

Suggested Citation

  • Cococcioni, Marco & Fiaschi, Lorenzo, 2025. "Linear programming with infinite, finite, and infinitesimal values in the right-hand side," Applied Mathematics and Computation, Elsevier, vol. 486(C).
    • Handle: RePEc:eee:apmaco:v:486:y:2025:i:c:s0096300324005058
    DOI: 10.1016/j.amc.2024.129044
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324005058
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.129044?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:apmaco:v:486:y:2025:i:c:s0096300324005058. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.