Enhanced Intersection Cutting-Plane Approach for Linear Complementarity Problems

Journal of Optimization Theory and Applications

Volumn 90, Issue 1, 1996, Pages 183-201

  Sherali, H D ^a   Krishnamurthy, R S ^b   Al Khayyal, F A ^c  

^a Virginia Polytechnic Institute and State University   (United States)

^b SIEMENS CORPORATE RESEARCH   (United States)

^c Georgia Institute of Technology   (United States)

Author keywords

Bilinear programming; Cutting planes; Intersection cuts; Linear complementarity problems; Nonconvex programming; Vertex ranking

Indexed keywords

OPERATIONS RESEARCH;

BILINEAR PROGRAMMING; CUTTING PLANE ALGORITHMS; CUTTING PLANES; CUTTING-PLANE APPROACH; FEASIBLE REGIONS; INTERSECTION CUT; LINEAR COMPLEMENTARITY PROBLEMS; NON-CONVEX PROGRAMMING; PROBLEM SOLUTIONS; VERTEX-RANKING;

INTEGER PROGRAMMING;

EID: 0030555263     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02192252     Document Type: Article

References (26)

1. BERSHCHANSKII, Y. M. and MEEROV, M. V., The Complementarity Problem: Theory and Methods of Solution, Automation and Remote Control, Vol. 44, pp. 687-710, 1983.
2. COTTLE, R. W., PANG, J. S., and STONE, R. E., The Linear Complementarity Problem, Academic Press, San Diego, California, 1991.
3. MURTY, K. G., Linear Complementarity, Linear and Nonlinear Programming, Helderman Verlag, Berlin, Germany, 1988.
4. KARMARKAR, N., A New Polynomial-Time Algorithm for Linear Programming, Combinatorica, Vol. 4, pp. 373-395, 1984.
5. KOJIMA, M., MEGIDDO, N., NOMA, T., and YOSHISE, A., A Unified Approach to Interior-Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Science, Springer Verlag, Berlin, Germany, Vol. 538, 1991.
6. PARDALOS, P. M., YE, Y., HAN, C. G., and KALINSKI, J., Solution of P-Matrix Linear Complementarity Problems Using a Potential Reduction Algorithm, SIAM Journal on Matrix Analysis and Applications, Vol. 14, pp. 1048-1060, 1993.
7. YE, Y., and PARDALOS, P. M., A Class of Linear Complementarity Problems Solvable in Polynomial Time, Linear Algebra and Its Applications, Vol. 152, pp. 3-17, 1991.
8. RAMARAO, B., and SHETTY, C. M., Application of Disjunctive Programming to the Linear Complementarity Problem, Naval Research Logistics Quarterly, Vol. 31, pp. 589-600, 1984.
9. AL-KHAYYAL, F. A., Implicit Enumeration Procedure for the Linear Complementarity Problem, Mathematical Programming Study, Vol. 17, pp. 1-21, 1987.
10. PARDALOS, P. M., and ROSEN, J. B., Global Optimization Approach to the Linear Complementarity Problem, SIAM Journal on Scientific and Statistical Computing, Vol. 9, pp. 341-353, 1988.
11. PARDALOS, P. M., The Linear Complementarity Problem, Advances in Optimization and Numerical Analysis, Edited by S. Gomez and J. P. Hennart, Kluwer Publishers, Dordrecht, Holland, pp. 39-49, 1994.
12. AL-KHAYYAL, F. A., On Solving Linear Complementarity Problems as Bilinear Programs, Arabian Journal for Science and Engineering, Vol. 15, pp. 639-646, 1990.
13. SHERALI, H. D., and SHETTY, C. M., A Finitely Convergent Algorithm for Bilinear Programming Problems Using Polar Cuts and Disjunctive Face Cuts, Mathematical Programming, Vol. 19, pp. 14-31, 1980.
14. BALAS, E., Intersection Cuts: A New Type of Cutting Planes for Integer Programming, Operations Research, Vol. 19, pp. 19-39, 1971.
15. GLOVER, F., Polyhedral Convexity Cuts and Negative Edge Extensions, Zeitschrift für Operations Research, Vol. 18, pp. 181-186, 1974.
16. TUY, H., Concave Programming under Linear Constraints, Soviet Mathematics, Vol. 5, pp. 1437-1440, 1964.
17. KONNO, H., A Cutting Plane Algorithm for Solving Bilinear Programs, Mathematical Programming, Vol. 11, pp. 14-27, 1977.
18. RITTER, K., A Method for Solving Maximum Problems with a Nonconcave Quadratic Objective Function, Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, Vol. 4, pp. 340-351, 1966.
19. VAISH, H., and SHETTY, C. M., A Cutting Plane Algorithm for the Bilinear Programming Problem, Naval Research Logistics Quarterly, Vol. 24, pp. 83-94, 1977.
20. AL-KHAYYAL, F. A., and FALK, J. E., Jointly Constrained Biconvex Programming, Mathematics of Operations Research, Vol. 8, pp. 273-286, 1983.
21. SHERALI, H. D., and ALAMEDDINE, A., A New Reformulation-Linearization Technique for Solving Bilinear Programming Problems, Journal of Global Optimization, Vol. 2, pp. 379-410, 1992.
22. MURTY, K., Solving the Fixed-Charge Problem by Ranking the Extreme Points, Operations Research, Vol. 16, pp. 268-279, 1968.
23. WALLACE, S. W., Pivoting Rules and Redundancy Schemes in Extreme-Point Enumeration, BIT, Vol. 25, pp. 274-280, 1985.
24. PARDALOS, P. M., and ROSEN, J. B., Bounds for Solution Sets of Linear Complementarity Problems, Discrete Applied Mathematics, Vol. 17, pp. 255-261, 1987.
25. L'ECUYER, P., and COTE, S., Implementing a Random Number Package with Splitting Facilities, ACM Transactions on Mathematical Software, Vol. 17, pp. 98-111, 1991.
26. MARSTEN, R. E., The Design of the XMP Linear Programming Library, ACM Transactions on Mathematical Software, Vol. 7, pp. 481-497, 1981.