Mathematical Programming Study, Volumes 7-9North-Holland Publishing Company, 1978 - Mathematical optimization |
Contents
1 Computing stationary points B C Eaves | 1 |
2 Some pivot schemes for the linear complementarity problem C | 15 |
3 An efficient implementation of the Lemke algorithm and its extension | 36 |
Copyright | |
20 other sections not shown
Other editions - View all
Common terms and phrases
adjacent Algorithm Schema anti-blocking applied assume B₁ basic vector blocking pair bound cluster colouring column combinatorial complementary cone complementary pivot components computational CONE(D consider constraints convex convex set Corollary corresponding Dantzig defined denote dual edges elements exists F₁ F₂ feasible formulation given graph greedy heuristic Hamiltonian circuit Hence heuristic homotopy hypergraph implies inequality integer integer programming iterations J₁ L.R. Ford layout Lemma linear complementarity problem linear program logconcave M₁ Mathematical Programming matrix matroids minimal nonlinear programming nonnegative objective function obtained optimal solution P-matrix P-property P₁ paper partial ordering partition path perfect matching permutation polyhedra polyhedron primal algorithm proof reservoir satisfying Section sequence simplex method solving Step stochastic programming subset Suppose Theorem theory triangulations V₁ variables vector vertex vertices y₁ z₁ zero