Polyhedral polarity defined by a general bilinear inequality

DOI10.1007/BF01583783MaRDI QIDQ3937166zbMATHOpenAlexFDO

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

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

polyhedral combinatoricsblockingrecession conefinite dimensional vector spacesbilinear inequalityanti-blockingmulti-parametric linear programmingomega-polarpolyhedral polarity

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3646642 (Why is no real title available?)
• scientific article; zbMATH DE number 3885658 (Why is no real title available?)
• scientific article; zbMATH DE number 3717152 (Why is no real title available?)
• scientific article; zbMATH DE number 3580255 (Why is no real title available?)
• scientific article; zbMATH DE number 3296906 (Why is no real title available?)
• scientific article; zbMATH DE number 3345048 (Why is no real title available?)
• Integer programming and convex analysis: Intersection cuts from outer polars
• Linear Inequalities and Related Systems. (AM-38)
• Some polyhedra related to combinatorial problems

Cited in

(4)

• A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
• Some relations between dualities, polarities, coupling functionals, and conjugations
• scientific article; zbMATH DE number 7289906 (Why is no real title available?)
• Infimal generators and dualities between complete lattices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3937166)