Application of disjunctive programming to the linear complementarity problem |
| |
| Authors: | B Ramarao C M Shetty |
| |
| Institution: | School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332 |
| |
| 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. |
| |
| Keywords: | |
|
|
