summary:Separation is a famous principle and separation properties are important for optimization theory and various applications. In practice, input data are rarely known exactly and it is advisable to deal with parameters. In this article, we are concerned with the basic characteristics (existence, description, stability etc.) of separating hyperplanes of two convex polyhedral sets depending on parameters. We study the case, when parameters are situated in one column of the constraint matrix from the description of the given convex polyhedral set. We provide also a lot of examples carried out on PC
This is a survey on support and separation properties of convex sets in the n-dimensional Euclidean ...
Introduction We present a locality-based algorithm to solve the problem of splitting a complex of c...
Convex sets separation is very important in convex programming, a very powerful mathematical tool fo...
summary:Separation is a famous principle and separation properties are important for optimization th...
summary:We investigate diverse separation properties of two convex polyhedral sets for the case when...
We propose a new approach to the strict separation of convex polyhedra. This approach is based on th...
We consider polyhedral separation of sets as a possible tool in supervised classification. In partic...
This paper is a contribution to the interval analysis and separability of convex sets. Separation is...
The vertex separator (VS) problem in a graph G = (V, E) asks for a partition of V into nonempty subs...
AbstractWe give some sufficient conditions of separation of two sets of integer points by a hyperpla...
Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, ...
AbstractIn this paper we study the problem of polygonal separation in the plane, i.e., finding a con...
Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, ...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer ...
This is a survey on support and separation properties of convex sets in the n-dimensional Euclidean ...
Introduction We present a locality-based algorithm to solve the problem of splitting a complex of c...
Convex sets separation is very important in convex programming, a very powerful mathematical tool fo...
summary:Separation is a famous principle and separation properties are important for optimization th...
summary:We investigate diverse separation properties of two convex polyhedral sets for the case when...
We propose a new approach to the strict separation of convex polyhedra. This approach is based on th...
We consider polyhedral separation of sets as a possible tool in supervised classification. In partic...
This paper is a contribution to the interval analysis and separability of convex sets. Separation is...
The vertex separator (VS) problem in a graph G = (V, E) asks for a partition of V into nonempty subs...
AbstractWe give some sufficient conditions of separation of two sets of integer points by a hyperpla...
Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, ...
AbstractIn this paper we study the problem of polygonal separation in the plane, i.e., finding a con...
Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, ...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer ...
This is a survey on support and separation properties of convex sets in the n-dimensional Euclidean ...
Introduction We present a locality-based algorithm to solve the problem of splitting a complex of c...
Convex sets separation is very important in convex programming, a very powerful mathematical tool fo...