Polyhedral polarity defined by a general bilinear inequality
From MaRDI portal
Publication:3937166
DOI10.1007/BF01583783zbMath0479.90083MaRDI QIDQ3937166
Jack Edmonds, Julián Aráoz, Victor J. Griffin
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
blocking; recession cone; polyhedral combinatorics; finite dimensional vector spaces; bilinear inequality; anti-blocking; multi-parametric linear programming; omega-polar; polyhedral polarity
90C31: Sensitivity, stability, parametric optimization
90C48: Programming in abstract spaces
52A40: Inequalities and extremum problems involving convexity in convex geometry
52Bxx: Polytopes and polyhedra
Related Items
Some relations between dualities, polarities, coupling functionals, and conjugations, Infimal generators and dualities between complete lattices, A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
Cites Work