Basis- and partition identification for Quadratic Programming and Linear Complementarity Problems

Mathematical Programming, Series B

Volumn 86, Issue 2, 1999, Pages 261-282

  Berkelaar, Arjan B ^a   Jansen, Benjamin ^b   Roos, Kees ^c   Terlaky, Tamás ^c  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^b Centre for Quantitative Methods CQM BV   (Netherlands)

^c DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Balinski Tucker tableaux; Basis recovery; Criss Cross method; Crossover; Interior point methods; Linear complementarity problems; Partition; Principal pivot transforms; Quadratic programming; Sufficient matrices

Indexed keywords

EID: 0007469047     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050089     Document Type: Article

References (48)

1. Andersen, E.D., Ye, Y. (1996): Combining interior-point and pivoting algorithms for linear programming. Manage. Sci. 42, 1719-1731
2. Anstreicher, K., den Hertog, D., Roos, C., Terlaky, T. (1993): A long step barrier method for convex quadratic programming. Algorithmica 10, 365-382
3. Balinski, M.L., Tucker, A.W. (1969): Duality theory of linear programs: A constructive approach with applications. SIAM Rev. 11, 347-377
4. Berkelaar, A.B., Roos, C., Terlaky, T. (1997): The Optimal Set and Optimal Partition Approach. In: Gal, T., Greenberg, H., eds., Recent Advances in Sensitivity Analysis and Parametric Programming, Chapter 6. Kluwer Academic Publishers
5. Bixby, R.E., Saltzman, M.J. (1994): Recovering an optimal LP basis from an interior point solution. Oper. Res. Lett. 15, 169-178
6. Bixby, R.E. (1994): Progress in linear programming. ORSA J. Comp. 6, 15-22
7. Carpenter, T.J., Lustig, I.J., Mulvey, J.M., Shanno, D.F. (1993): Higher order predictor-corrector interior point method. SIAM J. Optim. 3, 696-725
8. Cottle, R.W. (1967): The principal pivoting method of quadratic programming. In: Dantzig, G.B., Veinott, A.F., eds., Mathematics of the Decision Sciences Part I. Lect. Appl. Math. 11, 144-162
9. Cottle, R.W., Dantzig, G.D. (1968): Complementary pivot theory of mathematical programming. Linear Algebra Appl. 1, 103-125
10. Cottle, R.W., Pang, J.S., Stone, R.E. (1992): The Linear Complementarity Problem. Academic Press, San Diego, CA
11. Dantzig, G.D., Cottle, R.W. (1963): Positive (Semi)-Definite Programming, ORC 63-18 (RR), Operations Research Center, University of California, Berkeley. Revised in: Abadie, J., ed., Nonlinear Programming, pp. 55-73. North-Holland, Amsterdam, 1967
12. Fukuda, K., Terlaky, T. (1986): A general algorithmic framework for quadratic programming and a generalization of the Edmonds-Fukuda rule as a finite version of the van de Panne-Whinston method. Reprint, Department of Operations Research. Eötvös University, Budapest, Hungary
13. Goldman, A.J., Tucker, A.W. (1956): Theory of linear programming. In: Kuhn, H.W., Tucker, A.W., eds., Linear Inequalities and Related System. Ann. Math. Studies, No. 38, pp. 53-97. Princeton University Press, Princeton, NJ
14. Gondzio, J., Terlaky, T. (1996): A Computational View of Interior-Point Methods for Linear Programming. In: Beasley, J., ed., Advances in Linear and Integer Programming, pp. 103-144. Oxford University Press, Oxford, England
15. Greenberg, H.J. (1994): The use of the optimal partition in a linear programming solution for postoptimal analysis. Oper. Res. Lett. 15, 179-185
16. Güler, O., Ye, Y. (1993): Convergence behaviour of some interior-point algorithms. Math. Program. 60, 215-228
17. den Hertog, D., Roos, C., Terlaky, T. (1993): The linear complementarity problem, sufficient matrices, and the criss-cross method. Linear Algebra Appl. 187, 1-14
18. Jansen, B., de Jong, J.J., Roos C., Terlaky, T. (1997): Sensitivity analysis in linear programming: Just be careful! Eur. J. Oper. Res. 101, 15-28
19. Jansen, B., Roos, C., Terlaky T. (1994): The theory of linear programming: Skew symmetric self-dual problems and the central path. Optimization 29, 225-233
20. Jansen, B., Roos, C., Terlaky, T., Vial, J.Ph. (1993): Interior-Point Methodology for Linear Programming: Duality, Sensitivity Analysis and Computational Aspects. In: Frauendorfer, K., Glavitsch, H., Bacher, R., eds., Optimization in Planning and Operation of Electric Power Systems, pp. 57-124. Physica-Verlag
21. Keller, E. (1973): The general quadratic optimization problem. Math. Program. 5, 311-337
22. Klafszky, E., Terlaky, T. (1989): Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids. Combinatorica 9(2), 189-198
23. Klafszky, E., Terlaky, T. (1991): The role of pivoting in proving some fundamental theorems of linear algebra. Linear Algebra Appl. 151, 97-118
24. Klafszky, E., Terlaky, T. (1992): Some generalizations of the criss-cross method for quadratic programming. Optimization 24, 127-139
25. Kojima, M., Megiddo, N., Noma, T. (1989): Homotopy Continuation Methods for Complementary Problems. Research Report RJ 6638 (63949). IBM Research, Almaden Research Center, San Jose, CA 95120-6099
26. Kortanek, K.O., Zhu, J. (1988): New purification algorithms for linear programming. Nav. Res. Logist. Quarterly 35, 571-583
27. Lemke, C.E. (1965): Bimatrix equilibrium points and mathematical programming. Manage. Sci. 11, 681-689
28. Lemke, C.E. (1968): On Complementary Pivot Theory. In: Dantzig, G.B., Veinott, A.F., eds., Mathematics of the Decision Sciences Part I. Lect. Appl. Math. 11, 95-114
29. Markowitz, H.M. (1959): Portfolio Selection, Efficient Diversification of Investments. Cowles Foundation for Research in Economics at Yale University, Monograph 16. Wiley, New York
30. McLinden, L. (1980): The analogue of Moreau's proximation theorem, with applications to the nonlinear complementarity problem. Pac. J. Math. 88, 101-161
31. Megiddo, N. (1989): Pathways to the Optimal Set in Linear Programming. In: Megiddo, N., ed., Progress in Mathematical Programming-Interior Point And Related Methods, pp. 131-158. Springer Verlag, New York
32. Megiddo, N. (1991): On finding primal- and dual-optimal bases. ORSA J. Comp. 3, 63-65
33. Monteiro, R.D.C, Tsuchiya, T. (1996): Limiting Behaviour of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem. Math. OR 21, 793-814
34. Mitchell, J.E. (1997): Fixing Variables and Generating Classical Cutting Planes when Using an Interior Point Branch and Cut Method to Solve Integer Programming Problems. Eur. J. Oper. Res. 97, 139-148
35. van de Panne, C., Whinston, A. (1969): The symmetrical formulation of the Simplex method for quadratic programming. Econometrica 37, 507-527
36. Rubin, D.S., Wagner, H.M. (1990): Shadow prices: Tips and traps for managers and instructors. Interfaces 20, 150-157
37. Schrijver, A. (1986): Theory of Linear and Integer Programming. Wiley, New York
38. Strang, G. (1976): Linear Algebra and its Applications. Harcourt, Brace, Jovanovich, San Diego
39. Terlaky, T. (1985): A convergent criss-cross method. Optimization 16(5), 683-690
40. Terlaky, T. (1987): A finite criss-cross method for oriented matroids. J. Comb. Theory, Ser. B. 42, 319-327
41. Tijssen, G.A., Sierksma, G. (1995): Balinski-Tucker Simplex Tableaus: Dimensions, Degeneracy, Degrees, and Interior Points of Optimal Faces. Research Report 95A15, Graduate School/Research Institute Systems, Organization and Management (SOM). University of Groningen, Groningen, The Netherlands
42. Todd, M.J. (1985): Linear and quadratic programming in oriented matroids. J. Comb. Theory, Ser. B. 39, 105-133
43. Tucker, A.W. (1960): A combinatorial equivalence of matrices. In: Bellman, R., Hall, M., eds., Proceedings of Symposia in Applied Mathematics 10, 129-140. American Mathematical Society
44. Tucker, A.W. (1963): Principal pivot transforms of square matrices. SIAM Rev. 5, 305
45. Väliaho (1996): P* Matrices are Just Sufficient. Research Report, Department of Mathematics, University of Helsinki, Helsinki, Finland. Linear Algebra Appl. 239, 103-108
46. Vanderbei, R.J. (1994): LOQO: An Interior Point Code for Quadratic Programming. Tech. Rep., Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJ 08544
47. Wolfe, P. (1959): The Simplex method for quadratic programming. Econometrica 27, 382-398
48. Zhang, S. (1994): On the Strict Complementary Slackness Relation in Linear Programming. In: Du, D.-Z., Sun, J., eds., Advances in Optimization and Approximation, pp. 347-361. Kluwer Academic Publishers