IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v31y1984i4p589-600.html
   My bibliography  Save this article

Application of disjunctive programming to the linear complementarity problem

Author

Listed:
  • B. Ramarao
  • C. M. Shetty

Abstract

In this article we address the question of developing deep cuts for disjunctive programs using rectilinear distance measures. The method is applied to linear complementarity problems where the matrix M need not be copositive plus. Some modifications that are needed as a computational expediency are discussed. The computation results for matrix M of size up to 30 × 30 are discussed.

Suggested Citation

  • B. Ramarao & C. M. Shetty, 1984. "Application of disjunctive programming to the linear complementarity problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 31(4), pages 589-600, December.
    • Handle: RePEc:wly:navlog:v:31:y:1984:i:4:p:589-600
    DOI: 10.1002/nav.3800310408
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800310408
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800310408?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Trang T. Nguyen & Jean-Philippe P. Richard & Mohit Tawarmalani, 2021. "Convexification techniques for linear complementarity constraints," Journal of Global Optimization, Springer, vol. 80(2), pages 249-286, June.

    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:wly:navlog:v:31:y:1984:i:4:p:589-600. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.