Application of disjunctive programming to the linear complementarity problem

B. Ramarao and C. M. Shetty

Naval Research Logistics Quarterly, 1984, vol. 31, issue 4, 589-600

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.

Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/nav.3800310408

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:wly:navlog:v:31:y:1984:i:4:p:589-600

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().