Lexicographical representation of convex sets (Q2903487)

Following previous publications of the first author [Lect. Notes Control Inf. Sci. 59, 203--212 (1984; Zbl 0563.90084); with \textit{I. Singer}, Linear Algebra Appl. 90, 147--163 (1987; Zbl 0614.52003); Eur. J. Oper. Res. 33, 342--348 (1988; Zbl 0646.90076); with \textit{I. Singer}, Linear Algebra Appl. 110, 117--179 (1988; Zbl 0656.52004); Acta Math. Vietnam. 22, No. 1, 207--211 (1997; Zbl 0901.52008)], two families of properties of convex sets in \( {\mathbb R}^n\): \({\mathcal O} (m)\) and \({\mathcal C} (m) \), related, respectively, to open and closed lexicographical separation, are introduced for \( m = 1, 2, \ldots, n\). Some new separation theorems for convex sets in \({\mathbb R}^n \) which satisfy the proper\-ties \( {\mathcal O} (m)\), \({\mathcal C} (m) \) are proved.NEWLINENEWLINEA characterization of convex sets which are closely lexicographically sepa\-rated from any outside point by complements of semispaces is obtained as well.