Linear quadratic programming in oriented matroids

DOI10.1016/0095-8956(85)90042-5zbMath0555.05026OpenAlexW2043345643WikidataQ56504903 ScholiaQ56504903MaRDI QIDQ760437

Michael J. Todd

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90042-5

zbMATH Keywords

algorithmlinear programmingquadratic programmingdualityoriented matroids

Mathematics Subject Classification ID

Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

A Polynomial Method of Weighted Centers for Convex Quadratic Programming, Symmetry and positive definiteness in oriented matroids, Parametric linear programming and anti-cycling pivoting rules, Criss-cross methods: A fresh view on pivot algorithms, Subspaces with well-scaled frames, Abstract tropical linear programming, Some generalizations of the criss-cross method for quadratic programming, Games in oriented matroids, The double pivot simplex method, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, On circuit valuation of matroids, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, The linear complementarity problem, sufficient matrices, and the criss- cross method, Pivot rules for linear programming: A survey on recent theoretical developments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition of regular matroids
• Oriented matroids
• Orientability of matroids
• A combinatorial abstraction of linear programming
• Complementarity in Oriented Matroids
• Duality in quadratic programming
• Symmetric dual quadratic programs
• Equilibrium Points of Bimatrix Games
• Bimatrix Equilibrium Points and Mathematical Programming