Polyhedral polarity defined by a general bilinear inequality

DOI10.1007/BF01583783zbMath0479.90083OpenAlexW2092011617MaRDI QIDQ3937166

Jack Edmonds, Julián Aráoz, Victor J. Griffin

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01583783

zbMATH Keywords

blockingrecession conepolyhedral combinatoricsfinite dimensional vector spacesbilinear inequalityanti-blockingmulti-parametric linear programmingomega-polarpolyhedral polarity

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48) Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx)

Related Items (4)

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 ⋮ Unnamed Item

Cites Work

• Some polyhedra related to combinatorial problems
• Linear Inequalities and Related Systems. (AM-38)
• Integer programming and convex analysis: Intersection cuts from outer polars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polyhedral polarity defined by a general bilinear inequality