Pivoting and Extensions: In Honor of A. W. TuckerLower bounds for maximum diameters of polytopes; Maximum diameter of abstract polytopes; Existence of A-avoinding paths in abstract polytopes; On two special classes of transportation polytopes; Solution rays for a class of complementarity problems; Fourier's analysis of linear inequality systems; Solving piecewise linear convex equations; On balanced matrices; Derivation of a bound for error-correcting codes using pivoting techniques; A new proof of the fundamental theorem of algebra; Pivotal theory of determinants; A note of the Lemke-Howson method; Algorithm for a least-distance programming problem. |
Contents
Albert William Tucker | 1 |
In honor of A W Tuckers contributions to mathematical | 10 |
2 Maximum diameter of abstract polytopes I Adler and G | 20 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
A.W. Tucker abstract polytope adjacent affinely independent Al Tucker algorithm anti-blocking Applied B₁ bimatrix games blocking matrix column combinatorial complementary components contains convex cycle defined deleted denote dual edge eliminant system end-sinks equilibrium point example exists extreme points facets finite G.B. Dantzig Gauss-Jordan elimination given graph H.W. Kuhn Hence Hirsch conjecture induction integer integral vector inversion sequence j₁ Lemke Lemma linear code linear complementarity problem linear inequalities linear programming lower bounds Mathematical Programming max-min equality maximum diameter min-max equality N(vo n₁ neighbor node nonnegative obtained P₁ P₂ pair pairwise elimination paper path of length pivot polyhedra Princeton University Proof pseudo-manifolds Qm,h quadratic programming rows satisfies Section set of claws simple polytopes solution ray solve solvent matrix step subgradients subset tableau theory trees unique v₁ v₂ valency variables vertex vertices x₁ zero