Polyhedral polarity defined by a general bilinear inequality

DOI10.1007/BF01583783zbMATH Open0479.90083OpenAlexW2092011617MaRDI QIDQ3937166FDOQ3937166

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

• Linear Inequalities and Related Systems. (AM-38)
• Some polyhedra related to combinatorial problems
• Title not available (Why is that?)
• Integer programming and convex analysis: Intersection cuts from outer polars
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (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
• Title not available (Why is that?)

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)