Lexicographical separation in \({\mathbb{R}}^ n\)

DOI10.1016/0024-3795(87)90312-0zbMath0614.52003OpenAlexW2029950777WikidataQ57836431 ScholiaQ57836431MaRDI QIDQ1819730

Ivan Singer, Juan-Enrique Martinez-Legaz

Publication date: 1987

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(87)90312-0

zbMATH Keywords

lexicographic separation of convex sets

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items

Faces of convex sets and Minkowski additive selections, The structure of hemispaces in \({\mathbb{R}}^ n\), Lexicographical order, lexicographical index, and linear operators, Motzkin predecomposable sets, Quasiconvex duality theory by generalized conjugation methods, Step-affine functions, halfspaces, and separation of convex sets with applications to convex optimization problems, Closed convex sets of Minkowski type, Support and separation properties of convex sets in finite dimension, On \(\Phi\)-convexity of convex functions, Compatible preorders and linear operators on \({\mathbb{R}}^ n\)

Cites Work

• Lexicographical order and duality in multiobjective programming
• A cone separation theorem
• Maximal convex sets
• Exact quasiconvex conjugation
• Separation of Two Sets in a Product Space
• Recent results on separation of convex sets¹
• Two Consequences of the Transposition Theorem on Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item