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

DOI10.1016/0024-3795(87)90312-0zbMath0614.52003WikidataQ57836431 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

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

Related Items

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

Cites Work

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