×

Complementary pivot theory of mathematical programming. (English) Zbl 0155.28403


MSC:

90C05 Linear programming
90C20 Quadratic programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Cottle, R. W., Symmetric dual quadratic programs, Quart. Appl. Math., 21, 237-243 (1963) · Zbl 0127.36802
[2] Cottle, R. W., Nonlinear programs with positively bounded Jacobians, J. Siam Appl. Math., 14, 147-158 (1966) · Zbl 0158.18903
[3] Dantzig, G. B., Linear Programming and Extensions (1963), Princeton Univ. Press: Princeton Univ. Press Princeton, New Jersey · Zbl 0108.33103
[4] Dantzig, G. B.; Cottle, R. W., Positive (semi-) definite programming, (ORC 63-18 (RR) (1963), Operations Research Center, University California: Operations Research Center, University California Berkeley). (Abadie, J., Nonlinear Programming (1967), North-Holland: North-Holland Amsterdam), 55-73, Revised in · Zbl 0178.22801
[5] Dorn, W. S., Quality in quadratic programming, Quart. Appl. Math., 18, 155-162 (1960) · Zbl 0101.37003
[6] Du Val, P., The unloading problem for plane curves, Amer. J. Math., 62, 307-311 (1940) · Zbl 0025.21102
[7] Farkas, J., Theorie der einfachen Ungleichungen, J. Reine Angew. Math., 124, 1-27 (1902) · JFM 32.0169.02
[8] Fiedler, M.; Ptak, V., On matrices with non-positive off-diagonal elements and positive principals minors, Czech. Math. Journal, 12, 382-400 (1962) · Zbl 0131.24806
[9] Fiedler, M.; Ptak, V., Some generalizations o positive definiteness and monotonicity, Numerische Math., 9, 163-172 (1966) · Zbl 0148.25801
[10] Gale, D.; Nikaidŏ, H., The Jacobian matrix and global univalence of mappings, Math. Ann., 159, 81-93 (1965) · Zbl 0158.04903
[11] Goldman, A. J., Resolution and separation theorems for polyhedral convex sets, (Kuhn, H. W.; Tucker, A. W., Linear Inequalities and Related Systems (1956), Princeton Univ. Press: Princeton Univ. Press Princeton, New Jersey) · Zbl 0072.37505
[12] Hall, M., Combinatorial Theory (1967), Blaisdell: Blaisdell Waltham, Massachusetts, Chapter 16 · Zbl 0196.02401
[13] Kilmister, C. W.; Reeve, J. E., Rational Mechanics (1966), American Elsevier: American Elsevier New York, § 5.4. · Zbl 0163.45902
[14] Kuhn, H. W.; Tucker, A. W., Nonlinear programming, (Neyman, J., Secon Berkeley Symposium on Mathematical Statistics and Probability (1951), Univ. of California Press: Univ. of California Press Berkeley, California) · Zbl 0044.05903
[15] Lemke, C. E.; Howson, J. T., Equilibrium points of bimatrix games, J. Soc. Indust. Appl. Math., 12, 413-423 (1964) · Zbl 0128.14804
[16] Lemke, C. E., Bimatrix equilibrium points and mathematical programming, Management Sci., 11, 681-689 (1965) · Zbl 0139.13103
[17] C.E. Lemke, Private communication.; C.E. Lemke, Private communication.
[18] Motzkin, T. S., Copositive quadratic forms, Nat. Bur. Standards Report, 1818, 11-12 (1952)
[19] Nash, J. F., Noncooperative games, Ann. Math., 54, 286-295 (1951) · Zbl 0045.08202
[20] Neumann, J.von, Discussion of a maximum problem, (Taub, A. H., Collected Works, VI (1963), Pergamon: Pergamon New York)
[21] Panne, C.van de; Whinston, A., A composition of two methods for quadratic programming, Operations Res., 14, 422-441 (1966) · Zbl 0138.41305
[22] Parson, T. D., A combinatorial approach to convex quadratic programming, (Doctoral Dissertation (1966), Department of Mathematics, Princeton University)
[23] Tucker, A. W., A combinatorial equivalence of matrices, (Bellman, R.; Hall, M., Proceedings of Symposia in Applied Mathematics, 10 (1960), American Math. Soc) · Zbl 0096.00701
[24] Tucker, A. W., Principal pivotal transforms of square matrices, SIAM Review, 5, 305 (1963)
[25] Tucker, A. W., Pivotal Algebra, (Lectures notes (by T. D. Parsons) (1965), Department of Mathematics, Princeton Univ) · Zbl 0334.90033
[26] Wolfe, P., The simplex method for quadratic programming, Econometrica, 27, 1959 (1959)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.