Pivoting and extensions: in honor of A. W. Tucker

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Adler, I. Lower bounds for maximum diameters of polytopes.--Adler, I. and Dantzig, G. B. Maximum diameter of abstract polytopes.--Adler, I., Dantzig, G. B., and Murty, K. G. Existence of A-avoiding paths in abstract polytopes.--Balinski, M. L. On two special classes of transportation polytopes.--Cottle, R. W. Solution rays for a class of complementarity problems.--Duffin, R. J. Fourier's analysis of linear inequality systems.--Eaves, B. C. Solving piecewise linear convex equations.--Fulkerson, D. R., Hoffman, A. J., and Oppenheim, R. On balanced matrices.--Griesmer, J. H. Derivation of a bound for error-correcting codes using pivoting techniques.--Kuhn, H. W. A new proof of the fundamental theorem of algebra.--Maurer, S. Pivotal theory of determinants.--Shapley, L. S. A note of the Lemke-Howson method.--Wolfe, P. Algorithm for a least-distance programming problem

Author(s): Balinski M.L. (ed.)
Series: Mathematical programming study 1
Publisher: North-Holland Pub. Co.; American Elsevier Pub. Co
Year: 1974

Language: English
Pages: 213
City: Amsterdam :, New York